1 // SPDX-License-Identifier: GPL-2.0
3 * linux/fs/ext4/namei.c
5 * Copyright (C) 1992, 1993, 1994, 1995
7 * Laboratoire MASI - Institut Blaise Pascal
8 * Universite Pierre et Marie Curie (Paris VI)
12 * linux/fs/minix/namei.c
14 * Copyright (C) 1991, 1992 Linus Torvalds
16 * Big-endian to little-endian byte-swapping/bitmaps by
18 * Directory entry file type support and forward compatibility hooks
20 * Hash Tree Directory indexing (c)
21 * Daniel Phillips, 2001
22 * Hash Tree Directory indexing porting
23 * Christopher Li, 2002
24 * Hash Tree Directory indexing cleanup
29 #include <linux/pagemap.h>
30 #include <linux/time.h>
31 #include <linux/fcntl.h>
32 #include <linux/stat.h>
33 #include <linux/string.h>
34 #include <linux/quotaops.h>
35 #include <linux/buffer_head.h>
36 #include <linux/bio.h>
37 #include <linux/iversion.h>
38 #include <linux/unicode.h>
40 #include "ext4_jbd2.h"
45 #include <trace/events/ext4.h>
47 * define how far ahead to read directories while searching them.
49 #define NAMEI_RA_CHUNKS 2
50 #define NAMEI_RA_BLOCKS 4
51 #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS)
53 static struct buffer_head *ext4_append(handle_t *handle,
57 struct buffer_head *bh;
60 if (unlikely(EXT4_SB(inode->i_sb)->s_max_dir_size_kb &&
61 ((inode->i_size >> 10) >=
62 EXT4_SB(inode->i_sb)->s_max_dir_size_kb)))
63 return ERR_PTR(-ENOSPC);
65 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
67 bh = ext4_bread(handle, inode, *block, EXT4_GET_BLOCKS_CREATE);
70 inode->i_size += inode->i_sb->s_blocksize;
71 EXT4_I(inode)->i_disksize = inode->i_size;
72 BUFFER_TRACE(bh, "get_write_access");
73 err = ext4_journal_get_write_access(handle, bh);
76 ext4_std_error(inode->i_sb, err);
82 static int ext4_dx_csum_verify(struct inode *inode,
83 struct ext4_dir_entry *dirent);
86 * Hints to ext4_read_dirblock regarding whether we expect a directory
87 * block being read to be an index block, or a block containing
88 * directory entries (and if the latter, whether it was found via a
89 * logical block in an htree index block). This is used to control
90 * what sort of sanity checkinig ext4_read_dirblock() will do on the
91 * directory block read from the storage device. EITHER will means
92 * the caller doesn't know what kind of directory block will be read,
93 * so no specific verification will be done.
96 EITHER, INDEX, DIRENT, DIRENT_HTREE
99 #define ext4_read_dirblock(inode, block, type) \
100 __ext4_read_dirblock((inode), (block), (type), __func__, __LINE__)
102 static struct buffer_head *__ext4_read_dirblock(struct inode *inode,
104 dirblock_type_t type,
108 struct buffer_head *bh;
109 struct ext4_dir_entry *dirent;
112 bh = ext4_bread(NULL, inode, block, 0);
114 __ext4_warning(inode->i_sb, func, line,
115 "inode #%lu: lblock %lu: comm %s: "
116 "error %ld reading directory block",
117 inode->i_ino, (unsigned long)block,
118 current->comm, PTR_ERR(bh));
122 if (!bh && (type == INDEX || type == DIRENT_HTREE)) {
123 ext4_error_inode(inode, func, line, block,
124 "Directory hole found for htree %s block",
125 (type == INDEX) ? "index" : "leaf");
126 return ERR_PTR(-EFSCORRUPTED);
130 dirent = (struct ext4_dir_entry *) bh->b_data;
131 /* Determine whether or not we have an index block */
135 else if (ext4_rec_len_from_disk(dirent->rec_len,
136 inode->i_sb->s_blocksize) ==
137 inode->i_sb->s_blocksize)
140 if (!is_dx_block && type == INDEX) {
141 ext4_error_inode(inode, func, line, block,
142 "directory leaf block found instead of index block");
144 return ERR_PTR(-EFSCORRUPTED);
146 if (!ext4_has_metadata_csum(inode->i_sb) ||
151 * An empty leaf block can get mistaken for a index block; for
152 * this reason, we can only check the index checksum when the
153 * caller is sure it should be an index block.
155 if (is_dx_block && type == INDEX) {
156 if (ext4_dx_csum_verify(inode, dirent))
157 set_buffer_verified(bh);
159 ext4_error_inode(inode, func, line, block,
160 "Directory index failed checksum");
162 return ERR_PTR(-EFSBADCRC);
166 if (ext4_dirblock_csum_verify(inode, bh))
167 set_buffer_verified(bh);
169 ext4_error_inode(inode, func, line, block,
170 "Directory block failed checksum");
172 return ERR_PTR(-EFSBADCRC);
179 #define assert(test) J_ASSERT(test)
183 #define dxtrace(command) command
185 #define dxtrace(command)
209 * dx_root_info is laid out so that if it should somehow get overlaid by a
210 * dirent the two low bits of the hash version will be zero. Therefore, the
211 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
216 struct fake_dirent dot;
218 struct fake_dirent dotdot;
222 __le32 reserved_zero;
224 u8 info_length; /* 8 */
229 struct dx_entry entries[0];
234 struct fake_dirent fake;
235 struct dx_entry entries[0];
241 struct buffer_head *bh;
242 struct dx_entry *entries;
254 * This goes at the end of each htree block.
258 __le32 dt_checksum; /* crc32c(uuid+inum+dirblock) */
261 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry);
262 static void dx_set_block(struct dx_entry *entry, ext4_lblk_t value);
263 static inline unsigned dx_get_hash(struct dx_entry *entry);
264 static void dx_set_hash(struct dx_entry *entry, unsigned value);
265 static unsigned dx_get_count(struct dx_entry *entries);
266 static unsigned dx_get_limit(struct dx_entry *entries);
267 static void dx_set_count(struct dx_entry *entries, unsigned value);
268 static void dx_set_limit(struct dx_entry *entries, unsigned value);
269 static unsigned dx_root_limit(struct inode *dir, unsigned infosize);
270 static unsigned dx_node_limit(struct inode *dir);
271 static struct dx_frame *dx_probe(struct ext4_filename *fname,
273 struct dx_hash_info *hinfo,
274 struct dx_frame *frame);
275 static void dx_release(struct dx_frame *frames);
276 static int dx_make_map(struct inode *dir, struct ext4_dir_entry_2 *de,
277 unsigned blocksize, struct dx_hash_info *hinfo,
278 struct dx_map_entry map[]);
279 static void dx_sort_map(struct dx_map_entry *map, unsigned count);
280 static struct ext4_dir_entry_2 *dx_move_dirents(char *from, char *to,
281 struct dx_map_entry *offsets, int count, unsigned blocksize);
282 static struct ext4_dir_entry_2* dx_pack_dirents(char *base, unsigned blocksize);
283 static void dx_insert_block(struct dx_frame *frame,
284 u32 hash, ext4_lblk_t block);
285 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
286 struct dx_frame *frame,
287 struct dx_frame *frames,
289 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
290 struct ext4_filename *fname,
291 struct ext4_dir_entry_2 **res_dir);
292 static int ext4_dx_add_entry(handle_t *handle, struct ext4_filename *fname,
293 struct inode *dir, struct inode *inode);
295 /* checksumming functions */
296 void ext4_initialize_dirent_tail(struct buffer_head *bh,
297 unsigned int blocksize)
299 struct ext4_dir_entry_tail *t = EXT4_DIRENT_TAIL(bh->b_data, blocksize);
301 memset(t, 0, sizeof(struct ext4_dir_entry_tail));
302 t->det_rec_len = ext4_rec_len_to_disk(
303 sizeof(struct ext4_dir_entry_tail), blocksize);
304 t->det_reserved_ft = EXT4_FT_DIR_CSUM;
307 /* Walk through a dirent block to find a checksum "dirent" at the tail */
308 static struct ext4_dir_entry_tail *get_dirent_tail(struct inode *inode,
309 struct buffer_head *bh)
311 struct ext4_dir_entry_tail *t;
314 struct ext4_dir_entry *d, *top;
316 d = (struct ext4_dir_entry *)bh->b_data;
317 top = (struct ext4_dir_entry *)(bh->b_data +
318 (EXT4_BLOCK_SIZE(inode->i_sb) -
319 sizeof(struct ext4_dir_entry_tail)));
320 while (d < top && d->rec_len)
321 d = (struct ext4_dir_entry *)(((void *)d) +
322 le16_to_cpu(d->rec_len));
327 t = (struct ext4_dir_entry_tail *)d;
329 t = EXT4_DIRENT_TAIL(bh->b_data, EXT4_BLOCK_SIZE(inode->i_sb));
332 if (t->det_reserved_zero1 ||
333 le16_to_cpu(t->det_rec_len) != sizeof(struct ext4_dir_entry_tail) ||
334 t->det_reserved_zero2 ||
335 t->det_reserved_ft != EXT4_FT_DIR_CSUM)
341 static __le32 ext4_dirblock_csum(struct inode *inode, void *dirent, int size)
343 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
344 struct ext4_inode_info *ei = EXT4_I(inode);
347 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size);
348 return cpu_to_le32(csum);
351 #define warn_no_space_for_csum(inode) \
352 __warn_no_space_for_csum((inode), __func__, __LINE__)
354 static void __warn_no_space_for_csum(struct inode *inode, const char *func,
357 __ext4_warning_inode(inode, func, line,
358 "No space for directory leaf checksum. Please run e2fsck -D.");
361 int ext4_dirblock_csum_verify(struct inode *inode, struct buffer_head *bh)
363 struct ext4_dir_entry_tail *t;
365 if (!ext4_has_metadata_csum(inode->i_sb))
368 t = get_dirent_tail(inode, bh);
370 warn_no_space_for_csum(inode);
374 if (t->det_checksum != ext4_dirblock_csum(inode, bh->b_data,
375 (char *)t - bh->b_data))
381 static void ext4_dirblock_csum_set(struct inode *inode,
382 struct buffer_head *bh)
384 struct ext4_dir_entry_tail *t;
386 if (!ext4_has_metadata_csum(inode->i_sb))
389 t = get_dirent_tail(inode, bh);
391 warn_no_space_for_csum(inode);
395 t->det_checksum = ext4_dirblock_csum(inode, bh->b_data,
396 (char *)t - bh->b_data);
399 int ext4_handle_dirty_dirblock(handle_t *handle,
401 struct buffer_head *bh)
403 ext4_dirblock_csum_set(inode, bh);
404 return ext4_handle_dirty_metadata(handle, inode, bh);
407 static struct dx_countlimit *get_dx_countlimit(struct inode *inode,
408 struct ext4_dir_entry *dirent,
411 struct ext4_dir_entry *dp;
412 struct dx_root_info *root;
415 if (le16_to_cpu(dirent->rec_len) == EXT4_BLOCK_SIZE(inode->i_sb))
417 else if (le16_to_cpu(dirent->rec_len) == 12) {
418 dp = (struct ext4_dir_entry *)(((void *)dirent) + 12);
419 if (le16_to_cpu(dp->rec_len) !=
420 EXT4_BLOCK_SIZE(inode->i_sb) - 12)
422 root = (struct dx_root_info *)(((void *)dp + 12));
423 if (root->reserved_zero ||
424 root->info_length != sizeof(struct dx_root_info))
431 *offset = count_offset;
432 return (struct dx_countlimit *)(((void *)dirent) + count_offset);
435 static __le32 ext4_dx_csum(struct inode *inode, struct ext4_dir_entry *dirent,
436 int count_offset, int count, struct dx_tail *t)
438 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
439 struct ext4_inode_info *ei = EXT4_I(inode);
442 __u32 dummy_csum = 0;
443 int offset = offsetof(struct dx_tail, dt_checksum);
445 size = count_offset + (count * sizeof(struct dx_entry));
446 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size);
447 csum = ext4_chksum(sbi, csum, (__u8 *)t, offset);
448 csum = ext4_chksum(sbi, csum, (__u8 *)&dummy_csum, sizeof(dummy_csum));
450 return cpu_to_le32(csum);
453 static int ext4_dx_csum_verify(struct inode *inode,
454 struct ext4_dir_entry *dirent)
456 struct dx_countlimit *c;
458 int count_offset, limit, count;
460 if (!ext4_has_metadata_csum(inode->i_sb))
463 c = get_dx_countlimit(inode, dirent, &count_offset);
465 EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D.");
468 limit = le16_to_cpu(c->limit);
469 count = le16_to_cpu(c->count);
470 if (count_offset + (limit * sizeof(struct dx_entry)) >
471 EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) {
472 warn_no_space_for_csum(inode);
475 t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
477 if (t->dt_checksum != ext4_dx_csum(inode, dirent, count_offset,
483 static void ext4_dx_csum_set(struct inode *inode, struct ext4_dir_entry *dirent)
485 struct dx_countlimit *c;
487 int count_offset, limit, count;
489 if (!ext4_has_metadata_csum(inode->i_sb))
492 c = get_dx_countlimit(inode, dirent, &count_offset);
494 EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D.");
497 limit = le16_to_cpu(c->limit);
498 count = le16_to_cpu(c->count);
499 if (count_offset + (limit * sizeof(struct dx_entry)) >
500 EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) {
501 warn_no_space_for_csum(inode);
504 t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
506 t->dt_checksum = ext4_dx_csum(inode, dirent, count_offset, count, t);
509 static inline int ext4_handle_dirty_dx_node(handle_t *handle,
511 struct buffer_head *bh)
513 ext4_dx_csum_set(inode, (struct ext4_dir_entry *)bh->b_data);
514 return ext4_handle_dirty_metadata(handle, inode, bh);
518 * p is at least 6 bytes before the end of page
520 static inline struct ext4_dir_entry_2 *
521 ext4_next_entry(struct ext4_dir_entry_2 *p, unsigned long blocksize)
523 return (struct ext4_dir_entry_2 *)((char *)p +
524 ext4_rec_len_from_disk(p->rec_len, blocksize));
528 * Future: use high four bits of block for coalesce-on-delete flags
529 * Mask them off for now.
532 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry)
534 return le32_to_cpu(entry->block) & 0x0fffffff;
537 static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value)
539 entry->block = cpu_to_le32(value);
542 static inline unsigned dx_get_hash(struct dx_entry *entry)
544 return le32_to_cpu(entry->hash);
547 static inline void dx_set_hash(struct dx_entry *entry, unsigned value)
549 entry->hash = cpu_to_le32(value);
552 static inline unsigned dx_get_count(struct dx_entry *entries)
554 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
557 static inline unsigned dx_get_limit(struct dx_entry *entries)
559 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
562 static inline void dx_set_count(struct dx_entry *entries, unsigned value)
564 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
567 static inline void dx_set_limit(struct dx_entry *entries, unsigned value)
569 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
572 static inline unsigned dx_root_limit(struct inode *dir, unsigned infosize)
574 unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(1) -
575 EXT4_DIR_REC_LEN(2) - infosize;
577 if (ext4_has_metadata_csum(dir->i_sb))
578 entry_space -= sizeof(struct dx_tail);
579 return entry_space / sizeof(struct dx_entry);
582 static inline unsigned dx_node_limit(struct inode *dir)
584 unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(0);
586 if (ext4_has_metadata_csum(dir->i_sb))
587 entry_space -= sizeof(struct dx_tail);
588 return entry_space / sizeof(struct dx_entry);
595 static void dx_show_index(char * label, struct dx_entry *entries)
597 int i, n = dx_get_count (entries);
598 printk(KERN_DEBUG "%s index", label);
599 for (i = 0; i < n; i++) {
600 printk(KERN_CONT " %x->%lu",
601 i ? dx_get_hash(entries + i) : 0,
602 (unsigned long)dx_get_block(entries + i));
604 printk(KERN_CONT "\n");
614 static struct stats dx_show_leaf(struct inode *dir,
615 struct dx_hash_info *hinfo,
616 struct ext4_dir_entry_2 *de,
617 int size, int show_names)
619 unsigned names = 0, space = 0;
620 char *base = (char *) de;
621 struct dx_hash_info h = *hinfo;
624 while ((char *) de < base + size)
630 #ifdef CONFIG_FS_ENCRYPTION
633 struct fscrypt_str fname_crypto_str =
639 if (IS_ENCRYPTED(dir))
640 res = fscrypt_get_encryption_info(dir);
642 printk(KERN_WARNING "Error setting up"
643 " fname crypto: %d\n", res);
645 if (!fscrypt_has_encryption_key(dir)) {
646 /* Directory is not encrypted */
647 ext4fs_dirhash(dir, de->name,
649 printk("%*.s:(U)%x.%u ", len,
651 (unsigned) ((char *) de
654 struct fscrypt_str de_name =
655 FSTR_INIT(name, len);
657 /* Directory is encrypted */
658 res = fscrypt_fname_alloc_buffer(
662 printk(KERN_WARNING "Error "
666 res = fscrypt_fname_disk_to_usr(dir,
670 printk(KERN_WARNING "Error "
671 "converting filename "
677 name = fname_crypto_str.name;
678 len = fname_crypto_str.len;
680 ext4fs_dirhash(dir, de->name,
682 printk("%*.s:(E)%x.%u ", len, name,
683 h.hash, (unsigned) ((char *) de
685 fscrypt_fname_free_buffer(
689 int len = de->name_len;
690 char *name = de->name;
691 ext4fs_dirhash(dir, de->name, de->name_len, &h);
692 printk("%*.s:%x.%u ", len, name, h.hash,
693 (unsigned) ((char *) de - base));
696 space += EXT4_DIR_REC_LEN(de->name_len);
699 de = ext4_next_entry(de, size);
701 printk(KERN_CONT "(%i)\n", names);
702 return (struct stats) { names, space, 1 };
705 struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
706 struct dx_entry *entries, int levels)
708 unsigned blocksize = dir->i_sb->s_blocksize;
709 unsigned count = dx_get_count(entries), names = 0, space = 0, i;
711 struct buffer_head *bh;
712 printk("%i indexed blocks...\n", count);
713 for (i = 0; i < count; i++, entries++)
715 ext4_lblk_t block = dx_get_block(entries);
716 ext4_lblk_t hash = i ? dx_get_hash(entries): 0;
717 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
719 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
720 bh = ext4_bread(NULL,dir, block, 0);
721 if (!bh || IS_ERR(bh))
724 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
725 dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *)
726 bh->b_data, blocksize, 0);
727 names += stats.names;
728 space += stats.space;
729 bcount += stats.bcount;
733 printk(KERN_DEBUG "%snames %u, fullness %u (%u%%)\n",
734 levels ? "" : " ", names, space/bcount,
735 (space/bcount)*100/blocksize);
736 return (struct stats) { names, space, bcount};
738 #endif /* DX_DEBUG */
741 * Probe for a directory leaf block to search.
743 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
744 * error in the directory index, and the caller should fall back to
745 * searching the directory normally. The callers of dx_probe **MUST**
746 * check for this error code, and make sure it never gets reflected
749 static struct dx_frame *
750 dx_probe(struct ext4_filename *fname, struct inode *dir,
751 struct dx_hash_info *hinfo, struct dx_frame *frame_in)
753 unsigned count, indirect;
754 struct dx_entry *at, *entries, *p, *q, *m;
755 struct dx_root *root;
756 struct dx_frame *frame = frame_in;
757 struct dx_frame *ret_err = ERR_PTR(ERR_BAD_DX_DIR);
760 memset(frame_in, 0, EXT4_HTREE_LEVEL * sizeof(frame_in[0]));
761 frame->bh = ext4_read_dirblock(dir, 0, INDEX);
762 if (IS_ERR(frame->bh))
763 return (struct dx_frame *) frame->bh;
765 root = (struct dx_root *) frame->bh->b_data;
766 if (root->info.hash_version != DX_HASH_TEA &&
767 root->info.hash_version != DX_HASH_HALF_MD4 &&
768 root->info.hash_version != DX_HASH_LEGACY) {
769 ext4_warning_inode(dir, "Unrecognised inode hash code %u",
770 root->info.hash_version);
774 hinfo = &fname->hinfo;
775 hinfo->hash_version = root->info.hash_version;
776 if (hinfo->hash_version <= DX_HASH_TEA)
777 hinfo->hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
778 hinfo->seed = EXT4_SB(dir->i_sb)->s_hash_seed;
779 if (fname && fname_name(fname))
780 ext4fs_dirhash(dir, fname_name(fname), fname_len(fname), hinfo);
783 if (root->info.unused_flags & 1) {
784 ext4_warning_inode(dir, "Unimplemented hash flags: %#06x",
785 root->info.unused_flags);
789 indirect = root->info.indirect_levels;
790 if (indirect >= ext4_dir_htree_level(dir->i_sb)) {
791 ext4_warning(dir->i_sb,
792 "Directory (ino: %lu) htree depth %#06x exceed"
793 "supported value", dir->i_ino,
794 ext4_dir_htree_level(dir->i_sb));
795 if (ext4_dir_htree_level(dir->i_sb) < EXT4_HTREE_LEVEL) {
796 ext4_warning(dir->i_sb, "Enable large directory "
797 "feature to access it");
802 entries = (struct dx_entry *)(((char *)&root->info) +
803 root->info.info_length);
805 if (dx_get_limit(entries) != dx_root_limit(dir,
806 root->info.info_length)) {
807 ext4_warning_inode(dir, "dx entry: limit %u != root limit %u",
808 dx_get_limit(entries),
809 dx_root_limit(dir, root->info.info_length));
813 dxtrace(printk("Look up %x", hash));
815 count = dx_get_count(entries);
816 if (!count || count > dx_get_limit(entries)) {
817 ext4_warning_inode(dir,
818 "dx entry: count %u beyond limit %u",
819 count, dx_get_limit(entries));
824 q = entries + count - 1;
827 dxtrace(printk(KERN_CONT "."));
828 if (dx_get_hash(m) > hash)
834 if (0) { // linear search cross check
835 unsigned n = count - 1;
839 dxtrace(printk(KERN_CONT ","));
840 if (dx_get_hash(++at) > hash)
846 assert (at == p - 1);
850 dxtrace(printk(KERN_CONT " %x->%u\n",
851 at == entries ? 0 : dx_get_hash(at),
853 frame->entries = entries;
858 frame->bh = ext4_read_dirblock(dir, dx_get_block(at), INDEX);
859 if (IS_ERR(frame->bh)) {
860 ret_err = (struct dx_frame *) frame->bh;
864 entries = ((struct dx_node *) frame->bh->b_data)->entries;
866 if (dx_get_limit(entries) != dx_node_limit(dir)) {
867 ext4_warning_inode(dir,
868 "dx entry: limit %u != node limit %u",
869 dx_get_limit(entries), dx_node_limit(dir));
874 while (frame >= frame_in) {
879 if (ret_err == ERR_PTR(ERR_BAD_DX_DIR))
880 ext4_warning_inode(dir,
881 "Corrupt directory, running e2fsck is recommended");
885 static void dx_release(struct dx_frame *frames)
887 struct dx_root_info *info;
889 unsigned int indirect_levels;
891 if (frames[0].bh == NULL)
894 info = &((struct dx_root *)frames[0].bh->b_data)->info;
895 /* save local copy, "info" may be freed after brelse() */
896 indirect_levels = info->indirect_levels;
897 for (i = 0; i <= indirect_levels; i++) {
898 if (frames[i].bh == NULL)
900 brelse(frames[i].bh);
906 * This function increments the frame pointer to search the next leaf
907 * block, and reads in the necessary intervening nodes if the search
908 * should be necessary. Whether or not the search is necessary is
909 * controlled by the hash parameter. If the hash value is even, then
910 * the search is only continued if the next block starts with that
911 * hash value. This is used if we are searching for a specific file.
913 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
915 * This function returns 1 if the caller should continue to search,
916 * or 0 if it should not. If there is an error reading one of the
917 * index blocks, it will a negative error code.
919 * If start_hash is non-null, it will be filled in with the starting
920 * hash of the next page.
922 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
923 struct dx_frame *frame,
924 struct dx_frame *frames,
928 struct buffer_head *bh;
934 * Find the next leaf page by incrementing the frame pointer.
935 * If we run out of entries in the interior node, loop around and
936 * increment pointer in the parent node. When we break out of
937 * this loop, num_frames indicates the number of interior
938 * nodes need to be read.
941 if (++(p->at) < p->entries + dx_get_count(p->entries))
950 * If the hash is 1, then continue only if the next page has a
951 * continuation hash of any value. This is used for readdir
952 * handling. Otherwise, check to see if the hash matches the
953 * desired contiuation hash. If it doesn't, return since
954 * there's no point to read in the successive index pages.
956 bhash = dx_get_hash(p->at);
959 if ((hash & 1) == 0) {
960 if ((bhash & ~1) != hash)
964 * If the hash is HASH_NB_ALWAYS, we always go to the next
965 * block so no check is necessary
967 while (num_frames--) {
968 bh = ext4_read_dirblock(dir, dx_get_block(p->at), INDEX);
974 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
981 * This function fills a red-black tree with information from a
982 * directory block. It returns the number directory entries loaded
983 * into the tree. If there is an error it is returned in err.
985 static int htree_dirblock_to_tree(struct file *dir_file,
986 struct inode *dir, ext4_lblk_t block,
987 struct dx_hash_info *hinfo,
988 __u32 start_hash, __u32 start_minor_hash)
990 struct buffer_head *bh;
991 struct ext4_dir_entry_2 *de, *top;
992 int err = 0, count = 0;
993 struct fscrypt_str fname_crypto_str = FSTR_INIT(NULL, 0), tmp_str;
995 dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n",
996 (unsigned long)block));
997 bh = ext4_read_dirblock(dir, block, DIRENT_HTREE);
1001 de = (struct ext4_dir_entry_2 *) bh->b_data;
1002 top = (struct ext4_dir_entry_2 *) ((char *) de +
1003 dir->i_sb->s_blocksize -
1004 EXT4_DIR_REC_LEN(0));
1005 #ifdef CONFIG_FS_ENCRYPTION
1006 /* Check if the directory is encrypted */
1007 if (IS_ENCRYPTED(dir)) {
1008 err = fscrypt_get_encryption_info(dir);
1013 err = fscrypt_fname_alloc_buffer(dir, EXT4_NAME_LEN,
1021 for (; de < top; de = ext4_next_entry(de, dir->i_sb->s_blocksize)) {
1022 if (ext4_check_dir_entry(dir, NULL, de, bh,
1023 bh->b_data, bh->b_size,
1024 (block<<EXT4_BLOCK_SIZE_BITS(dir->i_sb))
1025 + ((char *)de - bh->b_data))) {
1026 /* silently ignore the rest of the block */
1029 ext4fs_dirhash(dir, de->name, de->name_len, hinfo);
1030 if ((hinfo->hash < start_hash) ||
1031 ((hinfo->hash == start_hash) &&
1032 (hinfo->minor_hash < start_minor_hash)))
1036 if (!IS_ENCRYPTED(dir)) {
1037 tmp_str.name = de->name;
1038 tmp_str.len = de->name_len;
1039 err = ext4_htree_store_dirent(dir_file,
1040 hinfo->hash, hinfo->minor_hash, de,
1043 int save_len = fname_crypto_str.len;
1044 struct fscrypt_str de_name = FSTR_INIT(de->name,
1047 /* Directory is encrypted */
1048 err = fscrypt_fname_disk_to_usr(dir, hinfo->hash,
1049 hinfo->minor_hash, &de_name,
1055 err = ext4_htree_store_dirent(dir_file,
1056 hinfo->hash, hinfo->minor_hash, de,
1058 fname_crypto_str.len = save_len;
1068 #ifdef CONFIG_FS_ENCRYPTION
1069 fscrypt_fname_free_buffer(&fname_crypto_str);
1076 * This function fills a red-black tree with information from a
1077 * directory. We start scanning the directory in hash order, starting
1078 * at start_hash and start_minor_hash.
1080 * This function returns the number of entries inserted into the tree,
1081 * or a negative error code.
1083 int ext4_htree_fill_tree(struct file *dir_file, __u32 start_hash,
1084 __u32 start_minor_hash, __u32 *next_hash)
1086 struct dx_hash_info hinfo;
1087 struct ext4_dir_entry_2 *de;
1088 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
1094 struct fscrypt_str tmp_str;
1096 dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n",
1097 start_hash, start_minor_hash));
1098 dir = file_inode(dir_file);
1099 if (!(ext4_test_inode_flag(dir, EXT4_INODE_INDEX))) {
1100 hinfo.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version;
1101 if (hinfo.hash_version <= DX_HASH_TEA)
1102 hinfo.hash_version +=
1103 EXT4_SB(dir->i_sb)->s_hash_unsigned;
1104 hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
1105 if (ext4_has_inline_data(dir)) {
1106 int has_inline_data = 1;
1107 count = ext4_inlinedir_to_tree(dir_file, dir, 0,
1111 if (has_inline_data) {
1116 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
1117 start_hash, start_minor_hash);
1121 hinfo.hash = start_hash;
1122 hinfo.minor_hash = 0;
1123 frame = dx_probe(NULL, dir, &hinfo, frames);
1125 return PTR_ERR(frame);
1127 /* Add '.' and '..' from the htree header */
1128 if (!start_hash && !start_minor_hash) {
1129 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
1130 tmp_str.name = de->name;
1131 tmp_str.len = de->name_len;
1132 err = ext4_htree_store_dirent(dir_file, 0, 0,
1138 if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) {
1139 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
1140 de = ext4_next_entry(de, dir->i_sb->s_blocksize);
1141 tmp_str.name = de->name;
1142 tmp_str.len = de->name_len;
1143 err = ext4_htree_store_dirent(dir_file, 2, 0,
1151 if (fatal_signal_pending(current)) {
1156 block = dx_get_block(frame->at);
1157 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
1158 start_hash, start_minor_hash);
1165 ret = ext4_htree_next_block(dir, HASH_NB_ALWAYS,
1166 frame, frames, &hashval);
1167 *next_hash = hashval;
1173 * Stop if: (a) there are no more entries, or
1174 * (b) we have inserted at least one entry and the
1175 * next hash value is not a continuation
1178 (count && ((hashval & 1) == 0)))
1182 dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, "
1183 "next hash: %x\n", count, *next_hash));
1190 static inline int search_dirblock(struct buffer_head *bh,
1192 struct ext4_filename *fname,
1193 unsigned int offset,
1194 struct ext4_dir_entry_2 **res_dir)
1196 return ext4_search_dir(bh, bh->b_data, dir->i_sb->s_blocksize, dir,
1197 fname, offset, res_dir);
1201 * Directory block splitting, compacting
1205 * Create map of hash values, offsets, and sizes, stored at end of block.
1206 * Returns number of entries mapped.
1208 static int dx_make_map(struct inode *dir, struct ext4_dir_entry_2 *de,
1209 unsigned blocksize, struct dx_hash_info *hinfo,
1210 struct dx_map_entry *map_tail)
1213 char *base = (char *) de;
1214 struct dx_hash_info h = *hinfo;
1216 while ((char *) de < base + blocksize) {
1217 if (de->name_len && de->inode) {
1218 ext4fs_dirhash(dir, de->name, de->name_len, &h);
1220 map_tail->hash = h.hash;
1221 map_tail->offs = ((char *) de - base)>>2;
1222 map_tail->size = le16_to_cpu(de->rec_len);
1226 /* XXX: do we need to check rec_len == 0 case? -Chris */
1227 de = ext4_next_entry(de, blocksize);
1232 /* Sort map by hash value */
1233 static void dx_sort_map (struct dx_map_entry *map, unsigned count)
1235 struct dx_map_entry *p, *q, *top = map + count - 1;
1237 /* Combsort until bubble sort doesn't suck */
1239 count = count*10/13;
1240 if (count - 9 < 2) /* 9, 10 -> 11 */
1242 for (p = top, q = p - count; q >= map; p--, q--)
1243 if (p->hash < q->hash)
1246 /* Garden variety bubble sort */
1251 if (q[1].hash >= q[0].hash)
1259 static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block)
1261 struct dx_entry *entries = frame->entries;
1262 struct dx_entry *old = frame->at, *new = old + 1;
1263 int count = dx_get_count(entries);
1265 assert(count < dx_get_limit(entries));
1266 assert(old < entries + count);
1267 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
1268 dx_set_hash(new, hash);
1269 dx_set_block(new, block);
1270 dx_set_count(entries, count + 1);
1273 #ifdef CONFIG_UNICODE
1275 * Test whether a case-insensitive directory entry matches the filename
1276 * being searched for. If quick is set, assume the name being looked up
1277 * is already in the casefolded form.
1279 * Returns: 0 if the directory entry matches, more than 0 if it
1280 * doesn't match or less than zero on error.
1282 int ext4_ci_compare(const struct inode *parent, const struct qstr *name,
1283 const struct qstr *entry, bool quick)
1285 const struct ext4_sb_info *sbi = EXT4_SB(parent->i_sb);
1286 const struct unicode_map *um = sbi->s_encoding;
1290 ret = utf8_strncasecmp_folded(um, name, entry);
1292 ret = utf8_strncasecmp(um, name, entry);
1295 /* Handle invalid character sequence as either an error
1296 * or as an opaque byte sequence.
1298 if (ext4_has_strict_mode(sbi))
1301 if (name->len != entry->len)
1304 return !!memcmp(name->name, entry->name, name->len);
1310 void ext4_fname_setup_ci_filename(struct inode *dir, const struct qstr *iname,
1311 struct fscrypt_str *cf_name)
1315 if (!IS_CASEFOLDED(dir) || !EXT4_SB(dir->i_sb)->s_encoding) {
1316 cf_name->name = NULL;
1320 cf_name->name = kmalloc(EXT4_NAME_LEN, GFP_NOFS);
1324 len = utf8_casefold(EXT4_SB(dir->i_sb)->s_encoding,
1325 iname, cf_name->name,
1328 kfree(cf_name->name);
1329 cf_name->name = NULL;
1332 cf_name->len = (unsigned) len;
1338 * Test whether a directory entry matches the filename being searched for.
1340 * Return: %true if the directory entry matches, otherwise %false.
1342 static inline bool ext4_match(const struct inode *parent,
1343 const struct ext4_filename *fname,
1344 const struct ext4_dir_entry_2 *de)
1346 struct fscrypt_name f;
1347 #ifdef CONFIG_UNICODE
1348 const struct qstr entry = {.name = de->name, .len = de->name_len};
1354 f.usr_fname = fname->usr_fname;
1355 f.disk_name = fname->disk_name;
1356 #ifdef CONFIG_FS_ENCRYPTION
1357 f.crypto_buf = fname->crypto_buf;
1360 #ifdef CONFIG_UNICODE
1361 if (EXT4_SB(parent->i_sb)->s_encoding && IS_CASEFOLDED(parent)) {
1362 if (fname->cf_name.name) {
1363 struct qstr cf = {.name = fname->cf_name.name,
1364 .len = fname->cf_name.len};
1365 return !ext4_ci_compare(parent, &cf, &entry, true);
1367 return !ext4_ci_compare(parent, fname->usr_fname, &entry,
1372 return fscrypt_match_name(&f, de->name, de->name_len);
1376 * Returns 0 if not found, -1 on failure, and 1 on success
1378 int ext4_search_dir(struct buffer_head *bh, char *search_buf, int buf_size,
1379 struct inode *dir, struct ext4_filename *fname,
1380 unsigned int offset, struct ext4_dir_entry_2 **res_dir)
1382 struct ext4_dir_entry_2 * de;
1386 de = (struct ext4_dir_entry_2 *)search_buf;
1387 dlimit = search_buf + buf_size;
1388 while ((char *) de < dlimit) {
1389 /* this code is executed quadratically often */
1390 /* do minimal checking `by hand' */
1391 if ((char *) de + de->name_len <= dlimit &&
1392 ext4_match(dir, fname, de)) {
1393 /* found a match - just to be sure, do
1395 if (ext4_check_dir_entry(dir, NULL, de, bh, bh->b_data,
1396 bh->b_size, offset))
1401 /* prevent looping on a bad block */
1402 de_len = ext4_rec_len_from_disk(de->rec_len,
1403 dir->i_sb->s_blocksize);
1407 de = (struct ext4_dir_entry_2 *) ((char *) de + de_len);
1412 static int is_dx_internal_node(struct inode *dir, ext4_lblk_t block,
1413 struct ext4_dir_entry *de)
1415 struct super_block *sb = dir->i_sb;
1421 if (de->inode == 0 &&
1422 ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize) ==
1429 * __ext4_find_entry()
1431 * finds an entry in the specified directory with the wanted name. It
1432 * returns the cache buffer in which the entry was found, and the entry
1433 * itself (as a parameter - res_dir). It does NOT read the inode of the
1434 * entry - you'll have to do that yourself if you want to.
1436 * The returned buffer_head has ->b_count elevated. The caller is expected
1437 * to brelse() it when appropriate.
1439 static struct buffer_head *__ext4_find_entry(struct inode *dir,
1440 struct ext4_filename *fname,
1441 struct ext4_dir_entry_2 **res_dir,
1444 struct super_block *sb;
1445 struct buffer_head *bh_use[NAMEI_RA_SIZE];
1446 struct buffer_head *bh, *ret = NULL;
1447 ext4_lblk_t start, block;
1448 const u8 *name = fname->usr_fname->name;
1449 size_t ra_max = 0; /* Number of bh's in the readahead
1451 size_t ra_ptr = 0; /* Current index into readahead
1453 ext4_lblk_t nblocks;
1454 int i, namelen, retval;
1458 namelen = fname->usr_fname->len;
1459 if (namelen > EXT4_NAME_LEN)
1462 if (ext4_has_inline_data(dir)) {
1463 int has_inline_data = 1;
1464 ret = ext4_find_inline_entry(dir, fname, res_dir,
1466 if (has_inline_data) {
1469 goto cleanup_and_exit;
1473 if ((namelen <= 2) && (name[0] == '.') &&
1474 (name[1] == '.' || name[1] == '\0')) {
1476 * "." or ".." will only be in the first block
1477 * NFS may look up ".."; "." should be handled by the VFS
1484 ret = ext4_dx_find_entry(dir, fname, res_dir);
1486 * On success, or if the error was file not found,
1487 * return. Otherwise, fall back to doing a search the
1488 * old fashioned way.
1490 if (!IS_ERR(ret) || PTR_ERR(ret) != ERR_BAD_DX_DIR)
1491 goto cleanup_and_exit;
1492 dxtrace(printk(KERN_DEBUG "ext4_find_entry: dx failed, "
1496 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
1499 goto cleanup_and_exit;
1501 start = EXT4_I(dir)->i_dir_start_lookup;
1502 if (start >= nblocks)
1508 * We deal with the read-ahead logic here.
1510 if (ra_ptr >= ra_max) {
1511 /* Refill the readahead buffer */
1514 ra_max = start - block;
1516 ra_max = nblocks - block;
1517 ra_max = min(ra_max, ARRAY_SIZE(bh_use));
1518 retval = ext4_bread_batch(dir, block, ra_max,
1519 false /* wait */, bh_use);
1521 ret = ERR_PTR(retval);
1523 goto cleanup_and_exit;
1526 if ((bh = bh_use[ra_ptr++]) == NULL)
1529 if (!buffer_uptodate(bh)) {
1530 EXT4_ERROR_INODE(dir, "reading directory lblock %lu",
1531 (unsigned long) block);
1533 ret = ERR_PTR(-EIO);
1534 goto cleanup_and_exit;
1536 if (!buffer_verified(bh) &&
1537 !is_dx_internal_node(dir, block,
1538 (struct ext4_dir_entry *)bh->b_data) &&
1539 !ext4_dirblock_csum_verify(dir, bh)) {
1540 EXT4_ERROR_INODE(dir, "checksumming directory "
1541 "block %lu", (unsigned long)block);
1543 ret = ERR_PTR(-EFSBADCRC);
1544 goto cleanup_and_exit;
1546 set_buffer_verified(bh);
1547 i = search_dirblock(bh, dir, fname,
1548 block << EXT4_BLOCK_SIZE_BITS(sb), res_dir);
1550 EXT4_I(dir)->i_dir_start_lookup = block;
1552 goto cleanup_and_exit;
1556 goto cleanup_and_exit;
1559 if (++block >= nblocks)
1561 } while (block != start);
1564 * If the directory has grown while we were searching, then
1565 * search the last part of the directory before giving up.
1568 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
1569 if (block < nblocks) {
1575 /* Clean up the read-ahead blocks */
1576 for (; ra_ptr < ra_max; ra_ptr++)
1577 brelse(bh_use[ra_ptr]);
1581 static struct buffer_head *ext4_find_entry(struct inode *dir,
1582 const struct qstr *d_name,
1583 struct ext4_dir_entry_2 **res_dir,
1587 struct ext4_filename fname;
1588 struct buffer_head *bh;
1590 err = ext4_fname_setup_filename(dir, d_name, 1, &fname);
1594 return ERR_PTR(err);
1596 bh = __ext4_find_entry(dir, &fname, res_dir, inlined);
1598 ext4_fname_free_filename(&fname);
1602 static struct buffer_head *ext4_lookup_entry(struct inode *dir,
1603 struct dentry *dentry,
1604 struct ext4_dir_entry_2 **res_dir)
1607 struct ext4_filename fname;
1608 struct buffer_head *bh;
1610 err = ext4_fname_prepare_lookup(dir, dentry, &fname);
1614 return ERR_PTR(err);
1616 bh = __ext4_find_entry(dir, &fname, res_dir, NULL);
1618 ext4_fname_free_filename(&fname);
1622 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
1623 struct ext4_filename *fname,
1624 struct ext4_dir_entry_2 **res_dir)
1626 struct super_block * sb = dir->i_sb;
1627 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
1628 struct buffer_head *bh;
1632 #ifdef CONFIG_FS_ENCRYPTION
1635 frame = dx_probe(fname, dir, NULL, frames);
1637 return (struct buffer_head *) frame;
1639 block = dx_get_block(frame->at);
1640 bh = ext4_read_dirblock(dir, block, DIRENT_HTREE);
1644 retval = search_dirblock(bh, dir, fname,
1645 block << EXT4_BLOCK_SIZE_BITS(sb),
1651 bh = ERR_PTR(ERR_BAD_DX_DIR);
1655 /* Check to see if we should continue to search */
1656 retval = ext4_htree_next_block(dir, fname->hinfo.hash, frame,
1659 ext4_warning_inode(dir,
1660 "error %d reading directory index block",
1662 bh = ERR_PTR(retval);
1665 } while (retval == 1);
1669 dxtrace(printk(KERN_DEBUG "%s not found\n", fname->usr_fname->name));
1675 static struct dentry *ext4_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
1677 struct inode *inode;
1678 struct ext4_dir_entry_2 *de;
1679 struct buffer_head *bh;
1681 if (dentry->d_name.len > EXT4_NAME_LEN)
1682 return ERR_PTR(-ENAMETOOLONG);
1684 bh = ext4_lookup_entry(dir, dentry, &de);
1686 return ERR_CAST(bh);
1689 __u32 ino = le32_to_cpu(de->inode);
1691 if (!ext4_valid_inum(dir->i_sb, ino)) {
1692 EXT4_ERROR_INODE(dir, "bad inode number: %u", ino);
1693 return ERR_PTR(-EFSCORRUPTED);
1695 if (unlikely(ino == dir->i_ino)) {
1696 EXT4_ERROR_INODE(dir, "'%pd' linked to parent dir",
1698 return ERR_PTR(-EFSCORRUPTED);
1700 inode = ext4_iget(dir->i_sb, ino, EXT4_IGET_NORMAL);
1701 if (inode == ERR_PTR(-ESTALE)) {
1702 EXT4_ERROR_INODE(dir,
1703 "deleted inode referenced: %u",
1705 return ERR_PTR(-EFSCORRUPTED);
1707 if (!IS_ERR(inode) && IS_ENCRYPTED(dir) &&
1708 (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode)) &&
1709 !fscrypt_has_permitted_context(dir, inode)) {
1710 ext4_warning(inode->i_sb,
1711 "Inconsistent encryption contexts: %lu/%lu",
1712 dir->i_ino, inode->i_ino);
1714 return ERR_PTR(-EPERM);
1718 #ifdef CONFIG_UNICODE
1719 if (!inode && IS_CASEFOLDED(dir)) {
1720 /* Eventually we want to call d_add_ci(dentry, NULL)
1721 * for negative dentries in the encoding case as
1722 * well. For now, prevent the negative dentry
1723 * from being cached.
1728 return d_splice_alias(inode, dentry);
1732 struct dentry *ext4_get_parent(struct dentry *child)
1735 static const struct qstr dotdot = QSTR_INIT("..", 2);
1736 struct ext4_dir_entry_2 * de;
1737 struct buffer_head *bh;
1739 bh = ext4_find_entry(d_inode(child), &dotdot, &de, NULL);
1741 return ERR_CAST(bh);
1743 return ERR_PTR(-ENOENT);
1744 ino = le32_to_cpu(de->inode);
1747 if (!ext4_valid_inum(child->d_sb, ino)) {
1748 EXT4_ERROR_INODE(d_inode(child),
1749 "bad parent inode number: %u", ino);
1750 return ERR_PTR(-EFSCORRUPTED);
1753 return d_obtain_alias(ext4_iget(child->d_sb, ino, EXT4_IGET_NORMAL));
1757 * Move count entries from end of map between two memory locations.
1758 * Returns pointer to last entry moved.
1760 static struct ext4_dir_entry_2 *
1761 dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count,
1764 unsigned rec_len = 0;
1767 struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *)
1768 (from + (map->offs<<2));
1769 rec_len = EXT4_DIR_REC_LEN(de->name_len);
1770 memcpy (to, de, rec_len);
1771 ((struct ext4_dir_entry_2 *) to)->rec_len =
1772 ext4_rec_len_to_disk(rec_len, blocksize);
1777 return (struct ext4_dir_entry_2 *) (to - rec_len);
1781 * Compact each dir entry in the range to the minimal rec_len.
1782 * Returns pointer to last entry in range.
1784 static struct ext4_dir_entry_2* dx_pack_dirents(char *base, unsigned blocksize)
1786 struct ext4_dir_entry_2 *next, *to, *prev, *de = (struct ext4_dir_entry_2 *) base;
1787 unsigned rec_len = 0;
1790 while ((char*)de < base + blocksize) {
1791 next = ext4_next_entry(de, blocksize);
1792 if (de->inode && de->name_len) {
1793 rec_len = EXT4_DIR_REC_LEN(de->name_len);
1795 memmove(to, de, rec_len);
1796 to->rec_len = ext4_rec_len_to_disk(rec_len, blocksize);
1798 to = (struct ext4_dir_entry_2 *) (((char *) to) + rec_len);
1806 * Split a full leaf block to make room for a new dir entry.
1807 * Allocate a new block, and move entries so that they are approx. equally full.
1808 * Returns pointer to de in block into which the new entry will be inserted.
1810 static struct ext4_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1811 struct buffer_head **bh,struct dx_frame *frame,
1812 struct dx_hash_info *hinfo)
1814 unsigned blocksize = dir->i_sb->s_blocksize;
1815 unsigned count, continued;
1816 struct buffer_head *bh2;
1817 ext4_lblk_t newblock;
1819 struct dx_map_entry *map;
1820 char *data1 = (*bh)->b_data, *data2;
1821 unsigned split, move, size;
1822 struct ext4_dir_entry_2 *de = NULL, *de2;
1826 if (ext4_has_metadata_csum(dir->i_sb))
1827 csum_size = sizeof(struct ext4_dir_entry_tail);
1829 bh2 = ext4_append(handle, dir, &newblock);
1833 return (struct ext4_dir_entry_2 *) bh2;
1836 BUFFER_TRACE(*bh, "get_write_access");
1837 err = ext4_journal_get_write_access(handle, *bh);
1841 BUFFER_TRACE(frame->bh, "get_write_access");
1842 err = ext4_journal_get_write_access(handle, frame->bh);
1846 data2 = bh2->b_data;
1848 /* create map in the end of data2 block */
1849 map = (struct dx_map_entry *) (data2 + blocksize);
1850 count = dx_make_map(dir, (struct ext4_dir_entry_2 *) data1,
1851 blocksize, hinfo, map);
1853 dx_sort_map(map, count);
1854 /* Split the existing block in the middle, size-wise */
1857 for (i = count-1; i >= 0; i--) {
1858 /* is more than half of this entry in 2nd half of the block? */
1859 if (size + map[i].size/2 > blocksize/2)
1861 size += map[i].size;
1864 /* map index at which we will split */
1865 split = count - move;
1866 hash2 = map[split].hash;
1867 continued = hash2 == map[split - 1].hash;
1868 dxtrace(printk(KERN_INFO "Split block %lu at %x, %i/%i\n",
1869 (unsigned long)dx_get_block(frame->at),
1870 hash2, split, count-split));
1872 /* Fancy dance to stay within two buffers */
1873 de2 = dx_move_dirents(data1, data2, map + split, count - split,
1875 de = dx_pack_dirents(data1, blocksize);
1876 de->rec_len = ext4_rec_len_to_disk(data1 + (blocksize - csum_size) -
1879 de2->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) -
1883 ext4_initialize_dirent_tail(*bh, blocksize);
1884 ext4_initialize_dirent_tail(bh2, blocksize);
1887 dxtrace(dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *) data1,
1889 dxtrace(dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *) data2,
1892 /* Which block gets the new entry? */
1893 if (hinfo->hash >= hash2) {
1897 dx_insert_block(frame, hash2 + continued, newblock);
1898 err = ext4_handle_dirty_dirblock(handle, dir, bh2);
1901 err = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
1905 dxtrace(dx_show_index("frame", frame->entries));
1912 ext4_std_error(dir->i_sb, err);
1913 return ERR_PTR(err);
1916 int ext4_find_dest_de(struct inode *dir, struct inode *inode,
1917 struct buffer_head *bh,
1918 void *buf, int buf_size,
1919 struct ext4_filename *fname,
1920 struct ext4_dir_entry_2 **dest_de)
1922 struct ext4_dir_entry_2 *de;
1923 unsigned short reclen = EXT4_DIR_REC_LEN(fname_len(fname));
1925 unsigned int offset = 0;
1928 de = (struct ext4_dir_entry_2 *)buf;
1929 top = buf + buf_size - reclen;
1930 while ((char *) de <= top) {
1931 if (ext4_check_dir_entry(dir, NULL, de, bh,
1932 buf, buf_size, offset))
1933 return -EFSCORRUPTED;
1934 if (ext4_match(dir, fname, de))
1936 nlen = EXT4_DIR_REC_LEN(de->name_len);
1937 rlen = ext4_rec_len_from_disk(de->rec_len, buf_size);
1938 if ((de->inode ? rlen - nlen : rlen) >= reclen)
1940 de = (struct ext4_dir_entry_2 *)((char *)de + rlen);
1943 if ((char *) de > top)
1950 void ext4_insert_dentry(struct inode *inode,
1951 struct ext4_dir_entry_2 *de,
1953 struct ext4_filename *fname)
1958 nlen = EXT4_DIR_REC_LEN(de->name_len);
1959 rlen = ext4_rec_len_from_disk(de->rec_len, buf_size);
1961 struct ext4_dir_entry_2 *de1 =
1962 (struct ext4_dir_entry_2 *)((char *)de + nlen);
1963 de1->rec_len = ext4_rec_len_to_disk(rlen - nlen, buf_size);
1964 de->rec_len = ext4_rec_len_to_disk(nlen, buf_size);
1967 de->file_type = EXT4_FT_UNKNOWN;
1968 de->inode = cpu_to_le32(inode->i_ino);
1969 ext4_set_de_type(inode->i_sb, de, inode->i_mode);
1970 de->name_len = fname_len(fname);
1971 memcpy(de->name, fname_name(fname), fname_len(fname));
1975 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1976 * it points to a directory entry which is guaranteed to be large
1977 * enough for new directory entry. If de is NULL, then
1978 * add_dirent_to_buf will attempt search the directory block for
1979 * space. It will return -ENOSPC if no space is available, and -EIO
1980 * and -EEXIST if directory entry already exists.
1982 static int add_dirent_to_buf(handle_t *handle, struct ext4_filename *fname,
1984 struct inode *inode, struct ext4_dir_entry_2 *de,
1985 struct buffer_head *bh)
1987 unsigned int blocksize = dir->i_sb->s_blocksize;
1991 if (ext4_has_metadata_csum(inode->i_sb))
1992 csum_size = sizeof(struct ext4_dir_entry_tail);
1995 err = ext4_find_dest_de(dir, inode, bh, bh->b_data,
1996 blocksize - csum_size, fname, &de);
2000 BUFFER_TRACE(bh, "get_write_access");
2001 err = ext4_journal_get_write_access(handle, bh);
2003 ext4_std_error(dir->i_sb, err);
2007 /* By now the buffer is marked for journaling */
2008 ext4_insert_dentry(inode, de, blocksize, fname);
2011 * XXX shouldn't update any times until successful
2012 * completion of syscall, but too many callers depend
2015 * XXX similarly, too many callers depend on
2016 * ext4_new_inode() setting the times, but error
2017 * recovery deletes the inode, so the worst that can
2018 * happen is that the times are slightly out of date
2019 * and/or different from the directory change time.
2021 dir->i_mtime = dir->i_ctime = current_time(dir);
2022 ext4_update_dx_flag(dir);
2023 inode_inc_iversion(dir);
2024 ext4_mark_inode_dirty(handle, dir);
2025 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
2026 err = ext4_handle_dirty_dirblock(handle, dir, bh);
2028 ext4_std_error(dir->i_sb, err);
2033 * This converts a one block unindexed directory to a 3 block indexed
2034 * directory, and adds the dentry to the indexed directory.
2036 static int make_indexed_dir(handle_t *handle, struct ext4_filename *fname,
2038 struct inode *inode, struct buffer_head *bh)
2040 struct buffer_head *bh2;
2041 struct dx_root *root;
2042 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
2043 struct dx_entry *entries;
2044 struct ext4_dir_entry_2 *de, *de2;
2050 struct fake_dirent *fde;
2053 if (ext4_has_metadata_csum(inode->i_sb))
2054 csum_size = sizeof(struct ext4_dir_entry_tail);
2056 blocksize = dir->i_sb->s_blocksize;
2057 dxtrace(printk(KERN_DEBUG "Creating index: inode %lu\n", dir->i_ino));
2058 BUFFER_TRACE(bh, "get_write_access");
2059 retval = ext4_journal_get_write_access(handle, bh);
2061 ext4_std_error(dir->i_sb, retval);
2065 root = (struct dx_root *) bh->b_data;
2067 /* The 0th block becomes the root, move the dirents out */
2068 fde = &root->dotdot;
2069 de = (struct ext4_dir_entry_2 *)((char *)fde +
2070 ext4_rec_len_from_disk(fde->rec_len, blocksize));
2071 if ((char *) de >= (((char *) root) + blocksize)) {
2072 EXT4_ERROR_INODE(dir, "invalid rec_len for '..'");
2074 return -EFSCORRUPTED;
2076 len = ((char *) root) + (blocksize - csum_size) - (char *) de;
2078 /* Allocate new block for the 0th block's dirents */
2079 bh2 = ext4_append(handle, dir, &block);
2082 return PTR_ERR(bh2);
2084 ext4_set_inode_flag(dir, EXT4_INODE_INDEX);
2085 data2 = bh2->b_data;
2087 memcpy(data2, de, len);
2088 de = (struct ext4_dir_entry_2 *) data2;
2090 while ((char *)(de2 = ext4_next_entry(de, blocksize)) < top)
2092 de->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) -
2093 (char *) de, blocksize);
2096 ext4_initialize_dirent_tail(bh2, blocksize);
2098 /* Initialize the root; the dot dirents already exist */
2099 de = (struct ext4_dir_entry_2 *) (&root->dotdot);
2100 de->rec_len = ext4_rec_len_to_disk(blocksize - EXT4_DIR_REC_LEN(2),
2102 memset (&root->info, 0, sizeof(root->info));
2103 root->info.info_length = sizeof(root->info);
2104 root->info.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version;
2105 entries = root->entries;
2106 dx_set_block(entries, 1);
2107 dx_set_count(entries, 1);
2108 dx_set_limit(entries, dx_root_limit(dir, sizeof(root->info)));
2110 /* Initialize as for dx_probe */
2111 fname->hinfo.hash_version = root->info.hash_version;
2112 if (fname->hinfo.hash_version <= DX_HASH_TEA)
2113 fname->hinfo.hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
2114 fname->hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
2115 ext4fs_dirhash(dir, fname_name(fname), fname_len(fname), &fname->hinfo);
2117 memset(frames, 0, sizeof(frames));
2119 frame->entries = entries;
2120 frame->at = entries;
2123 retval = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2126 retval = ext4_handle_dirty_dirblock(handle, dir, bh2);
2130 de = do_split(handle,dir, &bh2, frame, &fname->hinfo);
2132 retval = PTR_ERR(de);
2136 retval = add_dirent_to_buf(handle, fname, dir, inode, de, bh2);
2139 * Even if the block split failed, we have to properly write
2140 * out all the changes we did so far. Otherwise we can end up
2141 * with corrupted filesystem.
2144 ext4_mark_inode_dirty(handle, dir);
2153 * adds a file entry to the specified directory, using the same
2154 * semantics as ext4_find_entry(). It returns NULL if it failed.
2156 * NOTE!! The inode part of 'de' is left at 0 - which means you
2157 * may not sleep between calling this and putting something into
2158 * the entry, as someone else might have used it while you slept.
2160 static int ext4_add_entry(handle_t *handle, struct dentry *dentry,
2161 struct inode *inode)
2163 struct inode *dir = d_inode(dentry->d_parent);
2164 struct buffer_head *bh = NULL;
2165 struct ext4_dir_entry_2 *de;
2166 struct super_block *sb;
2167 #ifdef CONFIG_UNICODE
2168 struct ext4_sb_info *sbi;
2170 struct ext4_filename fname;
2174 ext4_lblk_t block, blocks;
2177 if (ext4_has_metadata_csum(inode->i_sb))
2178 csum_size = sizeof(struct ext4_dir_entry_tail);
2181 blocksize = sb->s_blocksize;
2182 if (!dentry->d_name.len)
2185 #ifdef CONFIG_UNICODE
2187 if (ext4_has_strict_mode(sbi) && IS_CASEFOLDED(dir) &&
2188 sbi->s_encoding && utf8_validate(sbi->s_encoding, &dentry->d_name))
2192 retval = ext4_fname_setup_filename(dir, &dentry->d_name, 0, &fname);
2196 if (ext4_has_inline_data(dir)) {
2197 retval = ext4_try_add_inline_entry(handle, &fname, dir, inode);
2207 retval = ext4_dx_add_entry(handle, &fname, dir, inode);
2208 if (!retval || (retval != ERR_BAD_DX_DIR))
2210 ext4_clear_inode_flag(dir, EXT4_INODE_INDEX);
2212 ext4_mark_inode_dirty(handle, dir);
2214 blocks = dir->i_size >> sb->s_blocksize_bits;
2215 for (block = 0; block < blocks; block++) {
2216 bh = ext4_read_dirblock(dir, block, DIRENT);
2218 bh = ext4_bread(handle, dir, block,
2219 EXT4_GET_BLOCKS_CREATE);
2220 goto add_to_new_block;
2223 retval = PTR_ERR(bh);
2227 retval = add_dirent_to_buf(handle, &fname, dir, inode,
2229 if (retval != -ENOSPC)
2232 if (blocks == 1 && !dx_fallback &&
2233 ext4_has_feature_dir_index(sb)) {
2234 retval = make_indexed_dir(handle, &fname, dir,
2236 bh = NULL; /* make_indexed_dir releases bh */
2241 bh = ext4_append(handle, dir, &block);
2244 retval = PTR_ERR(bh);
2248 de = (struct ext4_dir_entry_2 *) bh->b_data;
2250 de->rec_len = ext4_rec_len_to_disk(blocksize - csum_size, blocksize);
2253 ext4_initialize_dirent_tail(bh, blocksize);
2255 retval = add_dirent_to_buf(handle, &fname, dir, inode, de, bh);
2257 ext4_fname_free_filename(&fname);
2260 ext4_set_inode_state(inode, EXT4_STATE_NEWENTRY);
2265 * Returns 0 for success, or a negative error value
2267 static int ext4_dx_add_entry(handle_t *handle, struct ext4_filename *fname,
2268 struct inode *dir, struct inode *inode)
2270 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
2271 struct dx_entry *entries, *at;
2272 struct buffer_head *bh;
2273 struct super_block *sb = dir->i_sb;
2274 struct ext4_dir_entry_2 *de;
2280 frame = dx_probe(fname, dir, NULL, frames);
2282 return PTR_ERR(frame);
2283 entries = frame->entries;
2285 bh = ext4_read_dirblock(dir, dx_get_block(frame->at), DIRENT_HTREE);
2292 BUFFER_TRACE(bh, "get_write_access");
2293 err = ext4_journal_get_write_access(handle, bh);
2297 err = add_dirent_to_buf(handle, fname, dir, inode, NULL, bh);
2302 /* Block full, should compress but for now just split */
2303 dxtrace(printk(KERN_DEBUG "using %u of %u node entries\n",
2304 dx_get_count(entries), dx_get_limit(entries)));
2305 /* Need to split index? */
2306 if (dx_get_count(entries) == dx_get_limit(entries)) {
2307 ext4_lblk_t newblock;
2308 int levels = frame - frames + 1;
2309 unsigned int icount;
2311 struct dx_entry *entries2;
2312 struct dx_node *node2;
2313 struct buffer_head *bh2;
2315 while (frame > frames) {
2316 if (dx_get_count((frame - 1)->entries) <
2317 dx_get_limit((frame - 1)->entries)) {
2321 frame--; /* split higher index block */
2323 entries = frame->entries;
2326 if (add_level && levels == ext4_dir_htree_level(sb)) {
2327 ext4_warning(sb, "Directory (ino: %lu) index full, "
2328 "reach max htree level :%d",
2329 dir->i_ino, levels);
2330 if (ext4_dir_htree_level(sb) < EXT4_HTREE_LEVEL) {
2331 ext4_warning(sb, "Large directory feature is "
2332 "not enabled on this "
2338 icount = dx_get_count(entries);
2339 bh2 = ext4_append(handle, dir, &newblock);
2344 node2 = (struct dx_node *)(bh2->b_data);
2345 entries2 = node2->entries;
2346 memset(&node2->fake, 0, sizeof(struct fake_dirent));
2347 node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize,
2349 BUFFER_TRACE(frame->bh, "get_write_access");
2350 err = ext4_journal_get_write_access(handle, frame->bh);
2354 unsigned icount1 = icount/2, icount2 = icount - icount1;
2355 unsigned hash2 = dx_get_hash(entries + icount1);
2356 dxtrace(printk(KERN_DEBUG "Split index %i/%i\n",
2359 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
2360 err = ext4_journal_get_write_access(handle,
2365 memcpy((char *) entries2, (char *) (entries + icount1),
2366 icount2 * sizeof(struct dx_entry));
2367 dx_set_count(entries, icount1);
2368 dx_set_count(entries2, icount2);
2369 dx_set_limit(entries2, dx_node_limit(dir));
2371 /* Which index block gets the new entry? */
2372 if (at - entries >= icount1) {
2373 frame->at = at = at - entries - icount1 + entries2;
2374 frame->entries = entries = entries2;
2375 swap(frame->bh, bh2);
2377 dx_insert_block((frame - 1), hash2, newblock);
2378 dxtrace(dx_show_index("node", frame->entries));
2379 dxtrace(dx_show_index("node",
2380 ((struct dx_node *) bh2->b_data)->entries));
2381 err = ext4_handle_dirty_dx_node(handle, dir, bh2);
2385 err = ext4_handle_dirty_dx_node(handle, dir,
2390 err = ext4_handle_dirty_dx_node(handle, dir,
2395 struct dx_root *dxroot;
2396 memcpy((char *) entries2, (char *) entries,
2397 icount * sizeof(struct dx_entry));
2398 dx_set_limit(entries2, dx_node_limit(dir));
2401 dx_set_count(entries, 1);
2402 dx_set_block(entries + 0, newblock);
2403 dxroot = (struct dx_root *)frames[0].bh->b_data;
2404 dxroot->info.indirect_levels += 1;
2405 dxtrace(printk(KERN_DEBUG
2406 "Creating %d level index...\n",
2407 dxroot->info.indirect_levels));
2408 err = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2411 err = ext4_handle_dirty_dx_node(handle, dir, bh2);
2417 de = do_split(handle, dir, &bh, frame, &fname->hinfo);
2422 err = add_dirent_to_buf(handle, fname, dir, inode, de, bh);
2426 ext4_std_error(dir->i_sb, err); /* this is a no-op if err == 0 */
2430 /* @restart is true means htree-path has been changed, we need to
2431 * repeat dx_probe() to find out valid htree-path
2433 if (restart && err == 0)
2439 * ext4_generic_delete_entry deletes a directory entry by merging it
2440 * with the previous entry
2442 int ext4_generic_delete_entry(handle_t *handle,
2444 struct ext4_dir_entry_2 *de_del,
2445 struct buffer_head *bh,
2450 struct ext4_dir_entry_2 *de, *pde;
2451 unsigned int blocksize = dir->i_sb->s_blocksize;
2456 de = (struct ext4_dir_entry_2 *)entry_buf;
2457 while (i < buf_size - csum_size) {
2458 if (ext4_check_dir_entry(dir, NULL, de, bh,
2459 bh->b_data, bh->b_size, i))
2460 return -EFSCORRUPTED;
2463 pde->rec_len = ext4_rec_len_to_disk(
2464 ext4_rec_len_from_disk(pde->rec_len,
2466 ext4_rec_len_from_disk(de->rec_len,
2471 inode_inc_iversion(dir);
2474 i += ext4_rec_len_from_disk(de->rec_len, blocksize);
2476 de = ext4_next_entry(de, blocksize);
2481 static int ext4_delete_entry(handle_t *handle,
2483 struct ext4_dir_entry_2 *de_del,
2484 struct buffer_head *bh)
2486 int err, csum_size = 0;
2488 if (ext4_has_inline_data(dir)) {
2489 int has_inline_data = 1;
2490 err = ext4_delete_inline_entry(handle, dir, de_del, bh,
2492 if (has_inline_data)
2496 if (ext4_has_metadata_csum(dir->i_sb))
2497 csum_size = sizeof(struct ext4_dir_entry_tail);
2499 BUFFER_TRACE(bh, "get_write_access");
2500 err = ext4_journal_get_write_access(handle, bh);
2504 err = ext4_generic_delete_entry(handle, dir, de_del,
2506 dir->i_sb->s_blocksize, csum_size);
2510 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
2511 err = ext4_handle_dirty_dirblock(handle, dir, bh);
2518 ext4_std_error(dir->i_sb, err);
2523 * Set directory link count to 1 if nlinks > EXT4_LINK_MAX, or if nlinks == 2
2524 * since this indicates that nlinks count was previously 1 to avoid overflowing
2525 * the 16-bit i_links_count field on disk. Directories with i_nlink == 1 mean
2526 * that subdirectory link counts are not being maintained accurately.
2528 * The caller has already checked for i_nlink overflow in case the DIR_LINK
2529 * feature is not enabled and returned -EMLINK. The is_dx() check is a proxy
2530 * for checking S_ISDIR(inode) (since the INODE_INDEX feature will not be set
2531 * on regular files) and to avoid creating huge/slow non-HTREE directories.
2533 static void ext4_inc_count(handle_t *handle, struct inode *inode)
2537 (inode->i_nlink > EXT4_LINK_MAX || inode->i_nlink == 2))
2538 set_nlink(inode, 1);
2542 * If a directory had nlink == 1, then we should let it be 1. This indicates
2543 * directory has >EXT4_LINK_MAX subdirs.
2545 static void ext4_dec_count(handle_t *handle, struct inode *inode)
2547 if (!S_ISDIR(inode->i_mode) || inode->i_nlink > 2)
2553 * Add non-directory inode to a directory. On success, the inode reference is
2554 * consumed by dentry is instantiation. This is also indicated by clearing of
2555 * *inodep pointer. On failure, the caller is responsible for dropping the
2556 * inode reference in the safe context.
2558 static int ext4_add_nondir(handle_t *handle,
2559 struct dentry *dentry, struct inode **inodep)
2561 struct inode *dir = d_inode(dentry->d_parent);
2562 struct inode *inode = *inodep;
2563 int err = ext4_add_entry(handle, dentry, inode);
2565 ext4_mark_inode_dirty(handle, inode);
2566 if (IS_DIRSYNC(dir))
2567 ext4_handle_sync(handle);
2568 d_instantiate_new(dentry, inode);
2573 ext4_orphan_add(handle, inode);
2574 unlock_new_inode(inode);
2579 * By the time this is called, we already have created
2580 * the directory cache entry for the new file, but it
2581 * is so far negative - it has no inode.
2583 * If the create succeeds, we fill in the inode information
2584 * with d_instantiate().
2586 static int ext4_create(struct inode *dir, struct dentry *dentry, umode_t mode,
2590 struct inode *inode;
2591 int err, credits, retries = 0;
2593 err = dquot_initialize(dir);
2597 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2598 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2600 inode = ext4_new_inode_start_handle(dir, mode, &dentry->d_name, 0,
2601 NULL, EXT4_HT_DIR, credits);
2602 handle = ext4_journal_current_handle();
2603 err = PTR_ERR(inode);
2604 if (!IS_ERR(inode)) {
2605 inode->i_op = &ext4_file_inode_operations;
2606 inode->i_fop = &ext4_file_operations;
2607 ext4_set_aops(inode);
2608 err = ext4_add_nondir(handle, dentry, &inode);
2611 ext4_journal_stop(handle);
2612 if (!IS_ERR_OR_NULL(inode))
2614 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2619 static int ext4_mknod(struct inode *dir, struct dentry *dentry,
2620 umode_t mode, dev_t rdev)
2623 struct inode *inode;
2624 int err, credits, retries = 0;
2626 err = dquot_initialize(dir);
2630 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2631 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2633 inode = ext4_new_inode_start_handle(dir, mode, &dentry->d_name, 0,
2634 NULL, EXT4_HT_DIR, credits);
2635 handle = ext4_journal_current_handle();
2636 err = PTR_ERR(inode);
2637 if (!IS_ERR(inode)) {
2638 init_special_inode(inode, inode->i_mode, rdev);
2639 inode->i_op = &ext4_special_inode_operations;
2640 err = ext4_add_nondir(handle, dentry, &inode);
2643 ext4_journal_stop(handle);
2644 if (!IS_ERR_OR_NULL(inode))
2646 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2651 static int ext4_tmpfile(struct inode *dir, struct dentry *dentry, umode_t mode)
2654 struct inode *inode;
2655 int err, retries = 0;
2657 err = dquot_initialize(dir);
2662 inode = ext4_new_inode_start_handle(dir, mode,
2665 EXT4_MAXQUOTAS_INIT_BLOCKS(dir->i_sb) +
2666 4 + EXT4_XATTR_TRANS_BLOCKS);
2667 handle = ext4_journal_current_handle();
2668 err = PTR_ERR(inode);
2669 if (!IS_ERR(inode)) {
2670 inode->i_op = &ext4_file_inode_operations;
2671 inode->i_fop = &ext4_file_operations;
2672 ext4_set_aops(inode);
2673 d_tmpfile(dentry, inode);
2674 err = ext4_orphan_add(handle, inode);
2676 goto err_unlock_inode;
2677 mark_inode_dirty(inode);
2678 unlock_new_inode(inode);
2681 ext4_journal_stop(handle);
2682 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2686 ext4_journal_stop(handle);
2687 unlock_new_inode(inode);
2691 struct ext4_dir_entry_2 *ext4_init_dot_dotdot(struct inode *inode,
2692 struct ext4_dir_entry_2 *de,
2693 int blocksize, int csum_size,
2694 unsigned int parent_ino, int dotdot_real_len)
2696 de->inode = cpu_to_le32(inode->i_ino);
2698 de->rec_len = ext4_rec_len_to_disk(EXT4_DIR_REC_LEN(de->name_len),
2700 strcpy(de->name, ".");
2701 ext4_set_de_type(inode->i_sb, de, S_IFDIR);
2703 de = ext4_next_entry(de, blocksize);
2704 de->inode = cpu_to_le32(parent_ino);
2706 if (!dotdot_real_len)
2707 de->rec_len = ext4_rec_len_to_disk(blocksize -
2708 (csum_size + EXT4_DIR_REC_LEN(1)),
2711 de->rec_len = ext4_rec_len_to_disk(
2712 EXT4_DIR_REC_LEN(de->name_len), blocksize);
2713 strcpy(de->name, "..");
2714 ext4_set_de_type(inode->i_sb, de, S_IFDIR);
2716 return ext4_next_entry(de, blocksize);
2719 static int ext4_init_new_dir(handle_t *handle, struct inode *dir,
2720 struct inode *inode)
2722 struct buffer_head *dir_block = NULL;
2723 struct ext4_dir_entry_2 *de;
2724 ext4_lblk_t block = 0;
2725 unsigned int blocksize = dir->i_sb->s_blocksize;
2729 if (ext4_has_metadata_csum(dir->i_sb))
2730 csum_size = sizeof(struct ext4_dir_entry_tail);
2732 if (ext4_test_inode_state(inode, EXT4_STATE_MAY_INLINE_DATA)) {
2733 err = ext4_try_create_inline_dir(handle, dir, inode);
2734 if (err < 0 && err != -ENOSPC)
2741 dir_block = ext4_append(handle, inode, &block);
2742 if (IS_ERR(dir_block))
2743 return PTR_ERR(dir_block);
2744 de = (struct ext4_dir_entry_2 *)dir_block->b_data;
2745 ext4_init_dot_dotdot(inode, de, blocksize, csum_size, dir->i_ino, 0);
2746 set_nlink(inode, 2);
2748 ext4_initialize_dirent_tail(dir_block, blocksize);
2750 BUFFER_TRACE(dir_block, "call ext4_handle_dirty_metadata");
2751 err = ext4_handle_dirty_dirblock(handle, inode, dir_block);
2754 set_buffer_verified(dir_block);
2760 static int ext4_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
2763 struct inode *inode;
2764 int err, credits, retries = 0;
2766 if (EXT4_DIR_LINK_MAX(dir))
2769 err = dquot_initialize(dir);
2773 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2774 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2776 inode = ext4_new_inode_start_handle(dir, S_IFDIR | mode,
2778 0, NULL, EXT4_HT_DIR, credits);
2779 handle = ext4_journal_current_handle();
2780 err = PTR_ERR(inode);
2784 inode->i_op = &ext4_dir_inode_operations;
2785 inode->i_fop = &ext4_dir_operations;
2786 err = ext4_init_new_dir(handle, dir, inode);
2788 goto out_clear_inode;
2789 err = ext4_mark_inode_dirty(handle, inode);
2791 err = ext4_add_entry(handle, dentry, inode);
2795 ext4_orphan_add(handle, inode);
2796 unlock_new_inode(inode);
2797 ext4_mark_inode_dirty(handle, inode);
2798 ext4_journal_stop(handle);
2802 ext4_inc_count(handle, dir);
2803 ext4_update_dx_flag(dir);
2804 err = ext4_mark_inode_dirty(handle, dir);
2806 goto out_clear_inode;
2807 d_instantiate_new(dentry, inode);
2808 if (IS_DIRSYNC(dir))
2809 ext4_handle_sync(handle);
2813 ext4_journal_stop(handle);
2815 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2821 * routine to check that the specified directory is empty (for rmdir)
2823 bool ext4_empty_dir(struct inode *inode)
2825 unsigned int offset;
2826 struct buffer_head *bh;
2827 struct ext4_dir_entry_2 *de;
2828 struct super_block *sb;
2830 if (ext4_has_inline_data(inode)) {
2831 int has_inline_data = 1;
2834 ret = empty_inline_dir(inode, &has_inline_data);
2835 if (has_inline_data)
2840 if (inode->i_size < EXT4_DIR_REC_LEN(1) + EXT4_DIR_REC_LEN(2)) {
2841 EXT4_ERROR_INODE(inode, "invalid size");
2844 /* The first directory block must not be a hole,
2845 * so treat it as DIRENT_HTREE
2847 bh = ext4_read_dirblock(inode, 0, DIRENT_HTREE);
2851 de = (struct ext4_dir_entry_2 *) bh->b_data;
2852 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data, bh->b_size,
2854 le32_to_cpu(de->inode) != inode->i_ino || strcmp(".", de->name)) {
2855 ext4_warning_inode(inode, "directory missing '.'");
2859 offset = ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
2860 de = ext4_next_entry(de, sb->s_blocksize);
2861 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data, bh->b_size,
2863 le32_to_cpu(de->inode) == 0 || strcmp("..", de->name)) {
2864 ext4_warning_inode(inode, "directory missing '..'");
2868 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
2869 while (offset < inode->i_size) {
2870 if (!(offset & (sb->s_blocksize - 1))) {
2871 unsigned int lblock;
2873 lblock = offset >> EXT4_BLOCK_SIZE_BITS(sb);
2874 bh = ext4_read_dirblock(inode, lblock, EITHER);
2876 offset += sb->s_blocksize;
2882 de = (struct ext4_dir_entry_2 *) (bh->b_data +
2883 (offset & (sb->s_blocksize - 1)));
2884 if (ext4_check_dir_entry(inode, NULL, de, bh,
2885 bh->b_data, bh->b_size, offset)) {
2886 offset = (offset | (sb->s_blocksize - 1)) + 1;
2889 if (le32_to_cpu(de->inode)) {
2893 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
2900 * ext4_orphan_add() links an unlinked or truncated inode into a list of
2901 * such inodes, starting at the superblock, in case we crash before the
2902 * file is closed/deleted, or in case the inode truncate spans multiple
2903 * transactions and the last transaction is not recovered after a crash.
2905 * At filesystem recovery time, we walk this list deleting unlinked
2906 * inodes and truncating linked inodes in ext4_orphan_cleanup().
2908 * Orphan list manipulation functions must be called under i_mutex unless
2909 * we are just creating the inode or deleting it.
2911 int ext4_orphan_add(handle_t *handle, struct inode *inode)
2913 struct super_block *sb = inode->i_sb;
2914 struct ext4_sb_info *sbi = EXT4_SB(sb);
2915 struct ext4_iloc iloc;
2919 if (!sbi->s_journal || is_bad_inode(inode))
2922 WARN_ON_ONCE(!(inode->i_state & (I_NEW | I_FREEING)) &&
2923 !inode_is_locked(inode));
2925 * Exit early if inode already is on orphan list. This is a big speedup
2926 * since we don't have to contend on the global s_orphan_lock.
2928 if (!list_empty(&EXT4_I(inode)->i_orphan))
2932 * Orphan handling is only valid for files with data blocks
2933 * being truncated, or files being unlinked. Note that we either
2934 * hold i_mutex, or the inode can not be referenced from outside,
2935 * so i_nlink should not be bumped due to race
2937 J_ASSERT((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
2938 S_ISLNK(inode->i_mode)) || inode->i_nlink == 0);
2940 BUFFER_TRACE(sbi->s_sbh, "get_write_access");
2941 err = ext4_journal_get_write_access(handle, sbi->s_sbh);
2945 err = ext4_reserve_inode_write(handle, inode, &iloc);
2949 mutex_lock(&sbi->s_orphan_lock);
2951 * Due to previous errors inode may be already a part of on-disk
2952 * orphan list. If so skip on-disk list modification.
2954 if (!NEXT_ORPHAN(inode) || NEXT_ORPHAN(inode) >
2955 (le32_to_cpu(sbi->s_es->s_inodes_count))) {
2956 /* Insert this inode at the head of the on-disk orphan list */
2957 NEXT_ORPHAN(inode) = le32_to_cpu(sbi->s_es->s_last_orphan);
2958 sbi->s_es->s_last_orphan = cpu_to_le32(inode->i_ino);
2961 list_add(&EXT4_I(inode)->i_orphan, &sbi->s_orphan);
2962 mutex_unlock(&sbi->s_orphan_lock);
2965 err = ext4_handle_dirty_super(handle, sb);
2966 rc = ext4_mark_iloc_dirty(handle, inode, &iloc);
2971 * We have to remove inode from in-memory list if
2972 * addition to on disk orphan list failed. Stray orphan
2973 * list entries can cause panics at unmount time.
2975 mutex_lock(&sbi->s_orphan_lock);
2976 list_del_init(&EXT4_I(inode)->i_orphan);
2977 mutex_unlock(&sbi->s_orphan_lock);
2982 jbd_debug(4, "superblock will point to %lu\n", inode->i_ino);
2983 jbd_debug(4, "orphan inode %lu will point to %d\n",
2984 inode->i_ino, NEXT_ORPHAN(inode));
2986 ext4_std_error(sb, err);
2991 * ext4_orphan_del() removes an unlinked or truncated inode from the list
2992 * of such inodes stored on disk, because it is finally being cleaned up.
2994 int ext4_orphan_del(handle_t *handle, struct inode *inode)
2996 struct list_head *prev;
2997 struct ext4_inode_info *ei = EXT4_I(inode);
2998 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
3000 struct ext4_iloc iloc;
3003 if (!sbi->s_journal && !(sbi->s_mount_state & EXT4_ORPHAN_FS))
3006 WARN_ON_ONCE(!(inode->i_state & (I_NEW | I_FREEING)) &&
3007 !inode_is_locked(inode));
3008 /* Do this quick check before taking global s_orphan_lock. */
3009 if (list_empty(&ei->i_orphan))
3013 /* Grab inode buffer early before taking global s_orphan_lock */
3014 err = ext4_reserve_inode_write(handle, inode, &iloc);
3017 mutex_lock(&sbi->s_orphan_lock);
3018 jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino);
3020 prev = ei->i_orphan.prev;
3021 list_del_init(&ei->i_orphan);
3023 /* If we're on an error path, we may not have a valid
3024 * transaction handle with which to update the orphan list on
3025 * disk, but we still need to remove the inode from the linked
3026 * list in memory. */
3027 if (!handle || err) {
3028 mutex_unlock(&sbi->s_orphan_lock);
3032 ino_next = NEXT_ORPHAN(inode);
3033 if (prev == &sbi->s_orphan) {
3034 jbd_debug(4, "superblock will point to %u\n", ino_next);
3035 BUFFER_TRACE(sbi->s_sbh, "get_write_access");
3036 err = ext4_journal_get_write_access(handle, sbi->s_sbh);
3038 mutex_unlock(&sbi->s_orphan_lock);
3041 sbi->s_es->s_last_orphan = cpu_to_le32(ino_next);
3042 mutex_unlock(&sbi->s_orphan_lock);
3043 err = ext4_handle_dirty_super(handle, inode->i_sb);
3045 struct ext4_iloc iloc2;
3046 struct inode *i_prev =
3047 &list_entry(prev, struct ext4_inode_info, i_orphan)->vfs_inode;
3049 jbd_debug(4, "orphan inode %lu will point to %u\n",
3050 i_prev->i_ino, ino_next);
3051 err = ext4_reserve_inode_write(handle, i_prev, &iloc2);
3053 mutex_unlock(&sbi->s_orphan_lock);
3056 NEXT_ORPHAN(i_prev) = ino_next;
3057 err = ext4_mark_iloc_dirty(handle, i_prev, &iloc2);
3058 mutex_unlock(&sbi->s_orphan_lock);
3062 NEXT_ORPHAN(inode) = 0;
3063 err = ext4_mark_iloc_dirty(handle, inode, &iloc);
3065 ext4_std_error(inode->i_sb, err);
3073 static int ext4_rmdir(struct inode *dir, struct dentry *dentry)
3076 struct inode *inode;
3077 struct buffer_head *bh;
3078 struct ext4_dir_entry_2 *de;
3079 handle_t *handle = NULL;
3081 if (unlikely(ext4_forced_shutdown(EXT4_SB(dir->i_sb))))
3084 /* Initialize quotas before so that eventual writes go in
3085 * separate transaction */
3086 retval = dquot_initialize(dir);
3089 retval = dquot_initialize(d_inode(dentry));
3094 bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL);
3100 inode = d_inode(dentry);
3102 retval = -EFSCORRUPTED;
3103 if (le32_to_cpu(de->inode) != inode->i_ino)
3106 retval = -ENOTEMPTY;
3107 if (!ext4_empty_dir(inode))
3110 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3111 EXT4_DATA_TRANS_BLOCKS(dir->i_sb));
3112 if (IS_ERR(handle)) {
3113 retval = PTR_ERR(handle);
3118 if (IS_DIRSYNC(dir))
3119 ext4_handle_sync(handle);
3121 retval = ext4_delete_entry(handle, dir, de, bh);
3124 if (!EXT4_DIR_LINK_EMPTY(inode))
3125 ext4_warning_inode(inode,
3126 "empty directory '%.*s' has too many links (%u)",
3127 dentry->d_name.len, dentry->d_name.name,
3129 inode_inc_iversion(inode);
3131 /* There's no need to set i_disksize: the fact that i_nlink is
3132 * zero will ensure that the right thing happens during any
3135 ext4_orphan_add(handle, inode);
3136 inode->i_ctime = dir->i_ctime = dir->i_mtime = current_time(inode);
3137 ext4_mark_inode_dirty(handle, inode);
3138 ext4_dec_count(handle, dir);
3139 ext4_update_dx_flag(dir);
3140 ext4_mark_inode_dirty(handle, dir);
3142 #ifdef CONFIG_UNICODE
3143 /* VFS negative dentries are incompatible with Encoding and
3144 * Case-insensitiveness. Eventually we'll want avoid
3145 * invalidating the dentries here, alongside with returning the
3146 * negative dentries at ext4_lookup(), when it is better
3147 * supported by the VFS for the CI case.
3149 if (IS_CASEFOLDED(dir))
3150 d_invalidate(dentry);
3156 ext4_journal_stop(handle);
3160 static int ext4_unlink(struct inode *dir, struct dentry *dentry)
3163 struct inode *inode;
3164 struct buffer_head *bh;
3165 struct ext4_dir_entry_2 *de;
3166 handle_t *handle = NULL;
3168 if (unlikely(ext4_forced_shutdown(EXT4_SB(dir->i_sb))))
3171 trace_ext4_unlink_enter(dir, dentry);
3172 /* Initialize quotas before so that eventual writes go
3173 * in separate transaction */
3174 retval = dquot_initialize(dir);
3177 retval = dquot_initialize(d_inode(dentry));
3182 bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL);
3188 inode = d_inode(dentry);
3190 retval = -EFSCORRUPTED;
3191 if (le32_to_cpu(de->inode) != inode->i_ino)
3194 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3195 EXT4_DATA_TRANS_BLOCKS(dir->i_sb));
3196 if (IS_ERR(handle)) {
3197 retval = PTR_ERR(handle);
3202 if (IS_DIRSYNC(dir))
3203 ext4_handle_sync(handle);
3205 retval = ext4_delete_entry(handle, dir, de, bh);
3208 dir->i_ctime = dir->i_mtime = current_time(dir);
3209 ext4_update_dx_flag(dir);
3210 ext4_mark_inode_dirty(handle, dir);
3211 if (inode->i_nlink == 0)
3212 ext4_warning_inode(inode, "Deleting file '%.*s' with no links",
3213 dentry->d_name.len, dentry->d_name.name);
3216 if (!inode->i_nlink)
3217 ext4_orphan_add(handle, inode);
3218 inode->i_ctime = current_time(inode);
3219 ext4_mark_inode_dirty(handle, inode);
3221 #ifdef CONFIG_UNICODE
3222 /* VFS negative dentries are incompatible with Encoding and
3223 * Case-insensitiveness. Eventually we'll want avoid
3224 * invalidating the dentries here, alongside with returning the
3225 * negative dentries at ext4_lookup(), when it is better
3226 * supported by the VFS for the CI case.
3228 if (IS_CASEFOLDED(dir))
3229 d_invalidate(dentry);
3235 ext4_journal_stop(handle);
3236 trace_ext4_unlink_exit(dentry, retval);
3240 static int ext4_symlink(struct inode *dir,
3241 struct dentry *dentry, const char *symname)
3244 struct inode *inode;
3245 int err, len = strlen(symname);
3247 struct fscrypt_str disk_link;
3249 if (unlikely(ext4_forced_shutdown(EXT4_SB(dir->i_sb))))
3252 err = fscrypt_prepare_symlink(dir, symname, len, dir->i_sb->s_blocksize,
3257 err = dquot_initialize(dir);
3261 if ((disk_link.len > EXT4_N_BLOCKS * 4)) {
3263 * For non-fast symlinks, we just allocate inode and put it on
3264 * orphan list in the first transaction => we need bitmap,
3265 * group descriptor, sb, inode block, quota blocks, and
3266 * possibly selinux xattr blocks.
3268 credits = 4 + EXT4_MAXQUOTAS_INIT_BLOCKS(dir->i_sb) +
3269 EXT4_XATTR_TRANS_BLOCKS;
3272 * Fast symlink. We have to add entry to directory
3273 * (EXT4_DATA_TRANS_BLOCKS + EXT4_INDEX_EXTRA_TRANS_BLOCKS),
3274 * allocate new inode (bitmap, group descriptor, inode block,
3275 * quota blocks, sb is already counted in previous macros).
3277 credits = EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3278 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3;
3281 inode = ext4_new_inode_start_handle(dir, S_IFLNK|S_IRWXUGO,
3282 &dentry->d_name, 0, NULL,
3283 EXT4_HT_DIR, credits);
3284 handle = ext4_journal_current_handle();
3285 if (IS_ERR(inode)) {
3287 ext4_journal_stop(handle);
3288 return PTR_ERR(inode);
3291 if (IS_ENCRYPTED(inode)) {
3292 err = fscrypt_encrypt_symlink(inode, symname, len, &disk_link);
3294 goto err_drop_inode;
3295 inode->i_op = &ext4_encrypted_symlink_inode_operations;
3298 if ((disk_link.len > EXT4_N_BLOCKS * 4)) {
3299 if (!IS_ENCRYPTED(inode))
3300 inode->i_op = &ext4_symlink_inode_operations;
3301 inode_nohighmem(inode);
3302 ext4_set_aops(inode);
3304 * We cannot call page_symlink() with transaction started
3305 * because it calls into ext4_write_begin() which can wait
3306 * for transaction commit if we are running out of space
3307 * and thus we deadlock. So we have to stop transaction now
3308 * and restart it when symlink contents is written.
3310 * To keep fs consistent in case of crash, we have to put inode
3311 * to orphan list in the mean time.
3314 err = ext4_orphan_add(handle, inode);
3315 ext4_journal_stop(handle);
3318 goto err_drop_inode;
3319 err = __page_symlink(inode, disk_link.name, disk_link.len, 1);
3321 goto err_drop_inode;
3323 * Now inode is being linked into dir (EXT4_DATA_TRANS_BLOCKS
3324 * + EXT4_INDEX_EXTRA_TRANS_BLOCKS), inode is also modified
3326 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3327 EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3328 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 1);
3329 if (IS_ERR(handle)) {
3330 err = PTR_ERR(handle);
3332 goto err_drop_inode;
3334 set_nlink(inode, 1);
3335 err = ext4_orphan_del(handle, inode);
3337 goto err_drop_inode;
3339 /* clear the extent format for fast symlink */
3340 ext4_clear_inode_flag(inode, EXT4_INODE_EXTENTS);
3341 if (!IS_ENCRYPTED(inode)) {
3342 inode->i_op = &ext4_fast_symlink_inode_operations;
3343 inode->i_link = (char *)&EXT4_I(inode)->i_data;
3345 memcpy((char *)&EXT4_I(inode)->i_data, disk_link.name,
3347 inode->i_size = disk_link.len - 1;
3349 EXT4_I(inode)->i_disksize = inode->i_size;
3350 err = ext4_add_nondir(handle, dentry, &inode);
3352 ext4_journal_stop(handle);
3355 goto out_free_encrypted_link;
3359 ext4_journal_stop(handle);
3361 unlock_new_inode(inode);
3363 out_free_encrypted_link:
3364 if (disk_link.name != (unsigned char *)symname)
3365 kfree(disk_link.name);
3369 static int ext4_link(struct dentry *old_dentry,
3370 struct inode *dir, struct dentry *dentry)
3373 struct inode *inode = d_inode(old_dentry);
3374 int err, retries = 0;
3376 if (inode->i_nlink >= EXT4_LINK_MAX)
3379 err = fscrypt_prepare_link(old_dentry, dir, dentry);
3383 if ((ext4_test_inode_flag(dir, EXT4_INODE_PROJINHERIT)) &&
3384 (!projid_eq(EXT4_I(dir)->i_projid,
3385 EXT4_I(old_dentry->d_inode)->i_projid)))
3388 err = dquot_initialize(dir);
3393 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3394 (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3395 EXT4_INDEX_EXTRA_TRANS_BLOCKS) + 1);
3397 return PTR_ERR(handle);
3399 if (IS_DIRSYNC(dir))
3400 ext4_handle_sync(handle);
3402 inode->i_ctime = current_time(inode);
3403 ext4_inc_count(handle, inode);
3406 err = ext4_add_entry(handle, dentry, inode);
3408 ext4_mark_inode_dirty(handle, inode);
3409 /* this can happen only for tmpfile being
3410 * linked the first time
3412 if (inode->i_nlink == 1)
3413 ext4_orphan_del(handle, inode);
3414 d_instantiate(dentry, inode);
3419 ext4_journal_stop(handle);
3420 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3427 * Try to find buffer head where contains the parent block.
3428 * It should be the inode block if it is inlined or the 1st block
3429 * if it is a normal dir.
3431 static struct buffer_head *ext4_get_first_dir_block(handle_t *handle,
3432 struct inode *inode,
3434 struct ext4_dir_entry_2 **parent_de,
3437 struct buffer_head *bh;
3439 if (!ext4_has_inline_data(inode)) {
3440 /* The first directory block must not be a hole, so
3441 * treat it as DIRENT_HTREE
3443 bh = ext4_read_dirblock(inode, 0, DIRENT_HTREE);
3445 *retval = PTR_ERR(bh);
3448 *parent_de = ext4_next_entry(
3449 (struct ext4_dir_entry_2 *)bh->b_data,
3450 inode->i_sb->s_blocksize);
3455 return ext4_get_first_inline_block(inode, parent_de, retval);
3458 struct ext4_renament {
3460 struct dentry *dentry;
3461 struct inode *inode;
3463 int dir_nlink_delta;
3465 /* entry for "dentry" */
3466 struct buffer_head *bh;
3467 struct ext4_dir_entry_2 *de;
3470 /* entry for ".." in inode if it's a directory */
3471 struct buffer_head *dir_bh;
3472 struct ext4_dir_entry_2 *parent_de;
3476 static int ext4_rename_dir_prepare(handle_t *handle, struct ext4_renament *ent)
3480 ent->dir_bh = ext4_get_first_dir_block(handle, ent->inode,
3481 &retval, &ent->parent_de,
3485 if (le32_to_cpu(ent->parent_de->inode) != ent->dir->i_ino)
3486 return -EFSCORRUPTED;
3487 BUFFER_TRACE(ent->dir_bh, "get_write_access");
3488 return ext4_journal_get_write_access(handle, ent->dir_bh);
3491 static int ext4_rename_dir_finish(handle_t *handle, struct ext4_renament *ent,
3496 ent->parent_de->inode = cpu_to_le32(dir_ino);
3497 BUFFER_TRACE(ent->dir_bh, "call ext4_handle_dirty_metadata");
3498 if (!ent->dir_inlined) {
3499 if (is_dx(ent->inode)) {
3500 retval = ext4_handle_dirty_dx_node(handle,
3504 retval = ext4_handle_dirty_dirblock(handle, ent->inode,
3508 retval = ext4_mark_inode_dirty(handle, ent->inode);
3511 ext4_std_error(ent->dir->i_sb, retval);
3517 static int ext4_setent(handle_t *handle, struct ext4_renament *ent,
3518 unsigned ino, unsigned file_type)
3522 BUFFER_TRACE(ent->bh, "get write access");
3523 retval = ext4_journal_get_write_access(handle, ent->bh);
3526 ent->de->inode = cpu_to_le32(ino);
3527 if (ext4_has_feature_filetype(ent->dir->i_sb))
3528 ent->de->file_type = file_type;
3529 inode_inc_iversion(ent->dir);
3530 ent->dir->i_ctime = ent->dir->i_mtime =
3531 current_time(ent->dir);
3532 ext4_mark_inode_dirty(handle, ent->dir);
3533 BUFFER_TRACE(ent->bh, "call ext4_handle_dirty_metadata");
3534 if (!ent->inlined) {
3535 retval = ext4_handle_dirty_dirblock(handle, ent->dir, ent->bh);
3536 if (unlikely(retval)) {
3537 ext4_std_error(ent->dir->i_sb, retval);
3547 static int ext4_find_delete_entry(handle_t *handle, struct inode *dir,
3548 const struct qstr *d_name)
3550 int retval = -ENOENT;
3551 struct buffer_head *bh;
3552 struct ext4_dir_entry_2 *de;
3554 bh = ext4_find_entry(dir, d_name, &de, NULL);
3558 retval = ext4_delete_entry(handle, dir, de, bh);
3564 static void ext4_rename_delete(handle_t *handle, struct ext4_renament *ent,
3569 * ent->de could have moved from under us during htree split, so make
3570 * sure that we are deleting the right entry. We might also be pointing
3571 * to a stale entry in the unused part of ent->bh so just checking inum
3572 * and the name isn't enough.
3574 if (le32_to_cpu(ent->de->inode) != ent->inode->i_ino ||
3575 ent->de->name_len != ent->dentry->d_name.len ||
3576 strncmp(ent->de->name, ent->dentry->d_name.name,
3577 ent->de->name_len) ||
3579 retval = ext4_find_delete_entry(handle, ent->dir,
3580 &ent->dentry->d_name);
3582 retval = ext4_delete_entry(handle, ent->dir, ent->de, ent->bh);
3583 if (retval == -ENOENT) {
3584 retval = ext4_find_delete_entry(handle, ent->dir,
3585 &ent->dentry->d_name);
3590 ext4_warning_inode(ent->dir,
3591 "Deleting old file: nlink %d, error=%d",
3592 ent->dir->i_nlink, retval);
3596 static void ext4_update_dir_count(handle_t *handle, struct ext4_renament *ent)
3598 if (ent->dir_nlink_delta) {
3599 if (ent->dir_nlink_delta == -1)
3600 ext4_dec_count(handle, ent->dir);
3602 ext4_inc_count(handle, ent->dir);
3603 ext4_mark_inode_dirty(handle, ent->dir);
3607 static struct inode *ext4_whiteout_for_rename(struct ext4_renament *ent,
3608 int credits, handle_t **h)
3615 * for inode block, sb block, group summaries,
3618 credits += (EXT4_MAXQUOTAS_TRANS_BLOCKS(ent->dir->i_sb) +
3619 EXT4_XATTR_TRANS_BLOCKS + 4);
3621 wh = ext4_new_inode_start_handle(ent->dir, S_IFCHR | WHITEOUT_MODE,
3622 &ent->dentry->d_name, 0, NULL,
3623 EXT4_HT_DIR, credits);
3625 handle = ext4_journal_current_handle();
3628 ext4_journal_stop(handle);
3629 if (PTR_ERR(wh) == -ENOSPC &&
3630 ext4_should_retry_alloc(ent->dir->i_sb, &retries))
3634 init_special_inode(wh, wh->i_mode, WHITEOUT_DEV);
3635 wh->i_op = &ext4_special_inode_operations;
3641 * Anybody can rename anything with this: the permission checks are left to the
3642 * higher-level routines.
3644 * n.b. old_{dentry,inode) refers to the source dentry/inode
3645 * while new_{dentry,inode) refers to the destination dentry/inode
3646 * This comes from rename(const char *oldpath, const char *newpath)
3648 static int ext4_rename(struct inode *old_dir, struct dentry *old_dentry,
3649 struct inode *new_dir, struct dentry *new_dentry,
3652 handle_t *handle = NULL;
3653 struct ext4_renament old = {
3655 .dentry = old_dentry,
3656 .inode = d_inode(old_dentry),
3658 struct ext4_renament new = {
3660 .dentry = new_dentry,
3661 .inode = d_inode(new_dentry),
3665 struct inode *whiteout = NULL;
3669 if (new.inode && new.inode->i_nlink == 0) {
3670 EXT4_ERROR_INODE(new.inode,
3671 "target of rename is already freed");
3672 return -EFSCORRUPTED;
3675 if ((ext4_test_inode_flag(new_dir, EXT4_INODE_PROJINHERIT)) &&
3676 (!projid_eq(EXT4_I(new_dir)->i_projid,
3677 EXT4_I(old_dentry->d_inode)->i_projid)))
3680 retval = dquot_initialize(old.dir);
3683 retval = dquot_initialize(new.dir);
3687 /* Initialize quotas before so that eventual writes go
3688 * in separate transaction */
3690 retval = dquot_initialize(new.inode);
3695 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, &old.de, NULL);
3697 return PTR_ERR(old.bh);
3699 * Check for inode number is _not_ due to possible IO errors.
3700 * We might rmdir the source, keep it as pwd of some process
3701 * and merrily kill the link to whatever was created under the
3702 * same name. Goodbye sticky bit ;-<
3705 if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino)
3708 new.bh = ext4_find_entry(new.dir, &new.dentry->d_name,
3709 &new.de, &new.inlined);
3710 if (IS_ERR(new.bh)) {
3711 retval = PTR_ERR(new.bh);
3721 if (new.inode && !test_opt(new.dir->i_sb, NO_AUTO_DA_ALLOC))
3722 ext4_alloc_da_blocks(old.inode);
3724 credits = (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) +
3725 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2);
3726 if (!(flags & RENAME_WHITEOUT)) {
3727 handle = ext4_journal_start(old.dir, EXT4_HT_DIR, credits);
3728 if (IS_ERR(handle)) {
3729 retval = PTR_ERR(handle);
3734 whiteout = ext4_whiteout_for_rename(&old, credits, &handle);
3735 if (IS_ERR(whiteout)) {
3736 retval = PTR_ERR(whiteout);
3742 if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir))
3743 ext4_handle_sync(handle);
3745 if (S_ISDIR(old.inode->i_mode)) {
3747 retval = -ENOTEMPTY;
3748 if (!ext4_empty_dir(new.inode))
3752 if (new.dir != old.dir && EXT4_DIR_LINK_MAX(new.dir))
3755 retval = ext4_rename_dir_prepare(handle, &old);
3760 * If we're renaming a file within an inline_data dir and adding or
3761 * setting the new dirent causes a conversion from inline_data to
3762 * extents/blockmap, we need to force the dirent delete code to
3763 * re-read the directory, or else we end up trying to delete a dirent
3764 * from what is now the extent tree root (or a block map).
3766 force_reread = (new.dir->i_ino == old.dir->i_ino &&
3767 ext4_test_inode_flag(new.dir, EXT4_INODE_INLINE_DATA));
3769 old_file_type = old.de->file_type;
3772 * Do this before adding a new entry, so the old entry is sure
3773 * to be still pointing to the valid old entry.
3775 retval = ext4_setent(handle, &old, whiteout->i_ino,
3779 ext4_mark_inode_dirty(handle, whiteout);
3782 retval = ext4_add_entry(handle, new.dentry, old.inode);
3786 retval = ext4_setent(handle, &new,
3787 old.inode->i_ino, old_file_type);
3792 force_reread = !ext4_test_inode_flag(new.dir,
3793 EXT4_INODE_INLINE_DATA);
3796 * Like most other Unix systems, set the ctime for inodes on a
3799 old.inode->i_ctime = current_time(old.inode);
3800 ext4_mark_inode_dirty(handle, old.inode);
3806 ext4_rename_delete(handle, &old, force_reread);
3810 ext4_dec_count(handle, new.inode);
3811 new.inode->i_ctime = current_time(new.inode);
3813 old.dir->i_ctime = old.dir->i_mtime = current_time(old.dir);
3814 ext4_update_dx_flag(old.dir);
3816 retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino);
3820 ext4_dec_count(handle, old.dir);
3822 /* checked ext4_empty_dir above, can't have another
3823 * parent, ext4_dec_count() won't work for many-linked
3825 clear_nlink(new.inode);
3827 ext4_inc_count(handle, new.dir);
3828 ext4_update_dx_flag(new.dir);
3829 ext4_mark_inode_dirty(handle, new.dir);
3832 ext4_mark_inode_dirty(handle, old.dir);
3834 ext4_mark_inode_dirty(handle, new.inode);
3835 if (!new.inode->i_nlink)
3836 ext4_orphan_add(handle, new.inode);
3846 drop_nlink(whiteout);
3847 unlock_new_inode(whiteout);
3851 ext4_journal_stop(handle);
3855 static int ext4_cross_rename(struct inode *old_dir, struct dentry *old_dentry,
3856 struct inode *new_dir, struct dentry *new_dentry)
3858 handle_t *handle = NULL;
3859 struct ext4_renament old = {
3861 .dentry = old_dentry,
3862 .inode = d_inode(old_dentry),
3864 struct ext4_renament new = {
3866 .dentry = new_dentry,
3867 .inode = d_inode(new_dentry),
3871 struct timespec64 ctime;
3873 if ((ext4_test_inode_flag(new_dir, EXT4_INODE_PROJINHERIT) &&
3874 !projid_eq(EXT4_I(new_dir)->i_projid,
3875 EXT4_I(old_dentry->d_inode)->i_projid)) ||
3876 (ext4_test_inode_flag(old_dir, EXT4_INODE_PROJINHERIT) &&
3877 !projid_eq(EXT4_I(old_dir)->i_projid,
3878 EXT4_I(new_dentry->d_inode)->i_projid)))
3881 retval = dquot_initialize(old.dir);
3884 retval = dquot_initialize(new.dir);
3888 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name,
3889 &old.de, &old.inlined);
3891 return PTR_ERR(old.bh);
3893 * Check for inode number is _not_ due to possible IO errors.
3894 * We might rmdir the source, keep it as pwd of some process
3895 * and merrily kill the link to whatever was created under the
3896 * same name. Goodbye sticky bit ;-<
3899 if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino)
3902 new.bh = ext4_find_entry(new.dir, &new.dentry->d_name,
3903 &new.de, &new.inlined);
3904 if (IS_ERR(new.bh)) {
3905 retval = PTR_ERR(new.bh);
3910 /* RENAME_EXCHANGE case: old *and* new must both exist */
3911 if (!new.bh || le32_to_cpu(new.de->inode) != new.inode->i_ino)
3914 handle = ext4_journal_start(old.dir, EXT4_HT_DIR,
3915 (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) +
3916 2 * EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2));
3917 if (IS_ERR(handle)) {
3918 retval = PTR_ERR(handle);
3923 if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir))
3924 ext4_handle_sync(handle);
3926 if (S_ISDIR(old.inode->i_mode)) {
3928 retval = ext4_rename_dir_prepare(handle, &old);
3932 if (S_ISDIR(new.inode->i_mode)) {
3934 retval = ext4_rename_dir_prepare(handle, &new);
3940 * Other than the special case of overwriting a directory, parents'
3941 * nlink only needs to be modified if this is a cross directory rename.
3943 if (old.dir != new.dir && old.is_dir != new.is_dir) {
3944 old.dir_nlink_delta = old.is_dir ? -1 : 1;
3945 new.dir_nlink_delta = -old.dir_nlink_delta;
3947 if ((old.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(old.dir)) ||
3948 (new.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(new.dir)))
3952 new_file_type = new.de->file_type;
3953 retval = ext4_setent(handle, &new, old.inode->i_ino, old.de->file_type);
3957 retval = ext4_setent(handle, &old, new.inode->i_ino, new_file_type);
3962 * Like most other Unix systems, set the ctime for inodes on a
3965 ctime = current_time(old.inode);
3966 old.inode->i_ctime = ctime;
3967 new.inode->i_ctime = ctime;
3968 ext4_mark_inode_dirty(handle, old.inode);
3969 ext4_mark_inode_dirty(handle, new.inode);
3972 retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino);
3977 retval = ext4_rename_dir_finish(handle, &new, old.dir->i_ino);
3981 ext4_update_dir_count(handle, &old);
3982 ext4_update_dir_count(handle, &new);
3991 ext4_journal_stop(handle);
3995 static int ext4_rename2(struct inode *old_dir, struct dentry *old_dentry,
3996 struct inode *new_dir, struct dentry *new_dentry,
4001 if (unlikely(ext4_forced_shutdown(EXT4_SB(old_dir->i_sb))))
4004 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
4007 err = fscrypt_prepare_rename(old_dir, old_dentry, new_dir, new_dentry,
4012 if (flags & RENAME_EXCHANGE) {
4013 return ext4_cross_rename(old_dir, old_dentry,
4014 new_dir, new_dentry);
4017 return ext4_rename(old_dir, old_dentry, new_dir, new_dentry, flags);
4021 * directories can handle most operations...
4023 const struct inode_operations ext4_dir_inode_operations = {
4024 .create = ext4_create,
4025 .lookup = ext4_lookup,
4027 .unlink = ext4_unlink,
4028 .symlink = ext4_symlink,
4029 .mkdir = ext4_mkdir,
4030 .rmdir = ext4_rmdir,
4031 .mknod = ext4_mknod,
4032 .tmpfile = ext4_tmpfile,
4033 .rename = ext4_rename2,
4034 .setattr = ext4_setattr,
4035 .getattr = ext4_getattr,
4036 .listxattr = ext4_listxattr,
4037 .get_acl = ext4_get_acl,
4038 .set_acl = ext4_set_acl,
4039 .fiemap = ext4_fiemap,
4042 const struct inode_operations ext4_special_inode_operations = {
4043 .setattr = ext4_setattr,
4044 .getattr = ext4_getattr,
4045 .listxattr = ext4_listxattr,
4046 .get_acl = ext4_get_acl,
4047 .set_acl = ext4_set_acl,