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 ext4_map_blocks map;
58 struct buffer_head *bh;
61 if (unlikely(EXT4_SB(inode->i_sb)->s_max_dir_size_kb &&
62 ((inode->i_size >> 10) >=
63 EXT4_SB(inode->i_sb)->s_max_dir_size_kb)))
64 return ERR_PTR(-ENOSPC);
66 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
71 * We're appending new directory block. Make sure the block is not
72 * allocated yet, otherwise we will end up corrupting the
75 err = ext4_map_blocks(NULL, inode, &map, 0);
79 EXT4_ERROR_INODE(inode, "Logical block already allocated");
80 return ERR_PTR(-EFSCORRUPTED);
83 bh = ext4_bread(handle, inode, *block, EXT4_GET_BLOCKS_CREATE);
86 inode->i_size += inode->i_sb->s_blocksize;
87 EXT4_I(inode)->i_disksize = inode->i_size;
88 err = ext4_mark_inode_dirty(handle, inode);
91 BUFFER_TRACE(bh, "get_write_access");
92 err = ext4_journal_get_write_access(handle, inode->i_sb, bh,
100 ext4_std_error(inode->i_sb, err);
104 static int ext4_dx_csum_verify(struct inode *inode,
105 struct ext4_dir_entry *dirent);
108 * Hints to ext4_read_dirblock regarding whether we expect a directory
109 * block being read to be an index block, or a block containing
110 * directory entries (and if the latter, whether it was found via a
111 * logical block in an htree index block). This is used to control
112 * what sort of sanity checkinig ext4_read_dirblock() will do on the
113 * directory block read from the storage device. EITHER will means
114 * the caller doesn't know what kind of directory block will be read,
115 * so no specific verification will be done.
118 EITHER, INDEX, DIRENT, DIRENT_HTREE
121 #define ext4_read_dirblock(inode, block, type) \
122 __ext4_read_dirblock((inode), (block), (type), __func__, __LINE__)
124 static struct buffer_head *__ext4_read_dirblock(struct inode *inode,
126 dirblock_type_t type,
130 struct buffer_head *bh;
131 struct ext4_dir_entry *dirent;
134 if (block >= inode->i_size >> inode->i_blkbits) {
135 ext4_error_inode(inode, func, line, block,
136 "Attempting to read directory block (%u) that is past i_size (%llu)",
137 block, inode->i_size);
138 return ERR_PTR(-EFSCORRUPTED);
141 if (ext4_simulate_fail(inode->i_sb, EXT4_SIM_DIRBLOCK_EIO))
144 bh = ext4_bread(NULL, inode, block, 0);
146 __ext4_warning(inode->i_sb, func, line,
147 "inode #%lu: lblock %lu: comm %s: "
148 "error %ld reading directory block",
149 inode->i_ino, (unsigned long)block,
150 current->comm, PTR_ERR(bh));
154 if (!bh && (type == INDEX || type == DIRENT_HTREE)) {
155 ext4_error_inode(inode, func, line, block,
156 "Directory hole found for htree %s block",
157 (type == INDEX) ? "index" : "leaf");
158 return ERR_PTR(-EFSCORRUPTED);
162 dirent = (struct ext4_dir_entry *) bh->b_data;
163 /* Determine whether or not we have an index block */
167 else if (ext4_rec_len_from_disk(dirent->rec_len,
168 inode->i_sb->s_blocksize) ==
169 inode->i_sb->s_blocksize)
172 if (!is_dx_block && type == INDEX) {
173 ext4_error_inode(inode, func, line, block,
174 "directory leaf block found instead of index block");
176 return ERR_PTR(-EFSCORRUPTED);
178 if (!ext4_has_metadata_csum(inode->i_sb) ||
183 * An empty leaf block can get mistaken for a index block; for
184 * this reason, we can only check the index checksum when the
185 * caller is sure it should be an index block.
187 if (is_dx_block && type == INDEX) {
188 if (ext4_dx_csum_verify(inode, dirent) &&
189 !ext4_simulate_fail(inode->i_sb, EXT4_SIM_DIRBLOCK_CRC))
190 set_buffer_verified(bh);
192 ext4_error_inode_err(inode, func, line, block,
194 "Directory index failed checksum");
196 return ERR_PTR(-EFSBADCRC);
200 if (ext4_dirblock_csum_verify(inode, bh) &&
201 !ext4_simulate_fail(inode->i_sb, EXT4_SIM_DIRBLOCK_CRC))
202 set_buffer_verified(bh);
204 ext4_error_inode_err(inode, func, line, block,
206 "Directory block failed checksum");
208 return ERR_PTR(-EFSBADCRC);
215 #define dxtrace(command) command
217 #define dxtrace(command)
241 * dx_root_info is laid out so that if it should somehow get overlaid by a
242 * dirent the two low bits of the hash version will be zero. Therefore, the
243 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
248 struct fake_dirent dot;
250 struct fake_dirent dotdot;
254 __le32 reserved_zero;
256 u8 info_length; /* 8 */
261 struct dx_entry entries[];
266 struct fake_dirent fake;
267 struct dx_entry entries[];
273 struct buffer_head *bh;
274 struct dx_entry *entries;
286 * This goes at the end of each htree block.
290 __le32 dt_checksum; /* crc32c(uuid+inum+dirblock) */
293 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry);
294 static void dx_set_block(struct dx_entry *entry, ext4_lblk_t value);
295 static inline unsigned dx_get_hash(struct dx_entry *entry);
296 static void dx_set_hash(struct dx_entry *entry, unsigned value);
297 static unsigned dx_get_count(struct dx_entry *entries);
298 static unsigned dx_get_limit(struct dx_entry *entries);
299 static void dx_set_count(struct dx_entry *entries, unsigned value);
300 static void dx_set_limit(struct dx_entry *entries, unsigned value);
301 static unsigned dx_root_limit(struct inode *dir, unsigned infosize);
302 static unsigned dx_node_limit(struct inode *dir);
303 static struct dx_frame *dx_probe(struct ext4_filename *fname,
305 struct dx_hash_info *hinfo,
306 struct dx_frame *frame);
307 static void dx_release(struct dx_frame *frames);
308 static int dx_make_map(struct inode *dir, struct buffer_head *bh,
309 struct dx_hash_info *hinfo,
310 struct dx_map_entry *map_tail);
311 static void dx_sort_map(struct dx_map_entry *map, unsigned count);
312 static struct ext4_dir_entry_2 *dx_move_dirents(struct inode *dir, char *from,
313 char *to, struct dx_map_entry *offsets,
314 int count, unsigned int blocksize);
315 static struct ext4_dir_entry_2 *dx_pack_dirents(struct inode *dir, char *base,
316 unsigned int blocksize);
317 static void dx_insert_block(struct dx_frame *frame,
318 u32 hash, ext4_lblk_t block);
319 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
320 struct dx_frame *frame,
321 struct dx_frame *frames,
323 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
324 struct ext4_filename *fname,
325 struct ext4_dir_entry_2 **res_dir);
326 static int ext4_dx_add_entry(handle_t *handle, struct ext4_filename *fname,
327 struct inode *dir, struct inode *inode);
329 /* checksumming functions */
330 void ext4_initialize_dirent_tail(struct buffer_head *bh,
331 unsigned int blocksize)
333 struct ext4_dir_entry_tail *t = EXT4_DIRENT_TAIL(bh->b_data, blocksize);
335 memset(t, 0, sizeof(struct ext4_dir_entry_tail));
336 t->det_rec_len = ext4_rec_len_to_disk(
337 sizeof(struct ext4_dir_entry_tail), blocksize);
338 t->det_reserved_ft = EXT4_FT_DIR_CSUM;
341 /* Walk through a dirent block to find a checksum "dirent" at the tail */
342 static struct ext4_dir_entry_tail *get_dirent_tail(struct inode *inode,
343 struct buffer_head *bh)
345 struct ext4_dir_entry_tail *t;
346 int blocksize = EXT4_BLOCK_SIZE(inode->i_sb);
349 struct ext4_dir_entry *d, *top;
351 d = (struct ext4_dir_entry *)bh->b_data;
352 top = (struct ext4_dir_entry *)(bh->b_data +
353 (blocksize - sizeof(struct ext4_dir_entry_tail)));
354 while (d < top && ext4_rec_len_from_disk(d->rec_len, blocksize))
355 d = (struct ext4_dir_entry *)(((void *)d) +
356 ext4_rec_len_from_disk(d->rec_len, blocksize));
361 t = (struct ext4_dir_entry_tail *)d;
363 t = EXT4_DIRENT_TAIL(bh->b_data, EXT4_BLOCK_SIZE(inode->i_sb));
366 if (t->det_reserved_zero1 ||
367 (ext4_rec_len_from_disk(t->det_rec_len, blocksize) !=
368 sizeof(struct ext4_dir_entry_tail)) ||
369 t->det_reserved_zero2 ||
370 t->det_reserved_ft != EXT4_FT_DIR_CSUM)
376 static __le32 ext4_dirblock_csum(struct inode *inode, void *dirent, int size)
378 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
379 struct ext4_inode_info *ei = EXT4_I(inode);
382 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size);
383 return cpu_to_le32(csum);
386 #define warn_no_space_for_csum(inode) \
387 __warn_no_space_for_csum((inode), __func__, __LINE__)
389 static void __warn_no_space_for_csum(struct inode *inode, const char *func,
392 __ext4_warning_inode(inode, func, line,
393 "No space for directory leaf checksum. Please run e2fsck -D.");
396 int ext4_dirblock_csum_verify(struct inode *inode, struct buffer_head *bh)
398 struct ext4_dir_entry_tail *t;
400 if (!ext4_has_metadata_csum(inode->i_sb))
403 t = get_dirent_tail(inode, bh);
405 warn_no_space_for_csum(inode);
409 if (t->det_checksum != ext4_dirblock_csum(inode, bh->b_data,
410 (char *)t - bh->b_data))
416 static void ext4_dirblock_csum_set(struct inode *inode,
417 struct buffer_head *bh)
419 struct ext4_dir_entry_tail *t;
421 if (!ext4_has_metadata_csum(inode->i_sb))
424 t = get_dirent_tail(inode, bh);
426 warn_no_space_for_csum(inode);
430 t->det_checksum = ext4_dirblock_csum(inode, bh->b_data,
431 (char *)t - bh->b_data);
434 int ext4_handle_dirty_dirblock(handle_t *handle,
436 struct buffer_head *bh)
438 ext4_dirblock_csum_set(inode, bh);
439 return ext4_handle_dirty_metadata(handle, inode, bh);
442 static struct dx_countlimit *get_dx_countlimit(struct inode *inode,
443 struct ext4_dir_entry *dirent,
446 struct ext4_dir_entry *dp;
447 struct dx_root_info *root;
449 int blocksize = EXT4_BLOCK_SIZE(inode->i_sb);
450 unsigned int rlen = ext4_rec_len_from_disk(dirent->rec_len, blocksize);
452 if (rlen == blocksize)
454 else if (rlen == 12) {
455 dp = (struct ext4_dir_entry *)(((void *)dirent) + 12);
456 if (ext4_rec_len_from_disk(dp->rec_len, blocksize) != blocksize - 12)
458 root = (struct dx_root_info *)(((void *)dp + 12));
459 if (root->reserved_zero ||
460 root->info_length != sizeof(struct dx_root_info))
467 *offset = count_offset;
468 return (struct dx_countlimit *)(((void *)dirent) + count_offset);
471 static __le32 ext4_dx_csum(struct inode *inode, struct ext4_dir_entry *dirent,
472 int count_offset, int count, struct dx_tail *t)
474 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
475 struct ext4_inode_info *ei = EXT4_I(inode);
478 __u32 dummy_csum = 0;
479 int offset = offsetof(struct dx_tail, dt_checksum);
481 size = count_offset + (count * sizeof(struct dx_entry));
482 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size);
483 csum = ext4_chksum(sbi, csum, (__u8 *)t, offset);
484 csum = ext4_chksum(sbi, csum, (__u8 *)&dummy_csum, sizeof(dummy_csum));
486 return cpu_to_le32(csum);
489 static int ext4_dx_csum_verify(struct inode *inode,
490 struct ext4_dir_entry *dirent)
492 struct dx_countlimit *c;
494 int count_offset, limit, count;
496 if (!ext4_has_metadata_csum(inode->i_sb))
499 c = get_dx_countlimit(inode, dirent, &count_offset);
501 EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D.");
504 limit = le16_to_cpu(c->limit);
505 count = le16_to_cpu(c->count);
506 if (count_offset + (limit * sizeof(struct dx_entry)) >
507 EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) {
508 warn_no_space_for_csum(inode);
511 t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
513 if (t->dt_checksum != ext4_dx_csum(inode, dirent, count_offset,
519 static void ext4_dx_csum_set(struct inode *inode, struct ext4_dir_entry *dirent)
521 struct dx_countlimit *c;
523 int count_offset, limit, count;
525 if (!ext4_has_metadata_csum(inode->i_sb))
528 c = get_dx_countlimit(inode, dirent, &count_offset);
530 EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D.");
533 limit = le16_to_cpu(c->limit);
534 count = le16_to_cpu(c->count);
535 if (count_offset + (limit * sizeof(struct dx_entry)) >
536 EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) {
537 warn_no_space_for_csum(inode);
540 t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
542 t->dt_checksum = ext4_dx_csum(inode, dirent, count_offset, count, t);
545 static inline int ext4_handle_dirty_dx_node(handle_t *handle,
547 struct buffer_head *bh)
549 ext4_dx_csum_set(inode, (struct ext4_dir_entry *)bh->b_data);
550 return ext4_handle_dirty_metadata(handle, inode, bh);
554 * p is at least 6 bytes before the end of page
556 static inline struct ext4_dir_entry_2 *
557 ext4_next_entry(struct ext4_dir_entry_2 *p, unsigned long blocksize)
559 return (struct ext4_dir_entry_2 *)((char *)p +
560 ext4_rec_len_from_disk(p->rec_len, blocksize));
564 * Future: use high four bits of block for coalesce-on-delete flags
565 * Mask them off for now.
568 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry)
570 return le32_to_cpu(entry->block) & 0x0fffffff;
573 static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value)
575 entry->block = cpu_to_le32(value);
578 static inline unsigned dx_get_hash(struct dx_entry *entry)
580 return le32_to_cpu(entry->hash);
583 static inline void dx_set_hash(struct dx_entry *entry, unsigned value)
585 entry->hash = cpu_to_le32(value);
588 static inline unsigned dx_get_count(struct dx_entry *entries)
590 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
593 static inline unsigned dx_get_limit(struct dx_entry *entries)
595 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
598 static inline void dx_set_count(struct dx_entry *entries, unsigned value)
600 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
603 static inline void dx_set_limit(struct dx_entry *entries, unsigned value)
605 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
608 static inline unsigned dx_root_limit(struct inode *dir, unsigned infosize)
610 unsigned int entry_space = dir->i_sb->s_blocksize -
611 ext4_dir_rec_len(1, NULL) -
612 ext4_dir_rec_len(2, NULL) - infosize;
614 if (ext4_has_metadata_csum(dir->i_sb))
615 entry_space -= sizeof(struct dx_tail);
616 return entry_space / sizeof(struct dx_entry);
619 static inline unsigned dx_node_limit(struct inode *dir)
621 unsigned int entry_space = dir->i_sb->s_blocksize -
622 ext4_dir_rec_len(0, dir);
624 if (ext4_has_metadata_csum(dir->i_sb))
625 entry_space -= sizeof(struct dx_tail);
626 return entry_space / sizeof(struct dx_entry);
633 static void dx_show_index(char * label, struct dx_entry *entries)
635 int i, n = dx_get_count (entries);
636 printk(KERN_DEBUG "%s index", label);
637 for (i = 0; i < n; i++) {
638 printk(KERN_CONT " %x->%lu",
639 i ? dx_get_hash(entries + i) : 0,
640 (unsigned long)dx_get_block(entries + i));
642 printk(KERN_CONT "\n");
652 static struct stats dx_show_leaf(struct inode *dir,
653 struct dx_hash_info *hinfo,
654 struct ext4_dir_entry_2 *de,
655 int size, int show_names)
657 unsigned names = 0, space = 0;
658 char *base = (char *) de;
659 struct dx_hash_info h = *hinfo;
662 while ((char *) de < base + size)
668 #ifdef CONFIG_FS_ENCRYPTION
671 struct fscrypt_str fname_crypto_str =
677 if (!IS_ENCRYPTED(dir)) {
678 /* Directory is not encrypted */
679 (void) ext4fs_dirhash(dir, de->name,
681 printk("%*.s:(U)%x.%u ", len,
683 (unsigned) ((char *) de
686 struct fscrypt_str de_name =
687 FSTR_INIT(name, len);
689 /* Directory is encrypted */
690 res = fscrypt_fname_alloc_buffer(
691 len, &fname_crypto_str);
693 printk(KERN_WARNING "Error "
697 res = fscrypt_fname_disk_to_usr(dir,
701 printk(KERN_WARNING "Error "
702 "converting filename "
708 name = fname_crypto_str.name;
709 len = fname_crypto_str.len;
711 if (IS_CASEFOLDED(dir))
712 h.hash = EXT4_DIRENT_HASH(de);
714 (void) ext4fs_dirhash(dir,
717 printk("%*.s:(E)%x.%u ", len, name,
718 h.hash, (unsigned) ((char *) de
720 fscrypt_fname_free_buffer(
724 int len = de->name_len;
725 char *name = de->name;
726 (void) ext4fs_dirhash(dir, de->name,
728 printk("%*.s:%x.%u ", len, name, h.hash,
729 (unsigned) ((char *) de - base));
732 space += ext4_dir_rec_len(de->name_len, dir);
735 de = ext4_next_entry(de, size);
737 printk(KERN_CONT "(%i)\n", names);
738 return (struct stats) { names, space, 1 };
741 struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
742 struct dx_entry *entries, int levels)
744 unsigned blocksize = dir->i_sb->s_blocksize;
745 unsigned count = dx_get_count(entries), names = 0, space = 0, i;
747 struct buffer_head *bh;
748 printk("%i indexed blocks...\n", count);
749 for (i = 0; i < count; i++, entries++)
751 ext4_lblk_t block = dx_get_block(entries);
752 ext4_lblk_t hash = i ? dx_get_hash(entries): 0;
753 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
755 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
756 bh = ext4_bread(NULL,dir, block, 0);
757 if (!bh || IS_ERR(bh))
760 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
761 dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *)
762 bh->b_data, blocksize, 0);
763 names += stats.names;
764 space += stats.space;
765 bcount += stats.bcount;
769 printk(KERN_DEBUG "%snames %u, fullness %u (%u%%)\n",
770 levels ? "" : " ", names, space/bcount,
771 (space/bcount)*100/blocksize);
772 return (struct stats) { names, space, bcount};
776 * Linear search cross check
778 static inline void htree_rep_invariant_check(struct dx_entry *at,
779 struct dx_entry *target,
780 u32 hash, unsigned int n)
783 dxtrace(printk(KERN_CONT ","));
784 if (dx_get_hash(++at) > hash) {
789 ASSERT(at == target - 1);
792 static inline void htree_rep_invariant_check(struct dx_entry *at,
793 struct dx_entry *target,
794 u32 hash, unsigned int n)
797 #endif /* DX_DEBUG */
800 * Probe for a directory leaf block to search.
802 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
803 * error in the directory index, and the caller should fall back to
804 * searching the directory normally. The callers of dx_probe **MUST**
805 * check for this error code, and make sure it never gets reflected
808 static struct dx_frame *
809 dx_probe(struct ext4_filename *fname, struct inode *dir,
810 struct dx_hash_info *hinfo, struct dx_frame *frame_in)
812 unsigned count, indirect, level, i;
813 struct dx_entry *at, *entries, *p, *q, *m;
814 struct dx_root *root;
815 struct dx_frame *frame = frame_in;
816 struct dx_frame *ret_err = ERR_PTR(ERR_BAD_DX_DIR);
819 ext4_lblk_t blocks[EXT4_HTREE_LEVEL];
821 memset(frame_in, 0, EXT4_HTREE_LEVEL * sizeof(frame_in[0]));
822 frame->bh = ext4_read_dirblock(dir, 0, INDEX);
823 if (IS_ERR(frame->bh))
824 return (struct dx_frame *) frame->bh;
826 root = (struct dx_root *) frame->bh->b_data;
827 if (root->info.hash_version != DX_HASH_TEA &&
828 root->info.hash_version != DX_HASH_HALF_MD4 &&
829 root->info.hash_version != DX_HASH_LEGACY &&
830 root->info.hash_version != DX_HASH_SIPHASH) {
831 ext4_warning_inode(dir, "Unrecognised inode hash code %u",
832 root->info.hash_version);
835 if (ext4_hash_in_dirent(dir)) {
836 if (root->info.hash_version != DX_HASH_SIPHASH) {
837 ext4_warning_inode(dir,
838 "Hash in dirent, but hash is not SIPHASH");
842 if (root->info.hash_version == DX_HASH_SIPHASH) {
843 ext4_warning_inode(dir,
844 "Hash code is SIPHASH, but hash not in dirent");
849 hinfo = &fname->hinfo;
850 hinfo->hash_version = root->info.hash_version;
851 if (hinfo->hash_version <= DX_HASH_TEA)
852 hinfo->hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
853 hinfo->seed = EXT4_SB(dir->i_sb)->s_hash_seed;
854 /* hash is already computed for encrypted casefolded directory */
855 if (fname && fname_name(fname) &&
856 !(IS_ENCRYPTED(dir) && IS_CASEFOLDED(dir))) {
857 int ret = ext4fs_dirhash(dir, fname_name(fname),
858 fname_len(fname), hinfo);
860 ret_err = ERR_PTR(ret);
866 if (root->info.unused_flags & 1) {
867 ext4_warning_inode(dir, "Unimplemented hash flags: %#06x",
868 root->info.unused_flags);
872 indirect = root->info.indirect_levels;
873 if (indirect >= ext4_dir_htree_level(dir->i_sb)) {
874 ext4_warning(dir->i_sb,
875 "Directory (ino: %lu) htree depth %#06x exceed"
876 "supported value", dir->i_ino,
877 ext4_dir_htree_level(dir->i_sb));
878 if (ext4_dir_htree_level(dir->i_sb) < EXT4_HTREE_LEVEL) {
879 ext4_warning(dir->i_sb, "Enable large directory "
880 "feature to access it");
885 entries = (struct dx_entry *)(((char *)&root->info) +
886 root->info.info_length);
888 if (dx_get_limit(entries) != dx_root_limit(dir,
889 root->info.info_length)) {
890 ext4_warning_inode(dir, "dx entry: limit %u != root limit %u",
891 dx_get_limit(entries),
892 dx_root_limit(dir, root->info.info_length));
896 dxtrace(printk("Look up %x", hash));
900 count = dx_get_count(entries);
901 if (!count || count > dx_get_limit(entries)) {
902 ext4_warning_inode(dir,
903 "dx entry: count %u beyond limit %u",
904 count, dx_get_limit(entries));
909 q = entries + count - 1;
912 dxtrace(printk(KERN_CONT "."));
913 if (dx_get_hash(m) > hash)
919 htree_rep_invariant_check(entries, p, hash, count - 1);
922 dxtrace(printk(KERN_CONT " %x->%u\n",
923 at == entries ? 0 : dx_get_hash(at),
925 frame->entries = entries;
928 block = dx_get_block(at);
929 for (i = 0; i <= level; i++) {
930 if (blocks[i] == block) {
931 ext4_warning_inode(dir,
932 "dx entry: tree cycle block %u points back to block %u",
933 blocks[level], block);
937 if (++level > indirect)
939 blocks[level] = block;
941 frame->bh = ext4_read_dirblock(dir, block, INDEX);
942 if (IS_ERR(frame->bh)) {
943 ret_err = (struct dx_frame *) frame->bh;
948 entries = ((struct dx_node *) frame->bh->b_data)->entries;
950 if (dx_get_limit(entries) != dx_node_limit(dir)) {
951 ext4_warning_inode(dir,
952 "dx entry: limit %u != node limit %u",
953 dx_get_limit(entries), dx_node_limit(dir));
958 while (frame >= frame_in) {
963 if (ret_err == ERR_PTR(ERR_BAD_DX_DIR))
964 ext4_warning_inode(dir,
965 "Corrupt directory, running e2fsck is recommended");
969 static void dx_release(struct dx_frame *frames)
971 struct dx_root_info *info;
973 unsigned int indirect_levels;
975 if (frames[0].bh == NULL)
978 info = &((struct dx_root *)frames[0].bh->b_data)->info;
979 /* save local copy, "info" may be freed after brelse() */
980 indirect_levels = info->indirect_levels;
981 for (i = 0; i <= indirect_levels; i++) {
982 if (frames[i].bh == NULL)
984 brelse(frames[i].bh);
990 * This function increments the frame pointer to search the next leaf
991 * block, and reads in the necessary intervening nodes if the search
992 * should be necessary. Whether or not the search is necessary is
993 * controlled by the hash parameter. If the hash value is even, then
994 * the search is only continued if the next block starts with that
995 * hash value. This is used if we are searching for a specific file.
997 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
999 * This function returns 1 if the caller should continue to search,
1000 * or 0 if it should not. If there is an error reading one of the
1001 * index blocks, it will a negative error code.
1003 * If start_hash is non-null, it will be filled in with the starting
1004 * hash of the next page.
1006 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
1007 struct dx_frame *frame,
1008 struct dx_frame *frames,
1012 struct buffer_head *bh;
1018 * Find the next leaf page by incrementing the frame pointer.
1019 * If we run out of entries in the interior node, loop around and
1020 * increment pointer in the parent node. When we break out of
1021 * this loop, num_frames indicates the number of interior
1022 * nodes need to be read.
1025 if (++(p->at) < p->entries + dx_get_count(p->entries))
1034 * If the hash is 1, then continue only if the next page has a
1035 * continuation hash of any value. This is used for readdir
1036 * handling. Otherwise, check to see if the hash matches the
1037 * desired continuation hash. If it doesn't, return since
1038 * there's no point to read in the successive index pages.
1040 bhash = dx_get_hash(p->at);
1042 *start_hash = bhash;
1043 if ((hash & 1) == 0) {
1044 if ((bhash & ~1) != hash)
1048 * If the hash is HASH_NB_ALWAYS, we always go to the next
1049 * block so no check is necessary
1051 while (num_frames--) {
1052 bh = ext4_read_dirblock(dir, dx_get_block(p->at), INDEX);
1058 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
1065 * This function fills a red-black tree with information from a
1066 * directory block. It returns the number directory entries loaded
1067 * into the tree. If there is an error it is returned in err.
1069 static int htree_dirblock_to_tree(struct file *dir_file,
1070 struct inode *dir, ext4_lblk_t block,
1071 struct dx_hash_info *hinfo,
1072 __u32 start_hash, __u32 start_minor_hash)
1074 struct buffer_head *bh;
1075 struct ext4_dir_entry_2 *de, *top;
1076 int err = 0, count = 0;
1077 struct fscrypt_str fname_crypto_str = FSTR_INIT(NULL, 0), tmp_str;
1078 int csum = ext4_has_metadata_csum(dir->i_sb);
1080 dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n",
1081 (unsigned long)block));
1082 bh = ext4_read_dirblock(dir, block, DIRENT_HTREE);
1086 de = (struct ext4_dir_entry_2 *) bh->b_data;
1087 /* csum entries are not larger in the casefolded encrypted case */
1088 top = (struct ext4_dir_entry_2 *) ((char *) de +
1089 dir->i_sb->s_blocksize -
1091 csum ? NULL : dir));
1092 /* Check if the directory is encrypted */
1093 if (IS_ENCRYPTED(dir)) {
1094 err = fscrypt_prepare_readdir(dir);
1099 err = fscrypt_fname_alloc_buffer(EXT4_NAME_LEN,
1107 for (; de < top; de = ext4_next_entry(de, dir->i_sb->s_blocksize)) {
1108 if (ext4_check_dir_entry(dir, NULL, de, bh,
1109 bh->b_data, bh->b_size,
1110 (block<<EXT4_BLOCK_SIZE_BITS(dir->i_sb))
1111 + ((char *)de - bh->b_data))) {
1112 /* silently ignore the rest of the block */
1115 if (ext4_hash_in_dirent(dir)) {
1116 if (de->name_len && de->inode) {
1117 hinfo->hash = EXT4_DIRENT_HASH(de);
1118 hinfo->minor_hash = EXT4_DIRENT_MINOR_HASH(de);
1121 hinfo->minor_hash = 0;
1124 err = ext4fs_dirhash(dir, de->name,
1125 de->name_len, hinfo);
1131 if ((hinfo->hash < start_hash) ||
1132 ((hinfo->hash == start_hash) &&
1133 (hinfo->minor_hash < start_minor_hash)))
1137 if (!IS_ENCRYPTED(dir)) {
1138 tmp_str.name = de->name;
1139 tmp_str.len = de->name_len;
1140 err = ext4_htree_store_dirent(dir_file,
1141 hinfo->hash, hinfo->minor_hash, de,
1144 int save_len = fname_crypto_str.len;
1145 struct fscrypt_str de_name = FSTR_INIT(de->name,
1148 /* Directory is encrypted */
1149 err = fscrypt_fname_disk_to_usr(dir, hinfo->hash,
1150 hinfo->minor_hash, &de_name,
1156 err = ext4_htree_store_dirent(dir_file,
1157 hinfo->hash, hinfo->minor_hash, de,
1159 fname_crypto_str.len = save_len;
1169 fscrypt_fname_free_buffer(&fname_crypto_str);
1175 * This function fills a red-black tree with information from a
1176 * directory. We start scanning the directory in hash order, starting
1177 * at start_hash and start_minor_hash.
1179 * This function returns the number of entries inserted into the tree,
1180 * or a negative error code.
1182 int ext4_htree_fill_tree(struct file *dir_file, __u32 start_hash,
1183 __u32 start_minor_hash, __u32 *next_hash)
1185 struct dx_hash_info hinfo;
1186 struct ext4_dir_entry_2 *de;
1187 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
1193 struct fscrypt_str tmp_str;
1195 dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n",
1196 start_hash, start_minor_hash));
1197 dir = file_inode(dir_file);
1198 if (!(ext4_test_inode_flag(dir, EXT4_INODE_INDEX))) {
1199 if (ext4_hash_in_dirent(dir))
1200 hinfo.hash_version = DX_HASH_SIPHASH;
1202 hinfo.hash_version =
1203 EXT4_SB(dir->i_sb)->s_def_hash_version;
1204 if (hinfo.hash_version <= DX_HASH_TEA)
1205 hinfo.hash_version +=
1206 EXT4_SB(dir->i_sb)->s_hash_unsigned;
1207 hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
1208 if (ext4_has_inline_data(dir)) {
1209 int has_inline_data = 1;
1210 count = ext4_inlinedir_to_tree(dir_file, dir, 0,
1214 if (has_inline_data) {
1219 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
1220 start_hash, start_minor_hash);
1224 hinfo.hash = start_hash;
1225 hinfo.minor_hash = 0;
1226 frame = dx_probe(NULL, dir, &hinfo, frames);
1228 return PTR_ERR(frame);
1230 /* Add '.' and '..' from the htree header */
1231 if (!start_hash && !start_minor_hash) {
1232 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
1233 tmp_str.name = de->name;
1234 tmp_str.len = de->name_len;
1235 err = ext4_htree_store_dirent(dir_file, 0, 0,
1241 if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) {
1242 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
1243 de = ext4_next_entry(de, dir->i_sb->s_blocksize);
1244 tmp_str.name = de->name;
1245 tmp_str.len = de->name_len;
1246 err = ext4_htree_store_dirent(dir_file, 2, 0,
1254 if (fatal_signal_pending(current)) {
1259 block = dx_get_block(frame->at);
1260 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
1261 start_hash, start_minor_hash);
1268 ret = ext4_htree_next_block(dir, HASH_NB_ALWAYS,
1269 frame, frames, &hashval);
1270 *next_hash = hashval;
1276 * Stop if: (a) there are no more entries, or
1277 * (b) we have inserted at least one entry and the
1278 * next hash value is not a continuation
1281 (count && ((hashval & 1) == 0)))
1285 dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, "
1286 "next hash: %x\n", count, *next_hash));
1293 static inline int search_dirblock(struct buffer_head *bh,
1295 struct ext4_filename *fname,
1296 unsigned int offset,
1297 struct ext4_dir_entry_2 **res_dir)
1299 return ext4_search_dir(bh, bh->b_data, dir->i_sb->s_blocksize, dir,
1300 fname, offset, res_dir);
1304 * Directory block splitting, compacting
1308 * Create map of hash values, offsets, and sizes, stored at end of block.
1309 * Returns number of entries mapped.
1311 static int dx_make_map(struct inode *dir, struct buffer_head *bh,
1312 struct dx_hash_info *hinfo,
1313 struct dx_map_entry *map_tail)
1316 struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *)bh->b_data;
1317 unsigned int buflen = bh->b_size;
1318 char *base = bh->b_data;
1319 struct dx_hash_info h = *hinfo;
1320 int blocksize = EXT4_BLOCK_SIZE(dir->i_sb);
1322 if (ext4_has_metadata_csum(dir->i_sb))
1323 buflen -= sizeof(struct ext4_dir_entry_tail);
1325 while ((char *) de < base + buflen) {
1326 if (ext4_check_dir_entry(dir, NULL, de, bh, base, buflen,
1327 ((char *)de) - base))
1328 return -EFSCORRUPTED;
1329 if (de->name_len && de->inode) {
1330 if (ext4_hash_in_dirent(dir))
1331 h.hash = EXT4_DIRENT_HASH(de);
1333 int err = ext4fs_dirhash(dir, de->name,
1339 map_tail->hash = h.hash;
1340 map_tail->offs = ((char *) de - base)>>2;
1341 map_tail->size = ext4_rec_len_from_disk(de->rec_len,
1346 de = ext4_next_entry(de, blocksize);
1351 /* Sort map by hash value */
1352 static void dx_sort_map (struct dx_map_entry *map, unsigned count)
1354 struct dx_map_entry *p, *q, *top = map + count - 1;
1356 /* Combsort until bubble sort doesn't suck */
1358 count = count*10/13;
1359 if (count - 9 < 2) /* 9, 10 -> 11 */
1361 for (p = top, q = p - count; q >= map; p--, q--)
1362 if (p->hash < q->hash)
1365 /* Garden variety bubble sort */
1370 if (q[1].hash >= q[0].hash)
1378 static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block)
1380 struct dx_entry *entries = frame->entries;
1381 struct dx_entry *old = frame->at, *new = old + 1;
1382 int count = dx_get_count(entries);
1384 ASSERT(count < dx_get_limit(entries));
1385 ASSERT(old < entries + count);
1386 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
1387 dx_set_hash(new, hash);
1388 dx_set_block(new, block);
1389 dx_set_count(entries, count + 1);
1392 #if IS_ENABLED(CONFIG_UNICODE)
1394 * Test whether a case-insensitive directory entry matches the filename
1395 * being searched for. If quick is set, assume the name being looked up
1396 * is already in the casefolded form.
1398 * Returns: 0 if the directory entry matches, more than 0 if it
1399 * doesn't match or less than zero on error.
1401 static int ext4_ci_compare(const struct inode *parent, const struct qstr *name,
1402 u8 *de_name, size_t de_name_len, bool quick)
1404 const struct super_block *sb = parent->i_sb;
1405 const struct unicode_map *um = sb->s_encoding;
1406 struct fscrypt_str decrypted_name = FSTR_INIT(NULL, de_name_len);
1407 struct qstr entry = QSTR_INIT(de_name, de_name_len);
1410 if (IS_ENCRYPTED(parent)) {
1411 const struct fscrypt_str encrypted_name =
1412 FSTR_INIT(de_name, de_name_len);
1414 decrypted_name.name = kmalloc(de_name_len, GFP_KERNEL);
1415 if (!decrypted_name.name)
1417 ret = fscrypt_fname_disk_to_usr(parent, 0, 0, &encrypted_name,
1421 entry.name = decrypted_name.name;
1422 entry.len = decrypted_name.len;
1426 ret = utf8_strncasecmp_folded(um, name, &entry);
1428 ret = utf8_strncasecmp(um, name, &entry);
1430 /* Handle invalid character sequence as either an error
1431 * or as an opaque byte sequence.
1433 if (sb_has_strict_encoding(sb))
1435 else if (name->len != entry.len)
1438 ret = !!memcmp(name->name, entry.name, entry.len);
1441 kfree(decrypted_name.name);
1445 int ext4_fname_setup_ci_filename(struct inode *dir, const struct qstr *iname,
1446 struct ext4_filename *name)
1448 struct fscrypt_str *cf_name = &name->cf_name;
1449 struct dx_hash_info *hinfo = &name->hinfo;
1452 if (!IS_CASEFOLDED(dir) ||
1453 (IS_ENCRYPTED(dir) && !fscrypt_has_encryption_key(dir))) {
1454 cf_name->name = NULL;
1458 cf_name->name = kmalloc(EXT4_NAME_LEN, GFP_NOFS);
1462 len = utf8_casefold(dir->i_sb->s_encoding,
1463 iname, cf_name->name,
1466 kfree(cf_name->name);
1467 cf_name->name = NULL;
1469 cf_name->len = (unsigned) len;
1470 if (!IS_ENCRYPTED(dir))
1473 hinfo->hash_version = DX_HASH_SIPHASH;
1476 return ext4fs_dirhash(dir, cf_name->name, cf_name->len, hinfo);
1478 return ext4fs_dirhash(dir, iname->name, iname->len, hinfo);
1483 * Test whether a directory entry matches the filename being searched for.
1485 * Return: %true if the directory entry matches, otherwise %false.
1487 static bool ext4_match(struct inode *parent,
1488 const struct ext4_filename *fname,
1489 struct ext4_dir_entry_2 *de)
1491 struct fscrypt_name f;
1496 f.usr_fname = fname->usr_fname;
1497 f.disk_name = fname->disk_name;
1498 #ifdef CONFIG_FS_ENCRYPTION
1499 f.crypto_buf = fname->crypto_buf;
1502 #if IS_ENABLED(CONFIG_UNICODE)
1503 if (IS_CASEFOLDED(parent) &&
1504 (!IS_ENCRYPTED(parent) || fscrypt_has_encryption_key(parent))) {
1505 if (fname->cf_name.name) {
1506 struct qstr cf = {.name = fname->cf_name.name,
1507 .len = fname->cf_name.len};
1508 if (IS_ENCRYPTED(parent)) {
1509 if (fname->hinfo.hash != EXT4_DIRENT_HASH(de) ||
1510 fname->hinfo.minor_hash !=
1511 EXT4_DIRENT_MINOR_HASH(de)) {
1516 return !ext4_ci_compare(parent, &cf, de->name,
1517 de->name_len, true);
1519 return !ext4_ci_compare(parent, fname->usr_fname, de->name,
1520 de->name_len, false);
1524 return fscrypt_match_name(&f, de->name, de->name_len);
1528 * Returns 0 if not found, -1 on failure, and 1 on success
1530 int ext4_search_dir(struct buffer_head *bh, char *search_buf, int buf_size,
1531 struct inode *dir, struct ext4_filename *fname,
1532 unsigned int offset, struct ext4_dir_entry_2 **res_dir)
1534 struct ext4_dir_entry_2 * de;
1538 de = (struct ext4_dir_entry_2 *)search_buf;
1539 dlimit = search_buf + buf_size;
1540 while ((char *) de < dlimit - EXT4_BASE_DIR_LEN) {
1541 /* this code is executed quadratically often */
1542 /* do minimal checking `by hand' */
1543 if (de->name + de->name_len <= dlimit &&
1544 ext4_match(dir, fname, de)) {
1545 /* found a match - just to be sure, do
1547 if (ext4_check_dir_entry(dir, NULL, de, bh, search_buf,
1553 /* prevent looping on a bad block */
1554 de_len = ext4_rec_len_from_disk(de->rec_len,
1555 dir->i_sb->s_blocksize);
1559 de = (struct ext4_dir_entry_2 *) ((char *) de + de_len);
1564 static int is_dx_internal_node(struct inode *dir, ext4_lblk_t block,
1565 struct ext4_dir_entry *de)
1567 struct super_block *sb = dir->i_sb;
1573 if (de->inode == 0 &&
1574 ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize) ==
1581 * __ext4_find_entry()
1583 * finds an entry in the specified directory with the wanted name. It
1584 * returns the cache buffer in which the entry was found, and the entry
1585 * itself (as a parameter - res_dir). It does NOT read the inode of the
1586 * entry - you'll have to do that yourself if you want to.
1588 * The returned buffer_head has ->b_count elevated. The caller is expected
1589 * to brelse() it when appropriate.
1591 static struct buffer_head *__ext4_find_entry(struct inode *dir,
1592 struct ext4_filename *fname,
1593 struct ext4_dir_entry_2 **res_dir,
1596 struct super_block *sb;
1597 struct buffer_head *bh_use[NAMEI_RA_SIZE];
1598 struct buffer_head *bh, *ret = NULL;
1599 ext4_lblk_t start, block;
1600 const u8 *name = fname->usr_fname->name;
1601 size_t ra_max = 0; /* Number of bh's in the readahead
1603 size_t ra_ptr = 0; /* Current index into readahead
1605 ext4_lblk_t nblocks;
1606 int i, namelen, retval;
1610 namelen = fname->usr_fname->len;
1611 if (namelen > EXT4_NAME_LEN)
1614 if (ext4_has_inline_data(dir)) {
1615 int has_inline_data = 1;
1616 ret = ext4_find_inline_entry(dir, fname, res_dir,
1619 *inlined = has_inline_data;
1620 if (has_inline_data)
1621 goto cleanup_and_exit;
1624 if ((namelen <= 2) && (name[0] == '.') &&
1625 (name[1] == '.' || name[1] == '\0')) {
1627 * "." or ".." will only be in the first block
1628 * NFS may look up ".."; "." should be handled by the VFS
1635 ret = ext4_dx_find_entry(dir, fname, res_dir);
1637 * On success, or if the error was file not found,
1638 * return. Otherwise, fall back to doing a search the
1639 * old fashioned way.
1641 if (!IS_ERR(ret) || PTR_ERR(ret) != ERR_BAD_DX_DIR)
1642 goto cleanup_and_exit;
1643 dxtrace(printk(KERN_DEBUG "ext4_find_entry: dx failed, "
1647 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
1650 goto cleanup_and_exit;
1652 start = EXT4_I(dir)->i_dir_start_lookup;
1653 if (start >= nblocks)
1659 * We deal with the read-ahead logic here.
1662 if (ra_ptr >= ra_max) {
1663 /* Refill the readahead buffer */
1666 ra_max = start - block;
1668 ra_max = nblocks - block;
1669 ra_max = min(ra_max, ARRAY_SIZE(bh_use));
1670 retval = ext4_bread_batch(dir, block, ra_max,
1671 false /* wait */, bh_use);
1673 ret = ERR_PTR(retval);
1675 goto cleanup_and_exit;
1678 if ((bh = bh_use[ra_ptr++]) == NULL)
1681 if (!buffer_uptodate(bh)) {
1682 EXT4_ERROR_INODE_ERR(dir, EIO,
1683 "reading directory lblock %lu",
1684 (unsigned long) block);
1686 ret = ERR_PTR(-EIO);
1687 goto cleanup_and_exit;
1689 if (!buffer_verified(bh) &&
1690 !is_dx_internal_node(dir, block,
1691 (struct ext4_dir_entry *)bh->b_data) &&
1692 !ext4_dirblock_csum_verify(dir, bh)) {
1693 EXT4_ERROR_INODE_ERR(dir, EFSBADCRC,
1694 "checksumming directory "
1695 "block %lu", (unsigned long)block);
1697 ret = ERR_PTR(-EFSBADCRC);
1698 goto cleanup_and_exit;
1700 set_buffer_verified(bh);
1701 i = search_dirblock(bh, dir, fname,
1702 block << EXT4_BLOCK_SIZE_BITS(sb), res_dir);
1704 EXT4_I(dir)->i_dir_start_lookup = block;
1706 goto cleanup_and_exit;
1710 goto cleanup_and_exit;
1713 if (++block >= nblocks)
1715 } while (block != start);
1718 * If the directory has grown while we were searching, then
1719 * search the last part of the directory before giving up.
1722 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
1723 if (block < nblocks) {
1729 /* Clean up the read-ahead blocks */
1730 for (; ra_ptr < ra_max; ra_ptr++)
1731 brelse(bh_use[ra_ptr]);
1735 static struct buffer_head *ext4_find_entry(struct inode *dir,
1736 const struct qstr *d_name,
1737 struct ext4_dir_entry_2 **res_dir,
1741 struct ext4_filename fname;
1742 struct buffer_head *bh;
1744 err = ext4_fname_setup_filename(dir, d_name, 1, &fname);
1748 return ERR_PTR(err);
1750 bh = __ext4_find_entry(dir, &fname, res_dir, inlined);
1752 ext4_fname_free_filename(&fname);
1756 static struct buffer_head *ext4_lookup_entry(struct inode *dir,
1757 struct dentry *dentry,
1758 struct ext4_dir_entry_2 **res_dir)
1761 struct ext4_filename fname;
1762 struct buffer_head *bh;
1764 err = ext4_fname_prepare_lookup(dir, dentry, &fname);
1768 return ERR_PTR(err);
1770 bh = __ext4_find_entry(dir, &fname, res_dir, NULL);
1772 ext4_fname_free_filename(&fname);
1776 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
1777 struct ext4_filename *fname,
1778 struct ext4_dir_entry_2 **res_dir)
1780 struct super_block * sb = dir->i_sb;
1781 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
1782 struct buffer_head *bh;
1786 #ifdef CONFIG_FS_ENCRYPTION
1789 frame = dx_probe(fname, dir, NULL, frames);
1791 return (struct buffer_head *) frame;
1793 block = dx_get_block(frame->at);
1794 bh = ext4_read_dirblock(dir, block, DIRENT_HTREE);
1798 retval = search_dirblock(bh, dir, fname,
1799 block << EXT4_BLOCK_SIZE_BITS(sb),
1805 bh = ERR_PTR(ERR_BAD_DX_DIR);
1809 /* Check to see if we should continue to search */
1810 retval = ext4_htree_next_block(dir, fname->hinfo.hash, frame,
1813 ext4_warning_inode(dir,
1814 "error %d reading directory index block",
1816 bh = ERR_PTR(retval);
1819 } while (retval == 1);
1823 dxtrace(printk(KERN_DEBUG "%s not found\n", fname->usr_fname->name));
1829 static struct dentry *ext4_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
1831 struct inode *inode;
1832 struct ext4_dir_entry_2 *de;
1833 struct buffer_head *bh;
1835 if (dentry->d_name.len > EXT4_NAME_LEN)
1836 return ERR_PTR(-ENAMETOOLONG);
1838 bh = ext4_lookup_entry(dir, dentry, &de);
1840 return ERR_CAST(bh);
1843 __u32 ino = le32_to_cpu(de->inode);
1845 if (!ext4_valid_inum(dir->i_sb, ino)) {
1846 EXT4_ERROR_INODE(dir, "bad inode number: %u", ino);
1847 return ERR_PTR(-EFSCORRUPTED);
1849 if (unlikely(ino == dir->i_ino)) {
1850 EXT4_ERROR_INODE(dir, "'%pd' linked to parent dir",
1852 return ERR_PTR(-EFSCORRUPTED);
1854 inode = ext4_iget(dir->i_sb, ino, EXT4_IGET_NORMAL);
1855 if (inode == ERR_PTR(-ESTALE)) {
1856 EXT4_ERROR_INODE(dir,
1857 "deleted inode referenced: %u",
1859 return ERR_PTR(-EFSCORRUPTED);
1861 if (!IS_ERR(inode) && IS_ENCRYPTED(dir) &&
1862 (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode)) &&
1863 !fscrypt_has_permitted_context(dir, inode)) {
1864 ext4_warning(inode->i_sb,
1865 "Inconsistent encryption contexts: %lu/%lu",
1866 dir->i_ino, inode->i_ino);
1868 return ERR_PTR(-EPERM);
1872 #if IS_ENABLED(CONFIG_UNICODE)
1873 if (!inode && IS_CASEFOLDED(dir)) {
1874 /* Eventually we want to call d_add_ci(dentry, NULL)
1875 * for negative dentries in the encoding case as
1876 * well. For now, prevent the negative dentry
1877 * from being cached.
1882 return d_splice_alias(inode, dentry);
1886 struct dentry *ext4_get_parent(struct dentry *child)
1889 struct ext4_dir_entry_2 * de;
1890 struct buffer_head *bh;
1892 bh = ext4_find_entry(d_inode(child), &dotdot_name, &de, NULL);
1894 return ERR_CAST(bh);
1896 return ERR_PTR(-ENOENT);
1897 ino = le32_to_cpu(de->inode);
1900 if (!ext4_valid_inum(child->d_sb, ino)) {
1901 EXT4_ERROR_INODE(d_inode(child),
1902 "bad parent inode number: %u", ino);
1903 return ERR_PTR(-EFSCORRUPTED);
1906 return d_obtain_alias(ext4_iget(child->d_sb, ino, EXT4_IGET_NORMAL));
1910 * Move count entries from end of map between two memory locations.
1911 * Returns pointer to last entry moved.
1913 static struct ext4_dir_entry_2 *
1914 dx_move_dirents(struct inode *dir, char *from, char *to,
1915 struct dx_map_entry *map, int count,
1918 unsigned rec_len = 0;
1921 struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *)
1922 (from + (map->offs<<2));
1923 rec_len = ext4_dir_rec_len(de->name_len, dir);
1925 memcpy (to, de, rec_len);
1926 ((struct ext4_dir_entry_2 *) to)->rec_len =
1927 ext4_rec_len_to_disk(rec_len, blocksize);
1929 /* wipe dir_entry excluding the rec_len field */
1931 memset(&de->name_len, 0, ext4_rec_len_from_disk(de->rec_len,
1933 offsetof(struct ext4_dir_entry_2,
1939 return (struct ext4_dir_entry_2 *) (to - rec_len);
1943 * Compact each dir entry in the range to the minimal rec_len.
1944 * Returns pointer to last entry in range.
1946 static struct ext4_dir_entry_2 *dx_pack_dirents(struct inode *dir, char *base,
1947 unsigned int blocksize)
1949 struct ext4_dir_entry_2 *next, *to, *prev, *de = (struct ext4_dir_entry_2 *) base;
1950 unsigned rec_len = 0;
1953 while ((char*)de < base + blocksize) {
1954 next = ext4_next_entry(de, blocksize);
1955 if (de->inode && de->name_len) {
1956 rec_len = ext4_dir_rec_len(de->name_len, dir);
1958 memmove(to, de, rec_len);
1959 to->rec_len = ext4_rec_len_to_disk(rec_len, blocksize);
1961 to = (struct ext4_dir_entry_2 *) (((char *) to) + rec_len);
1969 * Split a full leaf block to make room for a new dir entry.
1970 * Allocate a new block, and move entries so that they are approx. equally full.
1971 * Returns pointer to de in block into which the new entry will be inserted.
1973 static struct ext4_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1974 struct buffer_head **bh,struct dx_frame *frame,
1975 struct dx_hash_info *hinfo)
1977 unsigned blocksize = dir->i_sb->s_blocksize;
1980 struct buffer_head *bh2;
1981 ext4_lblk_t newblock;
1983 struct dx_map_entry *map;
1984 char *data1 = (*bh)->b_data, *data2;
1985 unsigned split, move, size;
1986 struct ext4_dir_entry_2 *de = NULL, *de2;
1990 if (ext4_has_metadata_csum(dir->i_sb))
1991 csum_size = sizeof(struct ext4_dir_entry_tail);
1993 bh2 = ext4_append(handle, dir, &newblock);
1997 return (struct ext4_dir_entry_2 *) bh2;
2000 BUFFER_TRACE(*bh, "get_write_access");
2001 err = ext4_journal_get_write_access(handle, dir->i_sb, *bh,
2006 BUFFER_TRACE(frame->bh, "get_write_access");
2007 err = ext4_journal_get_write_access(handle, dir->i_sb, frame->bh,
2012 data2 = bh2->b_data;
2014 /* create map in the end of data2 block */
2015 map = (struct dx_map_entry *) (data2 + blocksize);
2016 count = dx_make_map(dir, *bh, hinfo, map);
2022 dx_sort_map(map, count);
2023 /* Ensure that neither split block is over half full */
2026 for (i = count-1; i >= 0; i--) {
2027 /* is more than half of this entry in 2nd half of the block? */
2028 if (size + map[i].size/2 > blocksize/2)
2030 size += map[i].size;
2034 * map index at which we will split
2036 * If the sum of active entries didn't exceed half the block size, just
2037 * split it in half by count; each resulting block will have at least
2038 * half the space free.
2041 split = count - move;
2045 hash2 = map[split].hash;
2046 continued = hash2 == map[split - 1].hash;
2047 dxtrace(printk(KERN_INFO "Split block %lu at %x, %i/%i\n",
2048 (unsigned long)dx_get_block(frame->at),
2049 hash2, split, count-split));
2051 /* Fancy dance to stay within two buffers */
2052 de2 = dx_move_dirents(dir, data1, data2, map + split, count - split,
2054 de = dx_pack_dirents(dir, data1, blocksize);
2055 de->rec_len = ext4_rec_len_to_disk(data1 + (blocksize - csum_size) -
2058 de2->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) -
2062 ext4_initialize_dirent_tail(*bh, blocksize);
2063 ext4_initialize_dirent_tail(bh2, blocksize);
2066 dxtrace(dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *) data1,
2068 dxtrace(dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *) data2,
2071 /* Which block gets the new entry? */
2072 if (hinfo->hash >= hash2) {
2076 dx_insert_block(frame, hash2 + continued, newblock);
2077 err = ext4_handle_dirty_dirblock(handle, dir, bh2);
2080 err = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2084 dxtrace(dx_show_index("frame", frame->entries));
2091 ext4_std_error(dir->i_sb, err);
2092 return ERR_PTR(err);
2095 int ext4_find_dest_de(struct inode *dir, struct inode *inode,
2096 struct buffer_head *bh,
2097 void *buf, int buf_size,
2098 struct ext4_filename *fname,
2099 struct ext4_dir_entry_2 **dest_de)
2101 struct ext4_dir_entry_2 *de;
2102 unsigned short reclen = ext4_dir_rec_len(fname_len(fname), dir);
2104 unsigned int offset = 0;
2108 top = buf + buf_size - reclen;
2109 while ((char *) de <= top) {
2110 if (ext4_check_dir_entry(dir, NULL, de, bh,
2111 buf, buf_size, offset))
2112 return -EFSCORRUPTED;
2113 if (ext4_match(dir, fname, de))
2115 nlen = ext4_dir_rec_len(de->name_len, dir);
2116 rlen = ext4_rec_len_from_disk(de->rec_len, buf_size);
2117 if ((de->inode ? rlen - nlen : rlen) >= reclen)
2119 de = (struct ext4_dir_entry_2 *)((char *)de + rlen);
2122 if ((char *) de > top)
2129 void ext4_insert_dentry(struct inode *dir,
2130 struct inode *inode,
2131 struct ext4_dir_entry_2 *de,
2133 struct ext4_filename *fname)
2138 nlen = ext4_dir_rec_len(de->name_len, dir);
2139 rlen = ext4_rec_len_from_disk(de->rec_len, buf_size);
2141 struct ext4_dir_entry_2 *de1 =
2142 (struct ext4_dir_entry_2 *)((char *)de + nlen);
2143 de1->rec_len = ext4_rec_len_to_disk(rlen - nlen, buf_size);
2144 de->rec_len = ext4_rec_len_to_disk(nlen, buf_size);
2147 de->file_type = EXT4_FT_UNKNOWN;
2148 de->inode = cpu_to_le32(inode->i_ino);
2149 ext4_set_de_type(inode->i_sb, de, inode->i_mode);
2150 de->name_len = fname_len(fname);
2151 memcpy(de->name, fname_name(fname), fname_len(fname));
2152 if (ext4_hash_in_dirent(dir)) {
2153 struct dx_hash_info *hinfo = &fname->hinfo;
2155 EXT4_DIRENT_HASHES(de)->hash = cpu_to_le32(hinfo->hash);
2156 EXT4_DIRENT_HASHES(de)->minor_hash =
2157 cpu_to_le32(hinfo->minor_hash);
2162 * Add a new entry into a directory (leaf) block. If de is non-NULL,
2163 * it points to a directory entry which is guaranteed to be large
2164 * enough for new directory entry. If de is NULL, then
2165 * add_dirent_to_buf will attempt search the directory block for
2166 * space. It will return -ENOSPC if no space is available, and -EIO
2167 * and -EEXIST if directory entry already exists.
2169 static int add_dirent_to_buf(handle_t *handle, struct ext4_filename *fname,
2171 struct inode *inode, struct ext4_dir_entry_2 *de,
2172 struct buffer_head *bh)
2174 unsigned int blocksize = dir->i_sb->s_blocksize;
2178 if (ext4_has_metadata_csum(inode->i_sb))
2179 csum_size = sizeof(struct ext4_dir_entry_tail);
2182 err = ext4_find_dest_de(dir, inode, bh, bh->b_data,
2183 blocksize - csum_size, fname, &de);
2187 BUFFER_TRACE(bh, "get_write_access");
2188 err = ext4_journal_get_write_access(handle, dir->i_sb, bh,
2191 ext4_std_error(dir->i_sb, err);
2195 /* By now the buffer is marked for journaling */
2196 ext4_insert_dentry(dir, inode, de, blocksize, fname);
2199 * XXX shouldn't update any times until successful
2200 * completion of syscall, but too many callers depend
2203 * XXX similarly, too many callers depend on
2204 * ext4_new_inode() setting the times, but error
2205 * recovery deletes the inode, so the worst that can
2206 * happen is that the times are slightly out of date
2207 * and/or different from the directory change time.
2209 inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
2210 ext4_update_dx_flag(dir);
2211 inode_inc_iversion(dir);
2212 err2 = ext4_mark_inode_dirty(handle, dir);
2213 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
2214 err = ext4_handle_dirty_dirblock(handle, dir, bh);
2216 ext4_std_error(dir->i_sb, err);
2217 return err ? err : err2;
2221 * This converts a one block unindexed directory to a 3 block indexed
2222 * directory, and adds the dentry to the indexed directory.
2224 static int make_indexed_dir(handle_t *handle, struct ext4_filename *fname,
2226 struct inode *inode, struct buffer_head *bh)
2228 struct buffer_head *bh2;
2229 struct dx_root *root;
2230 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
2231 struct dx_entry *entries;
2232 struct ext4_dir_entry_2 *de, *de2;
2238 struct fake_dirent *fde;
2241 if (ext4_has_metadata_csum(inode->i_sb))
2242 csum_size = sizeof(struct ext4_dir_entry_tail);
2244 blocksize = dir->i_sb->s_blocksize;
2245 dxtrace(printk(KERN_DEBUG "Creating index: inode %lu\n", dir->i_ino));
2246 BUFFER_TRACE(bh, "get_write_access");
2247 retval = ext4_journal_get_write_access(handle, dir->i_sb, bh,
2250 ext4_std_error(dir->i_sb, retval);
2254 root = (struct dx_root *) bh->b_data;
2256 /* The 0th block becomes the root, move the dirents out */
2257 fde = &root->dotdot;
2258 de = (struct ext4_dir_entry_2 *)((char *)fde +
2259 ext4_rec_len_from_disk(fde->rec_len, blocksize));
2260 if ((char *) de >= (((char *) root) + blocksize)) {
2261 EXT4_ERROR_INODE(dir, "invalid rec_len for '..'");
2263 return -EFSCORRUPTED;
2265 len = ((char *) root) + (blocksize - csum_size) - (char *) de;
2267 /* Allocate new block for the 0th block's dirents */
2268 bh2 = ext4_append(handle, dir, &block);
2271 return PTR_ERR(bh2);
2273 ext4_set_inode_flag(dir, EXT4_INODE_INDEX);
2274 data2 = bh2->b_data;
2276 memcpy(data2, de, len);
2277 memset(de, 0, len); /* wipe old data */
2278 de = (struct ext4_dir_entry_2 *) data2;
2280 while ((char *)(de2 = ext4_next_entry(de, blocksize)) < top) {
2281 if (ext4_check_dir_entry(dir, NULL, de, bh2, data2, len,
2282 (char *)de - data2)) {
2285 return -EFSCORRUPTED;
2289 de->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) -
2290 (char *) de, blocksize);
2293 ext4_initialize_dirent_tail(bh2, blocksize);
2295 /* Initialize the root; the dot dirents already exist */
2296 de = (struct ext4_dir_entry_2 *) (&root->dotdot);
2297 de->rec_len = ext4_rec_len_to_disk(
2298 blocksize - ext4_dir_rec_len(2, NULL), blocksize);
2299 memset (&root->info, 0, sizeof(root->info));
2300 root->info.info_length = sizeof(root->info);
2301 if (ext4_hash_in_dirent(dir))
2302 root->info.hash_version = DX_HASH_SIPHASH;
2304 root->info.hash_version =
2305 EXT4_SB(dir->i_sb)->s_def_hash_version;
2307 entries = root->entries;
2308 dx_set_block(entries, 1);
2309 dx_set_count(entries, 1);
2310 dx_set_limit(entries, dx_root_limit(dir, sizeof(root->info)));
2312 /* Initialize as for dx_probe */
2313 fname->hinfo.hash_version = root->info.hash_version;
2314 if (fname->hinfo.hash_version <= DX_HASH_TEA)
2315 fname->hinfo.hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
2316 fname->hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
2318 /* casefolded encrypted hashes are computed on fname setup */
2319 if (!ext4_hash_in_dirent(dir)) {
2320 int err = ext4fs_dirhash(dir, fname_name(fname),
2321 fname_len(fname), &fname->hinfo);
2328 memset(frames, 0, sizeof(frames));
2330 frame->entries = entries;
2331 frame->at = entries;
2334 retval = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2337 retval = ext4_handle_dirty_dirblock(handle, dir, bh2);
2341 de = do_split(handle,dir, &bh2, frame, &fname->hinfo);
2343 retval = PTR_ERR(de);
2347 retval = add_dirent_to_buf(handle, fname, dir, inode, de, bh2);
2350 * Even if the block split failed, we have to properly write
2351 * out all the changes we did so far. Otherwise we can end up
2352 * with corrupted filesystem.
2355 ext4_mark_inode_dirty(handle, dir);
2364 * adds a file entry to the specified directory, using the same
2365 * semantics as ext4_find_entry(). It returns NULL if it failed.
2367 * NOTE!! The inode part of 'de' is left at 0 - which means you
2368 * may not sleep between calling this and putting something into
2369 * the entry, as someone else might have used it while you slept.
2371 static int ext4_add_entry(handle_t *handle, struct dentry *dentry,
2372 struct inode *inode)
2374 struct inode *dir = d_inode(dentry->d_parent);
2375 struct buffer_head *bh = NULL;
2376 struct ext4_dir_entry_2 *de;
2377 struct super_block *sb;
2378 struct ext4_filename fname;
2382 ext4_lblk_t block, blocks;
2385 if (ext4_has_metadata_csum(inode->i_sb))
2386 csum_size = sizeof(struct ext4_dir_entry_tail);
2389 blocksize = sb->s_blocksize;
2391 if (fscrypt_is_nokey_name(dentry))
2394 #if IS_ENABLED(CONFIG_UNICODE)
2395 if (sb_has_strict_encoding(sb) && IS_CASEFOLDED(dir) &&
2396 utf8_validate(sb->s_encoding, &dentry->d_name))
2400 retval = ext4_fname_setup_filename(dir, &dentry->d_name, 0, &fname);
2404 if (ext4_has_inline_data(dir)) {
2405 retval = ext4_try_add_inline_entry(handle, &fname, dir, inode);
2415 retval = ext4_dx_add_entry(handle, &fname, dir, inode);
2416 if (!retval || (retval != ERR_BAD_DX_DIR))
2418 /* Can we just ignore htree data? */
2419 if (ext4_has_metadata_csum(sb)) {
2420 EXT4_ERROR_INODE(dir,
2421 "Directory has corrupted htree index.");
2422 retval = -EFSCORRUPTED;
2425 ext4_clear_inode_flag(dir, EXT4_INODE_INDEX);
2427 retval = ext4_mark_inode_dirty(handle, dir);
2428 if (unlikely(retval))
2431 blocks = dir->i_size >> sb->s_blocksize_bits;
2432 for (block = 0; block < blocks; block++) {
2433 bh = ext4_read_dirblock(dir, block, DIRENT);
2435 bh = ext4_bread(handle, dir, block,
2436 EXT4_GET_BLOCKS_CREATE);
2437 goto add_to_new_block;
2440 retval = PTR_ERR(bh);
2444 retval = add_dirent_to_buf(handle, &fname, dir, inode,
2446 if (retval != -ENOSPC)
2449 if (blocks == 1 && !dx_fallback &&
2450 ext4_has_feature_dir_index(sb)) {
2451 retval = make_indexed_dir(handle, &fname, dir,
2453 bh = NULL; /* make_indexed_dir releases bh */
2458 bh = ext4_append(handle, dir, &block);
2461 retval = PTR_ERR(bh);
2465 de = (struct ext4_dir_entry_2 *) bh->b_data;
2467 de->rec_len = ext4_rec_len_to_disk(blocksize - csum_size, blocksize);
2470 ext4_initialize_dirent_tail(bh, blocksize);
2472 retval = add_dirent_to_buf(handle, &fname, dir, inode, de, bh);
2474 ext4_fname_free_filename(&fname);
2477 ext4_set_inode_state(inode, EXT4_STATE_NEWENTRY);
2482 * Returns 0 for success, or a negative error value
2484 static int ext4_dx_add_entry(handle_t *handle, struct ext4_filename *fname,
2485 struct inode *dir, struct inode *inode)
2487 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
2488 struct dx_entry *entries, *at;
2489 struct buffer_head *bh;
2490 struct super_block *sb = dir->i_sb;
2491 struct ext4_dir_entry_2 *de;
2497 frame = dx_probe(fname, dir, NULL, frames);
2499 return PTR_ERR(frame);
2500 entries = frame->entries;
2502 bh = ext4_read_dirblock(dir, dx_get_block(frame->at), DIRENT_HTREE);
2509 BUFFER_TRACE(bh, "get_write_access");
2510 err = ext4_journal_get_write_access(handle, sb, bh, EXT4_JTR_NONE);
2514 err = add_dirent_to_buf(handle, fname, dir, inode, NULL, bh);
2519 /* Block full, should compress but for now just split */
2520 dxtrace(printk(KERN_DEBUG "using %u of %u node entries\n",
2521 dx_get_count(entries), dx_get_limit(entries)));
2522 /* Need to split index? */
2523 if (dx_get_count(entries) == dx_get_limit(entries)) {
2524 ext4_lblk_t newblock;
2525 int levels = frame - frames + 1;
2526 unsigned int icount;
2528 struct dx_entry *entries2;
2529 struct dx_node *node2;
2530 struct buffer_head *bh2;
2532 while (frame > frames) {
2533 if (dx_get_count((frame - 1)->entries) <
2534 dx_get_limit((frame - 1)->entries)) {
2538 frame--; /* split higher index block */
2540 entries = frame->entries;
2543 if (add_level && levels == ext4_dir_htree_level(sb)) {
2544 ext4_warning(sb, "Directory (ino: %lu) index full, "
2545 "reach max htree level :%d",
2546 dir->i_ino, levels);
2547 if (ext4_dir_htree_level(sb) < EXT4_HTREE_LEVEL) {
2548 ext4_warning(sb, "Large directory feature is "
2549 "not enabled on this "
2555 icount = dx_get_count(entries);
2556 bh2 = ext4_append(handle, dir, &newblock);
2561 node2 = (struct dx_node *)(bh2->b_data);
2562 entries2 = node2->entries;
2563 memset(&node2->fake, 0, sizeof(struct fake_dirent));
2564 node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize,
2566 BUFFER_TRACE(frame->bh, "get_write_access");
2567 err = ext4_journal_get_write_access(handle, sb, frame->bh,
2572 unsigned icount1 = icount/2, icount2 = icount - icount1;
2573 unsigned hash2 = dx_get_hash(entries + icount1);
2574 dxtrace(printk(KERN_DEBUG "Split index %i/%i\n",
2577 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
2578 err = ext4_journal_get_write_access(handle, sb,
2584 memcpy((char *) entries2, (char *) (entries + icount1),
2585 icount2 * sizeof(struct dx_entry));
2586 dx_set_count(entries, icount1);
2587 dx_set_count(entries2, icount2);
2588 dx_set_limit(entries2, dx_node_limit(dir));
2590 /* Which index block gets the new entry? */
2591 if (at - entries >= icount1) {
2592 frame->at = at - entries - icount1 + entries2;
2593 frame->entries = entries = entries2;
2594 swap(frame->bh, bh2);
2596 dx_insert_block((frame - 1), hash2, newblock);
2597 dxtrace(dx_show_index("node", frame->entries));
2598 dxtrace(dx_show_index("node",
2599 ((struct dx_node *) bh2->b_data)->entries));
2600 err = ext4_handle_dirty_dx_node(handle, dir, bh2);
2604 err = ext4_handle_dirty_dx_node(handle, dir,
2608 err = ext4_handle_dirty_dx_node(handle, dir,
2613 struct dx_root *dxroot;
2614 memcpy((char *) entries2, (char *) entries,
2615 icount * sizeof(struct dx_entry));
2616 dx_set_limit(entries2, dx_node_limit(dir));
2619 dx_set_count(entries, 1);
2620 dx_set_block(entries + 0, newblock);
2621 dxroot = (struct dx_root *)frames[0].bh->b_data;
2622 dxroot->info.indirect_levels += 1;
2623 dxtrace(printk(KERN_DEBUG
2624 "Creating %d level index...\n",
2625 dxroot->info.indirect_levels));
2626 err = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2629 err = ext4_handle_dirty_dx_node(handle, dir, bh2);
2635 de = do_split(handle, dir, &bh, frame, &fname->hinfo);
2640 err = add_dirent_to_buf(handle, fname, dir, inode, de, bh);
2644 ext4_std_error(dir->i_sb, err); /* this is a no-op if err == 0 */
2648 /* @restart is true means htree-path has been changed, we need to
2649 * repeat dx_probe() to find out valid htree-path
2651 if (restart && err == 0)
2657 * ext4_generic_delete_entry deletes a directory entry by merging it
2658 * with the previous entry
2660 int ext4_generic_delete_entry(struct inode *dir,
2661 struct ext4_dir_entry_2 *de_del,
2662 struct buffer_head *bh,
2667 struct ext4_dir_entry_2 *de, *pde;
2668 unsigned int blocksize = dir->i_sb->s_blocksize;
2674 while (i < buf_size - csum_size) {
2675 if (ext4_check_dir_entry(dir, NULL, de, bh,
2676 entry_buf, buf_size, i))
2677 return -EFSCORRUPTED;
2680 pde->rec_len = ext4_rec_len_to_disk(
2681 ext4_rec_len_from_disk(pde->rec_len,
2683 ext4_rec_len_from_disk(de->rec_len,
2687 /* wipe entire dir_entry */
2688 memset(de, 0, ext4_rec_len_from_disk(de->rec_len,
2691 /* wipe dir_entry excluding the rec_len field */
2693 memset(&de->name_len, 0,
2694 ext4_rec_len_from_disk(de->rec_len,
2696 offsetof(struct ext4_dir_entry_2,
2700 inode_inc_iversion(dir);
2703 i += ext4_rec_len_from_disk(de->rec_len, blocksize);
2705 de = ext4_next_entry(de, blocksize);
2710 static int ext4_delete_entry(handle_t *handle,
2712 struct ext4_dir_entry_2 *de_del,
2713 struct buffer_head *bh)
2715 int err, csum_size = 0;
2717 if (ext4_has_inline_data(dir)) {
2718 int has_inline_data = 1;
2719 err = ext4_delete_inline_entry(handle, dir, de_del, bh,
2721 if (has_inline_data)
2725 if (ext4_has_metadata_csum(dir->i_sb))
2726 csum_size = sizeof(struct ext4_dir_entry_tail);
2728 BUFFER_TRACE(bh, "get_write_access");
2729 err = ext4_journal_get_write_access(handle, dir->i_sb, bh,
2734 err = ext4_generic_delete_entry(dir, de_del, bh, bh->b_data,
2735 dir->i_sb->s_blocksize, csum_size);
2739 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
2740 err = ext4_handle_dirty_dirblock(handle, dir, bh);
2747 ext4_std_error(dir->i_sb, err);
2752 * Set directory link count to 1 if nlinks > EXT4_LINK_MAX, or if nlinks == 2
2753 * since this indicates that nlinks count was previously 1 to avoid overflowing
2754 * the 16-bit i_links_count field on disk. Directories with i_nlink == 1 mean
2755 * that subdirectory link counts are not being maintained accurately.
2757 * The caller has already checked for i_nlink overflow in case the DIR_LINK
2758 * feature is not enabled and returned -EMLINK. The is_dx() check is a proxy
2759 * for checking S_ISDIR(inode) (since the INODE_INDEX feature will not be set
2760 * on regular files) and to avoid creating huge/slow non-HTREE directories.
2762 static void ext4_inc_count(struct inode *inode)
2766 (inode->i_nlink > EXT4_LINK_MAX || inode->i_nlink == 2))
2767 set_nlink(inode, 1);
2771 * If a directory had nlink == 1, then we should let it be 1. This indicates
2772 * directory has >EXT4_LINK_MAX subdirs.
2774 static void ext4_dec_count(struct inode *inode)
2776 if (!S_ISDIR(inode->i_mode) || inode->i_nlink > 2)
2782 * Add non-directory inode to a directory. On success, the inode reference is
2783 * consumed by dentry is instantiation. This is also indicated by clearing of
2784 * *inodep pointer. On failure, the caller is responsible for dropping the
2785 * inode reference in the safe context.
2787 static int ext4_add_nondir(handle_t *handle,
2788 struct dentry *dentry, struct inode **inodep)
2790 struct inode *dir = d_inode(dentry->d_parent);
2791 struct inode *inode = *inodep;
2792 int err = ext4_add_entry(handle, dentry, inode);
2794 err = ext4_mark_inode_dirty(handle, inode);
2795 if (IS_DIRSYNC(dir))
2796 ext4_handle_sync(handle);
2797 d_instantiate_new(dentry, inode);
2802 ext4_mark_inode_dirty(handle, inode);
2803 ext4_orphan_add(handle, inode);
2804 unlock_new_inode(inode);
2809 * By the time this is called, we already have created
2810 * the directory cache entry for the new file, but it
2811 * is so far negative - it has no inode.
2813 * If the create succeeds, we fill in the inode information
2814 * with d_instantiate().
2816 static int ext4_create(struct mnt_idmap *idmap, struct inode *dir,
2817 struct dentry *dentry, umode_t mode, bool excl)
2820 struct inode *inode;
2821 int err, credits, retries = 0;
2823 err = dquot_initialize(dir);
2827 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2828 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2830 inode = ext4_new_inode_start_handle(idmap, dir, mode, &dentry->d_name,
2831 0, NULL, EXT4_HT_DIR, credits);
2832 handle = ext4_journal_current_handle();
2833 err = PTR_ERR(inode);
2834 if (!IS_ERR(inode)) {
2835 inode->i_op = &ext4_file_inode_operations;
2836 inode->i_fop = &ext4_file_operations;
2837 ext4_set_aops(inode);
2838 err = ext4_add_nondir(handle, dentry, &inode);
2840 ext4_fc_track_create(handle, dentry);
2843 ext4_journal_stop(handle);
2844 if (!IS_ERR_OR_NULL(inode))
2846 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2851 static int ext4_mknod(struct mnt_idmap *idmap, struct inode *dir,
2852 struct dentry *dentry, umode_t mode, dev_t rdev)
2855 struct inode *inode;
2856 int err, credits, retries = 0;
2858 err = dquot_initialize(dir);
2862 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2863 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2865 inode = ext4_new_inode_start_handle(idmap, dir, mode, &dentry->d_name,
2866 0, NULL, EXT4_HT_DIR, credits);
2867 handle = ext4_journal_current_handle();
2868 err = PTR_ERR(inode);
2869 if (!IS_ERR(inode)) {
2870 init_special_inode(inode, inode->i_mode, rdev);
2871 inode->i_op = &ext4_special_inode_operations;
2872 err = ext4_add_nondir(handle, dentry, &inode);
2874 ext4_fc_track_create(handle, dentry);
2877 ext4_journal_stop(handle);
2878 if (!IS_ERR_OR_NULL(inode))
2880 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2885 static int ext4_tmpfile(struct mnt_idmap *idmap, struct inode *dir,
2886 struct file *file, umode_t mode)
2889 struct inode *inode;
2890 int err, retries = 0;
2892 err = dquot_initialize(dir);
2897 inode = ext4_new_inode_start_handle(idmap, dir, mode,
2900 EXT4_MAXQUOTAS_TRANS_BLOCKS(dir->i_sb) +
2901 4 + EXT4_XATTR_TRANS_BLOCKS);
2902 handle = ext4_journal_current_handle();
2903 err = PTR_ERR(inode);
2904 if (!IS_ERR(inode)) {
2905 inode->i_op = &ext4_file_inode_operations;
2906 inode->i_fop = &ext4_file_operations;
2907 ext4_set_aops(inode);
2908 d_tmpfile(file, inode);
2909 err = ext4_orphan_add(handle, inode);
2911 goto err_unlock_inode;
2912 mark_inode_dirty(inode);
2913 unlock_new_inode(inode);
2916 ext4_journal_stop(handle);
2917 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2919 return finish_open_simple(file, err);
2921 ext4_journal_stop(handle);
2922 unlock_new_inode(inode);
2926 struct ext4_dir_entry_2 *ext4_init_dot_dotdot(struct inode *inode,
2927 struct ext4_dir_entry_2 *de,
2928 int blocksize, int csum_size,
2929 unsigned int parent_ino, int dotdot_real_len)
2931 de->inode = cpu_to_le32(inode->i_ino);
2933 de->rec_len = ext4_rec_len_to_disk(ext4_dir_rec_len(de->name_len, NULL),
2935 strcpy(de->name, ".");
2936 ext4_set_de_type(inode->i_sb, de, S_IFDIR);
2938 de = ext4_next_entry(de, blocksize);
2939 de->inode = cpu_to_le32(parent_ino);
2941 if (!dotdot_real_len)
2942 de->rec_len = ext4_rec_len_to_disk(blocksize -
2943 (csum_size + ext4_dir_rec_len(1, NULL)),
2946 de->rec_len = ext4_rec_len_to_disk(
2947 ext4_dir_rec_len(de->name_len, NULL),
2949 strcpy(de->name, "..");
2950 ext4_set_de_type(inode->i_sb, de, S_IFDIR);
2952 return ext4_next_entry(de, blocksize);
2955 int ext4_init_new_dir(handle_t *handle, struct inode *dir,
2956 struct inode *inode)
2958 struct buffer_head *dir_block = NULL;
2959 struct ext4_dir_entry_2 *de;
2960 ext4_lblk_t block = 0;
2961 unsigned int blocksize = dir->i_sb->s_blocksize;
2965 if (ext4_has_metadata_csum(dir->i_sb))
2966 csum_size = sizeof(struct ext4_dir_entry_tail);
2968 if (ext4_test_inode_state(inode, EXT4_STATE_MAY_INLINE_DATA)) {
2969 err = ext4_try_create_inline_dir(handle, dir, inode);
2970 if (err < 0 && err != -ENOSPC)
2977 dir_block = ext4_append(handle, inode, &block);
2978 if (IS_ERR(dir_block))
2979 return PTR_ERR(dir_block);
2980 de = (struct ext4_dir_entry_2 *)dir_block->b_data;
2981 ext4_init_dot_dotdot(inode, de, blocksize, csum_size, dir->i_ino, 0);
2982 set_nlink(inode, 2);
2984 ext4_initialize_dirent_tail(dir_block, blocksize);
2986 BUFFER_TRACE(dir_block, "call ext4_handle_dirty_metadata");
2987 err = ext4_handle_dirty_dirblock(handle, inode, dir_block);
2990 set_buffer_verified(dir_block);
2996 static int ext4_mkdir(struct mnt_idmap *idmap, struct inode *dir,
2997 struct dentry *dentry, umode_t mode)
3000 struct inode *inode;
3001 int err, err2 = 0, credits, retries = 0;
3003 if (EXT4_DIR_LINK_MAX(dir))
3006 err = dquot_initialize(dir);
3010 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3011 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
3013 inode = ext4_new_inode_start_handle(idmap, dir, S_IFDIR | mode,
3015 0, NULL, EXT4_HT_DIR, credits);
3016 handle = ext4_journal_current_handle();
3017 err = PTR_ERR(inode);
3021 inode->i_op = &ext4_dir_inode_operations;
3022 inode->i_fop = &ext4_dir_operations;
3023 err = ext4_init_new_dir(handle, dir, inode);
3025 goto out_clear_inode;
3026 err = ext4_mark_inode_dirty(handle, inode);
3028 err = ext4_add_entry(handle, dentry, inode);
3032 ext4_orphan_add(handle, inode);
3033 unlock_new_inode(inode);
3034 err2 = ext4_mark_inode_dirty(handle, inode);
3037 ext4_journal_stop(handle);
3041 ext4_inc_count(dir);
3043 ext4_update_dx_flag(dir);
3044 err = ext4_mark_inode_dirty(handle, dir);
3046 goto out_clear_inode;
3047 d_instantiate_new(dentry, inode);
3048 ext4_fc_track_create(handle, dentry);
3049 if (IS_DIRSYNC(dir))
3050 ext4_handle_sync(handle);
3054 ext4_journal_stop(handle);
3056 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3062 * routine to check that the specified directory is empty (for rmdir)
3064 bool ext4_empty_dir(struct inode *inode)
3066 unsigned int offset;
3067 struct buffer_head *bh;
3068 struct ext4_dir_entry_2 *de;
3069 struct super_block *sb;
3071 if (ext4_has_inline_data(inode)) {
3072 int has_inline_data = 1;
3075 ret = empty_inline_dir(inode, &has_inline_data);
3076 if (has_inline_data)
3081 if (inode->i_size < ext4_dir_rec_len(1, NULL) +
3082 ext4_dir_rec_len(2, NULL)) {
3083 EXT4_ERROR_INODE(inode, "invalid size");
3086 /* The first directory block must not be a hole,
3087 * so treat it as DIRENT_HTREE
3089 bh = ext4_read_dirblock(inode, 0, DIRENT_HTREE);
3093 de = (struct ext4_dir_entry_2 *) bh->b_data;
3094 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data, bh->b_size,
3096 le32_to_cpu(de->inode) != inode->i_ino || strcmp(".", de->name)) {
3097 ext4_warning_inode(inode, "directory missing '.'");
3101 offset = ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
3102 de = ext4_next_entry(de, sb->s_blocksize);
3103 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data, bh->b_size,
3105 le32_to_cpu(de->inode) == 0 || strcmp("..", de->name)) {
3106 ext4_warning_inode(inode, "directory missing '..'");
3110 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
3111 while (offset < inode->i_size) {
3112 if (!(offset & (sb->s_blocksize - 1))) {
3113 unsigned int lblock;
3115 lblock = offset >> EXT4_BLOCK_SIZE_BITS(sb);
3116 bh = ext4_read_dirblock(inode, lblock, EITHER);
3118 offset += sb->s_blocksize;
3124 de = (struct ext4_dir_entry_2 *) (bh->b_data +
3125 (offset & (sb->s_blocksize - 1)));
3126 if (ext4_check_dir_entry(inode, NULL, de, bh,
3127 bh->b_data, bh->b_size, offset) ||
3128 le32_to_cpu(de->inode)) {
3132 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
3138 static int ext4_rmdir(struct inode *dir, struct dentry *dentry)
3141 struct inode *inode;
3142 struct buffer_head *bh;
3143 struct ext4_dir_entry_2 *de;
3144 handle_t *handle = NULL;
3146 if (unlikely(ext4_forced_shutdown(dir->i_sb)))
3149 /* Initialize quotas before so that eventual writes go in
3150 * separate transaction */
3151 retval = dquot_initialize(dir);
3154 retval = dquot_initialize(d_inode(dentry));
3159 bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL);
3165 inode = d_inode(dentry);
3167 retval = -EFSCORRUPTED;
3168 if (le32_to_cpu(de->inode) != inode->i_ino)
3171 retval = -ENOTEMPTY;
3172 if (!ext4_empty_dir(inode))
3175 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3176 EXT4_DATA_TRANS_BLOCKS(dir->i_sb));
3177 if (IS_ERR(handle)) {
3178 retval = PTR_ERR(handle);
3183 if (IS_DIRSYNC(dir))
3184 ext4_handle_sync(handle);
3186 retval = ext4_delete_entry(handle, dir, de, bh);
3189 if (!EXT4_DIR_LINK_EMPTY(inode))
3190 ext4_warning_inode(inode,
3191 "empty directory '%.*s' has too many links (%u)",
3192 dentry->d_name.len, dentry->d_name.name,
3194 inode_inc_iversion(inode);
3196 /* There's no need to set i_disksize: the fact that i_nlink is
3197 * zero will ensure that the right thing happens during any
3200 ext4_orphan_add(handle, inode);
3201 inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
3202 inode_set_ctime_current(inode);
3203 retval = ext4_mark_inode_dirty(handle, inode);
3206 ext4_dec_count(dir);
3207 ext4_update_dx_flag(dir);
3208 ext4_fc_track_unlink(handle, dentry);
3209 retval = ext4_mark_inode_dirty(handle, dir);
3211 #if IS_ENABLED(CONFIG_UNICODE)
3212 /* VFS negative dentries are incompatible with Encoding and
3213 * Case-insensitiveness. Eventually we'll want avoid
3214 * invalidating the dentries here, alongside with returning the
3215 * negative dentries at ext4_lookup(), when it is better
3216 * supported by the VFS for the CI case.
3218 if (IS_CASEFOLDED(dir))
3219 d_invalidate(dentry);
3225 ext4_journal_stop(handle);
3229 int __ext4_unlink(struct inode *dir, const struct qstr *d_name,
3230 struct inode *inode,
3231 struct dentry *dentry /* NULL during fast_commit recovery */)
3233 int retval = -ENOENT;
3234 struct buffer_head *bh;
3235 struct ext4_dir_entry_2 *de;
3237 int skip_remove_dentry = 0;
3240 * Keep this outside the transaction; it may have to set up the
3241 * directory's encryption key, which isn't GFP_NOFS-safe.
3243 bh = ext4_find_entry(dir, d_name, &de, NULL);
3250 if (le32_to_cpu(de->inode) != inode->i_ino) {
3252 * It's okay if we find dont find dentry which matches
3253 * the inode. That's because it might have gotten
3254 * renamed to a different inode number
3256 if (EXT4_SB(inode->i_sb)->s_mount_state & EXT4_FC_REPLAY)
3257 skip_remove_dentry = 1;
3262 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3263 EXT4_DATA_TRANS_BLOCKS(dir->i_sb));
3264 if (IS_ERR(handle)) {
3265 retval = PTR_ERR(handle);
3269 if (IS_DIRSYNC(dir))
3270 ext4_handle_sync(handle);
3272 if (!skip_remove_dentry) {
3273 retval = ext4_delete_entry(handle, dir, de, bh);
3276 inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
3277 ext4_update_dx_flag(dir);
3278 retval = ext4_mark_inode_dirty(handle, dir);
3284 if (inode->i_nlink == 0)
3285 ext4_warning_inode(inode, "Deleting file '%.*s' with no links",
3286 d_name->len, d_name->name);
3289 if (!inode->i_nlink)
3290 ext4_orphan_add(handle, inode);
3291 inode_set_ctime_current(inode);
3292 retval = ext4_mark_inode_dirty(handle, inode);
3293 if (dentry && !retval)
3294 ext4_fc_track_unlink(handle, dentry);
3296 ext4_journal_stop(handle);
3302 static int ext4_unlink(struct inode *dir, struct dentry *dentry)
3306 if (unlikely(ext4_forced_shutdown(dir->i_sb)))
3309 trace_ext4_unlink_enter(dir, dentry);
3311 * Initialize quotas before so that eventual writes go
3312 * in separate transaction
3314 retval = dquot_initialize(dir);
3317 retval = dquot_initialize(d_inode(dentry));
3321 retval = __ext4_unlink(dir, &dentry->d_name, d_inode(dentry), dentry);
3322 #if IS_ENABLED(CONFIG_UNICODE)
3323 /* VFS negative dentries are incompatible with Encoding and
3324 * Case-insensitiveness. Eventually we'll want avoid
3325 * invalidating the dentries here, alongside with returning the
3326 * negative dentries at ext4_lookup(), when it is better
3327 * supported by the VFS for the CI case.
3329 if (IS_CASEFOLDED(dir))
3330 d_invalidate(dentry);
3334 trace_ext4_unlink_exit(dentry, retval);
3338 static int ext4_init_symlink_block(handle_t *handle, struct inode *inode,
3339 struct fscrypt_str *disk_link)
3341 struct buffer_head *bh;
3345 bh = ext4_bread(handle, inode, 0, EXT4_GET_BLOCKS_CREATE);
3349 BUFFER_TRACE(bh, "get_write_access");
3350 err = ext4_journal_get_write_access(handle, inode->i_sb, bh, EXT4_JTR_NONE);
3354 kaddr = (char *)bh->b_data;
3355 memcpy(kaddr, disk_link->name, disk_link->len);
3356 inode->i_size = disk_link->len - 1;
3357 EXT4_I(inode)->i_disksize = inode->i_size;
3358 err = ext4_handle_dirty_metadata(handle, inode, bh);
3364 static int ext4_symlink(struct mnt_idmap *idmap, struct inode *dir,
3365 struct dentry *dentry, const char *symname)
3368 struct inode *inode;
3369 int err, len = strlen(symname);
3371 struct fscrypt_str disk_link;
3374 if (unlikely(ext4_forced_shutdown(dir->i_sb)))
3377 err = fscrypt_prepare_symlink(dir, symname, len, dir->i_sb->s_blocksize,
3382 err = dquot_initialize(dir);
3387 * EXT4_INDEX_EXTRA_TRANS_BLOCKS for addition of entry into the
3388 * directory. +3 for inode, inode bitmap, group descriptor allocation.
3389 * EXT4_DATA_TRANS_BLOCKS for the data block allocation and
3392 credits = EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3393 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3;
3395 inode = ext4_new_inode_start_handle(idmap, dir, S_IFLNK|S_IRWXUGO,
3396 &dentry->d_name, 0, NULL,
3397 EXT4_HT_DIR, credits);
3398 handle = ext4_journal_current_handle();
3399 if (IS_ERR(inode)) {
3401 ext4_journal_stop(handle);
3402 err = PTR_ERR(inode);
3406 if (IS_ENCRYPTED(inode)) {
3407 err = fscrypt_encrypt_symlink(inode, symname, len, &disk_link);
3409 goto err_drop_inode;
3410 inode->i_op = &ext4_encrypted_symlink_inode_operations;
3412 if ((disk_link.len > EXT4_N_BLOCKS * 4)) {
3413 inode->i_op = &ext4_symlink_inode_operations;
3415 inode->i_op = &ext4_fast_symlink_inode_operations;
3416 inode->i_link = (char *)&EXT4_I(inode)->i_data;
3420 if ((disk_link.len > EXT4_N_BLOCKS * 4)) {
3421 /* alloc symlink block and fill it */
3422 err = ext4_init_symlink_block(handle, inode, &disk_link);
3424 goto err_drop_inode;
3426 /* clear the extent format for fast symlink */
3427 ext4_clear_inode_flag(inode, EXT4_INODE_EXTENTS);
3428 memcpy((char *)&EXT4_I(inode)->i_data, disk_link.name,
3430 inode->i_size = disk_link.len - 1;
3431 EXT4_I(inode)->i_disksize = inode->i_size;
3433 err = ext4_add_nondir(handle, dentry, &inode);
3435 ext4_journal_stop(handle);
3441 ext4_mark_inode_dirty(handle, inode);
3442 ext4_orphan_add(handle, inode);
3443 unlock_new_inode(inode);
3445 ext4_journal_stop(handle);
3448 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3450 if (disk_link.name != (unsigned char *)symname)
3451 kfree(disk_link.name);
3455 int __ext4_link(struct inode *dir, struct inode *inode, struct dentry *dentry)
3458 int err, retries = 0;
3460 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3461 (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3462 EXT4_INDEX_EXTRA_TRANS_BLOCKS) + 1);
3464 return PTR_ERR(handle);
3466 if (IS_DIRSYNC(dir))
3467 ext4_handle_sync(handle);
3469 inode_set_ctime_current(inode);
3470 ext4_inc_count(inode);
3473 err = ext4_add_entry(handle, dentry, inode);
3475 err = ext4_mark_inode_dirty(handle, inode);
3476 /* this can happen only for tmpfile being
3477 * linked the first time
3479 if (inode->i_nlink == 1)
3480 ext4_orphan_del(handle, inode);
3481 d_instantiate(dentry, inode);
3482 ext4_fc_track_link(handle, dentry);
3487 ext4_journal_stop(handle);
3488 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3493 static int ext4_link(struct dentry *old_dentry,
3494 struct inode *dir, struct dentry *dentry)
3496 struct inode *inode = d_inode(old_dentry);
3499 if (inode->i_nlink >= EXT4_LINK_MAX)
3502 err = fscrypt_prepare_link(old_dentry, dir, dentry);
3506 if ((ext4_test_inode_flag(dir, EXT4_INODE_PROJINHERIT)) &&
3507 (!projid_eq(EXT4_I(dir)->i_projid,
3508 EXT4_I(old_dentry->d_inode)->i_projid)))
3511 err = dquot_initialize(dir);
3514 return __ext4_link(dir, inode, dentry);
3518 * Try to find buffer head where contains the parent block.
3519 * It should be the inode block if it is inlined or the 1st block
3520 * if it is a normal dir.
3522 static struct buffer_head *ext4_get_first_dir_block(handle_t *handle,
3523 struct inode *inode,
3525 struct ext4_dir_entry_2 **parent_de,
3528 struct buffer_head *bh;
3530 if (!ext4_has_inline_data(inode)) {
3531 struct ext4_dir_entry_2 *de;
3532 unsigned int offset;
3534 /* The first directory block must not be a hole, so
3535 * treat it as DIRENT_HTREE
3537 bh = ext4_read_dirblock(inode, 0, DIRENT_HTREE);
3539 *retval = PTR_ERR(bh);
3543 de = (struct ext4_dir_entry_2 *) bh->b_data;
3544 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data,
3546 le32_to_cpu(de->inode) != inode->i_ino ||
3547 strcmp(".", de->name)) {
3548 EXT4_ERROR_INODE(inode, "directory missing '.'");
3550 *retval = -EFSCORRUPTED;
3553 offset = ext4_rec_len_from_disk(de->rec_len,
3554 inode->i_sb->s_blocksize);
3555 de = ext4_next_entry(de, inode->i_sb->s_blocksize);
3556 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data,
3557 bh->b_size, offset) ||
3558 le32_to_cpu(de->inode) == 0 || strcmp("..", de->name)) {
3559 EXT4_ERROR_INODE(inode, "directory missing '..'");
3561 *retval = -EFSCORRUPTED;
3570 return ext4_get_first_inline_block(inode, parent_de, retval);
3573 struct ext4_renament {
3575 struct dentry *dentry;
3576 struct inode *inode;
3578 int dir_nlink_delta;
3580 /* entry for "dentry" */
3581 struct buffer_head *bh;
3582 struct ext4_dir_entry_2 *de;
3585 /* entry for ".." in inode if it's a directory */
3586 struct buffer_head *dir_bh;
3587 struct ext4_dir_entry_2 *parent_de;
3591 static int ext4_rename_dir_prepare(handle_t *handle, struct ext4_renament *ent, bool is_cross)
3599 ent->dir_bh = ext4_get_first_dir_block(handle, ent->inode,
3600 &retval, &ent->parent_de,
3604 if (le32_to_cpu(ent->parent_de->inode) != ent->dir->i_ino)
3605 return -EFSCORRUPTED;
3606 BUFFER_TRACE(ent->dir_bh, "get_write_access");
3607 return ext4_journal_get_write_access(handle, ent->dir->i_sb,
3608 ent->dir_bh, EXT4_JTR_NONE);
3611 static int ext4_rename_dir_finish(handle_t *handle, struct ext4_renament *ent,
3619 ent->parent_de->inode = cpu_to_le32(dir_ino);
3620 BUFFER_TRACE(ent->dir_bh, "call ext4_handle_dirty_metadata");
3621 if (!ent->dir_inlined) {
3622 if (is_dx(ent->inode)) {
3623 retval = ext4_handle_dirty_dx_node(handle,
3627 retval = ext4_handle_dirty_dirblock(handle, ent->inode,
3631 retval = ext4_mark_inode_dirty(handle, ent->inode);
3634 ext4_std_error(ent->dir->i_sb, retval);
3640 static int ext4_setent(handle_t *handle, struct ext4_renament *ent,
3641 unsigned ino, unsigned file_type)
3643 int retval, retval2;
3645 BUFFER_TRACE(ent->bh, "get write access");
3646 retval = ext4_journal_get_write_access(handle, ent->dir->i_sb, ent->bh,
3650 ent->de->inode = cpu_to_le32(ino);
3651 if (ext4_has_feature_filetype(ent->dir->i_sb))
3652 ent->de->file_type = file_type;
3653 inode_inc_iversion(ent->dir);
3654 inode_set_mtime_to_ts(ent->dir, inode_set_ctime_current(ent->dir));
3655 retval = ext4_mark_inode_dirty(handle, ent->dir);
3656 BUFFER_TRACE(ent->bh, "call ext4_handle_dirty_metadata");
3657 if (!ent->inlined) {
3658 retval2 = ext4_handle_dirty_dirblock(handle, ent->dir, ent->bh);
3659 if (unlikely(retval2)) {
3660 ext4_std_error(ent->dir->i_sb, retval2);
3667 static void ext4_resetent(handle_t *handle, struct ext4_renament *ent,
3668 unsigned ino, unsigned file_type)
3670 struct ext4_renament old = *ent;
3674 * old->de could have moved from under us during make indexed dir,
3675 * so the old->de may no longer valid and need to find it again
3676 * before reset old inode info.
3678 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, &old.de,
3681 retval = PTR_ERR(old.bh);
3685 ext4_std_error(old.dir->i_sb, retval);
3689 ext4_setent(handle, &old, ino, file_type);
3693 static int ext4_find_delete_entry(handle_t *handle, struct inode *dir,
3694 const struct qstr *d_name)
3696 int retval = -ENOENT;
3697 struct buffer_head *bh;
3698 struct ext4_dir_entry_2 *de;
3700 bh = ext4_find_entry(dir, d_name, &de, NULL);
3704 retval = ext4_delete_entry(handle, dir, de, bh);
3710 static void ext4_rename_delete(handle_t *handle, struct ext4_renament *ent,
3715 * ent->de could have moved from under us during htree split, so make
3716 * sure that we are deleting the right entry. We might also be pointing
3717 * to a stale entry in the unused part of ent->bh so just checking inum
3718 * and the name isn't enough.
3720 if (le32_to_cpu(ent->de->inode) != ent->inode->i_ino ||
3721 ent->de->name_len != ent->dentry->d_name.len ||
3722 strncmp(ent->de->name, ent->dentry->d_name.name,
3723 ent->de->name_len) ||
3725 retval = ext4_find_delete_entry(handle, ent->dir,
3726 &ent->dentry->d_name);
3728 retval = ext4_delete_entry(handle, ent->dir, ent->de, ent->bh);
3729 if (retval == -ENOENT) {
3730 retval = ext4_find_delete_entry(handle, ent->dir,
3731 &ent->dentry->d_name);
3736 ext4_warning_inode(ent->dir,
3737 "Deleting old file: nlink %d, error=%d",
3738 ent->dir->i_nlink, retval);
3742 static void ext4_update_dir_count(handle_t *handle, struct ext4_renament *ent)
3744 if (ent->dir_nlink_delta) {
3745 if (ent->dir_nlink_delta == -1)
3746 ext4_dec_count(ent->dir);
3748 ext4_inc_count(ent->dir);
3749 ext4_mark_inode_dirty(handle, ent->dir);
3753 static struct inode *ext4_whiteout_for_rename(struct mnt_idmap *idmap,
3754 struct ext4_renament *ent,
3755 int credits, handle_t **h)
3762 * for inode block, sb block, group summaries,
3765 credits += (EXT4_MAXQUOTAS_TRANS_BLOCKS(ent->dir->i_sb) +
3766 EXT4_XATTR_TRANS_BLOCKS + 4);
3768 wh = ext4_new_inode_start_handle(idmap, ent->dir,
3769 S_IFCHR | WHITEOUT_MODE,
3770 &ent->dentry->d_name, 0, NULL,
3771 EXT4_HT_DIR, credits);
3773 handle = ext4_journal_current_handle();
3776 ext4_journal_stop(handle);
3777 if (PTR_ERR(wh) == -ENOSPC &&
3778 ext4_should_retry_alloc(ent->dir->i_sb, &retries))
3782 init_special_inode(wh, wh->i_mode, WHITEOUT_DEV);
3783 wh->i_op = &ext4_special_inode_operations;
3789 * Anybody can rename anything with this: the permission checks are left to the
3790 * higher-level routines.
3792 * n.b. old_{dentry,inode) refers to the source dentry/inode
3793 * while new_{dentry,inode) refers to the destination dentry/inode
3794 * This comes from rename(const char *oldpath, const char *newpath)
3796 static int ext4_rename(struct mnt_idmap *idmap, struct inode *old_dir,
3797 struct dentry *old_dentry, struct inode *new_dir,
3798 struct dentry *new_dentry, unsigned int flags)
3800 handle_t *handle = NULL;
3801 struct ext4_renament old = {
3803 .dentry = old_dentry,
3804 .inode = d_inode(old_dentry),
3806 struct ext4_renament new = {
3808 .dentry = new_dentry,
3809 .inode = d_inode(new_dentry),
3813 struct inode *whiteout = NULL;
3817 if (new.inode && new.inode->i_nlink == 0) {
3818 EXT4_ERROR_INODE(new.inode,
3819 "target of rename is already freed");
3820 return -EFSCORRUPTED;
3823 if ((ext4_test_inode_flag(new_dir, EXT4_INODE_PROJINHERIT)) &&
3824 (!projid_eq(EXT4_I(new_dir)->i_projid,
3825 EXT4_I(old_dentry->d_inode)->i_projid)))
3828 retval = dquot_initialize(old.dir);
3831 retval = dquot_initialize(old.inode);
3834 retval = dquot_initialize(new.dir);
3838 /* Initialize quotas before so that eventual writes go
3839 * in separate transaction */
3841 retval = dquot_initialize(new.inode);
3846 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, &old.de,
3849 return PTR_ERR(old.bh);
3852 * Check for inode number is _not_ due to possible IO errors.
3853 * We might rmdir the source, keep it as pwd of some process
3854 * and merrily kill the link to whatever was created under the
3855 * same name. Goodbye sticky bit ;-<
3858 if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino)
3861 new.bh = ext4_find_entry(new.dir, &new.dentry->d_name,
3862 &new.de, &new.inlined);
3863 if (IS_ERR(new.bh)) {
3864 retval = PTR_ERR(new.bh);
3874 if (new.inode && !test_opt(new.dir->i_sb, NO_AUTO_DA_ALLOC))
3875 ext4_alloc_da_blocks(old.inode);
3877 credits = (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) +
3878 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2);
3879 if (!(flags & RENAME_WHITEOUT)) {
3880 handle = ext4_journal_start(old.dir, EXT4_HT_DIR, credits);
3881 if (IS_ERR(handle)) {
3882 retval = PTR_ERR(handle);
3886 whiteout = ext4_whiteout_for_rename(idmap, &old, credits, &handle);
3887 if (IS_ERR(whiteout)) {
3888 retval = PTR_ERR(whiteout);
3893 old_file_type = old.de->file_type;
3894 if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir))
3895 ext4_handle_sync(handle);
3897 if (S_ISDIR(old.inode->i_mode)) {
3899 retval = -ENOTEMPTY;
3900 if (!ext4_empty_dir(new.inode))
3904 if (new.dir != old.dir && EXT4_DIR_LINK_MAX(new.dir))
3907 retval = ext4_rename_dir_prepare(handle, &old, new.dir != old.dir);
3912 * If we're renaming a file within an inline_data dir and adding or
3913 * setting the new dirent causes a conversion from inline_data to
3914 * extents/blockmap, we need to force the dirent delete code to
3915 * re-read the directory, or else we end up trying to delete a dirent
3916 * from what is now the extent tree root (or a block map).
3918 force_reread = (new.dir->i_ino == old.dir->i_ino &&
3919 ext4_test_inode_flag(new.dir, EXT4_INODE_INLINE_DATA));
3923 * Do this before adding a new entry, so the old entry is sure
3924 * to be still pointing to the valid old entry.
3926 retval = ext4_setent(handle, &old, whiteout->i_ino,
3930 retval = ext4_mark_inode_dirty(handle, whiteout);
3931 if (unlikely(retval))
3936 retval = ext4_add_entry(handle, new.dentry, old.inode);
3940 retval = ext4_setent(handle, &new,
3941 old.inode->i_ino, old_file_type);
3946 force_reread = !ext4_test_inode_flag(new.dir,
3947 EXT4_INODE_INLINE_DATA);
3950 * Like most other Unix systems, set the ctime for inodes on a
3953 inode_set_ctime_current(old.inode);
3954 retval = ext4_mark_inode_dirty(handle, old.inode);
3955 if (unlikely(retval))
3962 ext4_rename_delete(handle, &old, force_reread);
3966 ext4_dec_count(new.inode);
3967 inode_set_ctime_current(new.inode);
3969 inode_set_mtime_to_ts(old.dir, inode_set_ctime_current(old.dir));
3970 ext4_update_dx_flag(old.dir);
3972 retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino);
3976 ext4_dec_count(old.dir);
3978 /* checked ext4_empty_dir above, can't have another
3979 * parent, ext4_dec_count() won't work for many-linked
3981 clear_nlink(new.inode);
3983 ext4_inc_count(new.dir);
3984 ext4_update_dx_flag(new.dir);
3985 retval = ext4_mark_inode_dirty(handle, new.dir);
3986 if (unlikely(retval))
3990 retval = ext4_mark_inode_dirty(handle, old.dir);
3991 if (unlikely(retval))
3996 * We disable fast commits here that's because the
3997 * replay code is not yet capable of changing dot dot
3998 * dirents in directories.
4000 ext4_fc_mark_ineligible(old.inode->i_sb,
4001 EXT4_FC_REASON_RENAME_DIR, handle);
4003 struct super_block *sb = old.inode->i_sb;
4006 ext4_fc_track_unlink(handle, new.dentry);
4007 if (test_opt2(sb, JOURNAL_FAST_COMMIT) &&
4008 !(EXT4_SB(sb)->s_mount_state & EXT4_FC_REPLAY) &&
4009 !(ext4_test_mount_flag(sb, EXT4_MF_FC_INELIGIBLE))) {
4010 __ext4_fc_track_link(handle, old.inode, new.dentry);
4011 __ext4_fc_track_unlink(handle, old.inode, old.dentry);
4013 __ext4_fc_track_create(handle, whiteout,
4019 retval = ext4_mark_inode_dirty(handle, new.inode);
4020 if (unlikely(retval))
4022 if (!new.inode->i_nlink)
4023 ext4_orphan_add(handle, new.inode);
4030 ext4_resetent(handle, &old,
4031 old.inode->i_ino, old_file_type);
4032 drop_nlink(whiteout);
4033 ext4_mark_inode_dirty(handle, whiteout);
4034 ext4_orphan_add(handle, whiteout);
4036 unlock_new_inode(whiteout);
4037 ext4_journal_stop(handle);
4040 ext4_journal_stop(handle);
4050 static int ext4_cross_rename(struct inode *old_dir, struct dentry *old_dentry,
4051 struct inode *new_dir, struct dentry *new_dentry)
4053 handle_t *handle = NULL;
4054 struct ext4_renament old = {
4056 .dentry = old_dentry,
4057 .inode = d_inode(old_dentry),
4059 struct ext4_renament new = {
4061 .dentry = new_dentry,
4062 .inode = d_inode(new_dentry),
4067 if ((ext4_test_inode_flag(new_dir, EXT4_INODE_PROJINHERIT) &&
4068 !projid_eq(EXT4_I(new_dir)->i_projid,
4069 EXT4_I(old_dentry->d_inode)->i_projid)) ||
4070 (ext4_test_inode_flag(old_dir, EXT4_INODE_PROJINHERIT) &&
4071 !projid_eq(EXT4_I(old_dir)->i_projid,
4072 EXT4_I(new_dentry->d_inode)->i_projid)))
4075 retval = dquot_initialize(old.dir);
4078 retval = dquot_initialize(new.dir);
4082 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name,
4083 &old.de, &old.inlined);
4085 return PTR_ERR(old.bh);
4087 * Check for inode number is _not_ due to possible IO errors.
4088 * We might rmdir the source, keep it as pwd of some process
4089 * and merrily kill the link to whatever was created under the
4090 * same name. Goodbye sticky bit ;-<
4093 if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino)
4096 new.bh = ext4_find_entry(new.dir, &new.dentry->d_name,
4097 &new.de, &new.inlined);
4098 if (IS_ERR(new.bh)) {
4099 retval = PTR_ERR(new.bh);
4104 /* RENAME_EXCHANGE case: old *and* new must both exist */
4105 if (!new.bh || le32_to_cpu(new.de->inode) != new.inode->i_ino)
4108 handle = ext4_journal_start(old.dir, EXT4_HT_DIR,
4109 (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) +
4110 2 * EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2));
4111 if (IS_ERR(handle)) {
4112 retval = PTR_ERR(handle);
4117 if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir))
4118 ext4_handle_sync(handle);
4120 if (S_ISDIR(old.inode->i_mode)) {
4121 retval = ext4_rename_dir_prepare(handle, &old, new.dir != old.dir);
4125 if (S_ISDIR(new.inode->i_mode)) {
4126 retval = ext4_rename_dir_prepare(handle, &new, new.dir != old.dir);
4132 * Other than the special case of overwriting a directory, parents'
4133 * nlink only needs to be modified if this is a cross directory rename.
4135 if (old.dir != new.dir && old.is_dir != new.is_dir) {
4136 old.dir_nlink_delta = old.is_dir ? -1 : 1;
4137 new.dir_nlink_delta = -old.dir_nlink_delta;
4139 if ((old.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(old.dir)) ||
4140 (new.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(new.dir)))
4144 new_file_type = new.de->file_type;
4145 retval = ext4_setent(handle, &new, old.inode->i_ino, old.de->file_type);
4149 retval = ext4_setent(handle, &old, new.inode->i_ino, new_file_type);
4154 * Like most other Unix systems, set the ctime for inodes on a
4157 inode_set_ctime_current(old.inode);
4158 inode_set_ctime_current(new.inode);
4159 retval = ext4_mark_inode_dirty(handle, old.inode);
4160 if (unlikely(retval))
4162 retval = ext4_mark_inode_dirty(handle, new.inode);
4163 if (unlikely(retval))
4165 ext4_fc_mark_ineligible(new.inode->i_sb,
4166 EXT4_FC_REASON_CROSS_RENAME, handle);
4168 retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino);
4173 retval = ext4_rename_dir_finish(handle, &new, old.dir->i_ino);
4177 ext4_update_dir_count(handle, &old);
4178 ext4_update_dir_count(handle, &new);
4187 ext4_journal_stop(handle);
4191 static int ext4_rename2(struct mnt_idmap *idmap,
4192 struct inode *old_dir, struct dentry *old_dentry,
4193 struct inode *new_dir, struct dentry *new_dentry,
4198 if (unlikely(ext4_forced_shutdown(old_dir->i_sb)))
4201 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
4204 err = fscrypt_prepare_rename(old_dir, old_dentry, new_dir, new_dentry,
4209 if (flags & RENAME_EXCHANGE) {
4210 return ext4_cross_rename(old_dir, old_dentry,
4211 new_dir, new_dentry);
4214 return ext4_rename(idmap, old_dir, old_dentry, new_dir, new_dentry, flags);
4218 * directories can handle most operations...
4220 const struct inode_operations ext4_dir_inode_operations = {
4221 .create = ext4_create,
4222 .lookup = ext4_lookup,
4224 .unlink = ext4_unlink,
4225 .symlink = ext4_symlink,
4226 .mkdir = ext4_mkdir,
4227 .rmdir = ext4_rmdir,
4228 .mknod = ext4_mknod,
4229 .tmpfile = ext4_tmpfile,
4230 .rename = ext4_rename2,
4231 .setattr = ext4_setattr,
4232 .getattr = ext4_getattr,
4233 .listxattr = ext4_listxattr,
4234 .get_inode_acl = ext4_get_acl,
4235 .set_acl = ext4_set_acl,
4236 .fiemap = ext4_fiemap,
4237 .fileattr_get = ext4_fileattr_get,
4238 .fileattr_set = ext4_fileattr_set,
4241 const struct inode_operations ext4_special_inode_operations = {
4242 .setattr = ext4_setattr,
4243 .getattr = ext4_getattr,
4244 .listxattr = ext4_listxattr,
4245 .get_inode_acl = ext4_get_acl,
4246 .set_acl = ext4_set_acl,