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/jbd2.h>
30 #include <linux/time.h>
31 #include <linux/fcntl.h>
32 #include <linux/stat.h>
33 #include <linux/string.h>
34 #include <linux/quotaops.h>
35 #include <linux/buffer_head.h>
36 #include <linux/bio.h>
38 #include "ext4_jbd2.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)
49 #define NAMEI_RA_INDEX(c,b) (((c) * NAMEI_RA_BLOCKS) + (b))
51 static struct buffer_head *ext4_append(handle_t *handle,
53 ext4_lblk_t *block, int *err)
55 struct buffer_head *bh;
57 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
59 bh = ext4_bread(handle, inode, *block, 1, err);
61 inode->i_size += inode->i_sb->s_blocksize;
62 EXT4_I(inode)->i_disksize = inode->i_size;
63 *err = ext4_journal_get_write_access(handle, bh);
73 #define assert(test) J_ASSERT(test)
77 #define dxtrace(command) command
79 #define dxtrace(command)
103 * dx_root_info is laid out so that if it should somehow get overlaid by a
104 * dirent the two low bits of the hash version will be zero. Therefore, the
105 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
110 struct fake_dirent dot;
112 struct fake_dirent dotdot;
116 __le32 reserved_zero;
118 u8 info_length; /* 8 */
123 struct dx_entry entries[0];
128 struct fake_dirent fake;
129 struct dx_entry entries[0];
135 struct buffer_head *bh;
136 struct dx_entry *entries;
147 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry);
148 static void dx_set_block(struct dx_entry *entry, ext4_lblk_t value);
149 static inline unsigned dx_get_hash(struct dx_entry *entry);
150 static void dx_set_hash(struct dx_entry *entry, unsigned value);
151 static unsigned dx_get_count(struct dx_entry *entries);
152 static unsigned dx_get_limit(struct dx_entry *entries);
153 static void dx_set_count(struct dx_entry *entries, unsigned value);
154 static void dx_set_limit(struct dx_entry *entries, unsigned value);
155 static unsigned dx_root_limit(struct inode *dir, unsigned infosize);
156 static unsigned dx_node_limit(struct inode *dir);
157 static struct dx_frame *dx_probe(const struct qstr *d_name,
159 struct dx_hash_info *hinfo,
160 struct dx_frame *frame,
162 static void dx_release(struct dx_frame *frames);
163 static int dx_make_map(struct ext4_dir_entry_2 *de, unsigned blocksize,
164 struct dx_hash_info *hinfo, struct dx_map_entry map[]);
165 static void dx_sort_map(struct dx_map_entry *map, unsigned count);
166 static struct ext4_dir_entry_2 *dx_move_dirents(char *from, char *to,
167 struct dx_map_entry *offsets, int count, unsigned blocksize);
168 static struct ext4_dir_entry_2* dx_pack_dirents(char *base, unsigned blocksize);
169 static void dx_insert_block(struct dx_frame *frame,
170 u32 hash, ext4_lblk_t block);
171 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
172 struct dx_frame *frame,
173 struct dx_frame *frames,
175 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
176 const struct qstr *d_name,
177 struct ext4_dir_entry_2 **res_dir,
179 static int ext4_dx_add_entry(handle_t *handle, struct dentry *dentry,
180 struct inode *inode);
182 unsigned int ext4_rec_len_from_disk(__le16 dlen, unsigned blocksize)
184 unsigned len = le16_to_cpu(dlen);
186 if (len == EXT4_MAX_REC_LEN || len == 0)
188 return (len & 65532) | ((len & 3) << 16);
191 __le16 ext4_rec_len_to_disk(unsigned len, unsigned blocksize)
193 if ((len > blocksize) || (blocksize > (1 << 18)) || (len & 3))
196 return cpu_to_le16(len);
197 if (len == blocksize) {
198 if (blocksize == 65536)
199 return cpu_to_le16(EXT4_MAX_REC_LEN);
201 return cpu_to_le16(0);
203 return cpu_to_le16((len & 65532) | ((len >> 16) & 3));
207 * p is at least 6 bytes before the end of page
209 static inline struct ext4_dir_entry_2 *
210 ext4_next_entry(struct ext4_dir_entry_2 *p, unsigned long blocksize)
212 return (struct ext4_dir_entry_2 *)((char *)p +
213 ext4_rec_len_from_disk(p->rec_len, blocksize));
217 * Future: use high four bits of block for coalesce-on-delete flags
218 * Mask them off for now.
221 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry)
223 return le32_to_cpu(entry->block) & 0x00ffffff;
226 static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value)
228 entry->block = cpu_to_le32(value);
231 static inline unsigned dx_get_hash(struct dx_entry *entry)
233 return le32_to_cpu(entry->hash);
236 static inline void dx_set_hash(struct dx_entry *entry, unsigned value)
238 entry->hash = cpu_to_le32(value);
241 static inline unsigned dx_get_count(struct dx_entry *entries)
243 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
246 static inline unsigned dx_get_limit(struct dx_entry *entries)
248 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
251 static inline void dx_set_count(struct dx_entry *entries, unsigned value)
253 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
256 static inline void dx_set_limit(struct dx_entry *entries, unsigned value)
258 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
261 static inline unsigned dx_root_limit(struct inode *dir, unsigned infosize)
263 unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(1) -
264 EXT4_DIR_REC_LEN(2) - infosize;
265 return entry_space / sizeof(struct dx_entry);
268 static inline unsigned dx_node_limit(struct inode *dir)
270 unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(0);
271 return entry_space / sizeof(struct dx_entry);
278 static void dx_show_index(char * label, struct dx_entry *entries)
280 int i, n = dx_get_count (entries);
281 printk(KERN_DEBUG "%s index ", label);
282 for (i = 0; i < n; i++) {
283 printk("%x->%lu ", i ? dx_get_hash(entries + i) :
284 0, (unsigned long)dx_get_block(entries + i));
296 static struct stats dx_show_leaf(struct dx_hash_info *hinfo, struct ext4_dir_entry_2 *de,
297 int size, int show_names)
299 unsigned names = 0, space = 0;
300 char *base = (char *) de;
301 struct dx_hash_info h = *hinfo;
304 while ((char *) de < base + size)
310 int len = de->name_len;
311 char *name = de->name;
312 while (len--) printk("%c", *name++);
313 ext4fs_dirhash(de->name, de->name_len, &h);
314 printk(":%x.%u ", h.hash,
315 ((char *) de - base));
317 space += EXT4_DIR_REC_LEN(de->name_len);
320 de = ext4_next_entry(de, size);
322 printk("(%i)\n", names);
323 return (struct stats) { names, space, 1 };
326 struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
327 struct dx_entry *entries, int levels)
329 unsigned blocksize = dir->i_sb->s_blocksize;
330 unsigned count = dx_get_count(entries), names = 0, space = 0, i;
332 struct buffer_head *bh;
334 printk("%i indexed blocks...\n", count);
335 for (i = 0; i < count; i++, entries++)
337 ext4_lblk_t block = dx_get_block(entries);
338 ext4_lblk_t hash = i ? dx_get_hash(entries): 0;
339 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
341 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
342 if (!(bh = ext4_bread (NULL,dir, block, 0,&err))) continue;
344 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
345 dx_show_leaf(hinfo, (struct ext4_dir_entry_2 *) bh->b_data, blocksize, 0);
346 names += stats.names;
347 space += stats.space;
348 bcount += stats.bcount;
352 printk(KERN_DEBUG "%snames %u, fullness %u (%u%%)\n",
353 levels ? "" : " ", names, space/bcount,
354 (space/bcount)*100/blocksize);
355 return (struct stats) { names, space, bcount};
357 #endif /* DX_DEBUG */
360 * Probe for a directory leaf block to search.
362 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
363 * error in the directory index, and the caller should fall back to
364 * searching the directory normally. The callers of dx_probe **MUST**
365 * check for this error code, and make sure it never gets reflected
368 static struct dx_frame *
369 dx_probe(const struct qstr *d_name, struct inode *dir,
370 struct dx_hash_info *hinfo, struct dx_frame *frame_in, int *err)
372 unsigned count, indirect;
373 struct dx_entry *at, *entries, *p, *q, *m;
374 struct dx_root *root;
375 struct buffer_head *bh;
376 struct dx_frame *frame = frame_in;
380 if (!(bh = ext4_bread (NULL,dir, 0, 0, err)))
382 root = (struct dx_root *) bh->b_data;
383 if (root->info.hash_version != DX_HASH_TEA &&
384 root->info.hash_version != DX_HASH_HALF_MD4 &&
385 root->info.hash_version != DX_HASH_LEGACY) {
386 ext4_warning(dir->i_sb, __func__,
387 "Unrecognised inode hash code %d",
388 root->info.hash_version);
390 *err = ERR_BAD_DX_DIR;
393 hinfo->hash_version = root->info.hash_version;
394 if (hinfo->hash_version <= DX_HASH_TEA)
395 hinfo->hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
396 hinfo->seed = EXT4_SB(dir->i_sb)->s_hash_seed;
398 ext4fs_dirhash(d_name->name, d_name->len, hinfo);
401 if (root->info.unused_flags & 1) {
402 ext4_warning(dir->i_sb, __func__,
403 "Unimplemented inode hash flags: %#06x",
404 root->info.unused_flags);
406 *err = ERR_BAD_DX_DIR;
410 if ((indirect = root->info.indirect_levels) > 1) {
411 ext4_warning(dir->i_sb, __func__,
412 "Unimplemented inode hash depth: %#06x",
413 root->info.indirect_levels);
415 *err = ERR_BAD_DX_DIR;
419 entries = (struct dx_entry *) (((char *)&root->info) +
420 root->info.info_length);
422 if (dx_get_limit(entries) != dx_root_limit(dir,
423 root->info.info_length)) {
424 ext4_warning(dir->i_sb, __func__,
425 "dx entry: limit != root limit");
427 *err = ERR_BAD_DX_DIR;
431 dxtrace(printk("Look up %x", hash));
434 count = dx_get_count(entries);
435 if (!count || count > dx_get_limit(entries)) {
436 ext4_warning(dir->i_sb, __func__,
437 "dx entry: no count or count > limit");
439 *err = ERR_BAD_DX_DIR;
444 q = entries + count - 1;
448 dxtrace(printk("."));
449 if (dx_get_hash(m) > hash)
455 if (0) // linear search cross check
457 unsigned n = count - 1;
461 dxtrace(printk(","));
462 if (dx_get_hash(++at) > hash)
468 assert (at == p - 1);
472 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
474 frame->entries = entries;
476 if (!indirect--) return frame;
477 if (!(bh = ext4_bread (NULL,dir, dx_get_block(at), 0, err)))
479 at = entries = ((struct dx_node *) bh->b_data)->entries;
480 if (dx_get_limit(entries) != dx_node_limit (dir)) {
481 ext4_warning(dir->i_sb, __func__,
482 "dx entry: limit != node limit");
484 *err = ERR_BAD_DX_DIR;
491 while (frame >= frame_in) {
496 if (*err == ERR_BAD_DX_DIR)
497 ext4_warning(dir->i_sb, __func__,
498 "Corrupt dir inode %ld, running e2fsck is "
499 "recommended.", dir->i_ino);
503 static void dx_release (struct dx_frame *frames)
505 if (frames[0].bh == NULL)
508 if (((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels)
509 brelse(frames[1].bh);
510 brelse(frames[0].bh);
514 * This function increments the frame pointer to search the next leaf
515 * block, and reads in the necessary intervening nodes if the search
516 * should be necessary. Whether or not the search is necessary is
517 * controlled by the hash parameter. If the hash value is even, then
518 * the search is only continued if the next block starts with that
519 * hash value. This is used if we are searching for a specific file.
521 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
523 * This function returns 1 if the caller should continue to search,
524 * or 0 if it should not. If there is an error reading one of the
525 * index blocks, it will a negative error code.
527 * If start_hash is non-null, it will be filled in with the starting
528 * hash of the next page.
530 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
531 struct dx_frame *frame,
532 struct dx_frame *frames,
536 struct buffer_head *bh;
537 int err, num_frames = 0;
542 * Find the next leaf page by incrementing the frame pointer.
543 * If we run out of entries in the interior node, loop around and
544 * increment pointer in the parent node. When we break out of
545 * this loop, num_frames indicates the number of interior
546 * nodes need to be read.
549 if (++(p->at) < p->entries + dx_get_count(p->entries))
558 * If the hash is 1, then continue only if the next page has a
559 * continuation hash of any value. This is used for readdir
560 * handling. Otherwise, check to see if the hash matches the
561 * desired contiuation hash. If it doesn't, return since
562 * there's no point to read in the successive index pages.
564 bhash = dx_get_hash(p->at);
567 if ((hash & 1) == 0) {
568 if ((bhash & ~1) != hash)
572 * If the hash is HASH_NB_ALWAYS, we always go to the next
573 * block so no check is necessary
575 while (num_frames--) {
576 if (!(bh = ext4_bread(NULL, dir, dx_get_block(p->at),
578 return err; /* Failure */
582 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
589 * This function fills a red-black tree with information from a
590 * directory block. It returns the number directory entries loaded
591 * into the tree. If there is an error it is returned in err.
593 static int htree_dirblock_to_tree(struct file *dir_file,
594 struct inode *dir, ext4_lblk_t block,
595 struct dx_hash_info *hinfo,
596 __u32 start_hash, __u32 start_minor_hash)
598 struct buffer_head *bh;
599 struct ext4_dir_entry_2 *de, *top;
602 dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n",
603 (unsigned long)block));
604 if (!(bh = ext4_bread (NULL, dir, block, 0, &err)))
607 de = (struct ext4_dir_entry_2 *) bh->b_data;
608 top = (struct ext4_dir_entry_2 *) ((char *) de +
609 dir->i_sb->s_blocksize -
610 EXT4_DIR_REC_LEN(0));
611 for (; de < top; de = ext4_next_entry(de, dir->i_sb->s_blocksize)) {
612 if (!ext4_check_dir_entry("htree_dirblock_to_tree", dir, de, bh,
613 (block<<EXT4_BLOCK_SIZE_BITS(dir->i_sb))
614 +((char *)de - bh->b_data))) {
615 /* On error, skip the f_pos to the next block. */
616 dir_file->f_pos = (dir_file->f_pos |
617 (dir->i_sb->s_blocksize - 1)) + 1;
621 ext4fs_dirhash(de->name, de->name_len, hinfo);
622 if ((hinfo->hash < start_hash) ||
623 ((hinfo->hash == start_hash) &&
624 (hinfo->minor_hash < start_minor_hash)))
628 if ((err = ext4_htree_store_dirent(dir_file,
629 hinfo->hash, hinfo->minor_hash, de)) != 0) {
641 * This function fills a red-black tree with information from a
642 * directory. We start scanning the directory in hash order, starting
643 * at start_hash and start_minor_hash.
645 * This function returns the number of entries inserted into the tree,
646 * or a negative error code.
648 int ext4_htree_fill_tree(struct file *dir_file, __u32 start_hash,
649 __u32 start_minor_hash, __u32 *next_hash)
651 struct dx_hash_info hinfo;
652 struct ext4_dir_entry_2 *de;
653 struct dx_frame frames[2], *frame;
660 dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n",
661 start_hash, start_minor_hash));
662 dir = dir_file->f_path.dentry->d_inode;
663 if (!(EXT4_I(dir)->i_flags & EXT4_INDEX_FL)) {
664 hinfo.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version;
665 if (hinfo.hash_version <= DX_HASH_TEA)
666 hinfo.hash_version +=
667 EXT4_SB(dir->i_sb)->s_hash_unsigned;
668 hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
669 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
670 start_hash, start_minor_hash);
674 hinfo.hash = start_hash;
675 hinfo.minor_hash = 0;
676 frame = dx_probe(NULL, dir, &hinfo, frames, &err);
680 /* Add '.' and '..' from the htree header */
681 if (!start_hash && !start_minor_hash) {
682 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
683 if ((err = ext4_htree_store_dirent(dir_file, 0, 0, de)) != 0)
687 if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) {
688 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
689 de = ext4_next_entry(de, dir->i_sb->s_blocksize);
690 if ((err = ext4_htree_store_dirent(dir_file, 2, 0, de)) != 0)
696 block = dx_get_block(frame->at);
697 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
698 start_hash, start_minor_hash);
705 ret = ext4_htree_next_block(dir, HASH_NB_ALWAYS,
706 frame, frames, &hashval);
707 *next_hash = hashval;
713 * Stop if: (a) there are no more entries, or
714 * (b) we have inserted at least one entry and the
715 * next hash value is not a continuation
718 (count && ((hashval & 1) == 0)))
722 dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, "
723 "next hash: %x\n", count, *next_hash));
732 * Directory block splitting, compacting
736 * Create map of hash values, offsets, and sizes, stored at end of block.
737 * Returns number of entries mapped.
739 static int dx_make_map(struct ext4_dir_entry_2 *de, unsigned blocksize,
740 struct dx_hash_info *hinfo,
741 struct dx_map_entry *map_tail)
744 char *base = (char *) de;
745 struct dx_hash_info h = *hinfo;
747 while ((char *) de < base + blocksize) {
748 if (de->name_len && de->inode) {
749 ext4fs_dirhash(de->name, de->name_len, &h);
751 map_tail->hash = h.hash;
752 map_tail->offs = (u16) ((char *) de - base);
753 map_tail->size = le16_to_cpu(de->rec_len);
757 /* XXX: do we need to check rec_len == 0 case? -Chris */
758 de = ext4_next_entry(de, blocksize);
763 /* Sort map by hash value */
764 static void dx_sort_map (struct dx_map_entry *map, unsigned count)
766 struct dx_map_entry *p, *q, *top = map + count - 1;
768 /* Combsort until bubble sort doesn't suck */
771 if (count - 9 < 2) /* 9, 10 -> 11 */
773 for (p = top, q = p - count; q >= map; p--, q--)
774 if (p->hash < q->hash)
777 /* Garden variety bubble sort */
782 if (q[1].hash >= q[0].hash)
790 static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block)
792 struct dx_entry *entries = frame->entries;
793 struct dx_entry *old = frame->at, *new = old + 1;
794 int count = dx_get_count(entries);
796 assert(count < dx_get_limit(entries));
797 assert(old < entries + count);
798 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
799 dx_set_hash(new, hash);
800 dx_set_block(new, block);
801 dx_set_count(entries, count + 1);
804 static void ext4_update_dx_flag(struct inode *inode)
806 if (!EXT4_HAS_COMPAT_FEATURE(inode->i_sb,
807 EXT4_FEATURE_COMPAT_DIR_INDEX))
808 EXT4_I(inode)->i_flags &= ~EXT4_INDEX_FL;
812 * NOTE! unlike strncmp, ext4_match returns 1 for success, 0 for failure.
814 * `len <= EXT4_NAME_LEN' is guaranteed by caller.
815 * `de != NULL' is guaranteed by caller.
817 static inline int ext4_match (int len, const char * const name,
818 struct ext4_dir_entry_2 * de)
820 if (len != de->name_len)
824 return !memcmp(name, de->name, len);
828 * Returns 0 if not found, -1 on failure, and 1 on success
830 static inline int search_dirblock(struct buffer_head *bh,
832 const struct qstr *d_name,
834 struct ext4_dir_entry_2 ** res_dir)
836 struct ext4_dir_entry_2 * de;
839 const char *name = d_name->name;
840 int namelen = d_name->len;
842 de = (struct ext4_dir_entry_2 *) bh->b_data;
843 dlimit = bh->b_data + dir->i_sb->s_blocksize;
844 while ((char *) de < dlimit) {
845 /* this code is executed quadratically often */
846 /* do minimal checking `by hand' */
848 if ((char *) de + namelen <= dlimit &&
849 ext4_match (namelen, name, de)) {
850 /* found a match - just to be sure, do a full check */
851 if (!ext4_check_dir_entry("ext4_find_entry",
852 dir, de, bh, offset))
857 /* prevent looping on a bad block */
858 de_len = ext4_rec_len_from_disk(de->rec_len,
859 dir->i_sb->s_blocksize);
863 de = (struct ext4_dir_entry_2 *) ((char *) de + de_len);
872 * finds an entry in the specified directory with the wanted name. It
873 * returns the cache buffer in which the entry was found, and the entry
874 * itself (as a parameter - res_dir). It does NOT read the inode of the
875 * entry - you'll have to do that yourself if you want to.
877 * The returned buffer_head has ->b_count elevated. The caller is expected
878 * to brelse() it when appropriate.
880 static struct buffer_head * ext4_find_entry (struct inode *dir,
881 const struct qstr *d_name,
882 struct ext4_dir_entry_2 ** res_dir)
884 struct super_block *sb;
885 struct buffer_head *bh_use[NAMEI_RA_SIZE];
886 struct buffer_head *bh, *ret = NULL;
887 ext4_lblk_t start, block, b;
888 int ra_max = 0; /* Number of bh's in the readahead
890 int ra_ptr = 0; /* Current index into readahead
899 namelen = d_name->len;
900 if (namelen > EXT4_NAME_LEN)
903 bh = ext4_dx_find_entry(dir, d_name, res_dir, &err);
905 * On success, or if the error was file not found,
906 * return. Otherwise, fall back to doing a search the
909 if (bh || (err != ERR_BAD_DX_DIR))
911 dxtrace(printk(KERN_DEBUG "ext4_find_entry: dx failed, "
914 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
915 start = EXT4_I(dir)->i_dir_start_lookup;
916 if (start >= nblocks)
922 * We deal with the read-ahead logic here.
924 if (ra_ptr >= ra_max) {
925 /* Refill the readahead buffer */
928 for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) {
930 * Terminate if we reach the end of the
931 * directory and must wrap, or if our
932 * search has finished at this block.
934 if (b >= nblocks || (num && block == start)) {
935 bh_use[ra_max] = NULL;
939 bh = ext4_getblk(NULL, dir, b++, 0, &err);
942 ll_rw_block(READ_META, 1, &bh);
945 if ((bh = bh_use[ra_ptr++]) == NULL)
948 if (!buffer_uptodate(bh)) {
949 /* read error, skip block & hope for the best */
950 ext4_error(sb, __func__, "reading directory #%lu "
951 "offset %lu", dir->i_ino,
952 (unsigned long)block);
956 i = search_dirblock(bh, dir, d_name,
957 block << EXT4_BLOCK_SIZE_BITS(sb), res_dir);
959 EXT4_I(dir)->i_dir_start_lookup = block;
961 goto cleanup_and_exit;
965 goto cleanup_and_exit;
968 if (++block >= nblocks)
970 } while (block != start);
973 * If the directory has grown while we were searching, then
974 * search the last part of the directory before giving up.
977 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
978 if (block < nblocks) {
984 /* Clean up the read-ahead blocks */
985 for (; ra_ptr < ra_max; ra_ptr++)
986 brelse(bh_use[ra_ptr]);
990 static struct buffer_head * ext4_dx_find_entry(struct inode *dir, const struct qstr *d_name,
991 struct ext4_dir_entry_2 **res_dir, int *err)
993 struct super_block * sb;
994 struct dx_hash_info hinfo;
996 struct dx_frame frames[2], *frame;
997 struct ext4_dir_entry_2 *de, *top;
998 struct buffer_head *bh;
1001 int namelen = d_name->len;
1002 const u8 *name = d_name->name;
1005 /* NFS may look up ".." - look at dx_root directory block */
1006 if (namelen > 2 || name[0] != '.'||(name[1] != '.' && name[1] != '\0')){
1007 if (!(frame = dx_probe(d_name, dir, &hinfo, frames, err)))
1011 frame->bh = NULL; /* for dx_release() */
1012 frame->at = (struct dx_entry *)frames; /* hack for zero entry*/
1013 dx_set_block(frame->at, 0); /* dx_root block is 0 */
1017 block = dx_get_block(frame->at);
1018 if (!(bh = ext4_bread (NULL,dir, block, 0, err)))
1020 de = (struct ext4_dir_entry_2 *) bh->b_data;
1021 top = (struct ext4_dir_entry_2 *) ((char *) de + sb->s_blocksize -
1022 EXT4_DIR_REC_LEN(0));
1023 for (; de < top; de = ext4_next_entry(de, sb->s_blocksize)) {
1024 int off = (block << EXT4_BLOCK_SIZE_BITS(sb))
1025 + ((char *) de - bh->b_data);
1027 if (!ext4_check_dir_entry(__func__, dir, de, bh, off)) {
1029 *err = ERR_BAD_DX_DIR;
1033 if (ext4_match(namelen, name, de)) {
1040 /* Check to see if we should continue to search */
1041 retval = ext4_htree_next_block(dir, hash, frame,
1044 ext4_warning(sb, __func__,
1045 "error reading index page in directory #%lu",
1050 } while (retval == 1);
1054 dxtrace(printk(KERN_DEBUG "%s not found\n", name));
1055 dx_release (frames);
1059 static struct dentry *ext4_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd)
1061 struct inode *inode;
1062 struct ext4_dir_entry_2 *de;
1063 struct buffer_head *bh;
1065 if (dentry->d_name.len > EXT4_NAME_LEN)
1066 return ERR_PTR(-ENAMETOOLONG);
1068 bh = ext4_find_entry(dir, &dentry->d_name, &de);
1071 __u32 ino = le32_to_cpu(de->inode);
1073 if (!ext4_valid_inum(dir->i_sb, ino)) {
1074 ext4_error(dir->i_sb, "ext4_lookup",
1075 "bad inode number: %u", ino);
1076 return ERR_PTR(-EIO);
1078 inode = ext4_iget(dir->i_sb, ino);
1079 if (unlikely(IS_ERR(inode))) {
1080 if (PTR_ERR(inode) == -ESTALE) {
1081 ext4_error(dir->i_sb, __func__,
1082 "deleted inode referenced: %u",
1084 return ERR_PTR(-EIO);
1086 return ERR_CAST(inode);
1090 return d_splice_alias(inode, dentry);
1094 struct dentry *ext4_get_parent(struct dentry *child)
1097 struct inode *inode;
1098 static const struct qstr dotdot = {
1102 struct ext4_dir_entry_2 * de;
1103 struct buffer_head *bh;
1105 bh = ext4_find_entry(child->d_inode, &dotdot, &de);
1108 return ERR_PTR(-ENOENT);
1109 ino = le32_to_cpu(de->inode);
1112 if (!ext4_valid_inum(child->d_inode->i_sb, ino)) {
1113 ext4_error(child->d_inode->i_sb, "ext4_get_parent",
1114 "bad inode number: %u", ino);
1115 return ERR_PTR(-EIO);
1118 return d_obtain_alias(ext4_iget(child->d_inode->i_sb, ino));
1122 static unsigned char ext4_type_by_mode[S_IFMT >> S_SHIFT] = {
1123 [S_IFREG >> S_SHIFT] = EXT4_FT_REG_FILE,
1124 [S_IFDIR >> S_SHIFT] = EXT4_FT_DIR,
1125 [S_IFCHR >> S_SHIFT] = EXT4_FT_CHRDEV,
1126 [S_IFBLK >> S_SHIFT] = EXT4_FT_BLKDEV,
1127 [S_IFIFO >> S_SHIFT] = EXT4_FT_FIFO,
1128 [S_IFSOCK >> S_SHIFT] = EXT4_FT_SOCK,
1129 [S_IFLNK >> S_SHIFT] = EXT4_FT_SYMLINK,
1132 static inline void ext4_set_de_type(struct super_block *sb,
1133 struct ext4_dir_entry_2 *de,
1135 if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_FILETYPE))
1136 de->file_type = ext4_type_by_mode[(mode & S_IFMT)>>S_SHIFT];
1140 * Move count entries from end of map between two memory locations.
1141 * Returns pointer to last entry moved.
1143 static struct ext4_dir_entry_2 *
1144 dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count,
1147 unsigned rec_len = 0;
1150 struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *) (from + map->offs);
1151 rec_len = EXT4_DIR_REC_LEN(de->name_len);
1152 memcpy (to, de, rec_len);
1153 ((struct ext4_dir_entry_2 *) to)->rec_len =
1154 ext4_rec_len_to_disk(rec_len, blocksize);
1159 return (struct ext4_dir_entry_2 *) (to - rec_len);
1163 * Compact each dir entry in the range to the minimal rec_len.
1164 * Returns pointer to last entry in range.
1166 static struct ext4_dir_entry_2* dx_pack_dirents(char *base, unsigned blocksize)
1168 struct ext4_dir_entry_2 *next, *to, *prev, *de = (struct ext4_dir_entry_2 *) base;
1169 unsigned rec_len = 0;
1172 while ((char*)de < base + blocksize) {
1173 next = ext4_next_entry(de, blocksize);
1174 if (de->inode && de->name_len) {
1175 rec_len = EXT4_DIR_REC_LEN(de->name_len);
1177 memmove(to, de, rec_len);
1178 to->rec_len = ext4_rec_len_to_disk(rec_len, blocksize);
1180 to = (struct ext4_dir_entry_2 *) (((char *) to) + rec_len);
1188 * Split a full leaf block to make room for a new dir entry.
1189 * Allocate a new block, and move entries so that they are approx. equally full.
1190 * Returns pointer to de in block into which the new entry will be inserted.
1192 static struct ext4_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1193 struct buffer_head **bh,struct dx_frame *frame,
1194 struct dx_hash_info *hinfo, int *error)
1196 unsigned blocksize = dir->i_sb->s_blocksize;
1197 unsigned count, continued;
1198 struct buffer_head *bh2;
1199 ext4_lblk_t newblock;
1201 struct dx_map_entry *map;
1202 char *data1 = (*bh)->b_data, *data2;
1203 unsigned split, move, size;
1204 struct ext4_dir_entry_2 *de = NULL, *de2;
1207 bh2 = ext4_append (handle, dir, &newblock, &err);
1214 BUFFER_TRACE(*bh, "get_write_access");
1215 err = ext4_journal_get_write_access(handle, *bh);
1219 BUFFER_TRACE(frame->bh, "get_write_access");
1220 err = ext4_journal_get_write_access(handle, frame->bh);
1224 data2 = bh2->b_data;
1226 /* create map in the end of data2 block */
1227 map = (struct dx_map_entry *) (data2 + blocksize);
1228 count = dx_make_map((struct ext4_dir_entry_2 *) data1,
1229 blocksize, hinfo, map);
1231 dx_sort_map(map, count);
1232 /* Split the existing block in the middle, size-wise */
1235 for (i = count-1; i >= 0; i--) {
1236 /* is more than half of this entry in 2nd half of the block? */
1237 if (size + map[i].size/2 > blocksize/2)
1239 size += map[i].size;
1242 /* map index at which we will split */
1243 split = count - move;
1244 hash2 = map[split].hash;
1245 continued = hash2 == map[split - 1].hash;
1246 dxtrace(printk(KERN_INFO "Split block %lu at %x, %i/%i\n",
1247 (unsigned long)dx_get_block(frame->at),
1248 hash2, split, count-split));
1250 /* Fancy dance to stay within two buffers */
1251 de2 = dx_move_dirents(data1, data2, map + split, count - split, blocksize);
1252 de = dx_pack_dirents(data1, blocksize);
1253 de->rec_len = ext4_rec_len_to_disk(data1 + blocksize - (char *) de,
1255 de2->rec_len = ext4_rec_len_to_disk(data2 + blocksize - (char *) de2,
1257 dxtrace(dx_show_leaf (hinfo, (struct ext4_dir_entry_2 *) data1, blocksize, 1));
1258 dxtrace(dx_show_leaf (hinfo, (struct ext4_dir_entry_2 *) data2, blocksize, 1));
1260 /* Which block gets the new entry? */
1261 if (hinfo->hash >= hash2)
1266 dx_insert_block(frame, hash2 + continued, newblock);
1267 err = ext4_handle_dirty_metadata(handle, dir, bh2);
1270 err = ext4_handle_dirty_metadata(handle, dir, frame->bh);
1274 dxtrace(dx_show_index("frame", frame->entries));
1281 ext4_std_error(dir->i_sb, err);
1288 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1289 * it points to a directory entry which is guaranteed to be large
1290 * enough for new directory entry. If de is NULL, then
1291 * add_dirent_to_buf will attempt search the directory block for
1292 * space. It will return -ENOSPC if no space is available, and -EIO
1293 * and -EEXIST if directory entry already exists.
1295 * NOTE! bh is NOT released in the case where ENOSPC is returned. In
1296 * all other cases bh is released.
1298 static int add_dirent_to_buf(handle_t *handle, struct dentry *dentry,
1299 struct inode *inode, struct ext4_dir_entry_2 *de,
1300 struct buffer_head *bh)
1302 struct inode *dir = dentry->d_parent->d_inode;
1303 const char *name = dentry->d_name.name;
1304 int namelen = dentry->d_name.len;
1305 unsigned int offset = 0;
1306 unsigned int blocksize = dir->i_sb->s_blocksize;
1307 unsigned short reclen;
1308 int nlen, rlen, err;
1311 reclen = EXT4_DIR_REC_LEN(namelen);
1313 de = (struct ext4_dir_entry_2 *)bh->b_data;
1314 top = bh->b_data + blocksize - reclen;
1315 while ((char *) de <= top) {
1316 if (!ext4_check_dir_entry("ext4_add_entry", dir, de,
1321 if (ext4_match(namelen, name, de)) {
1325 nlen = EXT4_DIR_REC_LEN(de->name_len);
1326 rlen = ext4_rec_len_from_disk(de->rec_len, blocksize);
1327 if ((de->inode? rlen - nlen: rlen) >= reclen)
1329 de = (struct ext4_dir_entry_2 *)((char *)de + rlen);
1332 if ((char *) de > top)
1335 BUFFER_TRACE(bh, "get_write_access");
1336 err = ext4_journal_get_write_access(handle, bh);
1338 ext4_std_error(dir->i_sb, err);
1343 /* By now the buffer is marked for journaling */
1344 nlen = EXT4_DIR_REC_LEN(de->name_len);
1345 rlen = ext4_rec_len_from_disk(de->rec_len, blocksize);
1347 struct ext4_dir_entry_2 *de1 = (struct ext4_dir_entry_2 *)((char *)de + nlen);
1348 de1->rec_len = ext4_rec_len_to_disk(rlen - nlen, blocksize);
1349 de->rec_len = ext4_rec_len_to_disk(nlen, blocksize);
1352 de->file_type = EXT4_FT_UNKNOWN;
1354 de->inode = cpu_to_le32(inode->i_ino);
1355 ext4_set_de_type(dir->i_sb, de, inode->i_mode);
1358 de->name_len = namelen;
1359 memcpy(de->name, name, namelen);
1361 * XXX shouldn't update any times until successful
1362 * completion of syscall, but too many callers depend
1365 * XXX similarly, too many callers depend on
1366 * ext4_new_inode() setting the times, but error
1367 * recovery deletes the inode, so the worst that can
1368 * happen is that the times are slightly out of date
1369 * and/or different from the directory change time.
1371 dir->i_mtime = dir->i_ctime = ext4_current_time(dir);
1372 ext4_update_dx_flag(dir);
1374 ext4_mark_inode_dirty(handle, dir);
1375 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
1376 err = ext4_handle_dirty_metadata(handle, dir, bh);
1378 ext4_std_error(dir->i_sb, err);
1384 * This converts a one block unindexed directory to a 3 block indexed
1385 * directory, and adds the dentry to the indexed directory.
1387 static int make_indexed_dir(handle_t *handle, struct dentry *dentry,
1388 struct inode *inode, struct buffer_head *bh)
1390 struct inode *dir = dentry->d_parent->d_inode;
1391 const char *name = dentry->d_name.name;
1392 int namelen = dentry->d_name.len;
1393 struct buffer_head *bh2;
1394 struct dx_root *root;
1395 struct dx_frame frames[2], *frame;
1396 struct dx_entry *entries;
1397 struct ext4_dir_entry_2 *de, *de2;
1402 struct dx_hash_info hinfo;
1404 struct fake_dirent *fde;
1406 blocksize = dir->i_sb->s_blocksize;
1407 dxtrace(printk(KERN_DEBUG "Creating index: inode %lu\n", dir->i_ino));
1408 retval = ext4_journal_get_write_access(handle, bh);
1410 ext4_std_error(dir->i_sb, retval);
1414 root = (struct dx_root *) bh->b_data;
1416 /* The 0th block becomes the root, move the dirents out */
1417 fde = &root->dotdot;
1418 de = (struct ext4_dir_entry_2 *)((char *)fde +
1419 ext4_rec_len_from_disk(fde->rec_len, blocksize));
1420 if ((char *) de >= (((char *) root) + blocksize)) {
1421 ext4_error(dir->i_sb, __func__,
1422 "invalid rec_len for '..' in inode %lu",
1427 len = ((char *) root) + blocksize - (char *) de;
1429 /* Allocate new block for the 0th block's dirents */
1430 bh2 = ext4_append(handle, dir, &block, &retval);
1435 EXT4_I(dir)->i_flags |= EXT4_INDEX_FL;
1436 data1 = bh2->b_data;
1438 memcpy (data1, de, len);
1439 de = (struct ext4_dir_entry_2 *) data1;
1441 while ((char *)(de2 = ext4_next_entry(de, blocksize)) < top)
1443 de->rec_len = ext4_rec_len_to_disk(data1 + blocksize - (char *) de,
1445 /* Initialize the root; the dot dirents already exist */
1446 de = (struct ext4_dir_entry_2 *) (&root->dotdot);
1447 de->rec_len = ext4_rec_len_to_disk(blocksize - EXT4_DIR_REC_LEN(2),
1449 memset (&root->info, 0, sizeof(root->info));
1450 root->info.info_length = sizeof(root->info);
1451 root->info.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version;
1452 entries = root->entries;
1453 dx_set_block(entries, 1);
1454 dx_set_count(entries, 1);
1455 dx_set_limit(entries, dx_root_limit(dir, sizeof(root->info)));
1457 /* Initialize as for dx_probe */
1458 hinfo.hash_version = root->info.hash_version;
1459 if (hinfo.hash_version <= DX_HASH_TEA)
1460 hinfo.hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
1461 hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
1462 ext4fs_dirhash(name, namelen, &hinfo);
1464 frame->entries = entries;
1465 frame->at = entries;
1468 de = do_split(handle,dir, &bh, frame, &hinfo, &retval);
1469 dx_release (frames);
1473 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1479 * adds a file entry to the specified directory, using the same
1480 * semantics as ext4_find_entry(). It returns NULL if it failed.
1482 * NOTE!! The inode part of 'de' is left at 0 - which means you
1483 * may not sleep between calling this and putting something into
1484 * the entry, as someone else might have used it while you slept.
1486 static int ext4_add_entry(handle_t *handle, struct dentry *dentry,
1487 struct inode *inode)
1489 struct inode *dir = dentry->d_parent->d_inode;
1490 struct buffer_head *bh;
1491 struct ext4_dir_entry_2 *de;
1492 struct super_block *sb;
1496 ext4_lblk_t block, blocks;
1499 blocksize = sb->s_blocksize;
1500 if (!dentry->d_name.len)
1503 retval = ext4_dx_add_entry(handle, dentry, inode);
1504 if (!retval || (retval != ERR_BAD_DX_DIR))
1506 EXT4_I(dir)->i_flags &= ~EXT4_INDEX_FL;
1508 ext4_mark_inode_dirty(handle, dir);
1510 blocks = dir->i_size >> sb->s_blocksize_bits;
1511 for (block = 0; block < blocks; block++) {
1512 bh = ext4_bread(handle, dir, block, 0, &retval);
1515 retval = add_dirent_to_buf(handle, dentry, inode, NULL, bh);
1516 if (retval != -ENOSPC)
1519 if (blocks == 1 && !dx_fallback &&
1520 EXT4_HAS_COMPAT_FEATURE(sb, EXT4_FEATURE_COMPAT_DIR_INDEX))
1521 return make_indexed_dir(handle, dentry, inode, bh);
1524 bh = ext4_append(handle, dir, &block, &retval);
1527 de = (struct ext4_dir_entry_2 *) bh->b_data;
1529 de->rec_len = ext4_rec_len_to_disk(blocksize, blocksize);
1530 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1534 * Returns 0 for success, or a negative error value
1536 static int ext4_dx_add_entry(handle_t *handle, struct dentry *dentry,
1537 struct inode *inode)
1539 struct dx_frame frames[2], *frame;
1540 struct dx_entry *entries, *at;
1541 struct dx_hash_info hinfo;
1542 struct buffer_head *bh;
1543 struct inode *dir = dentry->d_parent->d_inode;
1544 struct super_block *sb = dir->i_sb;
1545 struct ext4_dir_entry_2 *de;
1548 frame = dx_probe(&dentry->d_name, dir, &hinfo, frames, &err);
1551 entries = frame->entries;
1554 if (!(bh = ext4_bread(handle,dir, dx_get_block(frame->at), 0, &err)))
1557 BUFFER_TRACE(bh, "get_write_access");
1558 err = ext4_journal_get_write_access(handle, bh);
1562 err = add_dirent_to_buf(handle, dentry, inode, NULL, bh);
1563 if (err != -ENOSPC) {
1568 /* Block full, should compress but for now just split */
1569 dxtrace(printk(KERN_DEBUG "using %u of %u node entries\n",
1570 dx_get_count(entries), dx_get_limit(entries)));
1571 /* Need to split index? */
1572 if (dx_get_count(entries) == dx_get_limit(entries)) {
1573 ext4_lblk_t newblock;
1574 unsigned icount = dx_get_count(entries);
1575 int levels = frame - frames;
1576 struct dx_entry *entries2;
1577 struct dx_node *node2;
1578 struct buffer_head *bh2;
1580 if (levels && (dx_get_count(frames->entries) ==
1581 dx_get_limit(frames->entries))) {
1582 ext4_warning(sb, __func__,
1583 "Directory index full!");
1587 bh2 = ext4_append (handle, dir, &newblock, &err);
1590 node2 = (struct dx_node *)(bh2->b_data);
1591 entries2 = node2->entries;
1592 node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize,
1594 node2->fake.inode = 0;
1595 BUFFER_TRACE(frame->bh, "get_write_access");
1596 err = ext4_journal_get_write_access(handle, frame->bh);
1600 unsigned icount1 = icount/2, icount2 = icount - icount1;
1601 unsigned hash2 = dx_get_hash(entries + icount1);
1602 dxtrace(printk(KERN_DEBUG "Split index %i/%i\n",
1605 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
1606 err = ext4_journal_get_write_access(handle,
1611 memcpy((char *) entries2, (char *) (entries + icount1),
1612 icount2 * sizeof(struct dx_entry));
1613 dx_set_count(entries, icount1);
1614 dx_set_count(entries2, icount2);
1615 dx_set_limit(entries2, dx_node_limit(dir));
1617 /* Which index block gets the new entry? */
1618 if (at - entries >= icount1) {
1619 frame->at = at = at - entries - icount1 + entries2;
1620 frame->entries = entries = entries2;
1621 swap(frame->bh, bh2);
1623 dx_insert_block(frames + 0, hash2, newblock);
1624 dxtrace(dx_show_index("node", frames[1].entries));
1625 dxtrace(dx_show_index("node",
1626 ((struct dx_node *) bh2->b_data)->entries));
1627 err = ext4_handle_dirty_metadata(handle, inode, bh2);
1632 dxtrace(printk(KERN_DEBUG
1633 "Creating second level index...\n"));
1634 memcpy((char *) entries2, (char *) entries,
1635 icount * sizeof(struct dx_entry));
1636 dx_set_limit(entries2, dx_node_limit(dir));
1639 dx_set_count(entries, 1);
1640 dx_set_block(entries + 0, newblock);
1641 ((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels = 1;
1643 /* Add new access path frame */
1645 frame->at = at = at - entries + entries2;
1646 frame->entries = entries = entries2;
1648 err = ext4_journal_get_write_access(handle,
1653 ext4_handle_dirty_metadata(handle, inode, frames[0].bh);
1655 de = do_split(handle, dir, &bh, frame, &hinfo, &err);
1658 err = add_dirent_to_buf(handle, dentry, inode, de, bh);
1663 ext4_std_error(dir->i_sb, err);
1672 * ext4_delete_entry deletes a directory entry by merging it with the
1675 static int ext4_delete_entry(handle_t *handle,
1677 struct ext4_dir_entry_2 *de_del,
1678 struct buffer_head *bh)
1680 struct ext4_dir_entry_2 *de, *pde;
1681 unsigned int blocksize = dir->i_sb->s_blocksize;
1686 de = (struct ext4_dir_entry_2 *) bh->b_data;
1687 while (i < bh->b_size) {
1688 if (!ext4_check_dir_entry("ext4_delete_entry", dir, de, bh, i))
1691 BUFFER_TRACE(bh, "get_write_access");
1692 ext4_journal_get_write_access(handle, bh);
1694 pde->rec_len = ext4_rec_len_to_disk(
1695 ext4_rec_len_from_disk(pde->rec_len,
1697 ext4_rec_len_from_disk(de->rec_len,
1703 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
1704 ext4_handle_dirty_metadata(handle, dir, bh);
1707 i += ext4_rec_len_from_disk(de->rec_len, blocksize);
1709 de = ext4_next_entry(de, blocksize);
1715 * DIR_NLINK feature is set if 1) nlinks > EXT4_LINK_MAX or 2) nlinks == 2,
1716 * since this indicates that nlinks count was previously 1.
1718 static void ext4_inc_count(handle_t *handle, struct inode *inode)
1721 if (is_dx(inode) && inode->i_nlink > 1) {
1722 /* limit is 16-bit i_links_count */
1723 if (inode->i_nlink >= EXT4_LINK_MAX || inode->i_nlink == 2) {
1725 EXT4_SET_RO_COMPAT_FEATURE(inode->i_sb,
1726 EXT4_FEATURE_RO_COMPAT_DIR_NLINK);
1732 * If a directory had nlink == 1, then we should let it be 1. This indicates
1733 * directory has >EXT4_LINK_MAX subdirs.
1735 static void ext4_dec_count(handle_t *handle, struct inode *inode)
1738 if (S_ISDIR(inode->i_mode) && inode->i_nlink == 0)
1743 static int ext4_add_nondir(handle_t *handle,
1744 struct dentry *dentry, struct inode *inode)
1746 int err = ext4_add_entry(handle, dentry, inode);
1748 ext4_mark_inode_dirty(handle, inode);
1749 d_instantiate(dentry, inode);
1750 unlock_new_inode(inode);
1754 unlock_new_inode(inode);
1760 * By the time this is called, we already have created
1761 * the directory cache entry for the new file, but it
1762 * is so far negative - it has no inode.
1764 * If the create succeeds, we fill in the inode information
1765 * with d_instantiate().
1767 static int ext4_create(struct inode *dir, struct dentry *dentry, int mode,
1768 struct nameidata *nd)
1771 struct inode *inode;
1772 int err, retries = 0;
1775 handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
1776 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1777 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb));
1779 return PTR_ERR(handle);
1781 if (IS_DIRSYNC(dir))
1782 ext4_handle_sync(handle);
1784 inode = ext4_new_inode (handle, dir, mode);
1785 err = PTR_ERR(inode);
1786 if (!IS_ERR(inode)) {
1787 inode->i_op = &ext4_file_inode_operations;
1788 inode->i_fop = &ext4_file_operations;
1789 ext4_set_aops(inode);
1790 err = ext4_add_nondir(handle, dentry, inode);
1792 ext4_journal_stop(handle);
1793 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
1798 static int ext4_mknod(struct inode *dir, struct dentry *dentry,
1799 int mode, dev_t rdev)
1802 struct inode *inode;
1803 int err, retries = 0;
1805 if (!new_valid_dev(rdev))
1809 handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
1810 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1811 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb));
1813 return PTR_ERR(handle);
1815 if (IS_DIRSYNC(dir))
1816 ext4_handle_sync(handle);
1818 inode = ext4_new_inode(handle, dir, mode);
1819 err = PTR_ERR(inode);
1820 if (!IS_ERR(inode)) {
1821 init_special_inode(inode, inode->i_mode, rdev);
1822 #ifdef CONFIG_EXT4_FS_XATTR
1823 inode->i_op = &ext4_special_inode_operations;
1825 err = ext4_add_nondir(handle, dentry, inode);
1827 ext4_journal_stop(handle);
1828 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
1833 static int ext4_mkdir(struct inode *dir, struct dentry *dentry, int mode)
1836 struct inode *inode;
1837 struct buffer_head *dir_block;
1838 struct ext4_dir_entry_2 *de;
1839 unsigned int blocksize = dir->i_sb->s_blocksize;
1840 int err, retries = 0;
1842 if (EXT4_DIR_LINK_MAX(dir))
1846 handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
1847 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1848 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb));
1850 return PTR_ERR(handle);
1852 if (IS_DIRSYNC(dir))
1853 ext4_handle_sync(handle);
1855 inode = ext4_new_inode(handle, dir, S_IFDIR | mode);
1856 err = PTR_ERR(inode);
1860 inode->i_op = &ext4_dir_inode_operations;
1861 inode->i_fop = &ext4_dir_operations;
1862 inode->i_size = EXT4_I(inode)->i_disksize = inode->i_sb->s_blocksize;
1863 dir_block = ext4_bread(handle, inode, 0, 1, &err);
1865 goto out_clear_inode;
1866 BUFFER_TRACE(dir_block, "get_write_access");
1867 ext4_journal_get_write_access(handle, dir_block);
1868 de = (struct ext4_dir_entry_2 *) dir_block->b_data;
1869 de->inode = cpu_to_le32(inode->i_ino);
1871 de->rec_len = ext4_rec_len_to_disk(EXT4_DIR_REC_LEN(de->name_len),
1873 strcpy(de->name, ".");
1874 ext4_set_de_type(dir->i_sb, de, S_IFDIR);
1875 de = ext4_next_entry(de, blocksize);
1876 de->inode = cpu_to_le32(dir->i_ino);
1877 de->rec_len = ext4_rec_len_to_disk(blocksize - EXT4_DIR_REC_LEN(1),
1880 strcpy(de->name, "..");
1881 ext4_set_de_type(dir->i_sb, de, S_IFDIR);
1883 BUFFER_TRACE(dir_block, "call ext4_handle_dirty_metadata");
1884 ext4_handle_dirty_metadata(handle, dir, dir_block);
1886 ext4_mark_inode_dirty(handle, inode);
1887 err = ext4_add_entry(handle, dentry, inode);
1891 unlock_new_inode(inode);
1892 ext4_mark_inode_dirty(handle, inode);
1896 ext4_inc_count(handle, dir);
1897 ext4_update_dx_flag(dir);
1898 ext4_mark_inode_dirty(handle, dir);
1899 d_instantiate(dentry, inode);
1900 unlock_new_inode(inode);
1902 ext4_journal_stop(handle);
1903 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
1909 * routine to check that the specified directory is empty (for rmdir)
1911 static int empty_dir(struct inode *inode)
1913 unsigned int offset;
1914 struct buffer_head *bh;
1915 struct ext4_dir_entry_2 *de, *de1;
1916 struct super_block *sb;
1920 if (inode->i_size < EXT4_DIR_REC_LEN(1) + EXT4_DIR_REC_LEN(2) ||
1921 !(bh = ext4_bread(NULL, inode, 0, 0, &err))) {
1923 ext4_error(inode->i_sb, __func__,
1924 "error %d reading directory #%lu offset 0",
1927 ext4_warning(inode->i_sb, __func__,
1928 "bad directory (dir #%lu) - no data block",
1932 de = (struct ext4_dir_entry_2 *) bh->b_data;
1933 de1 = ext4_next_entry(de, sb->s_blocksize);
1934 if (le32_to_cpu(de->inode) != inode->i_ino ||
1935 !le32_to_cpu(de1->inode) ||
1936 strcmp(".", de->name) ||
1937 strcmp("..", de1->name)) {
1938 ext4_warning(inode->i_sb, "empty_dir",
1939 "bad directory (dir #%lu) - no `.' or `..'",
1944 offset = ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize) +
1945 ext4_rec_len_from_disk(de1->rec_len, sb->s_blocksize);
1946 de = ext4_next_entry(de1, sb->s_blocksize);
1947 while (offset < inode->i_size) {
1949 (void *) de >= (void *) (bh->b_data+sb->s_blocksize)) {
1952 bh = ext4_bread(NULL, inode,
1953 offset >> EXT4_BLOCK_SIZE_BITS(sb), 0, &err);
1956 ext4_error(sb, __func__,
1957 "error %d reading directory"
1959 err, inode->i_ino, offset);
1960 offset += sb->s_blocksize;
1963 de = (struct ext4_dir_entry_2 *) bh->b_data;
1965 if (!ext4_check_dir_entry("empty_dir", inode, de, bh, offset)) {
1966 de = (struct ext4_dir_entry_2 *)(bh->b_data +
1968 offset = (offset | (sb->s_blocksize - 1)) + 1;
1971 if (le32_to_cpu(de->inode)) {
1975 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
1976 de = ext4_next_entry(de, sb->s_blocksize);
1982 /* ext4_orphan_add() links an unlinked or truncated inode into a list of
1983 * such inodes, starting at the superblock, in case we crash before the
1984 * file is closed/deleted, or in case the inode truncate spans multiple
1985 * transactions and the last transaction is not recovered after a crash.
1987 * At filesystem recovery time, we walk this list deleting unlinked
1988 * inodes and truncating linked inodes in ext4_orphan_cleanup().
1990 int ext4_orphan_add(handle_t *handle, struct inode *inode)
1992 struct super_block *sb = inode->i_sb;
1993 struct ext4_iloc iloc;
1996 if (!ext4_handle_valid(handle))
1999 mutex_lock(&EXT4_SB(sb)->s_orphan_lock);
2000 if (!list_empty(&EXT4_I(inode)->i_orphan))
2003 /* Orphan handling is only valid for files with data blocks
2004 * being truncated, or files being unlinked. */
2006 /* @@@ FIXME: Observation from aviro:
2007 * I think I can trigger J_ASSERT in ext4_orphan_add(). We block
2008 * here (on s_orphan_lock), so race with ext4_link() which might bump
2009 * ->i_nlink. For, say it, character device. Not a regular file,
2010 * not a directory, not a symlink and ->i_nlink > 0.
2012 * tytso, 4/25/2009: I'm not sure how that could happen;
2013 * shouldn't the fs core protect us from these sort of
2014 * unlink()/link() races?
2016 J_ASSERT((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
2017 S_ISLNK(inode->i_mode)) || inode->i_nlink == 0);
2019 BUFFER_TRACE(EXT4_SB(sb)->s_sbh, "get_write_access");
2020 err = ext4_journal_get_write_access(handle, EXT4_SB(sb)->s_sbh);
2024 err = ext4_reserve_inode_write(handle, inode, &iloc);
2028 /* Insert this inode at the head of the on-disk orphan list... */
2029 NEXT_ORPHAN(inode) = le32_to_cpu(EXT4_SB(sb)->s_es->s_last_orphan);
2030 EXT4_SB(sb)->s_es->s_last_orphan = cpu_to_le32(inode->i_ino);
2031 err = ext4_handle_dirty_metadata(handle, inode, EXT4_SB(sb)->s_sbh);
2032 rc = ext4_mark_iloc_dirty(handle, inode, &iloc);
2036 /* Only add to the head of the in-memory list if all the
2037 * previous operations succeeded. If the orphan_add is going to
2038 * fail (possibly taking the journal offline), we can't risk
2039 * leaving the inode on the orphan list: stray orphan-list
2040 * entries can cause panics at unmount time.
2042 * This is safe: on error we're going to ignore the orphan list
2043 * anyway on the next recovery. */
2045 list_add(&EXT4_I(inode)->i_orphan, &EXT4_SB(sb)->s_orphan);
2047 jbd_debug(4, "superblock will point to %lu\n", inode->i_ino);
2048 jbd_debug(4, "orphan inode %lu will point to %d\n",
2049 inode->i_ino, NEXT_ORPHAN(inode));
2051 mutex_unlock(&EXT4_SB(sb)->s_orphan_lock);
2052 ext4_std_error(inode->i_sb, err);
2057 * ext4_orphan_del() removes an unlinked or truncated inode from the list
2058 * of such inodes stored on disk, because it is finally being cleaned up.
2060 int ext4_orphan_del(handle_t *handle, struct inode *inode)
2062 struct list_head *prev;
2063 struct ext4_inode_info *ei = EXT4_I(inode);
2064 struct ext4_sb_info *sbi;
2066 struct ext4_iloc iloc;
2069 if (!ext4_handle_valid(handle))
2072 mutex_lock(&EXT4_SB(inode->i_sb)->s_orphan_lock);
2073 if (list_empty(&ei->i_orphan))
2076 ino_next = NEXT_ORPHAN(inode);
2077 prev = ei->i_orphan.prev;
2078 sbi = EXT4_SB(inode->i_sb);
2080 jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino);
2082 list_del_init(&ei->i_orphan);
2084 /* If we're on an error path, we may not have a valid
2085 * transaction handle with which to update the orphan list on
2086 * disk, but we still need to remove the inode from the linked
2087 * list in memory. */
2088 if (sbi->s_journal && !handle)
2091 err = ext4_reserve_inode_write(handle, inode, &iloc);
2095 if (prev == &sbi->s_orphan) {
2096 jbd_debug(4, "superblock will point to %u\n", ino_next);
2097 BUFFER_TRACE(sbi->s_sbh, "get_write_access");
2098 err = ext4_journal_get_write_access(handle, sbi->s_sbh);
2101 sbi->s_es->s_last_orphan = cpu_to_le32(ino_next);
2102 err = ext4_handle_dirty_metadata(handle, inode, sbi->s_sbh);
2104 struct ext4_iloc iloc2;
2105 struct inode *i_prev =
2106 &list_entry(prev, struct ext4_inode_info, i_orphan)->vfs_inode;
2108 jbd_debug(4, "orphan inode %lu will point to %u\n",
2109 i_prev->i_ino, ino_next);
2110 err = ext4_reserve_inode_write(handle, i_prev, &iloc2);
2113 NEXT_ORPHAN(i_prev) = ino_next;
2114 err = ext4_mark_iloc_dirty(handle, i_prev, &iloc2);
2118 NEXT_ORPHAN(inode) = 0;
2119 err = ext4_mark_iloc_dirty(handle, inode, &iloc);
2122 ext4_std_error(inode->i_sb, err);
2124 mutex_unlock(&EXT4_SB(inode->i_sb)->s_orphan_lock);
2132 static int ext4_rmdir(struct inode *dir, struct dentry *dentry)
2135 struct inode *inode;
2136 struct buffer_head *bh;
2137 struct ext4_dir_entry_2 *de;
2140 /* Initialize quotas before so that eventual writes go in
2141 * separate transaction */
2142 vfs_dq_init(dentry->d_inode);
2143 handle = ext4_journal_start(dir, EXT4_DELETE_TRANS_BLOCKS(dir->i_sb));
2145 return PTR_ERR(handle);
2148 bh = ext4_find_entry(dir, &dentry->d_name, &de);
2152 if (IS_DIRSYNC(dir))
2153 ext4_handle_sync(handle);
2155 inode = dentry->d_inode;
2158 if (le32_to_cpu(de->inode) != inode->i_ino)
2161 retval = -ENOTEMPTY;
2162 if (!empty_dir(inode))
2165 retval = ext4_delete_entry(handle, dir, de, bh);
2168 if (!EXT4_DIR_LINK_EMPTY(inode))
2169 ext4_warning(inode->i_sb, "ext4_rmdir",
2170 "empty directory has too many links (%d)",
2174 /* There's no need to set i_disksize: the fact that i_nlink is
2175 * zero will ensure that the right thing happens during any
2178 ext4_orphan_add(handle, inode);
2179 inode->i_ctime = dir->i_ctime = dir->i_mtime = ext4_current_time(inode);
2180 ext4_mark_inode_dirty(handle, inode);
2181 ext4_dec_count(handle, dir);
2182 ext4_update_dx_flag(dir);
2183 ext4_mark_inode_dirty(handle, dir);
2186 ext4_journal_stop(handle);
2191 static int ext4_unlink(struct inode *dir, struct dentry *dentry)
2194 struct inode *inode;
2195 struct buffer_head *bh;
2196 struct ext4_dir_entry_2 *de;
2199 /* Initialize quotas before so that eventual writes go
2200 * in separate transaction */
2201 vfs_dq_init(dentry->d_inode);
2202 handle = ext4_journal_start(dir, EXT4_DELETE_TRANS_BLOCKS(dir->i_sb));
2204 return PTR_ERR(handle);
2206 if (IS_DIRSYNC(dir))
2207 ext4_handle_sync(handle);
2210 bh = ext4_find_entry(dir, &dentry->d_name, &de);
2214 inode = dentry->d_inode;
2217 if (le32_to_cpu(de->inode) != inode->i_ino)
2220 if (!inode->i_nlink) {
2221 ext4_warning(inode->i_sb, "ext4_unlink",
2222 "Deleting nonexistent file (%lu), %d",
2223 inode->i_ino, inode->i_nlink);
2226 retval = ext4_delete_entry(handle, dir, de, bh);
2229 dir->i_ctime = dir->i_mtime = ext4_current_time(dir);
2230 ext4_update_dx_flag(dir);
2231 ext4_mark_inode_dirty(handle, dir);
2233 if (!inode->i_nlink)
2234 ext4_orphan_add(handle, inode);
2235 inode->i_ctime = ext4_current_time(inode);
2236 ext4_mark_inode_dirty(handle, inode);
2240 ext4_journal_stop(handle);
2245 static int ext4_symlink(struct inode *dir,
2246 struct dentry *dentry, const char *symname)
2249 struct inode *inode;
2250 int l, err, retries = 0;
2252 l = strlen(symname)+1;
2253 if (l > dir->i_sb->s_blocksize)
2254 return -ENAMETOOLONG;
2257 handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2258 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 5 +
2259 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb));
2261 return PTR_ERR(handle);
2263 if (IS_DIRSYNC(dir))
2264 ext4_handle_sync(handle);
2266 inode = ext4_new_inode(handle, dir, S_IFLNK|S_IRWXUGO);
2267 err = PTR_ERR(inode);
2271 if (l > sizeof(EXT4_I(inode)->i_data)) {
2272 inode->i_op = &ext4_symlink_inode_operations;
2273 ext4_set_aops(inode);
2275 * page_symlink() calls into ext4_prepare/commit_write.
2276 * We have a transaction open. All is sweetness. It also sets
2277 * i_size in generic_commit_write().
2279 err = __page_symlink(inode, symname, l, 1);
2282 unlock_new_inode(inode);
2283 ext4_mark_inode_dirty(handle, inode);
2288 /* clear the extent format for fast symlink */
2289 EXT4_I(inode)->i_flags &= ~EXT4_EXTENTS_FL;
2290 inode->i_op = &ext4_fast_symlink_inode_operations;
2291 memcpy((char *)&EXT4_I(inode)->i_data, symname, l);
2292 inode->i_size = l-1;
2294 EXT4_I(inode)->i_disksize = inode->i_size;
2295 err = ext4_add_nondir(handle, dentry, inode);
2297 ext4_journal_stop(handle);
2298 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2303 static int ext4_link(struct dentry *old_dentry,
2304 struct inode *dir, struct dentry *dentry)
2307 struct inode *inode = old_dentry->d_inode;
2308 int err, retries = 0;
2310 if (EXT4_DIR_LINK_MAX(inode))
2314 * Return -ENOENT if we've raced with unlink and i_nlink is 0. Doing
2315 * otherwise has the potential to corrupt the orphan inode list.
2317 if (inode->i_nlink == 0)
2321 handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2322 EXT4_INDEX_EXTRA_TRANS_BLOCKS);
2324 return PTR_ERR(handle);
2326 if (IS_DIRSYNC(dir))
2327 ext4_handle_sync(handle);
2329 inode->i_ctime = ext4_current_time(inode);
2330 ext4_inc_count(handle, inode);
2331 atomic_inc(&inode->i_count);
2333 err = ext4_add_entry(handle, dentry, inode);
2335 ext4_mark_inode_dirty(handle, inode);
2336 d_instantiate(dentry, inode);
2341 ext4_journal_stop(handle);
2342 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2347 #define PARENT_INO(buffer, size) \
2348 (ext4_next_entry((struct ext4_dir_entry_2 *)(buffer), size)->inode)
2351 * Anybody can rename anything with this: the permission checks are left to the
2352 * higher-level routines.
2354 static int ext4_rename(struct inode *old_dir, struct dentry *old_dentry,
2355 struct inode *new_dir, struct dentry *new_dentry)
2358 struct inode *old_inode, *new_inode;
2359 struct buffer_head *old_bh, *new_bh, *dir_bh;
2360 struct ext4_dir_entry_2 *old_de, *new_de;
2361 int retval, force_da_alloc = 0;
2363 old_bh = new_bh = dir_bh = NULL;
2365 /* Initialize quotas before so that eventual writes go
2366 * in separate transaction */
2367 if (new_dentry->d_inode)
2368 vfs_dq_init(new_dentry->d_inode);
2369 handle = ext4_journal_start(old_dir, 2 *
2370 EXT4_DATA_TRANS_BLOCKS(old_dir->i_sb) +
2371 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2);
2373 return PTR_ERR(handle);
2375 if (IS_DIRSYNC(old_dir) || IS_DIRSYNC(new_dir))
2376 ext4_handle_sync(handle);
2378 old_bh = ext4_find_entry(old_dir, &old_dentry->d_name, &old_de);
2380 * Check for inode number is _not_ due to possible IO errors.
2381 * We might rmdir the source, keep it as pwd of some process
2382 * and merrily kill the link to whatever was created under the
2383 * same name. Goodbye sticky bit ;-<
2385 old_inode = old_dentry->d_inode;
2387 if (!old_bh || le32_to_cpu(old_de->inode) != old_inode->i_ino)
2390 new_inode = new_dentry->d_inode;
2391 new_bh = ext4_find_entry(new_dir, &new_dentry->d_name, &new_de);
2398 if (S_ISDIR(old_inode->i_mode)) {
2400 retval = -ENOTEMPTY;
2401 if (!empty_dir(new_inode))
2405 dir_bh = ext4_bread(handle, old_inode, 0, 0, &retval);
2408 if (le32_to_cpu(PARENT_INO(dir_bh->b_data,
2409 old_dir->i_sb->s_blocksize)) != old_dir->i_ino)
2412 if (!new_inode && new_dir != old_dir &&
2413 new_dir->i_nlink >= EXT4_LINK_MAX)
2417 retval = ext4_add_entry(handle, new_dentry, old_inode);
2421 BUFFER_TRACE(new_bh, "get write access");
2422 ext4_journal_get_write_access(handle, new_bh);
2423 new_de->inode = cpu_to_le32(old_inode->i_ino);
2424 if (EXT4_HAS_INCOMPAT_FEATURE(new_dir->i_sb,
2425 EXT4_FEATURE_INCOMPAT_FILETYPE))
2426 new_de->file_type = old_de->file_type;
2427 new_dir->i_version++;
2428 new_dir->i_ctime = new_dir->i_mtime =
2429 ext4_current_time(new_dir);
2430 ext4_mark_inode_dirty(handle, new_dir);
2431 BUFFER_TRACE(new_bh, "call ext4_handle_dirty_metadata");
2432 ext4_handle_dirty_metadata(handle, new_dir, new_bh);
2438 * Like most other Unix systems, set the ctime for inodes on a
2441 old_inode->i_ctime = ext4_current_time(old_inode);
2442 ext4_mark_inode_dirty(handle, old_inode);
2447 if (le32_to_cpu(old_de->inode) != old_inode->i_ino ||
2448 old_de->name_len != old_dentry->d_name.len ||
2449 strncmp(old_de->name, old_dentry->d_name.name, old_de->name_len) ||
2450 (retval = ext4_delete_entry(handle, old_dir,
2451 old_de, old_bh)) == -ENOENT) {
2452 /* old_de could have moved from under us during htree split, so
2453 * make sure that we are deleting the right entry. We might
2454 * also be pointing to a stale entry in the unused part of
2455 * old_bh so just checking inum and the name isn't enough. */
2456 struct buffer_head *old_bh2;
2457 struct ext4_dir_entry_2 *old_de2;
2459 old_bh2 = ext4_find_entry(old_dir, &old_dentry->d_name, &old_de2);
2461 retval = ext4_delete_entry(handle, old_dir,
2467 ext4_warning(old_dir->i_sb, "ext4_rename",
2468 "Deleting old file (%lu), %d, error=%d",
2469 old_dir->i_ino, old_dir->i_nlink, retval);
2473 ext4_dec_count(handle, new_inode);
2474 new_inode->i_ctime = ext4_current_time(new_inode);
2476 old_dir->i_ctime = old_dir->i_mtime = ext4_current_time(old_dir);
2477 ext4_update_dx_flag(old_dir);
2479 BUFFER_TRACE(dir_bh, "get_write_access");
2480 ext4_journal_get_write_access(handle, dir_bh);
2481 PARENT_INO(dir_bh->b_data, new_dir->i_sb->s_blocksize) =
2482 cpu_to_le32(new_dir->i_ino);
2483 BUFFER_TRACE(dir_bh, "call ext4_handle_dirty_metadata");
2484 ext4_handle_dirty_metadata(handle, old_dir, dir_bh);
2485 ext4_dec_count(handle, old_dir);
2487 /* checked empty_dir above, can't have another parent,
2488 * ext4_dec_count() won't work for many-linked dirs */
2489 new_inode->i_nlink = 0;
2491 ext4_inc_count(handle, new_dir);
2492 ext4_update_dx_flag(new_dir);
2493 ext4_mark_inode_dirty(handle, new_dir);
2496 ext4_mark_inode_dirty(handle, old_dir);
2498 ext4_mark_inode_dirty(handle, new_inode);
2499 if (!new_inode->i_nlink)
2500 ext4_orphan_add(handle, new_inode);
2501 if (!test_opt(new_dir->i_sb, NO_AUTO_DA_ALLOC))
2510 ext4_journal_stop(handle);
2511 if (retval == 0 && force_da_alloc)
2512 ext4_alloc_da_blocks(old_inode);
2517 * directories can handle most operations...
2519 const struct inode_operations ext4_dir_inode_operations = {
2520 .create = ext4_create,
2521 .lookup = ext4_lookup,
2523 .unlink = ext4_unlink,
2524 .symlink = ext4_symlink,
2525 .mkdir = ext4_mkdir,
2526 .rmdir = ext4_rmdir,
2527 .mknod = ext4_mknod,
2528 .rename = ext4_rename,
2529 .setattr = ext4_setattr,
2530 #ifdef CONFIG_EXT4_FS_XATTR
2531 .setxattr = generic_setxattr,
2532 .getxattr = generic_getxattr,
2533 .listxattr = ext4_listxattr,
2534 .removexattr = generic_removexattr,
2536 .permission = ext4_permission,
2537 .fiemap = ext4_fiemap,
2540 const struct inode_operations ext4_special_inode_operations = {
2541 .setattr = ext4_setattr,
2542 #ifdef CONFIG_EXT4_FS_XATTR
2543 .setxattr = generic_setxattr,
2544 .getxattr = generic_getxattr,
2545 .listxattr = ext4_listxattr,
2546 .removexattr = generic_removexattr,
2548 .permission = ext4_permission,