2 * linux/fs/ext4/namei.c
4 * Copyright (C) 1992, 1993, 1994, 1995
5 * Remy Card (card@masi.ibp.fr)
6 * Laboratoire MASI - Institut Blaise Pascal
7 * Universite Pierre et Marie Curie (Paris VI)
11 * linux/fs/minix/namei.c
13 * Copyright (C) 1991, 1992 Linus Torvalds
15 * Big-endian to little-endian byte-swapping/bitmaps by
16 * David S. Miller (davem@caip.rutgers.edu), 1995
17 * Directory entry file type support and forward compatibility hooks
18 * for B-tree directories by Theodore Ts'o (tytso@mit.edu), 1998
19 * Hash Tree Directory indexing (c)
20 * Daniel Phillips, 2001
21 * Hash Tree Directory indexing porting
22 * Christopher Li, 2002
23 * Hash Tree Directory indexing cleanup
28 #include <linux/pagemap.h>
29 #include <linux/time.h>
30 #include <linux/fcntl.h>
31 #include <linux/stat.h>
32 #include <linux/string.h>
33 #include <linux/quotaops.h>
34 #include <linux/buffer_head.h>
35 #include <linux/bio.h>
37 #include "ext4_jbd2.h"
42 #include <trace/events/ext4.h>
44 * define how far ahead to read directories while searching them.
46 #define NAMEI_RA_CHUNKS 2
47 #define NAMEI_RA_BLOCKS 4
48 #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS)
50 static struct buffer_head
*ext4_append(handle_t
*handle
,
54 struct buffer_head
*bh
;
57 if (unlikely(EXT4_SB(inode
->i_sb
)->s_max_dir_size_kb
&&
58 ((inode
->i_size
>> 10) >=
59 EXT4_SB(inode
->i_sb
)->s_max_dir_size_kb
)))
60 return ERR_PTR(-ENOSPC
);
62 *block
= inode
->i_size
>> inode
->i_sb
->s_blocksize_bits
;
64 bh
= ext4_bread(handle
, inode
, *block
, EXT4_GET_BLOCKS_CREATE
);
67 inode
->i_size
+= inode
->i_sb
->s_blocksize
;
68 EXT4_I(inode
)->i_disksize
= inode
->i_size
;
69 BUFFER_TRACE(bh
, "get_write_access");
70 err
= ext4_journal_get_write_access(handle
, bh
);
73 ext4_std_error(inode
->i_sb
, err
);
79 static int ext4_dx_csum_verify(struct inode
*inode
,
80 struct ext4_dir_entry
*dirent
);
86 #define ext4_read_dirblock(inode, block, type) \
87 __ext4_read_dirblock((inode), (block), (type), __func__, __LINE__)
89 static struct buffer_head
*__ext4_read_dirblock(struct inode
*inode
,
95 struct buffer_head
*bh
;
96 struct ext4_dir_entry
*dirent
;
99 bh
= ext4_bread(NULL
, inode
, block
, 0);
101 __ext4_warning(inode
->i_sb
, func
, line
,
102 "inode #%lu: lblock %lu: comm %s: "
103 "error %ld reading directory block",
104 inode
->i_ino
, (unsigned long)block
,
105 current
->comm
, PTR_ERR(bh
));
110 ext4_error_inode(inode
, func
, line
, block
,
111 "Directory hole found");
112 return ERR_PTR(-EFSCORRUPTED
);
114 dirent
= (struct ext4_dir_entry
*) bh
->b_data
;
115 /* Determine whether or not we have an index block */
119 else if (ext4_rec_len_from_disk(dirent
->rec_len
,
120 inode
->i_sb
->s_blocksize
) ==
121 inode
->i_sb
->s_blocksize
)
124 if (!is_dx_block
&& type
== INDEX
) {
125 ext4_error_inode(inode
, func
, line
, block
,
126 "directory leaf block found instead of index block");
127 return ERR_PTR(-EFSCORRUPTED
);
129 if (!ext4_has_metadata_csum(inode
->i_sb
) ||
134 * An empty leaf block can get mistaken for a index block; for
135 * this reason, we can only check the index checksum when the
136 * caller is sure it should be an index block.
138 if (is_dx_block
&& type
== INDEX
) {
139 if (ext4_dx_csum_verify(inode
, dirent
))
140 set_buffer_verified(bh
);
142 ext4_error_inode(inode
, func
, line
, block
,
143 "Directory index failed checksum");
145 return ERR_PTR(-EFSBADCRC
);
149 if (ext4_dirent_csum_verify(inode
, dirent
))
150 set_buffer_verified(bh
);
152 ext4_error_inode(inode
, func
, line
, block
,
153 "Directory block failed checksum");
155 return ERR_PTR(-EFSBADCRC
);
162 #define assert(test) J_ASSERT(test)
166 #define dxtrace(command) command
168 #define dxtrace(command)
192 * dx_root_info is laid out so that if it should somehow get overlaid by a
193 * dirent the two low bits of the hash version will be zero. Therefore, the
194 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
199 struct fake_dirent dot
;
201 struct fake_dirent dotdot
;
205 __le32 reserved_zero
;
207 u8 info_length
; /* 8 */
212 struct dx_entry entries
[0];
217 struct fake_dirent fake
;
218 struct dx_entry entries
[0];
224 struct buffer_head
*bh
;
225 struct dx_entry
*entries
;
237 * This goes at the end of each htree block.
241 __le32 dt_checksum
; /* crc32c(uuid+inum+dirblock) */
244 static inline ext4_lblk_t
dx_get_block(struct dx_entry
*entry
);
245 static void dx_set_block(struct dx_entry
*entry
, ext4_lblk_t value
);
246 static inline unsigned dx_get_hash(struct dx_entry
*entry
);
247 static void dx_set_hash(struct dx_entry
*entry
, unsigned value
);
248 static unsigned dx_get_count(struct dx_entry
*entries
);
249 static unsigned dx_get_limit(struct dx_entry
*entries
);
250 static void dx_set_count(struct dx_entry
*entries
, unsigned value
);
251 static void dx_set_limit(struct dx_entry
*entries
, unsigned value
);
252 static unsigned dx_root_limit(struct inode
*dir
, unsigned infosize
);
253 static unsigned dx_node_limit(struct inode
*dir
);
254 static struct dx_frame
*dx_probe(struct ext4_filename
*fname
,
256 struct dx_hash_info
*hinfo
,
257 struct dx_frame
*frame
);
258 static void dx_release(struct dx_frame
*frames
);
259 static int dx_make_map(struct inode
*dir
, struct ext4_dir_entry_2
*de
,
260 unsigned blocksize
, struct dx_hash_info
*hinfo
,
261 struct dx_map_entry map
[]);
262 static void dx_sort_map(struct dx_map_entry
*map
, unsigned count
);
263 static struct ext4_dir_entry_2
*dx_move_dirents(char *from
, char *to
,
264 struct dx_map_entry
*offsets
, int count
, unsigned blocksize
);
265 static struct ext4_dir_entry_2
* dx_pack_dirents(char *base
, unsigned blocksize
);
266 static void dx_insert_block(struct dx_frame
*frame
,
267 u32 hash
, ext4_lblk_t block
);
268 static int ext4_htree_next_block(struct inode
*dir
, __u32 hash
,
269 struct dx_frame
*frame
,
270 struct dx_frame
*frames
,
272 static struct buffer_head
* ext4_dx_find_entry(struct inode
*dir
,
273 struct ext4_filename
*fname
,
274 struct ext4_dir_entry_2
**res_dir
);
275 static int ext4_dx_add_entry(handle_t
*handle
, struct ext4_filename
*fname
,
276 struct inode
*dir
, struct inode
*inode
);
278 /* checksumming functions */
279 void initialize_dirent_tail(struct ext4_dir_entry_tail
*t
,
280 unsigned int blocksize
)
282 memset(t
, 0, sizeof(struct ext4_dir_entry_tail
));
283 t
->det_rec_len
= ext4_rec_len_to_disk(
284 sizeof(struct ext4_dir_entry_tail
), blocksize
);
285 t
->det_reserved_ft
= EXT4_FT_DIR_CSUM
;
288 /* Walk through a dirent block to find a checksum "dirent" at the tail */
289 static struct ext4_dir_entry_tail
*get_dirent_tail(struct inode
*inode
,
290 struct ext4_dir_entry
*de
)
292 struct ext4_dir_entry_tail
*t
;
295 struct ext4_dir_entry
*d
, *top
;
298 top
= (struct ext4_dir_entry
*)(((void *)de
) +
299 (EXT4_BLOCK_SIZE(inode
->i_sb
) -
300 sizeof(struct ext4_dir_entry_tail
)));
301 while (d
< top
&& d
->rec_len
)
302 d
= (struct ext4_dir_entry
*)(((void *)d
) +
303 le16_to_cpu(d
->rec_len
));
308 t
= (struct ext4_dir_entry_tail
*)d
;
310 t
= EXT4_DIRENT_TAIL(de
, EXT4_BLOCK_SIZE(inode
->i_sb
));
313 if (t
->det_reserved_zero1
||
314 le16_to_cpu(t
->det_rec_len
) != sizeof(struct ext4_dir_entry_tail
) ||
315 t
->det_reserved_zero2
||
316 t
->det_reserved_ft
!= EXT4_FT_DIR_CSUM
)
322 static __le32
ext4_dirent_csum(struct inode
*inode
,
323 struct ext4_dir_entry
*dirent
, int size
)
325 struct ext4_sb_info
*sbi
= EXT4_SB(inode
->i_sb
);
326 struct ext4_inode_info
*ei
= EXT4_I(inode
);
329 csum
= ext4_chksum(sbi
, ei
->i_csum_seed
, (__u8
*)dirent
, size
);
330 return cpu_to_le32(csum
);
333 #define warn_no_space_for_csum(inode) \
334 __warn_no_space_for_csum((inode), __func__, __LINE__)
336 static void __warn_no_space_for_csum(struct inode
*inode
, const char *func
,
339 __ext4_warning_inode(inode
, func
, line
,
340 "No space for directory leaf checksum. Please run e2fsck -D.");
343 int ext4_dirent_csum_verify(struct inode
*inode
, struct ext4_dir_entry
*dirent
)
345 struct ext4_dir_entry_tail
*t
;
347 if (!ext4_has_metadata_csum(inode
->i_sb
))
350 t
= get_dirent_tail(inode
, dirent
);
352 warn_no_space_for_csum(inode
);
356 if (t
->det_checksum
!= ext4_dirent_csum(inode
, dirent
,
357 (void *)t
- (void *)dirent
))
363 static void ext4_dirent_csum_set(struct inode
*inode
,
364 struct ext4_dir_entry
*dirent
)
366 struct ext4_dir_entry_tail
*t
;
368 if (!ext4_has_metadata_csum(inode
->i_sb
))
371 t
= get_dirent_tail(inode
, dirent
);
373 warn_no_space_for_csum(inode
);
377 t
->det_checksum
= ext4_dirent_csum(inode
, dirent
,
378 (void *)t
- (void *)dirent
);
381 int ext4_handle_dirty_dirent_node(handle_t
*handle
,
383 struct buffer_head
*bh
)
385 ext4_dirent_csum_set(inode
, (struct ext4_dir_entry
*)bh
->b_data
);
386 return ext4_handle_dirty_metadata(handle
, inode
, bh
);
389 static struct dx_countlimit
*get_dx_countlimit(struct inode
*inode
,
390 struct ext4_dir_entry
*dirent
,
393 struct ext4_dir_entry
*dp
;
394 struct dx_root_info
*root
;
397 if (le16_to_cpu(dirent
->rec_len
) == EXT4_BLOCK_SIZE(inode
->i_sb
))
399 else if (le16_to_cpu(dirent
->rec_len
) == 12) {
400 dp
= (struct ext4_dir_entry
*)(((void *)dirent
) + 12);
401 if (le16_to_cpu(dp
->rec_len
) !=
402 EXT4_BLOCK_SIZE(inode
->i_sb
) - 12)
404 root
= (struct dx_root_info
*)(((void *)dp
+ 12));
405 if (root
->reserved_zero
||
406 root
->info_length
!= sizeof(struct dx_root_info
))
413 *offset
= count_offset
;
414 return (struct dx_countlimit
*)(((void *)dirent
) + count_offset
);
417 static __le32
ext4_dx_csum(struct inode
*inode
, struct ext4_dir_entry
*dirent
,
418 int count_offset
, int count
, struct dx_tail
*t
)
420 struct ext4_sb_info
*sbi
= EXT4_SB(inode
->i_sb
);
421 struct ext4_inode_info
*ei
= EXT4_I(inode
);
424 __u32 dummy_csum
= 0;
425 int offset
= offsetof(struct dx_tail
, dt_checksum
);
427 size
= count_offset
+ (count
* sizeof(struct dx_entry
));
428 csum
= ext4_chksum(sbi
, ei
->i_csum_seed
, (__u8
*)dirent
, size
);
429 csum
= ext4_chksum(sbi
, csum
, (__u8
*)t
, offset
);
430 csum
= ext4_chksum(sbi
, csum
, (__u8
*)&dummy_csum
, sizeof(dummy_csum
));
432 return cpu_to_le32(csum
);
435 static int ext4_dx_csum_verify(struct inode
*inode
,
436 struct ext4_dir_entry
*dirent
)
438 struct dx_countlimit
*c
;
440 int count_offset
, limit
, count
;
442 if (!ext4_has_metadata_csum(inode
->i_sb
))
445 c
= get_dx_countlimit(inode
, dirent
, &count_offset
);
447 EXT4_ERROR_INODE(inode
, "dir seems corrupt? Run e2fsck -D.");
450 limit
= le16_to_cpu(c
->limit
);
451 count
= le16_to_cpu(c
->count
);
452 if (count_offset
+ (limit
* sizeof(struct dx_entry
)) >
453 EXT4_BLOCK_SIZE(inode
->i_sb
) - sizeof(struct dx_tail
)) {
454 warn_no_space_for_csum(inode
);
457 t
= (struct dx_tail
*)(((struct dx_entry
*)c
) + limit
);
459 if (t
->dt_checksum
!= ext4_dx_csum(inode
, dirent
, count_offset
,
465 static void ext4_dx_csum_set(struct inode
*inode
, struct ext4_dir_entry
*dirent
)
467 struct dx_countlimit
*c
;
469 int count_offset
, limit
, count
;
471 if (!ext4_has_metadata_csum(inode
->i_sb
))
474 c
= get_dx_countlimit(inode
, dirent
, &count_offset
);
476 EXT4_ERROR_INODE(inode
, "dir seems corrupt? Run e2fsck -D.");
479 limit
= le16_to_cpu(c
->limit
);
480 count
= le16_to_cpu(c
->count
);
481 if (count_offset
+ (limit
* sizeof(struct dx_entry
)) >
482 EXT4_BLOCK_SIZE(inode
->i_sb
) - sizeof(struct dx_tail
)) {
483 warn_no_space_for_csum(inode
);
486 t
= (struct dx_tail
*)(((struct dx_entry
*)c
) + limit
);
488 t
->dt_checksum
= ext4_dx_csum(inode
, dirent
, count_offset
, count
, t
);
491 static inline int ext4_handle_dirty_dx_node(handle_t
*handle
,
493 struct buffer_head
*bh
)
495 ext4_dx_csum_set(inode
, (struct ext4_dir_entry
*)bh
->b_data
);
496 return ext4_handle_dirty_metadata(handle
, inode
, bh
);
500 * p is at least 6 bytes before the end of page
502 static inline struct ext4_dir_entry_2
*
503 ext4_next_entry(struct ext4_dir_entry_2
*p
, unsigned long blocksize
)
505 return (struct ext4_dir_entry_2
*)((char *)p
+
506 ext4_rec_len_from_disk(p
->rec_len
, blocksize
));
510 * Future: use high four bits of block for coalesce-on-delete flags
511 * Mask them off for now.
514 static inline ext4_lblk_t
dx_get_block(struct dx_entry
*entry
)
516 return le32_to_cpu(entry
->block
) & 0x00ffffff;
519 static inline void dx_set_block(struct dx_entry
*entry
, ext4_lblk_t value
)
521 entry
->block
= cpu_to_le32(value
);
524 static inline unsigned dx_get_hash(struct dx_entry
*entry
)
526 return le32_to_cpu(entry
->hash
);
529 static inline void dx_set_hash(struct dx_entry
*entry
, unsigned value
)
531 entry
->hash
= cpu_to_le32(value
);
534 static inline unsigned dx_get_count(struct dx_entry
*entries
)
536 return le16_to_cpu(((struct dx_countlimit
*) entries
)->count
);
539 static inline unsigned dx_get_limit(struct dx_entry
*entries
)
541 return le16_to_cpu(((struct dx_countlimit
*) entries
)->limit
);
544 static inline void dx_set_count(struct dx_entry
*entries
, unsigned value
)
546 ((struct dx_countlimit
*) entries
)->count
= cpu_to_le16(value
);
549 static inline void dx_set_limit(struct dx_entry
*entries
, unsigned value
)
551 ((struct dx_countlimit
*) entries
)->limit
= cpu_to_le16(value
);
554 static inline unsigned dx_root_limit(struct inode
*dir
, unsigned infosize
)
556 unsigned entry_space
= dir
->i_sb
->s_blocksize
- EXT4_DIR_REC_LEN(1) -
557 EXT4_DIR_REC_LEN(2) - infosize
;
559 if (ext4_has_metadata_csum(dir
->i_sb
))
560 entry_space
-= sizeof(struct dx_tail
);
561 return entry_space
/ sizeof(struct dx_entry
);
564 static inline unsigned dx_node_limit(struct inode
*dir
)
566 unsigned entry_space
= dir
->i_sb
->s_blocksize
- EXT4_DIR_REC_LEN(0);
568 if (ext4_has_metadata_csum(dir
->i_sb
))
569 entry_space
-= sizeof(struct dx_tail
);
570 return entry_space
/ sizeof(struct dx_entry
);
577 static void dx_show_index(char * label
, struct dx_entry
*entries
)
579 int i
, n
= dx_get_count (entries
);
580 printk(KERN_DEBUG
"%s index ", label
);
581 for (i
= 0; i
< n
; i
++) {
582 printk("%x->%lu ", i
? dx_get_hash(entries
+ i
) :
583 0, (unsigned long)dx_get_block(entries
+ i
));
595 static struct stats
dx_show_leaf(struct inode
*dir
,
596 struct dx_hash_info
*hinfo
,
597 struct ext4_dir_entry_2
*de
,
598 int size
, int show_names
)
600 unsigned names
= 0, space
= 0;
601 char *base
= (char *) de
;
602 struct dx_hash_info h
= *hinfo
;
605 while ((char *) de
< base
+ size
)
611 #ifdef CONFIG_EXT4_FS_ENCRYPTION
614 struct fscrypt_str fname_crypto_str
=
620 if (ext4_encrypted_inode(dir
))
621 res
= fscrypt_get_encryption_info(dir
);
623 printk(KERN_WARNING
"Error setting up"
624 " fname crypto: %d\n", res
);
626 if (!fscrypt_has_encryption_key(dir
)) {
627 /* Directory is not encrypted */
628 ext4fs_dirhash(de
->name
,
630 printk("%*.s:(U)%x.%u ", len
,
632 (unsigned) ((char *) de
635 struct fscrypt_str de_name
=
636 FSTR_INIT(name
, len
);
638 /* Directory is encrypted */
639 res
= fscrypt_fname_alloc_buffer(
643 printk(KERN_WARNING
"Error "
647 res
= fscrypt_fname_disk_to_usr(dir
,
651 printk(KERN_WARNING
"Error "
652 "converting filename "
658 name
= fname_crypto_str
.name
;
659 len
= fname_crypto_str
.len
;
661 ext4fs_dirhash(de
->name
, de
->name_len
,
663 printk("%*.s:(E)%x.%u ", len
, name
,
664 h
.hash
, (unsigned) ((char *) de
666 fscrypt_fname_free_buffer(
670 int len
= de
->name_len
;
671 char *name
= de
->name
;
672 ext4fs_dirhash(de
->name
, de
->name_len
, &h
);
673 printk("%*.s:%x.%u ", len
, name
, h
.hash
,
674 (unsigned) ((char *) de
- base
));
677 space
+= EXT4_DIR_REC_LEN(de
->name_len
);
680 de
= ext4_next_entry(de
, size
);
682 printk("(%i)\n", names
);
683 return (struct stats
) { names
, space
, 1 };
686 struct stats
dx_show_entries(struct dx_hash_info
*hinfo
, struct inode
*dir
,
687 struct dx_entry
*entries
, int levels
)
689 unsigned blocksize
= dir
->i_sb
->s_blocksize
;
690 unsigned count
= dx_get_count(entries
), names
= 0, space
= 0, i
;
692 struct buffer_head
*bh
;
693 printk("%i indexed blocks...\n", count
);
694 for (i
= 0; i
< count
; i
++, entries
++)
696 ext4_lblk_t block
= dx_get_block(entries
);
697 ext4_lblk_t hash
= i
? dx_get_hash(entries
): 0;
698 u32 range
= i
< count
- 1? (dx_get_hash(entries
+ 1) - hash
): ~hash
;
700 printk("%s%3u:%03u hash %8x/%8x ",levels
?"":" ", i
, block
, hash
, range
);
701 bh
= ext4_bread(NULL
,dir
, block
, 0);
702 if (!bh
|| IS_ERR(bh
))
705 dx_show_entries(hinfo
, dir
, ((struct dx_node
*) bh
->b_data
)->entries
, levels
- 1):
706 dx_show_leaf(dir
, hinfo
, (struct ext4_dir_entry_2
*)
707 bh
->b_data
, blocksize
, 0);
708 names
+= stats
.names
;
709 space
+= stats
.space
;
710 bcount
+= stats
.bcount
;
714 printk(KERN_DEBUG
"%snames %u, fullness %u (%u%%)\n",
715 levels
? "" : " ", names
, space
/bcount
,
716 (space
/bcount
)*100/blocksize
);
717 return (struct stats
) { names
, space
, bcount
};
719 #endif /* DX_DEBUG */
722 * Probe for a directory leaf block to search.
724 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
725 * error in the directory index, and the caller should fall back to
726 * searching the directory normally. The callers of dx_probe **MUST**
727 * check for this error code, and make sure it never gets reflected
730 static struct dx_frame
*
731 dx_probe(struct ext4_filename
*fname
, struct inode
*dir
,
732 struct dx_hash_info
*hinfo
, struct dx_frame
*frame_in
)
734 unsigned count
, indirect
;
735 struct dx_entry
*at
, *entries
, *p
, *q
, *m
;
736 struct dx_root
*root
;
737 struct dx_frame
*frame
= frame_in
;
738 struct dx_frame
*ret_err
= ERR_PTR(ERR_BAD_DX_DIR
);
741 frame
->bh
= ext4_read_dirblock(dir
, 0, INDEX
);
742 if (IS_ERR(frame
->bh
))
743 return (struct dx_frame
*) frame
->bh
;
745 root
= (struct dx_root
*) frame
->bh
->b_data
;
746 if (root
->info
.hash_version
!= DX_HASH_TEA
&&
747 root
->info
.hash_version
!= DX_HASH_HALF_MD4
&&
748 root
->info
.hash_version
!= DX_HASH_LEGACY
) {
749 ext4_warning_inode(dir
, "Unrecognised inode hash code %u",
750 root
->info
.hash_version
);
754 hinfo
= &fname
->hinfo
;
755 hinfo
->hash_version
= root
->info
.hash_version
;
756 if (hinfo
->hash_version
<= DX_HASH_TEA
)
757 hinfo
->hash_version
+= EXT4_SB(dir
->i_sb
)->s_hash_unsigned
;
758 hinfo
->seed
= EXT4_SB(dir
->i_sb
)->s_hash_seed
;
759 if (fname
&& fname_name(fname
))
760 ext4fs_dirhash(fname_name(fname
), fname_len(fname
), hinfo
);
763 if (root
->info
.unused_flags
& 1) {
764 ext4_warning_inode(dir
, "Unimplemented hash flags: %#06x",
765 root
->info
.unused_flags
);
769 indirect
= root
->info
.indirect_levels
;
771 ext4_warning_inode(dir
, "Unimplemented hash depth: %#06x",
772 root
->info
.indirect_levels
);
776 entries
= (struct dx_entry
*)(((char *)&root
->info
) +
777 root
->info
.info_length
);
779 if (dx_get_limit(entries
) != dx_root_limit(dir
,
780 root
->info
.info_length
)) {
781 ext4_warning_inode(dir
, "dx entry: limit %u != root limit %u",
782 dx_get_limit(entries
),
783 dx_root_limit(dir
, root
->info
.info_length
));
787 dxtrace(printk("Look up %x", hash
));
789 count
= dx_get_count(entries
);
790 if (!count
|| count
> dx_get_limit(entries
)) {
791 ext4_warning_inode(dir
,
792 "dx entry: count %u beyond limit %u",
793 count
, dx_get_limit(entries
));
798 q
= entries
+ count
- 1;
801 dxtrace(printk("."));
802 if (dx_get_hash(m
) > hash
)
808 if (0) { // linear search cross check
809 unsigned n
= count
- 1;
813 dxtrace(printk(","));
814 if (dx_get_hash(++at
) > hash
)
820 assert (at
== p
- 1);
824 dxtrace(printk(" %x->%u\n", at
== entries
? 0 : dx_get_hash(at
),
826 frame
->entries
= entries
;
831 frame
->bh
= ext4_read_dirblock(dir
, dx_get_block(at
), INDEX
);
832 if (IS_ERR(frame
->bh
)) {
833 ret_err
= (struct dx_frame
*) frame
->bh
;
837 entries
= ((struct dx_node
*) frame
->bh
->b_data
)->entries
;
839 if (dx_get_limit(entries
) != dx_node_limit(dir
)) {
840 ext4_warning_inode(dir
,
841 "dx entry: limit %u != node limit %u",
842 dx_get_limit(entries
), dx_node_limit(dir
));
847 while (frame
>= frame_in
) {
852 if (ret_err
== ERR_PTR(ERR_BAD_DX_DIR
))
853 ext4_warning_inode(dir
,
854 "Corrupt directory, running e2fsck is recommended");
858 static void dx_release(struct dx_frame
*frames
)
860 if (frames
[0].bh
== NULL
)
863 if (((struct dx_root
*)frames
[0].bh
->b_data
)->info
.indirect_levels
)
864 brelse(frames
[1].bh
);
865 brelse(frames
[0].bh
);
869 * This function increments the frame pointer to search the next leaf
870 * block, and reads in the necessary intervening nodes if the search
871 * should be necessary. Whether or not the search is necessary is
872 * controlled by the hash parameter. If the hash value is even, then
873 * the search is only continued if the next block starts with that
874 * hash value. This is used if we are searching for a specific file.
876 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
878 * This function returns 1 if the caller should continue to search,
879 * or 0 if it should not. If there is an error reading one of the
880 * index blocks, it will a negative error code.
882 * If start_hash is non-null, it will be filled in with the starting
883 * hash of the next page.
885 static int ext4_htree_next_block(struct inode
*dir
, __u32 hash
,
886 struct dx_frame
*frame
,
887 struct dx_frame
*frames
,
891 struct buffer_head
*bh
;
897 * Find the next leaf page by incrementing the frame pointer.
898 * If we run out of entries in the interior node, loop around and
899 * increment pointer in the parent node. When we break out of
900 * this loop, num_frames indicates the number of interior
901 * nodes need to be read.
904 if (++(p
->at
) < p
->entries
+ dx_get_count(p
->entries
))
913 * If the hash is 1, then continue only if the next page has a
914 * continuation hash of any value. This is used for readdir
915 * handling. Otherwise, check to see if the hash matches the
916 * desired contiuation hash. If it doesn't, return since
917 * there's no point to read in the successive index pages.
919 bhash
= dx_get_hash(p
->at
);
922 if ((hash
& 1) == 0) {
923 if ((bhash
& ~1) != hash
)
927 * If the hash is HASH_NB_ALWAYS, we always go to the next
928 * block so no check is necessary
930 while (num_frames
--) {
931 bh
= ext4_read_dirblock(dir
, dx_get_block(p
->at
), INDEX
);
937 p
->at
= p
->entries
= ((struct dx_node
*) bh
->b_data
)->entries
;
944 * This function fills a red-black tree with information from a
945 * directory block. It returns the number directory entries loaded
946 * into the tree. If there is an error it is returned in err.
948 static int htree_dirblock_to_tree(struct file
*dir_file
,
949 struct inode
*dir
, ext4_lblk_t block
,
950 struct dx_hash_info
*hinfo
,
951 __u32 start_hash
, __u32 start_minor_hash
)
953 struct buffer_head
*bh
;
954 struct ext4_dir_entry_2
*de
, *top
;
955 int err
= 0, count
= 0;
956 struct fscrypt_str fname_crypto_str
= FSTR_INIT(NULL
, 0), tmp_str
;
958 dxtrace(printk(KERN_INFO
"In htree dirblock_to_tree: block %lu\n",
959 (unsigned long)block
));
960 bh
= ext4_read_dirblock(dir
, block
, DIRENT
);
964 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
965 top
= (struct ext4_dir_entry_2
*) ((char *) de
+
966 dir
->i_sb
->s_blocksize
-
967 EXT4_DIR_REC_LEN(0));
968 #ifdef CONFIG_EXT4_FS_ENCRYPTION
969 /* Check if the directory is encrypted */
970 if (ext4_encrypted_inode(dir
)) {
971 err
= fscrypt_get_encryption_info(dir
);
976 err
= fscrypt_fname_alloc_buffer(dir
, EXT4_NAME_LEN
,
984 for (; de
< top
; de
= ext4_next_entry(de
, dir
->i_sb
->s_blocksize
)) {
985 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
986 bh
->b_data
, bh
->b_size
,
987 (block
<<EXT4_BLOCK_SIZE_BITS(dir
->i_sb
))
988 + ((char *)de
- bh
->b_data
))) {
989 /* silently ignore the rest of the block */
992 ext4fs_dirhash(de
->name
, de
->name_len
, hinfo
);
993 if ((hinfo
->hash
< start_hash
) ||
994 ((hinfo
->hash
== start_hash
) &&
995 (hinfo
->minor_hash
< start_minor_hash
)))
999 if (!ext4_encrypted_inode(dir
)) {
1000 tmp_str
.name
= de
->name
;
1001 tmp_str
.len
= de
->name_len
;
1002 err
= ext4_htree_store_dirent(dir_file
,
1003 hinfo
->hash
, hinfo
->minor_hash
, de
,
1006 int save_len
= fname_crypto_str
.len
;
1007 struct fscrypt_str de_name
= FSTR_INIT(de
->name
,
1010 /* Directory is encrypted */
1011 err
= fscrypt_fname_disk_to_usr(dir
, hinfo
->hash
,
1012 hinfo
->minor_hash
, &de_name
,
1018 err
= ext4_htree_store_dirent(dir_file
,
1019 hinfo
->hash
, hinfo
->minor_hash
, de
,
1021 fname_crypto_str
.len
= save_len
;
1031 #ifdef CONFIG_EXT4_FS_ENCRYPTION
1032 fscrypt_fname_free_buffer(&fname_crypto_str
);
1039 * This function fills a red-black tree with information from a
1040 * directory. We start scanning the directory in hash order, starting
1041 * at start_hash and start_minor_hash.
1043 * This function returns the number of entries inserted into the tree,
1044 * or a negative error code.
1046 int ext4_htree_fill_tree(struct file
*dir_file
, __u32 start_hash
,
1047 __u32 start_minor_hash
, __u32
*next_hash
)
1049 struct dx_hash_info hinfo
;
1050 struct ext4_dir_entry_2
*de
;
1051 struct dx_frame frames
[2], *frame
;
1057 struct fscrypt_str tmp_str
;
1059 dxtrace(printk(KERN_DEBUG
"In htree_fill_tree, start hash: %x:%x\n",
1060 start_hash
, start_minor_hash
));
1061 dir
= file_inode(dir_file
);
1062 if (!(ext4_test_inode_flag(dir
, EXT4_INODE_INDEX
))) {
1063 hinfo
.hash_version
= EXT4_SB(dir
->i_sb
)->s_def_hash_version
;
1064 if (hinfo
.hash_version
<= DX_HASH_TEA
)
1065 hinfo
.hash_version
+=
1066 EXT4_SB(dir
->i_sb
)->s_hash_unsigned
;
1067 hinfo
.seed
= EXT4_SB(dir
->i_sb
)->s_hash_seed
;
1068 if (ext4_has_inline_data(dir
)) {
1069 int has_inline_data
= 1;
1070 count
= htree_inlinedir_to_tree(dir_file
, dir
, 0,
1074 if (has_inline_data
) {
1079 count
= htree_dirblock_to_tree(dir_file
, dir
, 0, &hinfo
,
1080 start_hash
, start_minor_hash
);
1084 hinfo
.hash
= start_hash
;
1085 hinfo
.minor_hash
= 0;
1086 frame
= dx_probe(NULL
, dir
, &hinfo
, frames
);
1088 return PTR_ERR(frame
);
1090 /* Add '.' and '..' from the htree header */
1091 if (!start_hash
&& !start_minor_hash
) {
1092 de
= (struct ext4_dir_entry_2
*) frames
[0].bh
->b_data
;
1093 tmp_str
.name
= de
->name
;
1094 tmp_str
.len
= de
->name_len
;
1095 err
= ext4_htree_store_dirent(dir_file
, 0, 0,
1101 if (start_hash
< 2 || (start_hash
==2 && start_minor_hash
==0)) {
1102 de
= (struct ext4_dir_entry_2
*) frames
[0].bh
->b_data
;
1103 de
= ext4_next_entry(de
, dir
->i_sb
->s_blocksize
);
1104 tmp_str
.name
= de
->name
;
1105 tmp_str
.len
= de
->name_len
;
1106 err
= ext4_htree_store_dirent(dir_file
, 2, 0,
1114 if (fatal_signal_pending(current
)) {
1119 block
= dx_get_block(frame
->at
);
1120 ret
= htree_dirblock_to_tree(dir_file
, dir
, block
, &hinfo
,
1121 start_hash
, start_minor_hash
);
1128 ret
= ext4_htree_next_block(dir
, HASH_NB_ALWAYS
,
1129 frame
, frames
, &hashval
);
1130 *next_hash
= hashval
;
1136 * Stop if: (a) there are no more entries, or
1137 * (b) we have inserted at least one entry and the
1138 * next hash value is not a continuation
1141 (count
&& ((hashval
& 1) == 0)))
1145 dxtrace(printk(KERN_DEBUG
"Fill tree: returned %d entries, "
1146 "next hash: %x\n", count
, *next_hash
));
1153 static inline int search_dirblock(struct buffer_head
*bh
,
1155 struct ext4_filename
*fname
,
1156 const struct qstr
*d_name
,
1157 unsigned int offset
,
1158 struct ext4_dir_entry_2
**res_dir
)
1160 return ext4_search_dir(bh
, bh
->b_data
, dir
->i_sb
->s_blocksize
, dir
,
1161 fname
, d_name
, offset
, res_dir
);
1165 * Directory block splitting, compacting
1169 * Create map of hash values, offsets, and sizes, stored at end of block.
1170 * Returns number of entries mapped.
1172 static int dx_make_map(struct inode
*dir
, struct ext4_dir_entry_2
*de
,
1173 unsigned blocksize
, struct dx_hash_info
*hinfo
,
1174 struct dx_map_entry
*map_tail
)
1177 char *base
= (char *) de
;
1178 struct dx_hash_info h
= *hinfo
;
1180 while ((char *) de
< base
+ blocksize
) {
1181 if (de
->name_len
&& de
->inode
) {
1182 ext4fs_dirhash(de
->name
, de
->name_len
, &h
);
1184 map_tail
->hash
= h
.hash
;
1185 map_tail
->offs
= ((char *) de
- base
)>>2;
1186 map_tail
->size
= le16_to_cpu(de
->rec_len
);
1190 /* XXX: do we need to check rec_len == 0 case? -Chris */
1191 de
= ext4_next_entry(de
, blocksize
);
1196 /* Sort map by hash value */
1197 static void dx_sort_map (struct dx_map_entry
*map
, unsigned count
)
1199 struct dx_map_entry
*p
, *q
, *top
= map
+ count
- 1;
1201 /* Combsort until bubble sort doesn't suck */
1203 count
= count
*10/13;
1204 if (count
- 9 < 2) /* 9, 10 -> 11 */
1206 for (p
= top
, q
= p
- count
; q
>= map
; p
--, q
--)
1207 if (p
->hash
< q
->hash
)
1210 /* Garden variety bubble sort */
1215 if (q
[1].hash
>= q
[0].hash
)
1223 static void dx_insert_block(struct dx_frame
*frame
, u32 hash
, ext4_lblk_t block
)
1225 struct dx_entry
*entries
= frame
->entries
;
1226 struct dx_entry
*old
= frame
->at
, *new = old
+ 1;
1227 int count
= dx_get_count(entries
);
1229 assert(count
< dx_get_limit(entries
));
1230 assert(old
< entries
+ count
);
1231 memmove(new + 1, new, (char *)(entries
+ count
) - (char *)(new));
1232 dx_set_hash(new, hash
);
1233 dx_set_block(new, block
);
1234 dx_set_count(entries
, count
+ 1);
1238 * NOTE! unlike strncmp, ext4_match returns 1 for success, 0 for failure.
1240 * `len <= EXT4_NAME_LEN' is guaranteed by caller.
1241 * `de != NULL' is guaranteed by caller.
1243 static inline int ext4_match(struct ext4_filename
*fname
,
1244 struct ext4_dir_entry_2
*de
)
1246 const void *name
= fname_name(fname
);
1247 u32 len
= fname_len(fname
);
1252 #ifdef CONFIG_EXT4_FS_ENCRYPTION
1253 if (unlikely(!name
)) {
1254 if (fname
->usr_fname
->name
[0] == '_') {
1256 if (de
->name_len
< 16)
1258 ret
= memcmp(de
->name
+ de
->name_len
- 16,
1259 fname
->crypto_buf
.name
+ 8, 16);
1260 return (ret
== 0) ? 1 : 0;
1262 name
= fname
->crypto_buf
.name
;
1263 len
= fname
->crypto_buf
.len
;
1266 if (de
->name_len
!= len
)
1268 return (memcmp(de
->name
, name
, len
) == 0) ? 1 : 0;
1272 * Returns 0 if not found, -1 on failure, and 1 on success
1274 int ext4_search_dir(struct buffer_head
*bh
, char *search_buf
, int buf_size
,
1275 struct inode
*dir
, struct ext4_filename
*fname
,
1276 const struct qstr
*d_name
,
1277 unsigned int offset
, struct ext4_dir_entry_2
**res_dir
)
1279 struct ext4_dir_entry_2
* de
;
1284 de
= (struct ext4_dir_entry_2
*)search_buf
;
1285 dlimit
= search_buf
+ buf_size
;
1286 while ((char *) de
< dlimit
) {
1287 /* this code is executed quadratically often */
1288 /* do minimal checking `by hand' */
1289 if ((char *) de
+ de
->name_len
<= dlimit
) {
1290 res
= ext4_match(fname
, de
);
1296 /* found a match - just to be sure, do
1298 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
1300 bh
->b_size
, offset
)) {
1310 /* prevent looping on a bad block */
1311 de_len
= ext4_rec_len_from_disk(de
->rec_len
,
1312 dir
->i_sb
->s_blocksize
);
1318 de
= (struct ext4_dir_entry_2
*) ((char *) de
+ de_len
);
1326 static int is_dx_internal_node(struct inode
*dir
, ext4_lblk_t block
,
1327 struct ext4_dir_entry
*de
)
1329 struct super_block
*sb
= dir
->i_sb
;
1335 if (de
->inode
== 0 &&
1336 ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
) ==
1345 * finds an entry in the specified directory with the wanted name. It
1346 * returns the cache buffer in which the entry was found, and the entry
1347 * itself (as a parameter - res_dir). It does NOT read the inode of the
1348 * entry - you'll have to do that yourself if you want to.
1350 * The returned buffer_head has ->b_count elevated. The caller is expected
1351 * to brelse() it when appropriate.
1353 static struct buffer_head
* ext4_find_entry (struct inode
*dir
,
1354 const struct qstr
*d_name
,
1355 struct ext4_dir_entry_2
**res_dir
,
1358 struct super_block
*sb
;
1359 struct buffer_head
*bh_use
[NAMEI_RA_SIZE
];
1360 struct buffer_head
*bh
, *ret
= NULL
;
1361 ext4_lblk_t start
, block
, b
;
1362 const u8
*name
= d_name
->name
;
1363 int ra_max
= 0; /* Number of bh's in the readahead
1365 int ra_ptr
= 0; /* Current index into readahead
1368 ext4_lblk_t nblocks
;
1369 int i
, namelen
, retval
;
1370 struct ext4_filename fname
;
1374 namelen
= d_name
->len
;
1375 if (namelen
> EXT4_NAME_LEN
)
1378 retval
= ext4_fname_setup_filename(dir
, d_name
, 1, &fname
);
1380 return ERR_PTR(retval
);
1382 if (ext4_has_inline_data(dir
)) {
1383 int has_inline_data
= 1;
1384 ret
= ext4_find_inline_entry(dir
, &fname
, d_name
, res_dir
,
1386 if (has_inline_data
) {
1389 goto cleanup_and_exit
;
1393 if ((namelen
<= 2) && (name
[0] == '.') &&
1394 (name
[1] == '.' || name
[1] == '\0')) {
1396 * "." or ".." will only be in the first block
1397 * NFS may look up ".."; "." should be handled by the VFS
1404 ret
= ext4_dx_find_entry(dir
, &fname
, res_dir
);
1406 * On success, or if the error was file not found,
1407 * return. Otherwise, fall back to doing a search the
1408 * old fashioned way.
1410 if (!IS_ERR(ret
) || PTR_ERR(ret
) != ERR_BAD_DX_DIR
)
1411 goto cleanup_and_exit
;
1412 dxtrace(printk(KERN_DEBUG
"ext4_find_entry: dx failed, "
1415 nblocks
= dir
->i_size
>> EXT4_BLOCK_SIZE_BITS(sb
);
1416 start
= EXT4_I(dir
)->i_dir_start_lookup
;
1417 if (start
>= nblocks
)
1423 * We deal with the read-ahead logic here.
1425 if (ra_ptr
>= ra_max
) {
1426 /* Refill the readahead buffer */
1429 for (ra_max
= 0; ra_max
< NAMEI_RA_SIZE
; ra_max
++) {
1431 * Terminate if we reach the end of the
1432 * directory and must wrap, or if our
1433 * search has finished at this block.
1435 if (b
>= nblocks
|| (num
&& block
== start
)) {
1436 bh_use
[ra_max
] = NULL
;
1440 bh
= ext4_getblk(NULL
, dir
, b
++, 0);
1444 goto cleanup_and_exit
;
1448 bh_use
[ra_max
] = bh
;
1450 ll_rw_block(READ
| REQ_META
| REQ_PRIO
,
1454 if ((bh
= bh_use
[ra_ptr
++]) == NULL
)
1457 if (!buffer_uptodate(bh
)) {
1458 /* read error, skip block & hope for the best */
1459 EXT4_ERROR_INODE(dir
, "reading directory lblock %lu",
1460 (unsigned long) block
);
1464 if (!buffer_verified(bh
) &&
1465 !is_dx_internal_node(dir
, block
,
1466 (struct ext4_dir_entry
*)bh
->b_data
) &&
1467 !ext4_dirent_csum_verify(dir
,
1468 (struct ext4_dir_entry
*)bh
->b_data
)) {
1469 EXT4_ERROR_INODE(dir
, "checksumming directory "
1470 "block %lu", (unsigned long)block
);
1474 set_buffer_verified(bh
);
1475 i
= search_dirblock(bh
, dir
, &fname
, d_name
,
1476 block
<< EXT4_BLOCK_SIZE_BITS(sb
), res_dir
);
1478 EXT4_I(dir
)->i_dir_start_lookup
= block
;
1480 goto cleanup_and_exit
;
1484 goto cleanup_and_exit
;
1487 if (++block
>= nblocks
)
1489 } while (block
!= start
);
1492 * If the directory has grown while we were searching, then
1493 * search the last part of the directory before giving up.
1496 nblocks
= dir
->i_size
>> EXT4_BLOCK_SIZE_BITS(sb
);
1497 if (block
< nblocks
) {
1503 /* Clean up the read-ahead blocks */
1504 for (; ra_ptr
< ra_max
; ra_ptr
++)
1505 brelse(bh_use
[ra_ptr
]);
1506 ext4_fname_free_filename(&fname
);
1510 static struct buffer_head
* ext4_dx_find_entry(struct inode
*dir
,
1511 struct ext4_filename
*fname
,
1512 struct ext4_dir_entry_2
**res_dir
)
1514 struct super_block
* sb
= dir
->i_sb
;
1515 struct dx_frame frames
[2], *frame
;
1516 const struct qstr
*d_name
= fname
->usr_fname
;
1517 struct buffer_head
*bh
;
1521 #ifdef CONFIG_EXT4_FS_ENCRYPTION
1524 frame
= dx_probe(fname
, dir
, NULL
, frames
);
1526 return (struct buffer_head
*) frame
;
1528 block
= dx_get_block(frame
->at
);
1529 bh
= ext4_read_dirblock(dir
, block
, DIRENT
);
1533 retval
= search_dirblock(bh
, dir
, fname
, d_name
,
1534 block
<< EXT4_BLOCK_SIZE_BITS(sb
),
1540 bh
= ERR_PTR(ERR_BAD_DX_DIR
);
1544 /* Check to see if we should continue to search */
1545 retval
= ext4_htree_next_block(dir
, fname
->hinfo
.hash
, frame
,
1548 ext4_warning_inode(dir
,
1549 "error %d reading directory index block",
1551 bh
= ERR_PTR(retval
);
1554 } while (retval
== 1);
1558 dxtrace(printk(KERN_DEBUG
"%s not found\n", d_name
->name
));
1564 static struct dentry
*ext4_lookup(struct inode
*dir
, struct dentry
*dentry
, unsigned int flags
)
1566 struct inode
*inode
;
1567 struct ext4_dir_entry_2
*de
;
1568 struct buffer_head
*bh
;
1570 if (ext4_encrypted_inode(dir
)) {
1571 int res
= fscrypt_get_encryption_info(dir
);
1574 * DCACHE_ENCRYPTED_WITH_KEY is set if the dentry is
1575 * created while the directory was encrypted and we
1576 * have access to the key.
1578 if (fscrypt_has_encryption_key(dir
))
1579 fscrypt_set_encrypted_dentry(dentry
);
1580 fscrypt_set_d_op(dentry
);
1581 if (res
&& res
!= -ENOKEY
)
1582 return ERR_PTR(res
);
1585 if (dentry
->d_name
.len
> EXT4_NAME_LEN
)
1586 return ERR_PTR(-ENAMETOOLONG
);
1588 bh
= ext4_find_entry(dir
, &dentry
->d_name
, &de
, NULL
);
1590 return (struct dentry
*) bh
;
1593 __u32 ino
= le32_to_cpu(de
->inode
);
1595 if (!ext4_valid_inum(dir
->i_sb
, ino
)) {
1596 EXT4_ERROR_INODE(dir
, "bad inode number: %u", ino
);
1597 return ERR_PTR(-EFSCORRUPTED
);
1599 if (unlikely(ino
== dir
->i_ino
)) {
1600 EXT4_ERROR_INODE(dir
, "'%pd' linked to parent dir",
1602 return ERR_PTR(-EFSCORRUPTED
);
1604 inode
= ext4_iget_normal(dir
->i_sb
, ino
);
1605 if (inode
== ERR_PTR(-ESTALE
)) {
1606 EXT4_ERROR_INODE(dir
,
1607 "deleted inode referenced: %u",
1609 return ERR_PTR(-EFSCORRUPTED
);
1611 if (!IS_ERR(inode
) && ext4_encrypted_inode(dir
) &&
1612 (S_ISDIR(inode
->i_mode
) || S_ISLNK(inode
->i_mode
)) &&
1613 !fscrypt_has_permitted_context(dir
, inode
)) {
1614 int nokey
= ext4_encrypted_inode(inode
) &&
1615 !fscrypt_has_encryption_key(inode
);
1618 return ERR_PTR(-ENOKEY
);
1619 ext4_warning(inode
->i_sb
,
1620 "Inconsistent encryption contexts: %lu/%lu",
1621 (unsigned long) dir
->i_ino
,
1622 (unsigned long) inode
->i_ino
);
1623 return ERR_PTR(-EPERM
);
1626 return d_splice_alias(inode
, dentry
);
1630 struct dentry
*ext4_get_parent(struct dentry
*child
)
1633 static const struct qstr dotdot
= QSTR_INIT("..", 2);
1634 struct ext4_dir_entry_2
* de
;
1635 struct buffer_head
*bh
;
1637 bh
= ext4_find_entry(d_inode(child
), &dotdot
, &de
, NULL
);
1639 return (struct dentry
*) bh
;
1641 return ERR_PTR(-ENOENT
);
1642 ino
= le32_to_cpu(de
->inode
);
1645 if (!ext4_valid_inum(child
->d_sb
, ino
)) {
1646 EXT4_ERROR_INODE(d_inode(child
),
1647 "bad parent inode number: %u", ino
);
1648 return ERR_PTR(-EFSCORRUPTED
);
1651 return d_obtain_alias(ext4_iget_normal(child
->d_sb
, ino
));
1655 * Move count entries from end of map between two memory locations.
1656 * Returns pointer to last entry moved.
1658 static struct ext4_dir_entry_2
*
1659 dx_move_dirents(char *from
, char *to
, struct dx_map_entry
*map
, int count
,
1662 unsigned rec_len
= 0;
1665 struct ext4_dir_entry_2
*de
= (struct ext4_dir_entry_2
*)
1666 (from
+ (map
->offs
<<2));
1667 rec_len
= EXT4_DIR_REC_LEN(de
->name_len
);
1668 memcpy (to
, de
, rec_len
);
1669 ((struct ext4_dir_entry_2
*) to
)->rec_len
=
1670 ext4_rec_len_to_disk(rec_len
, blocksize
);
1675 return (struct ext4_dir_entry_2
*) (to
- rec_len
);
1679 * Compact each dir entry in the range to the minimal rec_len.
1680 * Returns pointer to last entry in range.
1682 static struct ext4_dir_entry_2
* dx_pack_dirents(char *base
, unsigned blocksize
)
1684 struct ext4_dir_entry_2
*next
, *to
, *prev
, *de
= (struct ext4_dir_entry_2
*) base
;
1685 unsigned rec_len
= 0;
1688 while ((char*)de
< base
+ blocksize
) {
1689 next
= ext4_next_entry(de
, blocksize
);
1690 if (de
->inode
&& de
->name_len
) {
1691 rec_len
= EXT4_DIR_REC_LEN(de
->name_len
);
1693 memmove(to
, de
, rec_len
);
1694 to
->rec_len
= ext4_rec_len_to_disk(rec_len
, blocksize
);
1696 to
= (struct ext4_dir_entry_2
*) (((char *) to
) + rec_len
);
1704 * Split a full leaf block to make room for a new dir entry.
1705 * Allocate a new block, and move entries so that they are approx. equally full.
1706 * Returns pointer to de in block into which the new entry will be inserted.
1708 static struct ext4_dir_entry_2
*do_split(handle_t
*handle
, struct inode
*dir
,
1709 struct buffer_head
**bh
,struct dx_frame
*frame
,
1710 struct dx_hash_info
*hinfo
)
1712 unsigned blocksize
= dir
->i_sb
->s_blocksize
;
1713 unsigned count
, continued
;
1714 struct buffer_head
*bh2
;
1715 ext4_lblk_t newblock
;
1717 struct dx_map_entry
*map
;
1718 char *data1
= (*bh
)->b_data
, *data2
;
1719 unsigned split
, move
, size
;
1720 struct ext4_dir_entry_2
*de
= NULL
, *de2
;
1721 struct ext4_dir_entry_tail
*t
;
1725 if (ext4_has_metadata_csum(dir
->i_sb
))
1726 csum_size
= sizeof(struct ext4_dir_entry_tail
);
1728 bh2
= ext4_append(handle
, dir
, &newblock
);
1732 return (struct ext4_dir_entry_2
*) bh2
;
1735 BUFFER_TRACE(*bh
, "get_write_access");
1736 err
= ext4_journal_get_write_access(handle
, *bh
);
1740 BUFFER_TRACE(frame
->bh
, "get_write_access");
1741 err
= ext4_journal_get_write_access(handle
, frame
->bh
);
1745 data2
= bh2
->b_data
;
1747 /* create map in the end of data2 block */
1748 map
= (struct dx_map_entry
*) (data2
+ blocksize
);
1749 count
= dx_make_map(dir
, (struct ext4_dir_entry_2
*) data1
,
1750 blocksize
, hinfo
, map
);
1752 dx_sort_map(map
, count
);
1753 /* Split the existing block in the middle, size-wise */
1756 for (i
= count
-1; i
>= 0; i
--) {
1757 /* is more than half of this entry in 2nd half of the block? */
1758 if (size
+ map
[i
].size
/2 > blocksize
/2)
1760 size
+= map
[i
].size
;
1763 /* map index at which we will split */
1764 split
= count
- move
;
1765 hash2
= map
[split
].hash
;
1766 continued
= hash2
== map
[split
- 1].hash
;
1767 dxtrace(printk(KERN_INFO
"Split block %lu at %x, %i/%i\n",
1768 (unsigned long)dx_get_block(frame
->at
),
1769 hash2
, split
, count
-split
));
1771 /* Fancy dance to stay within two buffers */
1772 de2
= dx_move_dirents(data1
, data2
, map
+ split
, count
- split
,
1774 de
= dx_pack_dirents(data1
, blocksize
);
1775 de
->rec_len
= ext4_rec_len_to_disk(data1
+ (blocksize
- csum_size
) -
1778 de2
->rec_len
= ext4_rec_len_to_disk(data2
+ (blocksize
- csum_size
) -
1782 t
= EXT4_DIRENT_TAIL(data2
, blocksize
);
1783 initialize_dirent_tail(t
, blocksize
);
1785 t
= EXT4_DIRENT_TAIL(data1
, blocksize
);
1786 initialize_dirent_tail(t
, blocksize
);
1789 dxtrace(dx_show_leaf(dir
, hinfo
, (struct ext4_dir_entry_2
*) data1
,
1791 dxtrace(dx_show_leaf(dir
, hinfo
, (struct ext4_dir_entry_2
*) data2
,
1794 /* Which block gets the new entry? */
1795 if (hinfo
->hash
>= hash2
) {
1799 dx_insert_block(frame
, hash2
+ continued
, newblock
);
1800 err
= ext4_handle_dirty_dirent_node(handle
, dir
, bh2
);
1803 err
= ext4_handle_dirty_dx_node(handle
, dir
, frame
->bh
);
1807 dxtrace(dx_show_index("frame", frame
->entries
));
1814 ext4_std_error(dir
->i_sb
, err
);
1815 return ERR_PTR(err
);
1818 int ext4_find_dest_de(struct inode
*dir
, struct inode
*inode
,
1819 struct buffer_head
*bh
,
1820 void *buf
, int buf_size
,
1821 struct ext4_filename
*fname
,
1822 struct ext4_dir_entry_2
**dest_de
)
1824 struct ext4_dir_entry_2
*de
;
1825 unsigned short reclen
= EXT4_DIR_REC_LEN(fname_len(fname
));
1827 unsigned int offset
= 0;
1831 de
= (struct ext4_dir_entry_2
*)buf
;
1832 top
= buf
+ buf_size
- reclen
;
1833 while ((char *) de
<= top
) {
1834 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
1835 buf
, buf_size
, offset
)) {
1836 res
= -EFSCORRUPTED
;
1839 /* Provide crypto context and crypto buffer to ext4 match */
1840 res
= ext4_match(fname
, de
);
1847 nlen
= EXT4_DIR_REC_LEN(de
->name_len
);
1848 rlen
= ext4_rec_len_from_disk(de
->rec_len
, buf_size
);
1849 if ((de
->inode
? rlen
- nlen
: rlen
) >= reclen
)
1851 de
= (struct ext4_dir_entry_2
*)((char *)de
+ rlen
);
1855 if ((char *) de
> top
)
1865 int ext4_insert_dentry(struct inode
*dir
,
1866 struct inode
*inode
,
1867 struct ext4_dir_entry_2
*de
,
1869 struct ext4_filename
*fname
)
1874 nlen
= EXT4_DIR_REC_LEN(de
->name_len
);
1875 rlen
= ext4_rec_len_from_disk(de
->rec_len
, buf_size
);
1877 struct ext4_dir_entry_2
*de1
=
1878 (struct ext4_dir_entry_2
*)((char *)de
+ nlen
);
1879 de1
->rec_len
= ext4_rec_len_to_disk(rlen
- nlen
, buf_size
);
1880 de
->rec_len
= ext4_rec_len_to_disk(nlen
, buf_size
);
1883 de
->file_type
= EXT4_FT_UNKNOWN
;
1884 de
->inode
= cpu_to_le32(inode
->i_ino
);
1885 ext4_set_de_type(inode
->i_sb
, de
, inode
->i_mode
);
1886 de
->name_len
= fname_len(fname
);
1887 memcpy(de
->name
, fname_name(fname
), fname_len(fname
));
1892 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1893 * it points to a directory entry which is guaranteed to be large
1894 * enough for new directory entry. If de is NULL, then
1895 * add_dirent_to_buf will attempt search the directory block for
1896 * space. It will return -ENOSPC if no space is available, and -EIO
1897 * and -EEXIST if directory entry already exists.
1899 static int add_dirent_to_buf(handle_t
*handle
, struct ext4_filename
*fname
,
1901 struct inode
*inode
, struct ext4_dir_entry_2
*de
,
1902 struct buffer_head
*bh
)
1904 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
1908 if (ext4_has_metadata_csum(inode
->i_sb
))
1909 csum_size
= sizeof(struct ext4_dir_entry_tail
);
1912 err
= ext4_find_dest_de(dir
, inode
, bh
, bh
->b_data
,
1913 blocksize
- csum_size
, fname
, &de
);
1917 BUFFER_TRACE(bh
, "get_write_access");
1918 err
= ext4_journal_get_write_access(handle
, bh
);
1920 ext4_std_error(dir
->i_sb
, err
);
1924 /* By now the buffer is marked for journaling. Due to crypto operations,
1925 * the following function call may fail */
1926 err
= ext4_insert_dentry(dir
, inode
, de
, blocksize
, fname
);
1931 * XXX shouldn't update any times until successful
1932 * completion of syscall, but too many callers depend
1935 * XXX similarly, too many callers depend on
1936 * ext4_new_inode() setting the times, but error
1937 * recovery deletes the inode, so the worst that can
1938 * happen is that the times are slightly out of date
1939 * and/or different from the directory change time.
1941 dir
->i_mtime
= dir
->i_ctime
= ext4_current_time(dir
);
1942 ext4_update_dx_flag(dir
);
1944 ext4_mark_inode_dirty(handle
, dir
);
1945 BUFFER_TRACE(bh
, "call ext4_handle_dirty_metadata");
1946 err
= ext4_handle_dirty_dirent_node(handle
, dir
, bh
);
1948 ext4_std_error(dir
->i_sb
, err
);
1953 * This converts a one block unindexed directory to a 3 block indexed
1954 * directory, and adds the dentry to the indexed directory.
1956 static int make_indexed_dir(handle_t
*handle
, struct ext4_filename
*fname
,
1958 struct inode
*inode
, struct buffer_head
*bh
)
1960 struct buffer_head
*bh2
;
1961 struct dx_root
*root
;
1962 struct dx_frame frames
[2], *frame
;
1963 struct dx_entry
*entries
;
1964 struct ext4_dir_entry_2
*de
, *de2
;
1965 struct ext4_dir_entry_tail
*t
;
1971 struct fake_dirent
*fde
;
1974 if (ext4_has_metadata_csum(inode
->i_sb
))
1975 csum_size
= sizeof(struct ext4_dir_entry_tail
);
1977 blocksize
= dir
->i_sb
->s_blocksize
;
1978 dxtrace(printk(KERN_DEBUG
"Creating index: inode %lu\n", dir
->i_ino
));
1979 BUFFER_TRACE(bh
, "get_write_access");
1980 retval
= ext4_journal_get_write_access(handle
, bh
);
1982 ext4_std_error(dir
->i_sb
, retval
);
1986 root
= (struct dx_root
*) bh
->b_data
;
1988 /* The 0th block becomes the root, move the dirents out */
1989 fde
= &root
->dotdot
;
1990 de
= (struct ext4_dir_entry_2
*)((char *)fde
+
1991 ext4_rec_len_from_disk(fde
->rec_len
, blocksize
));
1992 if ((char *) de
>= (((char *) root
) + blocksize
)) {
1993 EXT4_ERROR_INODE(dir
, "invalid rec_len for '..'");
1995 return -EFSCORRUPTED
;
1997 len
= ((char *) root
) + (blocksize
- csum_size
) - (char *) de
;
1999 /* Allocate new block for the 0th block's dirents */
2000 bh2
= ext4_append(handle
, dir
, &block
);
2003 return PTR_ERR(bh2
);
2005 ext4_set_inode_flag(dir
, EXT4_INODE_INDEX
);
2006 data1
= bh2
->b_data
;
2008 memcpy (data1
, de
, len
);
2009 de
= (struct ext4_dir_entry_2
*) data1
;
2011 while ((char *)(de2
= ext4_next_entry(de
, blocksize
)) < top
)
2013 de
->rec_len
= ext4_rec_len_to_disk(data1
+ (blocksize
- csum_size
) -
2018 t
= EXT4_DIRENT_TAIL(data1
, blocksize
);
2019 initialize_dirent_tail(t
, blocksize
);
2022 /* Initialize the root; the dot dirents already exist */
2023 de
= (struct ext4_dir_entry_2
*) (&root
->dotdot
);
2024 de
->rec_len
= ext4_rec_len_to_disk(blocksize
- EXT4_DIR_REC_LEN(2),
2026 memset (&root
->info
, 0, sizeof(root
->info
));
2027 root
->info
.info_length
= sizeof(root
->info
);
2028 root
->info
.hash_version
= EXT4_SB(dir
->i_sb
)->s_def_hash_version
;
2029 entries
= root
->entries
;
2030 dx_set_block(entries
, 1);
2031 dx_set_count(entries
, 1);
2032 dx_set_limit(entries
, dx_root_limit(dir
, sizeof(root
->info
)));
2034 /* Initialize as for dx_probe */
2035 fname
->hinfo
.hash_version
= root
->info
.hash_version
;
2036 if (fname
->hinfo
.hash_version
<= DX_HASH_TEA
)
2037 fname
->hinfo
.hash_version
+= EXT4_SB(dir
->i_sb
)->s_hash_unsigned
;
2038 fname
->hinfo
.seed
= EXT4_SB(dir
->i_sb
)->s_hash_seed
;
2039 ext4fs_dirhash(fname_name(fname
), fname_len(fname
), &fname
->hinfo
);
2041 memset(frames
, 0, sizeof(frames
));
2043 frame
->entries
= entries
;
2044 frame
->at
= entries
;
2048 retval
= ext4_handle_dirty_dx_node(handle
, dir
, frame
->bh
);
2051 retval
= ext4_handle_dirty_dirent_node(handle
, dir
, bh
);
2055 de
= do_split(handle
,dir
, &bh
, frame
, &fname
->hinfo
);
2057 retval
= PTR_ERR(de
);
2062 retval
= add_dirent_to_buf(handle
, fname
, dir
, inode
, de
, bh
);
2067 * Even if the block split failed, we have to properly write
2068 * out all the changes we did so far. Otherwise we can end up
2069 * with corrupted filesystem.
2071 ext4_mark_inode_dirty(handle
, dir
);
2079 * adds a file entry to the specified directory, using the same
2080 * semantics as ext4_find_entry(). It returns NULL if it failed.
2082 * NOTE!! The inode part of 'de' is left at 0 - which means you
2083 * may not sleep between calling this and putting something into
2084 * the entry, as someone else might have used it while you slept.
2086 static int ext4_add_entry(handle_t
*handle
, struct dentry
*dentry
,
2087 struct inode
*inode
)
2089 struct inode
*dir
= d_inode(dentry
->d_parent
);
2090 struct buffer_head
*bh
= NULL
;
2091 struct ext4_dir_entry_2
*de
;
2092 struct ext4_dir_entry_tail
*t
;
2093 struct super_block
*sb
;
2094 struct ext4_filename fname
;
2098 ext4_lblk_t block
, blocks
;
2101 if (ext4_has_metadata_csum(inode
->i_sb
))
2102 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2105 blocksize
= sb
->s_blocksize
;
2106 if (!dentry
->d_name
.len
)
2109 retval
= ext4_fname_setup_filename(dir
, &dentry
->d_name
, 0, &fname
);
2113 if (ext4_has_inline_data(dir
)) {
2114 retval
= ext4_try_add_inline_entry(handle
, &fname
, dir
, inode
);
2124 retval
= ext4_dx_add_entry(handle
, &fname
, dir
, inode
);
2125 if (!retval
|| (retval
!= ERR_BAD_DX_DIR
))
2127 ext4_clear_inode_flag(dir
, EXT4_INODE_INDEX
);
2129 ext4_mark_inode_dirty(handle
, dir
);
2131 blocks
= dir
->i_size
>> sb
->s_blocksize_bits
;
2132 for (block
= 0; block
< blocks
; block
++) {
2133 bh
= ext4_read_dirblock(dir
, block
, DIRENT
);
2135 retval
= PTR_ERR(bh
);
2139 retval
= add_dirent_to_buf(handle
, &fname
, dir
, inode
,
2141 if (retval
!= -ENOSPC
)
2144 if (blocks
== 1 && !dx_fallback
&&
2145 ext4_has_feature_dir_index(sb
)) {
2146 retval
= make_indexed_dir(handle
, &fname
, dir
,
2148 bh
= NULL
; /* make_indexed_dir releases bh */
2153 bh
= ext4_append(handle
, dir
, &block
);
2155 retval
= PTR_ERR(bh
);
2159 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
2161 de
->rec_len
= ext4_rec_len_to_disk(blocksize
- csum_size
, blocksize
);
2164 t
= EXT4_DIRENT_TAIL(bh
->b_data
, blocksize
);
2165 initialize_dirent_tail(t
, blocksize
);
2168 retval
= add_dirent_to_buf(handle
, &fname
, dir
, inode
, de
, bh
);
2170 ext4_fname_free_filename(&fname
);
2173 ext4_set_inode_state(inode
, EXT4_STATE_NEWENTRY
);
2178 * Returns 0 for success, or a negative error value
2180 static int ext4_dx_add_entry(handle_t
*handle
, struct ext4_filename
*fname
,
2181 struct inode
*dir
, struct inode
*inode
)
2183 struct dx_frame frames
[2], *frame
;
2184 struct dx_entry
*entries
, *at
;
2185 struct buffer_head
*bh
;
2186 struct super_block
*sb
= dir
->i_sb
;
2187 struct ext4_dir_entry_2
*de
;
2190 frame
= dx_probe(fname
, dir
, NULL
, frames
);
2192 return PTR_ERR(frame
);
2193 entries
= frame
->entries
;
2195 bh
= ext4_read_dirblock(dir
, dx_get_block(frame
->at
), DIRENT
);
2202 BUFFER_TRACE(bh
, "get_write_access");
2203 err
= ext4_journal_get_write_access(handle
, bh
);
2207 err
= add_dirent_to_buf(handle
, fname
, dir
, inode
, NULL
, bh
);
2211 /* Block full, should compress but for now just split */
2212 dxtrace(printk(KERN_DEBUG
"using %u of %u node entries\n",
2213 dx_get_count(entries
), dx_get_limit(entries
)));
2214 /* Need to split index? */
2215 if (dx_get_count(entries
) == dx_get_limit(entries
)) {
2216 ext4_lblk_t newblock
;
2217 unsigned icount
= dx_get_count(entries
);
2218 int levels
= frame
- frames
;
2219 struct dx_entry
*entries2
;
2220 struct dx_node
*node2
;
2221 struct buffer_head
*bh2
;
2223 if (levels
&& (dx_get_count(frames
->entries
) ==
2224 dx_get_limit(frames
->entries
))) {
2225 ext4_warning_inode(dir
, "Directory index full!");
2229 bh2
= ext4_append(handle
, dir
, &newblock
);
2234 node2
= (struct dx_node
*)(bh2
->b_data
);
2235 entries2
= node2
->entries
;
2236 memset(&node2
->fake
, 0, sizeof(struct fake_dirent
));
2237 node2
->fake
.rec_len
= ext4_rec_len_to_disk(sb
->s_blocksize
,
2239 BUFFER_TRACE(frame
->bh
, "get_write_access");
2240 err
= ext4_journal_get_write_access(handle
, frame
->bh
);
2244 unsigned icount1
= icount
/2, icount2
= icount
- icount1
;
2245 unsigned hash2
= dx_get_hash(entries
+ icount1
);
2246 dxtrace(printk(KERN_DEBUG
"Split index %i/%i\n",
2249 BUFFER_TRACE(frame
->bh
, "get_write_access"); /* index root */
2250 err
= ext4_journal_get_write_access(handle
,
2255 memcpy((char *) entries2
, (char *) (entries
+ icount1
),
2256 icount2
* sizeof(struct dx_entry
));
2257 dx_set_count(entries
, icount1
);
2258 dx_set_count(entries2
, icount2
);
2259 dx_set_limit(entries2
, dx_node_limit(dir
));
2261 /* Which index block gets the new entry? */
2262 if (at
- entries
>= icount1
) {
2263 frame
->at
= at
= at
- entries
- icount1
+ entries2
;
2264 frame
->entries
= entries
= entries2
;
2265 swap(frame
->bh
, bh2
);
2267 dx_insert_block(frames
+ 0, hash2
, newblock
);
2268 dxtrace(dx_show_index("node", frames
[1].entries
));
2269 dxtrace(dx_show_index("node",
2270 ((struct dx_node
*) bh2
->b_data
)->entries
));
2271 err
= ext4_handle_dirty_dx_node(handle
, dir
, bh2
);
2276 dxtrace(printk(KERN_DEBUG
2277 "Creating second level index...\n"));
2278 memcpy((char *) entries2
, (char *) entries
,
2279 icount
* sizeof(struct dx_entry
));
2280 dx_set_limit(entries2
, dx_node_limit(dir
));
2283 dx_set_count(entries
, 1);
2284 dx_set_block(entries
+ 0, newblock
);
2285 ((struct dx_root
*) frames
[0].bh
->b_data
)->info
.indirect_levels
= 1;
2287 /* Add new access path frame */
2289 frame
->at
= at
= at
- entries
+ entries2
;
2290 frame
->entries
= entries
= entries2
;
2292 err
= ext4_journal_get_write_access(handle
,
2297 err
= ext4_handle_dirty_dx_node(handle
, dir
, frames
[0].bh
);
2299 ext4_std_error(inode
->i_sb
, err
);
2303 de
= do_split(handle
, dir
, &bh
, frame
, &fname
->hinfo
);
2308 err
= add_dirent_to_buf(handle
, fname
, dir
, inode
, de
, bh
);
2312 ext4_std_error(dir
->i_sb
, err
);
2320 * ext4_generic_delete_entry deletes a directory entry by merging it
2321 * with the previous entry
2323 int ext4_generic_delete_entry(handle_t
*handle
,
2325 struct ext4_dir_entry_2
*de_del
,
2326 struct buffer_head
*bh
,
2331 struct ext4_dir_entry_2
*de
, *pde
;
2332 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
2337 de
= (struct ext4_dir_entry_2
*)entry_buf
;
2338 while (i
< buf_size
- csum_size
) {
2339 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
2340 bh
->b_data
, bh
->b_size
, i
))
2341 return -EFSCORRUPTED
;
2344 pde
->rec_len
= ext4_rec_len_to_disk(
2345 ext4_rec_len_from_disk(pde
->rec_len
,
2347 ext4_rec_len_from_disk(de
->rec_len
,
2355 i
+= ext4_rec_len_from_disk(de
->rec_len
, blocksize
);
2357 de
= ext4_next_entry(de
, blocksize
);
2362 static int ext4_delete_entry(handle_t
*handle
,
2364 struct ext4_dir_entry_2
*de_del
,
2365 struct buffer_head
*bh
)
2367 int err
, csum_size
= 0;
2369 if (ext4_has_inline_data(dir
)) {
2370 int has_inline_data
= 1;
2371 err
= ext4_delete_inline_entry(handle
, dir
, de_del
, bh
,
2373 if (has_inline_data
)
2377 if (ext4_has_metadata_csum(dir
->i_sb
))
2378 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2380 BUFFER_TRACE(bh
, "get_write_access");
2381 err
= ext4_journal_get_write_access(handle
, bh
);
2385 err
= ext4_generic_delete_entry(handle
, dir
, de_del
,
2387 dir
->i_sb
->s_blocksize
, csum_size
);
2391 BUFFER_TRACE(bh
, "call ext4_handle_dirty_metadata");
2392 err
= ext4_handle_dirty_dirent_node(handle
, dir
, bh
);
2399 ext4_std_error(dir
->i_sb
, err
);
2404 * DIR_NLINK feature is set if 1) nlinks > EXT4_LINK_MAX or 2) nlinks == 2,
2405 * since this indicates that nlinks count was previously 1.
2407 static void ext4_inc_count(handle_t
*handle
, struct inode
*inode
)
2410 if (is_dx(inode
) && inode
->i_nlink
> 1) {
2411 /* limit is 16-bit i_links_count */
2412 if (inode
->i_nlink
>= EXT4_LINK_MAX
|| inode
->i_nlink
== 2) {
2413 set_nlink(inode
, 1);
2414 ext4_set_feature_dir_nlink(inode
->i_sb
);
2420 * If a directory had nlink == 1, then we should let it be 1. This indicates
2421 * directory has >EXT4_LINK_MAX subdirs.
2423 static void ext4_dec_count(handle_t
*handle
, struct inode
*inode
)
2425 if (!S_ISDIR(inode
->i_mode
) || inode
->i_nlink
> 2)
2430 static int ext4_add_nondir(handle_t
*handle
,
2431 struct dentry
*dentry
, struct inode
*inode
)
2433 int err
= ext4_add_entry(handle
, dentry
, inode
);
2435 ext4_mark_inode_dirty(handle
, inode
);
2436 unlock_new_inode(inode
);
2437 d_instantiate(dentry
, inode
);
2441 unlock_new_inode(inode
);
2447 * By the time this is called, we already have created
2448 * the directory cache entry for the new file, but it
2449 * is so far negative - it has no inode.
2451 * If the create succeeds, we fill in the inode information
2452 * with d_instantiate().
2454 static int ext4_create(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
,
2458 struct inode
*inode
;
2459 int err
, credits
, retries
= 0;
2461 err
= dquot_initialize(dir
);
2465 credits
= (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
2466 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3);
2468 inode
= ext4_new_inode_start_handle(dir
, mode
, &dentry
->d_name
, 0,
2469 NULL
, EXT4_HT_DIR
, credits
);
2470 handle
= ext4_journal_current_handle();
2471 err
= PTR_ERR(inode
);
2472 if (!IS_ERR(inode
)) {
2473 inode
->i_op
= &ext4_file_inode_operations
;
2474 inode
->i_fop
= &ext4_file_operations
;
2475 ext4_set_aops(inode
);
2476 err
= ext4_add_nondir(handle
, dentry
, inode
);
2477 if (!err
&& IS_DIRSYNC(dir
))
2478 ext4_handle_sync(handle
);
2481 ext4_journal_stop(handle
);
2482 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2487 static int ext4_mknod(struct inode
*dir
, struct dentry
*dentry
,
2488 umode_t mode
, dev_t rdev
)
2491 struct inode
*inode
;
2492 int err
, credits
, retries
= 0;
2494 err
= dquot_initialize(dir
);
2498 credits
= (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
2499 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3);
2501 inode
= ext4_new_inode_start_handle(dir
, mode
, &dentry
->d_name
, 0,
2502 NULL
, EXT4_HT_DIR
, credits
);
2503 handle
= ext4_journal_current_handle();
2504 err
= PTR_ERR(inode
);
2505 if (!IS_ERR(inode
)) {
2506 init_special_inode(inode
, inode
->i_mode
, rdev
);
2507 inode
->i_op
= &ext4_special_inode_operations
;
2508 err
= ext4_add_nondir(handle
, dentry
, inode
);
2509 if (!err
&& IS_DIRSYNC(dir
))
2510 ext4_handle_sync(handle
);
2513 ext4_journal_stop(handle
);
2514 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2519 static int ext4_tmpfile(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
2522 struct inode
*inode
;
2523 int err
, retries
= 0;
2525 err
= dquot_initialize(dir
);
2530 inode
= ext4_new_inode_start_handle(dir
, mode
,
2533 EXT4_MAXQUOTAS_INIT_BLOCKS(dir
->i_sb
) +
2534 4 + EXT4_XATTR_TRANS_BLOCKS
);
2535 handle
= ext4_journal_current_handle();
2536 err
= PTR_ERR(inode
);
2537 if (!IS_ERR(inode
)) {
2538 inode
->i_op
= &ext4_file_inode_operations
;
2539 inode
->i_fop
= &ext4_file_operations
;
2540 ext4_set_aops(inode
);
2541 d_tmpfile(dentry
, inode
);
2542 err
= ext4_orphan_add(handle
, inode
);
2544 goto err_unlock_inode
;
2545 mark_inode_dirty(inode
);
2546 unlock_new_inode(inode
);
2549 ext4_journal_stop(handle
);
2550 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2554 ext4_journal_stop(handle
);
2555 unlock_new_inode(inode
);
2559 struct ext4_dir_entry_2
*ext4_init_dot_dotdot(struct inode
*inode
,
2560 struct ext4_dir_entry_2
*de
,
2561 int blocksize
, int csum_size
,
2562 unsigned int parent_ino
, int dotdot_real_len
)
2564 de
->inode
= cpu_to_le32(inode
->i_ino
);
2566 de
->rec_len
= ext4_rec_len_to_disk(EXT4_DIR_REC_LEN(de
->name_len
),
2568 strcpy(de
->name
, ".");
2569 ext4_set_de_type(inode
->i_sb
, de
, S_IFDIR
);
2571 de
= ext4_next_entry(de
, blocksize
);
2572 de
->inode
= cpu_to_le32(parent_ino
);
2574 if (!dotdot_real_len
)
2575 de
->rec_len
= ext4_rec_len_to_disk(blocksize
-
2576 (csum_size
+ EXT4_DIR_REC_LEN(1)),
2579 de
->rec_len
= ext4_rec_len_to_disk(
2580 EXT4_DIR_REC_LEN(de
->name_len
), blocksize
);
2581 strcpy(de
->name
, "..");
2582 ext4_set_de_type(inode
->i_sb
, de
, S_IFDIR
);
2584 return ext4_next_entry(de
, blocksize
);
2587 static int ext4_init_new_dir(handle_t
*handle
, struct inode
*dir
,
2588 struct inode
*inode
)
2590 struct buffer_head
*dir_block
= NULL
;
2591 struct ext4_dir_entry_2
*de
;
2592 struct ext4_dir_entry_tail
*t
;
2593 ext4_lblk_t block
= 0;
2594 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
2598 if (ext4_has_metadata_csum(dir
->i_sb
))
2599 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2601 if (ext4_test_inode_state(inode
, EXT4_STATE_MAY_INLINE_DATA
)) {
2602 err
= ext4_try_create_inline_dir(handle
, dir
, inode
);
2603 if (err
< 0 && err
!= -ENOSPC
)
2610 dir_block
= ext4_append(handle
, inode
, &block
);
2611 if (IS_ERR(dir_block
))
2612 return PTR_ERR(dir_block
);
2613 de
= (struct ext4_dir_entry_2
*)dir_block
->b_data
;
2614 ext4_init_dot_dotdot(inode
, de
, blocksize
, csum_size
, dir
->i_ino
, 0);
2615 set_nlink(inode
, 2);
2617 t
= EXT4_DIRENT_TAIL(dir_block
->b_data
, blocksize
);
2618 initialize_dirent_tail(t
, blocksize
);
2621 BUFFER_TRACE(dir_block
, "call ext4_handle_dirty_metadata");
2622 err
= ext4_handle_dirty_dirent_node(handle
, inode
, dir_block
);
2625 set_buffer_verified(dir_block
);
2631 static int ext4_mkdir(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
2634 struct inode
*inode
;
2635 int err
, credits
, retries
= 0;
2637 if (EXT4_DIR_LINK_MAX(dir
))
2640 err
= dquot_initialize(dir
);
2644 credits
= (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
2645 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3);
2647 inode
= ext4_new_inode_start_handle(dir
, S_IFDIR
| mode
,
2649 0, NULL
, EXT4_HT_DIR
, credits
);
2650 handle
= ext4_journal_current_handle();
2651 err
= PTR_ERR(inode
);
2655 inode
->i_op
= &ext4_dir_inode_operations
;
2656 inode
->i_fop
= &ext4_dir_operations
;
2657 err
= ext4_init_new_dir(handle
, dir
, inode
);
2659 goto out_clear_inode
;
2660 err
= ext4_mark_inode_dirty(handle
, inode
);
2662 err
= ext4_add_entry(handle
, dentry
, inode
);
2666 unlock_new_inode(inode
);
2667 ext4_mark_inode_dirty(handle
, inode
);
2671 ext4_inc_count(handle
, dir
);
2672 ext4_update_dx_flag(dir
);
2673 err
= ext4_mark_inode_dirty(handle
, dir
);
2675 goto out_clear_inode
;
2676 unlock_new_inode(inode
);
2677 d_instantiate(dentry
, inode
);
2678 if (IS_DIRSYNC(dir
))
2679 ext4_handle_sync(handle
);
2683 ext4_journal_stop(handle
);
2684 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2690 * routine to check that the specified directory is empty (for rmdir)
2692 bool ext4_empty_dir(struct inode
*inode
)
2694 unsigned int offset
;
2695 struct buffer_head
*bh
;
2696 struct ext4_dir_entry_2
*de
, *de1
;
2697 struct super_block
*sb
;
2699 if (ext4_has_inline_data(inode
)) {
2700 int has_inline_data
= 1;
2703 ret
= empty_inline_dir(inode
, &has_inline_data
);
2704 if (has_inline_data
)
2709 if (inode
->i_size
< EXT4_DIR_REC_LEN(1) + EXT4_DIR_REC_LEN(2)) {
2710 EXT4_ERROR_INODE(inode
, "invalid size");
2713 bh
= ext4_read_dirblock(inode
, 0, EITHER
);
2717 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
2718 de1
= ext4_next_entry(de
, sb
->s_blocksize
);
2719 if (le32_to_cpu(de
->inode
) != inode
->i_ino
||
2720 le32_to_cpu(de1
->inode
) == 0 ||
2721 strcmp(".", de
->name
) || strcmp("..", de1
->name
)) {
2722 ext4_warning_inode(inode
, "directory missing '.' and/or '..'");
2726 offset
= ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
) +
2727 ext4_rec_len_from_disk(de1
->rec_len
, sb
->s_blocksize
);
2728 de
= ext4_next_entry(de1
, sb
->s_blocksize
);
2729 while (offset
< inode
->i_size
) {
2730 if ((void *) de
>= (void *) (bh
->b_data
+sb
->s_blocksize
)) {
2731 unsigned int lblock
;
2733 lblock
= offset
>> EXT4_BLOCK_SIZE_BITS(sb
);
2734 bh
= ext4_read_dirblock(inode
, lblock
, EITHER
);
2737 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
2739 if (ext4_check_dir_entry(inode
, NULL
, de
, bh
,
2740 bh
->b_data
, bh
->b_size
, offset
)) {
2741 de
= (struct ext4_dir_entry_2
*)(bh
->b_data
+
2743 offset
= (offset
| (sb
->s_blocksize
- 1)) + 1;
2746 if (le32_to_cpu(de
->inode
)) {
2750 offset
+= ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
);
2751 de
= ext4_next_entry(de
, sb
->s_blocksize
);
2758 * ext4_orphan_add() links an unlinked or truncated inode into a list of
2759 * such inodes, starting at the superblock, in case we crash before the
2760 * file is closed/deleted, or in case the inode truncate spans multiple
2761 * transactions and the last transaction is not recovered after a crash.
2763 * At filesystem recovery time, we walk this list deleting unlinked
2764 * inodes and truncating linked inodes in ext4_orphan_cleanup().
2766 * Orphan list manipulation functions must be called under i_mutex unless
2767 * we are just creating the inode or deleting it.
2769 int ext4_orphan_add(handle_t
*handle
, struct inode
*inode
)
2771 struct super_block
*sb
= inode
->i_sb
;
2772 struct ext4_sb_info
*sbi
= EXT4_SB(sb
);
2773 struct ext4_iloc iloc
;
2777 if (!sbi
->s_journal
|| is_bad_inode(inode
))
2780 WARN_ON_ONCE(!(inode
->i_state
& (I_NEW
| I_FREEING
)) &&
2781 !inode_is_locked(inode
));
2783 * Exit early if inode already is on orphan list. This is a big speedup
2784 * since we don't have to contend on the global s_orphan_lock.
2786 if (!list_empty(&EXT4_I(inode
)->i_orphan
))
2790 * Orphan handling is only valid for files with data blocks
2791 * being truncated, or files being unlinked. Note that we either
2792 * hold i_mutex, or the inode can not be referenced from outside,
2793 * so i_nlink should not be bumped due to race
2795 J_ASSERT((S_ISREG(inode
->i_mode
) || S_ISDIR(inode
->i_mode
) ||
2796 S_ISLNK(inode
->i_mode
)) || inode
->i_nlink
== 0);
2798 BUFFER_TRACE(sbi
->s_sbh
, "get_write_access");
2799 err
= ext4_journal_get_write_access(handle
, sbi
->s_sbh
);
2803 err
= ext4_reserve_inode_write(handle
, inode
, &iloc
);
2807 mutex_lock(&sbi
->s_orphan_lock
);
2809 * Due to previous errors inode may be already a part of on-disk
2810 * orphan list. If so skip on-disk list modification.
2812 if (!NEXT_ORPHAN(inode
) || NEXT_ORPHAN(inode
) >
2813 (le32_to_cpu(sbi
->s_es
->s_inodes_count
))) {
2814 /* Insert this inode at the head of the on-disk orphan list */
2815 NEXT_ORPHAN(inode
) = le32_to_cpu(sbi
->s_es
->s_last_orphan
);
2816 sbi
->s_es
->s_last_orphan
= cpu_to_le32(inode
->i_ino
);
2819 list_add(&EXT4_I(inode
)->i_orphan
, &sbi
->s_orphan
);
2820 mutex_unlock(&sbi
->s_orphan_lock
);
2823 err
= ext4_handle_dirty_super(handle
, sb
);
2824 rc
= ext4_mark_iloc_dirty(handle
, inode
, &iloc
);
2829 * We have to remove inode from in-memory list if
2830 * addition to on disk orphan list failed. Stray orphan
2831 * list entries can cause panics at unmount time.
2833 mutex_lock(&sbi
->s_orphan_lock
);
2834 list_del_init(&EXT4_I(inode
)->i_orphan
);
2835 mutex_unlock(&sbi
->s_orphan_lock
);
2838 jbd_debug(4, "superblock will point to %lu\n", inode
->i_ino
);
2839 jbd_debug(4, "orphan inode %lu will point to %d\n",
2840 inode
->i_ino
, NEXT_ORPHAN(inode
));
2842 ext4_std_error(sb
, err
);
2847 * ext4_orphan_del() removes an unlinked or truncated inode from the list
2848 * of such inodes stored on disk, because it is finally being cleaned up.
2850 int ext4_orphan_del(handle_t
*handle
, struct inode
*inode
)
2852 struct list_head
*prev
;
2853 struct ext4_inode_info
*ei
= EXT4_I(inode
);
2854 struct ext4_sb_info
*sbi
= EXT4_SB(inode
->i_sb
);
2856 struct ext4_iloc iloc
;
2859 if (!sbi
->s_journal
&& !(sbi
->s_mount_state
& EXT4_ORPHAN_FS
))
2862 WARN_ON_ONCE(!(inode
->i_state
& (I_NEW
| I_FREEING
)) &&
2863 !inode_is_locked(inode
));
2864 /* Do this quick check before taking global s_orphan_lock. */
2865 if (list_empty(&ei
->i_orphan
))
2869 /* Grab inode buffer early before taking global s_orphan_lock */
2870 err
= ext4_reserve_inode_write(handle
, inode
, &iloc
);
2873 mutex_lock(&sbi
->s_orphan_lock
);
2874 jbd_debug(4, "remove inode %lu from orphan list\n", inode
->i_ino
);
2876 prev
= ei
->i_orphan
.prev
;
2877 list_del_init(&ei
->i_orphan
);
2879 /* If we're on an error path, we may not have a valid
2880 * transaction handle with which to update the orphan list on
2881 * disk, but we still need to remove the inode from the linked
2882 * list in memory. */
2883 if (!handle
|| err
) {
2884 mutex_unlock(&sbi
->s_orphan_lock
);
2888 ino_next
= NEXT_ORPHAN(inode
);
2889 if (prev
== &sbi
->s_orphan
) {
2890 jbd_debug(4, "superblock will point to %u\n", ino_next
);
2891 BUFFER_TRACE(sbi
->s_sbh
, "get_write_access");
2892 err
= ext4_journal_get_write_access(handle
, sbi
->s_sbh
);
2894 mutex_unlock(&sbi
->s_orphan_lock
);
2897 sbi
->s_es
->s_last_orphan
= cpu_to_le32(ino_next
);
2898 mutex_unlock(&sbi
->s_orphan_lock
);
2899 err
= ext4_handle_dirty_super(handle
, inode
->i_sb
);
2901 struct ext4_iloc iloc2
;
2902 struct inode
*i_prev
=
2903 &list_entry(prev
, struct ext4_inode_info
, i_orphan
)->vfs_inode
;
2905 jbd_debug(4, "orphan inode %lu will point to %u\n",
2906 i_prev
->i_ino
, ino_next
);
2907 err
= ext4_reserve_inode_write(handle
, i_prev
, &iloc2
);
2909 mutex_unlock(&sbi
->s_orphan_lock
);
2912 NEXT_ORPHAN(i_prev
) = ino_next
;
2913 err
= ext4_mark_iloc_dirty(handle
, i_prev
, &iloc2
);
2914 mutex_unlock(&sbi
->s_orphan_lock
);
2918 NEXT_ORPHAN(inode
) = 0;
2919 err
= ext4_mark_iloc_dirty(handle
, inode
, &iloc
);
2921 ext4_std_error(inode
->i_sb
, err
);
2929 static int ext4_rmdir(struct inode
*dir
, struct dentry
*dentry
)
2932 struct inode
*inode
;
2933 struct buffer_head
*bh
;
2934 struct ext4_dir_entry_2
*de
;
2935 handle_t
*handle
= NULL
;
2937 /* Initialize quotas before so that eventual writes go in
2938 * separate transaction */
2939 retval
= dquot_initialize(dir
);
2942 retval
= dquot_initialize(d_inode(dentry
));
2947 bh
= ext4_find_entry(dir
, &dentry
->d_name
, &de
, NULL
);
2953 inode
= d_inode(dentry
);
2955 retval
= -EFSCORRUPTED
;
2956 if (le32_to_cpu(de
->inode
) != inode
->i_ino
)
2959 retval
= -ENOTEMPTY
;
2960 if (!ext4_empty_dir(inode
))
2963 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
2964 EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
));
2965 if (IS_ERR(handle
)) {
2966 retval
= PTR_ERR(handle
);
2971 if (IS_DIRSYNC(dir
))
2972 ext4_handle_sync(handle
);
2974 retval
= ext4_delete_entry(handle
, dir
, de
, bh
);
2977 if (!EXT4_DIR_LINK_EMPTY(inode
))
2978 ext4_warning_inode(inode
,
2979 "empty directory '%.*s' has too many links (%u)",
2980 dentry
->d_name
.len
, dentry
->d_name
.name
,
2984 /* There's no need to set i_disksize: the fact that i_nlink is
2985 * zero will ensure that the right thing happens during any
2988 ext4_orphan_add(handle
, inode
);
2989 inode
->i_ctime
= dir
->i_ctime
= dir
->i_mtime
= ext4_current_time(inode
);
2990 ext4_mark_inode_dirty(handle
, inode
);
2991 ext4_dec_count(handle
, dir
);
2992 ext4_update_dx_flag(dir
);
2993 ext4_mark_inode_dirty(handle
, dir
);
2998 ext4_journal_stop(handle
);
3002 static int ext4_unlink(struct inode
*dir
, struct dentry
*dentry
)
3005 struct inode
*inode
;
3006 struct buffer_head
*bh
;
3007 struct ext4_dir_entry_2
*de
;
3008 handle_t
*handle
= NULL
;
3010 trace_ext4_unlink_enter(dir
, dentry
);
3011 /* Initialize quotas before so that eventual writes go
3012 * in separate transaction */
3013 retval
= dquot_initialize(dir
);
3016 retval
= dquot_initialize(d_inode(dentry
));
3021 bh
= ext4_find_entry(dir
, &dentry
->d_name
, &de
, NULL
);
3027 inode
= d_inode(dentry
);
3029 retval
= -EFSCORRUPTED
;
3030 if (le32_to_cpu(de
->inode
) != inode
->i_ino
)
3033 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
3034 EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
));
3035 if (IS_ERR(handle
)) {
3036 retval
= PTR_ERR(handle
);
3041 if (IS_DIRSYNC(dir
))
3042 ext4_handle_sync(handle
);
3044 if (inode
->i_nlink
== 0) {
3045 ext4_warning_inode(inode
, "Deleting file '%.*s' with no links",
3046 dentry
->d_name
.len
, dentry
->d_name
.name
);
3047 set_nlink(inode
, 1);
3049 retval
= ext4_delete_entry(handle
, dir
, de
, bh
);
3052 dir
->i_ctime
= dir
->i_mtime
= ext4_current_time(dir
);
3053 ext4_update_dx_flag(dir
);
3054 ext4_mark_inode_dirty(handle
, dir
);
3056 if (!inode
->i_nlink
)
3057 ext4_orphan_add(handle
, inode
);
3058 inode
->i_ctime
= ext4_current_time(inode
);
3059 ext4_mark_inode_dirty(handle
, inode
);
3064 ext4_journal_stop(handle
);
3065 trace_ext4_unlink_exit(dentry
, retval
);
3069 static int ext4_symlink(struct inode
*dir
,
3070 struct dentry
*dentry
, const char *symname
)
3073 struct inode
*inode
;
3074 int err
, len
= strlen(symname
);
3076 bool encryption_required
;
3077 struct fscrypt_str disk_link
;
3078 struct fscrypt_symlink_data
*sd
= NULL
;
3080 disk_link
.len
= len
+ 1;
3081 disk_link
.name
= (char *) symname
;
3083 encryption_required
= (ext4_encrypted_inode(dir
) ||
3084 DUMMY_ENCRYPTION_ENABLED(EXT4_SB(dir
->i_sb
)));
3085 if (encryption_required
) {
3086 err
= fscrypt_get_encryption_info(dir
);
3089 if (!fscrypt_has_encryption_key(dir
))
3091 disk_link
.len
= (fscrypt_fname_encrypted_size(dir
, len
) +
3092 sizeof(struct fscrypt_symlink_data
));
3093 sd
= kzalloc(disk_link
.len
, GFP_KERNEL
);
3098 if (disk_link
.len
> dir
->i_sb
->s_blocksize
) {
3099 err
= -ENAMETOOLONG
;
3103 err
= dquot_initialize(dir
);
3107 if ((disk_link
.len
> EXT4_N_BLOCKS
* 4)) {
3109 * For non-fast symlinks, we just allocate inode and put it on
3110 * orphan list in the first transaction => we need bitmap,
3111 * group descriptor, sb, inode block, quota blocks, and
3112 * possibly selinux xattr blocks.
3114 credits
= 4 + EXT4_MAXQUOTAS_INIT_BLOCKS(dir
->i_sb
) +
3115 EXT4_XATTR_TRANS_BLOCKS
;
3118 * Fast symlink. We have to add entry to directory
3119 * (EXT4_DATA_TRANS_BLOCKS + EXT4_INDEX_EXTRA_TRANS_BLOCKS),
3120 * allocate new inode (bitmap, group descriptor, inode block,
3121 * quota blocks, sb is already counted in previous macros).
3123 credits
= EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
3124 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3;
3127 inode
= ext4_new_inode_start_handle(dir
, S_IFLNK
|S_IRWXUGO
,
3128 &dentry
->d_name
, 0, NULL
,
3129 EXT4_HT_DIR
, credits
);
3130 handle
= ext4_journal_current_handle();
3131 if (IS_ERR(inode
)) {
3133 ext4_journal_stop(handle
);
3134 err
= PTR_ERR(inode
);
3138 if (encryption_required
) {
3140 struct fscrypt_str ostr
=
3141 FSTR_INIT(sd
->encrypted_path
, disk_link
.len
);
3143 istr
.name
= (const unsigned char *) symname
;
3145 err
= fscrypt_fname_usr_to_disk(inode
, &istr
, &ostr
);
3147 goto err_drop_inode
;
3148 sd
->len
= cpu_to_le16(ostr
.len
);
3149 disk_link
.name
= (char *) sd
;
3150 inode
->i_op
= &ext4_encrypted_symlink_inode_operations
;
3153 if ((disk_link
.len
> EXT4_N_BLOCKS
* 4)) {
3154 if (!encryption_required
)
3155 inode
->i_op
= &ext4_symlink_inode_operations
;
3156 inode_nohighmem(inode
);
3157 ext4_set_aops(inode
);
3159 * We cannot call page_symlink() with transaction started
3160 * because it calls into ext4_write_begin() which can wait
3161 * for transaction commit if we are running out of space
3162 * and thus we deadlock. So we have to stop transaction now
3163 * and restart it when symlink contents is written.
3165 * To keep fs consistent in case of crash, we have to put inode
3166 * to orphan list in the mean time.
3169 err
= ext4_orphan_add(handle
, inode
);
3170 ext4_journal_stop(handle
);
3173 goto err_drop_inode
;
3174 err
= __page_symlink(inode
, disk_link
.name
, disk_link
.len
, 1);
3176 goto err_drop_inode
;
3178 * Now inode is being linked into dir (EXT4_DATA_TRANS_BLOCKS
3179 * + EXT4_INDEX_EXTRA_TRANS_BLOCKS), inode is also modified
3181 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
3182 EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
3183 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 1);
3184 if (IS_ERR(handle
)) {
3185 err
= PTR_ERR(handle
);
3187 goto err_drop_inode
;
3189 set_nlink(inode
, 1);
3190 err
= ext4_orphan_del(handle
, inode
);
3192 goto err_drop_inode
;
3194 /* clear the extent format for fast symlink */
3195 ext4_clear_inode_flag(inode
, EXT4_INODE_EXTENTS
);
3196 if (!encryption_required
) {
3197 inode
->i_op
= &ext4_fast_symlink_inode_operations
;
3198 inode
->i_link
= (char *)&EXT4_I(inode
)->i_data
;
3200 memcpy((char *)&EXT4_I(inode
)->i_data
, disk_link
.name
,
3202 inode
->i_size
= disk_link
.len
- 1;
3204 EXT4_I(inode
)->i_disksize
= inode
->i_size
;
3205 err
= ext4_add_nondir(handle
, dentry
, inode
);
3206 if (!err
&& IS_DIRSYNC(dir
))
3207 ext4_handle_sync(handle
);
3210 ext4_journal_stop(handle
);
3215 ext4_journal_stop(handle
);
3217 unlock_new_inode(inode
);
3224 static int ext4_link(struct dentry
*old_dentry
,
3225 struct inode
*dir
, struct dentry
*dentry
)
3228 struct inode
*inode
= d_inode(old_dentry
);
3229 int err
, retries
= 0;
3231 if (inode
->i_nlink
>= EXT4_LINK_MAX
)
3233 if (ext4_encrypted_inode(dir
) &&
3234 !fscrypt_has_permitted_context(dir
, inode
))
3237 if ((ext4_test_inode_flag(dir
, EXT4_INODE_PROJINHERIT
)) &&
3238 (!projid_eq(EXT4_I(dir
)->i_projid
,
3239 EXT4_I(old_dentry
->d_inode
)->i_projid
)))
3242 err
= dquot_initialize(dir
);
3247 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
3248 (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
3249 EXT4_INDEX_EXTRA_TRANS_BLOCKS
) + 1);
3251 return PTR_ERR(handle
);
3253 if (IS_DIRSYNC(dir
))
3254 ext4_handle_sync(handle
);
3256 inode
->i_ctime
= ext4_current_time(inode
);
3257 ext4_inc_count(handle
, inode
);
3260 err
= ext4_add_entry(handle
, dentry
, inode
);
3262 ext4_mark_inode_dirty(handle
, inode
);
3263 /* this can happen only for tmpfile being
3264 * linked the first time
3266 if (inode
->i_nlink
== 1)
3267 ext4_orphan_del(handle
, inode
);
3268 d_instantiate(dentry
, inode
);
3273 ext4_journal_stop(handle
);
3274 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
3281 * Try to find buffer head where contains the parent block.
3282 * It should be the inode block if it is inlined or the 1st block
3283 * if it is a normal dir.
3285 static struct buffer_head
*ext4_get_first_dir_block(handle_t
*handle
,
3286 struct inode
*inode
,
3288 struct ext4_dir_entry_2
**parent_de
,
3291 struct buffer_head
*bh
;
3293 if (!ext4_has_inline_data(inode
)) {
3294 bh
= ext4_read_dirblock(inode
, 0, EITHER
);
3296 *retval
= PTR_ERR(bh
);
3299 *parent_de
= ext4_next_entry(
3300 (struct ext4_dir_entry_2
*)bh
->b_data
,
3301 inode
->i_sb
->s_blocksize
);
3306 return ext4_get_first_inline_block(inode
, parent_de
, retval
);
3309 struct ext4_renament
{
3311 struct dentry
*dentry
;
3312 struct inode
*inode
;
3314 int dir_nlink_delta
;
3316 /* entry for "dentry" */
3317 struct buffer_head
*bh
;
3318 struct ext4_dir_entry_2
*de
;
3321 /* entry for ".." in inode if it's a directory */
3322 struct buffer_head
*dir_bh
;
3323 struct ext4_dir_entry_2
*parent_de
;
3327 static int ext4_rename_dir_prepare(handle_t
*handle
, struct ext4_renament
*ent
)
3331 ent
->dir_bh
= ext4_get_first_dir_block(handle
, ent
->inode
,
3332 &retval
, &ent
->parent_de
,
3336 if (le32_to_cpu(ent
->parent_de
->inode
) != ent
->dir
->i_ino
)
3337 return -EFSCORRUPTED
;
3338 BUFFER_TRACE(ent
->dir_bh
, "get_write_access");
3339 return ext4_journal_get_write_access(handle
, ent
->dir_bh
);
3342 static int ext4_rename_dir_finish(handle_t
*handle
, struct ext4_renament
*ent
,
3347 ent
->parent_de
->inode
= cpu_to_le32(dir_ino
);
3348 BUFFER_TRACE(ent
->dir_bh
, "call ext4_handle_dirty_metadata");
3349 if (!ent
->dir_inlined
) {
3350 if (is_dx(ent
->inode
)) {
3351 retval
= ext4_handle_dirty_dx_node(handle
,
3355 retval
= ext4_handle_dirty_dirent_node(handle
,
3360 retval
= ext4_mark_inode_dirty(handle
, ent
->inode
);
3363 ext4_std_error(ent
->dir
->i_sb
, retval
);
3369 static int ext4_setent(handle_t
*handle
, struct ext4_renament
*ent
,
3370 unsigned ino
, unsigned file_type
)
3374 BUFFER_TRACE(ent
->bh
, "get write access");
3375 retval
= ext4_journal_get_write_access(handle
, ent
->bh
);
3378 ent
->de
->inode
= cpu_to_le32(ino
);
3379 if (ext4_has_feature_filetype(ent
->dir
->i_sb
))
3380 ent
->de
->file_type
= file_type
;
3381 ent
->dir
->i_version
++;
3382 ent
->dir
->i_ctime
= ent
->dir
->i_mtime
=
3383 ext4_current_time(ent
->dir
);
3384 ext4_mark_inode_dirty(handle
, ent
->dir
);
3385 BUFFER_TRACE(ent
->bh
, "call ext4_handle_dirty_metadata");
3386 if (!ent
->inlined
) {
3387 retval
= ext4_handle_dirty_dirent_node(handle
,
3389 if (unlikely(retval
)) {
3390 ext4_std_error(ent
->dir
->i_sb
, retval
);
3400 static int ext4_find_delete_entry(handle_t
*handle
, struct inode
*dir
,
3401 const struct qstr
*d_name
)
3403 int retval
= -ENOENT
;
3404 struct buffer_head
*bh
;
3405 struct ext4_dir_entry_2
*de
;
3407 bh
= ext4_find_entry(dir
, d_name
, &de
, NULL
);
3411 retval
= ext4_delete_entry(handle
, dir
, de
, bh
);
3417 static void ext4_rename_delete(handle_t
*handle
, struct ext4_renament
*ent
,
3422 * ent->de could have moved from under us during htree split, so make
3423 * sure that we are deleting the right entry. We might also be pointing
3424 * to a stale entry in the unused part of ent->bh so just checking inum
3425 * and the name isn't enough.
3427 if (le32_to_cpu(ent
->de
->inode
) != ent
->inode
->i_ino
||
3428 ent
->de
->name_len
!= ent
->dentry
->d_name
.len
||
3429 strncmp(ent
->de
->name
, ent
->dentry
->d_name
.name
,
3430 ent
->de
->name_len
) ||
3432 retval
= ext4_find_delete_entry(handle
, ent
->dir
,
3433 &ent
->dentry
->d_name
);
3435 retval
= ext4_delete_entry(handle
, ent
->dir
, ent
->de
, ent
->bh
);
3436 if (retval
== -ENOENT
) {
3437 retval
= ext4_find_delete_entry(handle
, ent
->dir
,
3438 &ent
->dentry
->d_name
);
3443 ext4_warning_inode(ent
->dir
,
3444 "Deleting old file: nlink %d, error=%d",
3445 ent
->dir
->i_nlink
, retval
);
3449 static void ext4_update_dir_count(handle_t
*handle
, struct ext4_renament
*ent
)
3451 if (ent
->dir_nlink_delta
) {
3452 if (ent
->dir_nlink_delta
== -1)
3453 ext4_dec_count(handle
, ent
->dir
);
3455 ext4_inc_count(handle
, ent
->dir
);
3456 ext4_mark_inode_dirty(handle
, ent
->dir
);
3460 static struct inode
*ext4_whiteout_for_rename(struct ext4_renament
*ent
,
3461 int credits
, handle_t
**h
)
3468 * for inode block, sb block, group summaries,
3471 credits
+= (EXT4_MAXQUOTAS_TRANS_BLOCKS(ent
->dir
->i_sb
) +
3472 EXT4_XATTR_TRANS_BLOCKS
+ 4);
3474 wh
= ext4_new_inode_start_handle(ent
->dir
, S_IFCHR
| WHITEOUT_MODE
,
3475 &ent
->dentry
->d_name
, 0, NULL
,
3476 EXT4_HT_DIR
, credits
);
3478 handle
= ext4_journal_current_handle();
3481 ext4_journal_stop(handle
);
3482 if (PTR_ERR(wh
) == -ENOSPC
&&
3483 ext4_should_retry_alloc(ent
->dir
->i_sb
, &retries
))
3487 init_special_inode(wh
, wh
->i_mode
, WHITEOUT_DEV
);
3488 wh
->i_op
= &ext4_special_inode_operations
;
3494 * Anybody can rename anything with this: the permission checks are left to the
3495 * higher-level routines.
3497 * n.b. old_{dentry,inode) refers to the source dentry/inode
3498 * while new_{dentry,inode) refers to the destination dentry/inode
3499 * This comes from rename(const char *oldpath, const char *newpath)
3501 static int ext4_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
3502 struct inode
*new_dir
, struct dentry
*new_dentry
,
3505 handle_t
*handle
= NULL
;
3506 struct ext4_renament old
= {
3508 .dentry
= old_dentry
,
3509 .inode
= d_inode(old_dentry
),
3511 struct ext4_renament
new = {
3513 .dentry
= new_dentry
,
3514 .inode
= d_inode(new_dentry
),
3518 struct inode
*whiteout
= NULL
;
3522 if ((ext4_test_inode_flag(new_dir
, EXT4_INODE_PROJINHERIT
)) &&
3523 (!projid_eq(EXT4_I(new_dir
)->i_projid
,
3524 EXT4_I(old_dentry
->d_inode
)->i_projid
)))
3527 retval
= dquot_initialize(old
.dir
);
3530 retval
= dquot_initialize(new.dir
);
3534 /* Initialize quotas before so that eventual writes go
3535 * in separate transaction */
3537 retval
= dquot_initialize(new.inode
);
3542 old
.bh
= ext4_find_entry(old
.dir
, &old
.dentry
->d_name
, &old
.de
, NULL
);
3544 return PTR_ERR(old
.bh
);
3546 * Check for inode number is _not_ due to possible IO errors.
3547 * We might rmdir the source, keep it as pwd of some process
3548 * and merrily kill the link to whatever was created under the
3549 * same name. Goodbye sticky bit ;-<
3552 if (!old
.bh
|| le32_to_cpu(old
.de
->inode
) != old
.inode
->i_ino
)
3555 if ((old
.dir
!= new.dir
) &&
3556 ext4_encrypted_inode(new.dir
) &&
3557 !fscrypt_has_permitted_context(new.dir
, old
.inode
)) {
3562 new.bh
= ext4_find_entry(new.dir
, &new.dentry
->d_name
,
3563 &new.de
, &new.inlined
);
3564 if (IS_ERR(new.bh
)) {
3565 retval
= PTR_ERR(new.bh
);
3575 if (new.inode
&& !test_opt(new.dir
->i_sb
, NO_AUTO_DA_ALLOC
))
3576 ext4_alloc_da_blocks(old
.inode
);
3578 credits
= (2 * EXT4_DATA_TRANS_BLOCKS(old
.dir
->i_sb
) +
3579 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 2);
3580 if (!(flags
& RENAME_WHITEOUT
)) {
3581 handle
= ext4_journal_start(old
.dir
, EXT4_HT_DIR
, credits
);
3582 if (IS_ERR(handle
)) {
3583 retval
= PTR_ERR(handle
);
3588 whiteout
= ext4_whiteout_for_rename(&old
, credits
, &handle
);
3589 if (IS_ERR(whiteout
)) {
3590 retval
= PTR_ERR(whiteout
);
3596 if (IS_DIRSYNC(old
.dir
) || IS_DIRSYNC(new.dir
))
3597 ext4_handle_sync(handle
);
3599 if (S_ISDIR(old
.inode
->i_mode
)) {
3601 retval
= -ENOTEMPTY
;
3602 if (!ext4_empty_dir(new.inode
))
3606 if (new.dir
!= old
.dir
&& EXT4_DIR_LINK_MAX(new.dir
))
3609 retval
= ext4_rename_dir_prepare(handle
, &old
);
3614 * If we're renaming a file within an inline_data dir and adding or
3615 * setting the new dirent causes a conversion from inline_data to
3616 * extents/blockmap, we need to force the dirent delete code to
3617 * re-read the directory, or else we end up trying to delete a dirent
3618 * from what is now the extent tree root (or a block map).
3620 force_reread
= (new.dir
->i_ino
== old
.dir
->i_ino
&&
3621 ext4_test_inode_flag(new.dir
, EXT4_INODE_INLINE_DATA
));
3623 old_file_type
= old
.de
->file_type
;
3626 * Do this before adding a new entry, so the old entry is sure
3627 * to be still pointing to the valid old entry.
3629 retval
= ext4_setent(handle
, &old
, whiteout
->i_ino
,
3633 ext4_mark_inode_dirty(handle
, whiteout
);
3636 retval
= ext4_add_entry(handle
, new.dentry
, old
.inode
);
3640 retval
= ext4_setent(handle
, &new,
3641 old
.inode
->i_ino
, old_file_type
);
3646 force_reread
= !ext4_test_inode_flag(new.dir
,
3647 EXT4_INODE_INLINE_DATA
);
3650 * Like most other Unix systems, set the ctime for inodes on a
3653 old
.inode
->i_ctime
= ext4_current_time(old
.inode
);
3654 ext4_mark_inode_dirty(handle
, old
.inode
);
3660 ext4_rename_delete(handle
, &old
, force_reread
);
3664 ext4_dec_count(handle
, new.inode
);
3665 new.inode
->i_ctime
= ext4_current_time(new.inode
);
3667 old
.dir
->i_ctime
= old
.dir
->i_mtime
= ext4_current_time(old
.dir
);
3668 ext4_update_dx_flag(old
.dir
);
3670 retval
= ext4_rename_dir_finish(handle
, &old
, new.dir
->i_ino
);
3674 ext4_dec_count(handle
, old
.dir
);
3676 /* checked ext4_empty_dir above, can't have another
3677 * parent, ext4_dec_count() won't work for many-linked
3679 clear_nlink(new.inode
);
3681 ext4_inc_count(handle
, new.dir
);
3682 ext4_update_dx_flag(new.dir
);
3683 ext4_mark_inode_dirty(handle
, new.dir
);
3686 ext4_mark_inode_dirty(handle
, old
.dir
);
3688 ext4_mark_inode_dirty(handle
, new.inode
);
3689 if (!new.inode
->i_nlink
)
3690 ext4_orphan_add(handle
, new.inode
);
3700 drop_nlink(whiteout
);
3701 unlock_new_inode(whiteout
);
3705 ext4_journal_stop(handle
);
3709 static int ext4_cross_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
3710 struct inode
*new_dir
, struct dentry
*new_dentry
)
3712 handle_t
*handle
= NULL
;
3713 struct ext4_renament old
= {
3715 .dentry
= old_dentry
,
3716 .inode
= d_inode(old_dentry
),
3718 struct ext4_renament
new = {
3720 .dentry
= new_dentry
,
3721 .inode
= d_inode(new_dentry
),
3726 if ((ext4_encrypted_inode(old_dir
) ||
3727 ext4_encrypted_inode(new_dir
)) &&
3728 (old_dir
!= new_dir
) &&
3729 (!fscrypt_has_permitted_context(new_dir
, old
.inode
) ||
3730 !fscrypt_has_permitted_context(old_dir
, new.inode
)))
3733 if ((ext4_test_inode_flag(new_dir
, EXT4_INODE_PROJINHERIT
) &&
3734 !projid_eq(EXT4_I(new_dir
)->i_projid
,
3735 EXT4_I(old_dentry
->d_inode
)->i_projid
)) ||
3736 (ext4_test_inode_flag(old_dir
, EXT4_INODE_PROJINHERIT
) &&
3737 !projid_eq(EXT4_I(old_dir
)->i_projid
,
3738 EXT4_I(new_dentry
->d_inode
)->i_projid
)))
3741 retval
= dquot_initialize(old
.dir
);
3744 retval
= dquot_initialize(new.dir
);
3748 old
.bh
= ext4_find_entry(old
.dir
, &old
.dentry
->d_name
,
3749 &old
.de
, &old
.inlined
);
3751 return PTR_ERR(old
.bh
);
3753 * Check for inode number is _not_ due to possible IO errors.
3754 * We might rmdir the source, keep it as pwd of some process
3755 * and merrily kill the link to whatever was created under the
3756 * same name. Goodbye sticky bit ;-<
3759 if (!old
.bh
|| le32_to_cpu(old
.de
->inode
) != old
.inode
->i_ino
)
3762 new.bh
= ext4_find_entry(new.dir
, &new.dentry
->d_name
,
3763 &new.de
, &new.inlined
);
3764 if (IS_ERR(new.bh
)) {
3765 retval
= PTR_ERR(new.bh
);
3770 /* RENAME_EXCHANGE case: old *and* new must both exist */
3771 if (!new.bh
|| le32_to_cpu(new.de
->inode
) != new.inode
->i_ino
)
3774 handle
= ext4_journal_start(old
.dir
, EXT4_HT_DIR
,
3775 (2 * EXT4_DATA_TRANS_BLOCKS(old
.dir
->i_sb
) +
3776 2 * EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 2));
3777 if (IS_ERR(handle
)) {
3778 retval
= PTR_ERR(handle
);
3783 if (IS_DIRSYNC(old
.dir
) || IS_DIRSYNC(new.dir
))
3784 ext4_handle_sync(handle
);
3786 if (S_ISDIR(old
.inode
->i_mode
)) {
3788 retval
= ext4_rename_dir_prepare(handle
, &old
);
3792 if (S_ISDIR(new.inode
->i_mode
)) {
3794 retval
= ext4_rename_dir_prepare(handle
, &new);
3800 * Other than the special case of overwriting a directory, parents'
3801 * nlink only needs to be modified if this is a cross directory rename.
3803 if (old
.dir
!= new.dir
&& old
.is_dir
!= new.is_dir
) {
3804 old
.dir_nlink_delta
= old
.is_dir
? -1 : 1;
3805 new.dir_nlink_delta
= -old
.dir_nlink_delta
;
3807 if ((old
.dir_nlink_delta
> 0 && EXT4_DIR_LINK_MAX(old
.dir
)) ||
3808 (new.dir_nlink_delta
> 0 && EXT4_DIR_LINK_MAX(new.dir
)))
3812 new_file_type
= new.de
->file_type
;
3813 retval
= ext4_setent(handle
, &new, old
.inode
->i_ino
, old
.de
->file_type
);
3817 retval
= ext4_setent(handle
, &old
, new.inode
->i_ino
, new_file_type
);
3822 * Like most other Unix systems, set the ctime for inodes on a
3825 old
.inode
->i_ctime
= ext4_current_time(old
.inode
);
3826 new.inode
->i_ctime
= ext4_current_time(new.inode
);
3827 ext4_mark_inode_dirty(handle
, old
.inode
);
3828 ext4_mark_inode_dirty(handle
, new.inode
);
3831 retval
= ext4_rename_dir_finish(handle
, &old
, new.dir
->i_ino
);
3836 retval
= ext4_rename_dir_finish(handle
, &new, old
.dir
->i_ino
);
3840 ext4_update_dir_count(handle
, &old
);
3841 ext4_update_dir_count(handle
, &new);
3850 ext4_journal_stop(handle
);
3854 static int ext4_rename2(struct inode
*old_dir
, struct dentry
*old_dentry
,
3855 struct inode
*new_dir
, struct dentry
*new_dentry
,
3858 if (flags
& ~(RENAME_NOREPLACE
| RENAME_EXCHANGE
| RENAME_WHITEOUT
))
3861 if (flags
& RENAME_EXCHANGE
) {
3862 return ext4_cross_rename(old_dir
, old_dentry
,
3863 new_dir
, new_dentry
);
3866 return ext4_rename(old_dir
, old_dentry
, new_dir
, new_dentry
, flags
);
3870 * directories can handle most operations...
3872 const struct inode_operations ext4_dir_inode_operations
= {
3873 .create
= ext4_create
,
3874 .lookup
= ext4_lookup
,
3876 .unlink
= ext4_unlink
,
3877 .symlink
= ext4_symlink
,
3878 .mkdir
= ext4_mkdir
,
3879 .rmdir
= ext4_rmdir
,
3880 .mknod
= ext4_mknod
,
3881 .tmpfile
= ext4_tmpfile
,
3882 .rename2
= ext4_rename2
,
3883 .setattr
= ext4_setattr
,
3884 .setxattr
= generic_setxattr
,
3885 .getxattr
= generic_getxattr
,
3886 .listxattr
= ext4_listxattr
,
3887 .removexattr
= generic_removexattr
,
3888 .get_acl
= ext4_get_acl
,
3889 .set_acl
= ext4_set_acl
,
3890 .fiemap
= ext4_fiemap
,
3893 const struct inode_operations ext4_special_inode_operations
= {
3894 .setattr
= ext4_setattr
,
3895 .setxattr
= generic_setxattr
,
3896 .getxattr
= generic_getxattr
,
3897 .listxattr
= ext4_listxattr
,
3898 .removexattr
= generic_removexattr
,
3899 .get_acl
= ext4_get_acl
,
3900 .set_acl
= ext4_set_acl
,