2 * linux/fs/ext3/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/jbd.h>
30 #include <linux/time.h>
31 #include <linux/ext3_fs.h>
32 #include <linux/ext3_jbd.h>
33 #include <linux/fcntl.h>
34 #include <linux/stat.h>
35 #include <linux/string.h>
36 #include <linux/quotaops.h>
37 #include <linux/buffer_head.h>
38 #include <linux/smp_lock.h>
43 * define how far ahead to read directories while searching them.
45 #define NAMEI_RA_CHUNKS 2
46 #define NAMEI_RA_BLOCKS 4
47 #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS)
48 #define NAMEI_RA_INDEX(c,b) (((c) * NAMEI_RA_BLOCKS) + (b))
50 static struct buffer_head *ext3_append(handle_t *handle,
54 struct buffer_head *bh;
56 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
58 if ((bh = ext3_bread(handle, inode, *block, 1, err))) {
59 inode->i_size += inode->i_sb->s_blocksize;
60 EXT3_I(inode)->i_disksize = inode->i_size;
61 ext3_journal_get_write_access(handle,bh);
67 #define assert(test) J_ASSERT(test)
71 #define swap(x, y) do { typeof(x) z = x; x = y; y = z; } while (0)
74 typedef struct { u32 v; } le_u32;
75 typedef struct { u16 v; } le_u16;
78 #define dxtrace(command) command
80 #define dxtrace(command)
104 * dx_root_info is laid out so that if it should somehow get overlaid by a
105 * dirent the two low bits of the hash version will be zero. Therefore, the
106 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
111 struct fake_dirent dot;
113 struct fake_dirent dotdot;
117 le_u32 reserved_zero;
119 u8 info_length; /* 8 */
124 struct dx_entry entries[0];
129 struct fake_dirent fake;
130 struct dx_entry entries[0];
136 struct buffer_head *bh;
137 struct dx_entry *entries;
147 #ifdef CONFIG_EXT3_INDEX
148 static inline unsigned dx_get_block (struct dx_entry *entry);
149 static void dx_set_block (struct dx_entry *entry, unsigned value);
150 static inline unsigned dx_get_hash (struct dx_entry *entry);
151 static void dx_set_hash (struct dx_entry *entry, unsigned value);
152 static unsigned dx_get_count (struct dx_entry *entries);
153 static unsigned dx_get_limit (struct dx_entry *entries);
154 static void dx_set_count (struct dx_entry *entries, unsigned value);
155 static void dx_set_limit (struct dx_entry *entries, unsigned value);
156 static unsigned dx_root_limit (struct inode *dir, unsigned infosize);
157 static unsigned dx_node_limit (struct inode *dir);
158 static struct dx_frame *dx_probe(struct dentry *dentry,
160 struct dx_hash_info *hinfo,
161 struct dx_frame *frame,
163 static void dx_release (struct dx_frame *frames);
164 static int dx_make_map (struct ext3_dir_entry_2 *de, int size,
165 struct dx_hash_info *hinfo, struct dx_map_entry map[]);
166 static void dx_sort_map(struct dx_map_entry *map, unsigned count);
167 static struct ext3_dir_entry_2 *dx_move_dirents (char *from, char *to,
168 struct dx_map_entry *offsets, int count);
169 static struct ext3_dir_entry_2* dx_pack_dirents (char *base, int size);
170 static void dx_insert_block (struct dx_frame *frame, u32 hash, u32 block);
171 static int ext3_htree_next_block(struct inode *dir, __u32 hash,
172 struct dx_frame *frame,
173 struct dx_frame *frames,
175 static struct buffer_head * ext3_dx_find_entry(struct dentry *dentry,
176 struct ext3_dir_entry_2 **res_dir, int *err);
177 static int ext3_dx_add_entry(handle_t *handle, struct dentry *dentry,
178 struct inode *inode);
181 * Future: use high four bits of block for coalesce-on-delete flags
182 * Mask them off for now.
185 static inline unsigned dx_get_block (struct dx_entry *entry)
187 return le32_to_cpu(entry->block.v) & 0x00ffffff;
190 static inline void dx_set_block (struct dx_entry *entry, unsigned value)
192 entry->block.v = cpu_to_le32(value);
195 static inline unsigned dx_get_hash (struct dx_entry *entry)
197 return le32_to_cpu(entry->hash.v);
200 static inline void dx_set_hash (struct dx_entry *entry, unsigned value)
202 entry->hash.v = cpu_to_le32(value);
205 static inline unsigned dx_get_count (struct dx_entry *entries)
207 return le16_to_cpu(((struct dx_countlimit *) entries)->count.v);
210 static inline unsigned dx_get_limit (struct dx_entry *entries)
212 return le16_to_cpu(((struct dx_countlimit *) entries)->limit.v);
215 static inline void dx_set_count (struct dx_entry *entries, unsigned value)
217 ((struct dx_countlimit *) entries)->count.v = cpu_to_le16(value);
220 static inline void dx_set_limit (struct dx_entry *entries, unsigned value)
222 ((struct dx_countlimit *) entries)->limit.v = cpu_to_le16(value);
225 static inline unsigned dx_root_limit (struct inode *dir, unsigned infosize)
227 unsigned entry_space = dir->i_sb->s_blocksize - EXT3_DIR_REC_LEN(1) -
228 EXT3_DIR_REC_LEN(2) - infosize;
229 return 0? 20: entry_space / sizeof(struct dx_entry);
232 static inline unsigned dx_node_limit (struct inode *dir)
234 unsigned entry_space = dir->i_sb->s_blocksize - EXT3_DIR_REC_LEN(0);
235 return 0? 22: entry_space / sizeof(struct dx_entry);
242 static void dx_show_index (char * label, struct dx_entry *entries)
244 int i, n = dx_get_count (entries);
245 printk("%s index ", label);
246 for (i = 0; i < n; i++)
248 printk("%x->%u ", i? dx_get_hash(entries + i): 0, dx_get_block(entries + i));
260 static struct stats dx_show_leaf(struct dx_hash_info *hinfo, struct ext3_dir_entry_2 *de,
261 int size, int show_names)
263 unsigned names = 0, space = 0;
264 char *base = (char *) de;
265 struct dx_hash_info h = *hinfo;
268 while ((char *) de < base + size)
274 int len = de->name_len;
275 char *name = de->name;
276 while (len--) printk("%c", *name++);
277 ext3fs_dirhash(de->name, de->name_len, &h);
278 printk(":%x.%u ", h.hash,
279 ((char *) de - base));
281 space += EXT3_DIR_REC_LEN(de->name_len);
284 de = (struct ext3_dir_entry_2 *) ((char *) de + le16_to_cpu(de->rec_len));
286 printk("(%i)\n", names);
287 return (struct stats) { names, space, 1 };
290 struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
291 struct dx_entry *entries, int levels)
293 unsigned blocksize = dir->i_sb->s_blocksize;
294 unsigned count = dx_get_count (entries), names = 0, space = 0, i;
296 struct buffer_head *bh;
298 printk("%i indexed blocks...\n", count);
299 for (i = 0; i < count; i++, entries++)
301 u32 block = dx_get_block(entries), hash = i? dx_get_hash(entries): 0;
302 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
304 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
305 if (!(bh = ext3_bread (NULL,dir, block, 0,&err))) continue;
307 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
308 dx_show_leaf(hinfo, (struct ext3_dir_entry_2 *) bh->b_data, blocksize, 0);
309 names += stats.names;
310 space += stats.space;
311 bcount += stats.bcount;
315 printk("%snames %u, fullness %u (%u%%)\n", levels?"":" ",
316 names, space/bcount,(space/bcount)*100/blocksize);
317 return (struct stats) { names, space, bcount};
319 #endif /* DX_DEBUG */
322 * Probe for a directory leaf block to search.
324 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
325 * error in the directory index, and the caller should fall back to
326 * searching the directory normally. The callers of dx_probe **MUST**
327 * check for this error code, and make sure it never gets reflected
330 static struct dx_frame *
331 dx_probe(struct dentry *dentry, struct inode *dir,
332 struct dx_hash_info *hinfo, struct dx_frame *frame_in, int *err)
334 unsigned count, indirect;
335 struct dx_entry *at, *entries, *p, *q, *m;
336 struct dx_root *root;
337 struct buffer_head *bh;
338 struct dx_frame *frame = frame_in;
343 dir = dentry->d_parent->d_inode;
344 if (!(bh = ext3_bread (NULL,dir, 0, 0, err)))
346 root = (struct dx_root *) bh->b_data;
347 if (root->info.hash_version != DX_HASH_TEA &&
348 root->info.hash_version != DX_HASH_HALF_MD4 &&
349 root->info.hash_version != DX_HASH_LEGACY) {
350 ext3_warning(dir->i_sb, __FUNCTION__,
351 "Unrecognised inode hash code %d",
352 root->info.hash_version);
354 *err = ERR_BAD_DX_DIR;
357 hinfo->hash_version = root->info.hash_version;
358 hinfo->seed = EXT3_SB(dir->i_sb)->s_hash_seed;
360 ext3fs_dirhash(dentry->d_name.name, dentry->d_name.len, hinfo);
363 if (root->info.unused_flags & 1) {
364 ext3_warning(dir->i_sb, __FUNCTION__,
365 "Unimplemented inode hash flags: %#06x",
366 root->info.unused_flags);
368 *err = ERR_BAD_DX_DIR;
372 if ((indirect = root->info.indirect_levels) > 1) {
373 ext3_warning(dir->i_sb, __FUNCTION__,
374 "Unimplemented inode hash depth: %#06x",
375 root->info.indirect_levels);
377 *err = ERR_BAD_DX_DIR;
381 entries = (struct dx_entry *) (((char *)&root->info) +
382 root->info.info_length);
383 assert(dx_get_limit(entries) == dx_root_limit(dir,
384 root->info.info_length));
385 dxtrace (printk("Look up %x", hash));
388 count = dx_get_count(entries);
389 assert (count && count <= dx_get_limit(entries));
391 q = entries + count - 1;
395 dxtrace(printk("."));
396 if (dx_get_hash(m) > hash)
402 if (0) // linear search cross check
404 unsigned n = count - 1;
408 dxtrace(printk(","));
409 if (dx_get_hash(++at) > hash)
415 assert (at == p - 1);
419 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
421 frame->entries = entries;
423 if (!indirect--) return frame;
424 if (!(bh = ext3_bread (NULL,dir, dx_get_block(at), 0, err)))
426 at = entries = ((struct dx_node *) bh->b_data)->entries;
427 assert (dx_get_limit(entries) == dx_node_limit (dir));
431 while (frame >= frame_in) {
439 static void dx_release (struct dx_frame *frames)
441 if (frames[0].bh == NULL)
444 if (((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels)
445 brelse(frames[1].bh);
446 brelse(frames[0].bh);
450 * This function increments the frame pointer to search the next leaf
451 * block, and reads in the necessary intervening nodes if the search
452 * should be necessary. Whether or not the search is necessary is
453 * controlled by the hash parameter. If the hash value is even, then
454 * the search is only continued if the next block starts with that
455 * hash value. This is used if we are searching for a specific file.
457 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
459 * This function returns 1 if the caller should continue to search,
460 * or 0 if it should not. If there is an error reading one of the
461 * index blocks, it will a negative error code.
463 * If start_hash is non-null, it will be filled in with the starting
464 * hash of the next page.
466 static int ext3_htree_next_block(struct inode *dir, __u32 hash,
467 struct dx_frame *frame,
468 struct dx_frame *frames,
472 struct buffer_head *bh;
473 int err, num_frames = 0;
478 * Find the next leaf page by incrementing the frame pointer.
479 * If we run out of entries in the interior node, loop around and
480 * increment pointer in the parent node. When we break out of
481 * this loop, num_frames indicates the number of interior
482 * nodes need to be read.
485 if (++(p->at) < p->entries + dx_get_count(p->entries))
494 * If the hash is 1, then continue only if the next page has a
495 * continuation hash of any value. This is used for readdir
496 * handling. Otherwise, check to see if the hash matches the
497 * desired contiuation hash. If it doesn't, return since
498 * there's no point to read in the successive index pages.
500 bhash = dx_get_hash(p->at);
503 if ((hash & 1) == 0) {
504 if ((bhash & ~1) != hash)
508 * If the hash is HASH_NB_ALWAYS, we always go to the next
509 * block so no check is necessary
511 while (num_frames--) {
512 if (!(bh = ext3_bread(NULL, dir, dx_get_block(p->at),
514 return err; /* Failure */
518 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
525 * p is at least 6 bytes before the end of page
527 static inline struct ext3_dir_entry_2 *ext3_next_entry(struct ext3_dir_entry_2 *p)
529 return (struct ext3_dir_entry_2 *)((char*)p + le16_to_cpu(p->rec_len));
533 * This function fills a red-black tree with information from a
534 * directory block. It returns the number directory entries loaded
535 * into the tree. If there is an error it is returned in err.
537 static int htree_dirblock_to_tree(struct file *dir_file,
538 struct inode *dir, int block,
539 struct dx_hash_info *hinfo,
540 __u32 start_hash, __u32 start_minor_hash)
542 struct buffer_head *bh;
543 struct ext3_dir_entry_2 *de, *top;
546 dxtrace(printk("In htree dirblock_to_tree: block %d\n", block));
547 if (!(bh = ext3_bread (NULL, dir, block, 0, &err)))
550 de = (struct ext3_dir_entry_2 *) bh->b_data;
551 top = (struct ext3_dir_entry_2 *) ((char *) de +
552 dir->i_sb->s_blocksize -
553 EXT3_DIR_REC_LEN(0));
554 for (; de < top; de = ext3_next_entry(de)) {
555 ext3fs_dirhash(de->name, de->name_len, hinfo);
556 if ((hinfo->hash < start_hash) ||
557 ((hinfo->hash == start_hash) &&
558 (hinfo->minor_hash < start_minor_hash)))
560 if ((err = ext3_htree_store_dirent(dir_file,
561 hinfo->hash, hinfo->minor_hash, de)) != 0) {
573 * This function fills a red-black tree with information from a
574 * directory. We start scanning the directory in hash order, starting
575 * at start_hash and start_minor_hash.
577 * This function returns the number of entries inserted into the tree,
578 * or a negative error code.
580 int ext3_htree_fill_tree(struct file *dir_file, __u32 start_hash,
581 __u32 start_minor_hash, __u32 *next_hash)
583 struct dx_hash_info hinfo;
584 struct ext3_dir_entry_2 *de;
585 struct dx_frame frames[2], *frame;
592 dxtrace(printk("In htree_fill_tree, start hash: %x:%x\n", start_hash,
594 dir = dir_file->f_dentry->d_inode;
595 if (!(EXT3_I(dir)->i_flags & EXT3_INDEX_FL)) {
596 hinfo.hash_version = EXT3_SB(dir->i_sb)->s_def_hash_version;
597 hinfo.seed = EXT3_SB(dir->i_sb)->s_hash_seed;
598 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
599 start_hash, start_minor_hash);
603 hinfo.hash = start_hash;
604 hinfo.minor_hash = 0;
605 frame = dx_probe(0, dir_file->f_dentry->d_inode, &hinfo, frames, &err);
609 /* Add '.' and '..' from the htree header */
610 if (!start_hash && !start_minor_hash) {
611 de = (struct ext3_dir_entry_2 *) frames[0].bh->b_data;
612 if ((err = ext3_htree_store_dirent(dir_file, 0, 0, de)) != 0)
614 de = ext3_next_entry(de);
615 if ((err = ext3_htree_store_dirent(dir_file, 0, 0, de)) != 0)
621 block = dx_get_block(frame->at);
622 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
623 start_hash, start_minor_hash);
630 ret = ext3_htree_next_block(dir, HASH_NB_ALWAYS,
631 frame, frames, &hashval);
632 *next_hash = hashval;
638 * Stop if: (a) there are no more entries, or
639 * (b) we have inserted at least one entry and the
640 * next hash value is not a continuation
643 (count && ((hashval & 1) == 0)))
647 dxtrace(printk("Fill tree: returned %d entries, next hash: %x\n",
657 * Directory block splitting, compacting
660 static int dx_make_map (struct ext3_dir_entry_2 *de, int size,
661 struct dx_hash_info *hinfo, struct dx_map_entry *map_tail)
664 char *base = (char *) de;
665 struct dx_hash_info h = *hinfo;
667 while ((char *) de < base + size)
669 if (de->name_len && de->inode) {
670 ext3fs_dirhash(de->name, de->name_len, &h);
672 map_tail->hash = h.hash;
673 map_tail->offs = (u32) ((char *) de - base);
676 /* XXX: do we need to check rec_len == 0 case? -Chris */
677 de = (struct ext3_dir_entry_2 *) ((char *) de + le16_to_cpu(de->rec_len));
682 static void dx_sort_map (struct dx_map_entry *map, unsigned count)
684 struct dx_map_entry *p, *q, *top = map + count - 1;
686 /* Combsort until bubble sort doesn't suck */
690 if (count - 9 < 2) /* 9, 10 -> 11 */
692 for (p = top, q = p - count; q >= map; p--, q--)
693 if (p->hash < q->hash)
696 /* Garden variety bubble sort */
702 if (q[1].hash >= q[0].hash)
710 static void dx_insert_block(struct dx_frame *frame, u32 hash, u32 block)
712 struct dx_entry *entries = frame->entries;
713 struct dx_entry *old = frame->at, *new = old + 1;
714 int count = dx_get_count(entries);
716 assert(count < dx_get_limit(entries));
717 assert(old < entries + count);
718 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
719 dx_set_hash(new, hash);
720 dx_set_block(new, block);
721 dx_set_count(entries, count + 1);
726 static void ext3_update_dx_flag(struct inode *inode)
728 if (!EXT3_HAS_COMPAT_FEATURE(inode->i_sb,
729 EXT3_FEATURE_COMPAT_DIR_INDEX))
730 EXT3_I(inode)->i_flags &= ~EXT3_INDEX_FL;
734 * NOTE! unlike strncmp, ext3_match returns 1 for success, 0 for failure.
736 * `len <= EXT3_NAME_LEN' is guaranteed by caller.
737 * `de != NULL' is guaranteed by caller.
739 static inline int ext3_match (int len, const char * const name,
740 struct ext3_dir_entry_2 * de)
742 if (len != de->name_len)
746 return !memcmp(name, de->name, len);
750 * Returns 0 if not found, -1 on failure, and 1 on success
752 static inline int search_dirblock(struct buffer_head * bh,
754 struct dentry *dentry,
755 unsigned long offset,
756 struct ext3_dir_entry_2 ** res_dir)
758 struct ext3_dir_entry_2 * de;
761 const char *name = dentry->d_name.name;
762 int namelen = dentry->d_name.len;
764 de = (struct ext3_dir_entry_2 *) bh->b_data;
765 dlimit = bh->b_data + dir->i_sb->s_blocksize;
766 while ((char *) de < dlimit) {
767 /* this code is executed quadratically often */
768 /* do minimal checking `by hand' */
770 if ((char *) de + namelen <= dlimit &&
771 ext3_match (namelen, name, de)) {
772 /* found a match - just to be sure, do a full check */
773 if (!ext3_check_dir_entry("ext3_find_entry",
774 dir, de, bh, offset))
779 /* prevent looping on a bad block */
780 de_len = le16_to_cpu(de->rec_len);
784 de = (struct ext3_dir_entry_2 *) ((char *) de + de_len);
793 * finds an entry in the specified directory with the wanted name. It
794 * returns the cache buffer in which the entry was found, and the entry
795 * itself (as a parameter - res_dir). It does NOT read the inode of the
796 * entry - you'll have to do that yourself if you want to.
798 * The returned buffer_head has ->b_count elevated. The caller is expected
799 * to brelse() it when appropriate.
801 static struct buffer_head * ext3_find_entry (struct dentry *dentry,
802 struct ext3_dir_entry_2 ** res_dir)
804 struct super_block * sb;
805 struct buffer_head * bh_use[NAMEI_RA_SIZE];
806 struct buffer_head * bh, *ret = NULL;
807 unsigned long start, block, b;
808 int ra_max = 0; /* Number of bh's in the readahead
810 int ra_ptr = 0; /* Current index into readahead
814 struct inode *dir = dentry->d_parent->d_inode;
821 blocksize = sb->s_blocksize;
822 namelen = dentry->d_name.len;
823 name = dentry->d_name.name;
824 if (namelen > EXT3_NAME_LEN)
826 #ifdef CONFIG_EXT3_INDEX
828 bh = ext3_dx_find_entry(dentry, res_dir, &err);
830 * On success, or if the error was file not found,
831 * return. Otherwise, fall back to doing a search the
834 if (bh || (err != ERR_BAD_DX_DIR))
836 dxtrace(printk("ext3_find_entry: dx failed, falling back\n"));
839 nblocks = dir->i_size >> EXT3_BLOCK_SIZE_BITS(sb);
840 start = EXT3_I(dir)->i_dir_start_lookup;
841 if (start >= nblocks)
847 * We deal with the read-ahead logic here.
849 if (ra_ptr >= ra_max) {
850 /* Refill the readahead buffer */
853 for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) {
855 * Terminate if we reach the end of the
856 * directory and must wrap, or if our
857 * search has finished at this block.
859 if (b >= nblocks || (num && block == start)) {
860 bh_use[ra_max] = NULL;
864 bh = ext3_getblk(NULL, dir, b++, 0, &err);
867 ll_rw_block(READ, 1, &bh);
870 if ((bh = bh_use[ra_ptr++]) == NULL)
873 if (!buffer_uptodate(bh)) {
874 /* read error, skip block & hope for the best */
875 ext3_error(sb, __FUNCTION__, "reading directory #%lu "
876 "offset %lu\n", dir->i_ino, block);
880 i = search_dirblock(bh, dir, dentry,
881 block << EXT3_BLOCK_SIZE_BITS(sb), res_dir);
883 EXT3_I(dir)->i_dir_start_lookup = block;
885 goto cleanup_and_exit;
889 goto cleanup_and_exit;
892 if (++block >= nblocks)
894 } while (block != start);
897 * If the directory has grown while we were searching, then
898 * search the last part of the directory before giving up.
901 nblocks = dir->i_size >> EXT3_BLOCK_SIZE_BITS(sb);
902 if (block < nblocks) {
908 /* Clean up the read-ahead blocks */
909 for (; ra_ptr < ra_max; ra_ptr++)
910 brelse (bh_use[ra_ptr]);
914 #ifdef CONFIG_EXT3_INDEX
915 static struct buffer_head * ext3_dx_find_entry(struct dentry *dentry,
916 struct ext3_dir_entry_2 **res_dir, int *err)
918 struct super_block * sb;
919 struct dx_hash_info hinfo;
921 struct dx_frame frames[2], *frame;
922 struct ext3_dir_entry_2 *de, *top;
923 struct buffer_head *bh;
926 int namelen = dentry->d_name.len;
927 const u8 *name = dentry->d_name.name;
928 struct inode *dir = dentry->d_parent->d_inode;
931 if (!(frame = dx_probe (dentry, 0, &hinfo, frames, err)))
935 block = dx_get_block(frame->at);
936 if (!(bh = ext3_bread (NULL,dir, block, 0, err)))
938 de = (struct ext3_dir_entry_2 *) bh->b_data;
939 top = (struct ext3_dir_entry_2 *) ((char *) de + sb->s_blocksize -
940 EXT3_DIR_REC_LEN(0));
941 for (; de < top; de = ext3_next_entry(de))
942 if (ext3_match (namelen, name, de)) {
943 if (!ext3_check_dir_entry("ext3_find_entry",
945 (block<<EXT3_BLOCK_SIZE_BITS(sb))
946 +((char *)de - bh->b_data))) {
955 /* Check to see if we should continue to search */
956 retval = ext3_htree_next_block(dir, hash, frame,
959 ext3_warning(sb, __FUNCTION__,
960 "error reading index page in directory #%lu",
965 } while (retval == 1);
969 dxtrace(printk("%s not found\n", name));
975 static struct dentry *ext3_lookup(struct inode * dir, struct dentry *dentry, struct nameidata *nd)
977 struct inode * inode;
978 struct ext3_dir_entry_2 * de;
979 struct buffer_head * bh;
981 if (dentry->d_name.len > EXT3_NAME_LEN)
982 return ERR_PTR(-ENAMETOOLONG);
984 bh = ext3_find_entry(dentry, &de);
987 unsigned long ino = le32_to_cpu(de->inode);
989 inode = iget(dir->i_sb, ino);
992 return ERR_PTR(-EACCES);
995 return d_splice_alias(inode, dentry);
996 d_add(dentry, inode);
1001 struct dentry *ext3_get_parent(struct dentry *child)
1004 struct dentry *parent;
1005 struct inode *inode;
1006 struct dentry dotdot;
1007 struct ext3_dir_entry_2 * de;
1008 struct buffer_head *bh;
1010 dotdot.d_name.name = "..";
1011 dotdot.d_name.len = 2;
1012 dotdot.d_parent = child; /* confusing, isn't it! */
1014 bh = ext3_find_entry(&dotdot, &de);
1017 return ERR_PTR(-ENOENT);
1018 ino = le32_to_cpu(de->inode);
1020 inode = iget(child->d_inode->i_sb, ino);
1023 return ERR_PTR(-EACCES);
1025 parent = d_alloc_anon(inode);
1028 parent = ERR_PTR(-ENOMEM);
1034 static unsigned char ext3_type_by_mode[S_IFMT >> S_SHIFT] = {
1035 [S_IFREG >> S_SHIFT] = EXT3_FT_REG_FILE,
1036 [S_IFDIR >> S_SHIFT] = EXT3_FT_DIR,
1037 [S_IFCHR >> S_SHIFT] = EXT3_FT_CHRDEV,
1038 [S_IFBLK >> S_SHIFT] = EXT3_FT_BLKDEV,
1039 [S_IFIFO >> S_SHIFT] = EXT3_FT_FIFO,
1040 [S_IFSOCK >> S_SHIFT] = EXT3_FT_SOCK,
1041 [S_IFLNK >> S_SHIFT] = EXT3_FT_SYMLINK,
1044 static inline void ext3_set_de_type(struct super_block *sb,
1045 struct ext3_dir_entry_2 *de,
1047 if (EXT3_HAS_INCOMPAT_FEATURE(sb, EXT3_FEATURE_INCOMPAT_FILETYPE))
1048 de->file_type = ext3_type_by_mode[(mode & S_IFMT)>>S_SHIFT];
1051 #ifdef CONFIG_EXT3_INDEX
1052 static struct ext3_dir_entry_2 *
1053 dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count)
1055 unsigned rec_len = 0;
1058 struct ext3_dir_entry_2 *de = (struct ext3_dir_entry_2 *) (from + map->offs);
1059 rec_len = EXT3_DIR_REC_LEN(de->name_len);
1060 memcpy (to, de, rec_len);
1061 ((struct ext3_dir_entry_2 *) to)->rec_len =
1062 cpu_to_le16(rec_len);
1067 return (struct ext3_dir_entry_2 *) (to - rec_len);
1070 static struct ext3_dir_entry_2* dx_pack_dirents(char *base, int size)
1072 struct ext3_dir_entry_2 *next, *to, *prev, *de = (struct ext3_dir_entry_2 *) base;
1073 unsigned rec_len = 0;
1076 while ((char*)de < base + size) {
1077 next = (struct ext3_dir_entry_2 *) ((char *) de +
1078 le16_to_cpu(de->rec_len));
1079 if (de->inode && de->name_len) {
1080 rec_len = EXT3_DIR_REC_LEN(de->name_len);
1082 memmove(to, de, rec_len);
1083 to->rec_len = cpu_to_le16(rec_len);
1085 to = (struct ext3_dir_entry_2 *) (((char *) to) + rec_len);
1092 static struct ext3_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1093 struct buffer_head **bh,struct dx_frame *frame,
1094 struct dx_hash_info *hinfo, int *error)
1096 unsigned blocksize = dir->i_sb->s_blocksize;
1097 unsigned count, continued;
1098 struct buffer_head *bh2;
1101 struct dx_map_entry *map;
1102 char *data1 = (*bh)->b_data, *data2;
1104 struct ext3_dir_entry_2 *de = NULL, *de2;
1107 bh2 = ext3_append (handle, dir, &newblock, error);
1114 BUFFER_TRACE(*bh, "get_write_access");
1115 err = ext3_journal_get_write_access(handle, *bh);
1121 ext3_std_error(dir->i_sb, err);
1124 BUFFER_TRACE(frame->bh, "get_write_access");
1125 err = ext3_journal_get_write_access(handle, frame->bh);
1129 data2 = bh2->b_data;
1131 /* create map in the end of data2 block */
1132 map = (struct dx_map_entry *) (data2 + blocksize);
1133 count = dx_make_map ((struct ext3_dir_entry_2 *) data1,
1134 blocksize, hinfo, map);
1136 split = count/2; // need to adjust to actual middle
1137 dx_sort_map (map, count);
1138 hash2 = map[split].hash;
1139 continued = hash2 == map[split - 1].hash;
1140 dxtrace(printk("Split block %i at %x, %i/%i\n",
1141 dx_get_block(frame->at), hash2, split, count-split));
1143 /* Fancy dance to stay within two buffers */
1144 de2 = dx_move_dirents(data1, data2, map + split, count - split);
1145 de = dx_pack_dirents(data1,blocksize);
1146 de->rec_len = cpu_to_le16(data1 + blocksize - (char *) de);
1147 de2->rec_len = cpu_to_le16(data2 + blocksize - (char *) de2);
1148 dxtrace(dx_show_leaf (hinfo, (struct ext3_dir_entry_2 *) data1, blocksize, 1));
1149 dxtrace(dx_show_leaf (hinfo, (struct ext3_dir_entry_2 *) data2, blocksize, 1));
1151 /* Which block gets the new entry? */
1152 if (hinfo->hash >= hash2)
1157 dx_insert_block (frame, hash2 + continued, newblock);
1158 err = ext3_journal_dirty_metadata (handle, bh2);
1161 err = ext3_journal_dirty_metadata (handle, frame->bh);
1165 dxtrace(dx_show_index ("frame", frame->entries));
1173 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1174 * it points to a directory entry which is guaranteed to be large
1175 * enough for new directory entry. If de is NULL, then
1176 * add_dirent_to_buf will attempt search the directory block for
1177 * space. It will return -ENOSPC if no space is available, and -EIO
1178 * and -EEXIST if directory entry already exists.
1180 * NOTE! bh is NOT released in the case where ENOSPC is returned. In
1181 * all other cases bh is released.
1183 static int add_dirent_to_buf(handle_t *handle, struct dentry *dentry,
1184 struct inode *inode, struct ext3_dir_entry_2 *de,
1185 struct buffer_head * bh)
1187 struct inode *dir = dentry->d_parent->d_inode;
1188 const char *name = dentry->d_name.name;
1189 int namelen = dentry->d_name.len;
1190 unsigned long offset = 0;
1191 unsigned short reclen;
1192 int nlen, rlen, err;
1195 reclen = EXT3_DIR_REC_LEN(namelen);
1197 de = (struct ext3_dir_entry_2 *)bh->b_data;
1198 top = bh->b_data + dir->i_sb->s_blocksize - reclen;
1199 while ((char *) de <= top) {
1200 if (!ext3_check_dir_entry("ext3_add_entry", dir, de,
1205 if (ext3_match (namelen, name, de)) {
1209 nlen = EXT3_DIR_REC_LEN(de->name_len);
1210 rlen = le16_to_cpu(de->rec_len);
1211 if ((de->inode? rlen - nlen: rlen) >= reclen)
1213 de = (struct ext3_dir_entry_2 *)((char *)de + rlen);
1216 if ((char *) de > top)
1219 BUFFER_TRACE(bh, "get_write_access");
1220 err = ext3_journal_get_write_access(handle, bh);
1222 ext3_std_error(dir->i_sb, err);
1227 /* By now the buffer is marked for journaling */
1228 nlen = EXT3_DIR_REC_LEN(de->name_len);
1229 rlen = le16_to_cpu(de->rec_len);
1231 struct ext3_dir_entry_2 *de1 = (struct ext3_dir_entry_2 *)((char *)de + nlen);
1232 de1->rec_len = cpu_to_le16(rlen - nlen);
1233 de->rec_len = cpu_to_le16(nlen);
1236 de->file_type = EXT3_FT_UNKNOWN;
1238 de->inode = cpu_to_le32(inode->i_ino);
1239 ext3_set_de_type(dir->i_sb, de, inode->i_mode);
1242 de->name_len = namelen;
1243 memcpy (de->name, name, namelen);
1245 * XXX shouldn't update any times until successful
1246 * completion of syscall, but too many callers depend
1249 * XXX similarly, too many callers depend on
1250 * ext3_new_inode() setting the times, but error
1251 * recovery deletes the inode, so the worst that can
1252 * happen is that the times are slightly out of date
1253 * and/or different from the directory change time.
1255 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
1256 ext3_update_dx_flag(dir);
1258 ext3_mark_inode_dirty(handle, dir);
1259 BUFFER_TRACE(bh, "call ext3_journal_dirty_metadata");
1260 err = ext3_journal_dirty_metadata(handle, bh);
1262 ext3_std_error(dir->i_sb, err);
1267 #ifdef CONFIG_EXT3_INDEX
1269 * This converts a one block unindexed directory to a 3 block indexed
1270 * directory, and adds the dentry to the indexed directory.
1272 static int make_indexed_dir(handle_t *handle, struct dentry *dentry,
1273 struct inode *inode, struct buffer_head *bh)
1275 struct inode *dir = dentry->d_parent->d_inode;
1276 const char *name = dentry->d_name.name;
1277 int namelen = dentry->d_name.len;
1278 struct buffer_head *bh2;
1279 struct dx_root *root;
1280 struct dx_frame frames[2], *frame;
1281 struct dx_entry *entries;
1282 struct ext3_dir_entry_2 *de, *de2;
1287 struct dx_hash_info hinfo;
1289 struct fake_dirent *fde;
1291 blocksize = dir->i_sb->s_blocksize;
1292 dxtrace(printk("Creating index\n"));
1293 retval = ext3_journal_get_write_access(handle, bh);
1295 ext3_std_error(dir->i_sb, retval);
1299 root = (struct dx_root *) bh->b_data;
1301 bh2 = ext3_append (handle, dir, &block, &retval);
1306 EXT3_I(dir)->i_flags |= EXT3_INDEX_FL;
1307 data1 = bh2->b_data;
1309 /* The 0th block becomes the root, move the dirents out */
1310 fde = &root->dotdot;
1311 de = (struct ext3_dir_entry_2 *)((char *)fde + le16_to_cpu(fde->rec_len));
1312 len = ((char *) root) + blocksize - (char *) de;
1313 memcpy (data1, de, len);
1314 de = (struct ext3_dir_entry_2 *) data1;
1316 while ((char *)(de2=(void*)de+le16_to_cpu(de->rec_len)) < top)
1318 de->rec_len = cpu_to_le16(data1 + blocksize - (char *) de);
1319 /* Initialize the root; the dot dirents already exist */
1320 de = (struct ext3_dir_entry_2 *) (&root->dotdot);
1321 de->rec_len = cpu_to_le16(blocksize - EXT3_DIR_REC_LEN(2));
1322 memset (&root->info, 0, sizeof(root->info));
1323 root->info.info_length = sizeof(root->info);
1324 root->info.hash_version = EXT3_SB(dir->i_sb)->s_def_hash_version;
1325 entries = root->entries;
1326 dx_set_block (entries, 1);
1327 dx_set_count (entries, 1);
1328 dx_set_limit (entries, dx_root_limit(dir, sizeof(root->info)));
1330 /* Initialize as for dx_probe */
1331 hinfo.hash_version = root->info.hash_version;
1332 hinfo.seed = EXT3_SB(dir->i_sb)->s_hash_seed;
1333 ext3fs_dirhash(name, namelen, &hinfo);
1335 frame->entries = entries;
1336 frame->at = entries;
1339 de = do_split(handle,dir, &bh, frame, &hinfo, &retval);
1340 dx_release (frames);
1344 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1351 * adds a file entry to the specified directory, using the same
1352 * semantics as ext3_find_entry(). It returns NULL if it failed.
1354 * NOTE!! The inode part of 'de' is left at 0 - which means you
1355 * may not sleep between calling this and putting something into
1356 * the entry, as someone else might have used it while you slept.
1358 static int ext3_add_entry (handle_t *handle, struct dentry *dentry,
1359 struct inode *inode)
1361 struct inode *dir = dentry->d_parent->d_inode;
1362 unsigned long offset;
1363 struct buffer_head * bh;
1364 struct ext3_dir_entry_2 *de;
1365 struct super_block * sb;
1367 #ifdef CONFIG_EXT3_INDEX
1371 unsigned nlen, rlen;
1375 blocksize = sb->s_blocksize;
1376 if (!dentry->d_name.len)
1378 #ifdef CONFIG_EXT3_INDEX
1380 retval = ext3_dx_add_entry(handle, dentry, inode);
1381 if (!retval || (retval != ERR_BAD_DX_DIR))
1383 EXT3_I(dir)->i_flags &= ~EXT3_INDEX_FL;
1385 ext3_mark_inode_dirty(handle, dir);
1388 blocks = dir->i_size >> sb->s_blocksize_bits;
1389 for (block = 0, offset = 0; block < blocks; block++) {
1390 bh = ext3_bread(handle, dir, block, 0, &retval);
1393 retval = add_dirent_to_buf(handle, dentry, inode, 0, bh);
1394 if (retval != -ENOSPC)
1397 #ifdef CONFIG_EXT3_INDEX
1398 if (blocks == 1 && !dx_fallback &&
1399 EXT3_HAS_COMPAT_FEATURE(sb, EXT3_FEATURE_COMPAT_DIR_INDEX))
1400 return make_indexed_dir(handle, dentry, inode, bh);
1404 bh = ext3_append(handle, dir, &block, &retval);
1407 de = (struct ext3_dir_entry_2 *) bh->b_data;
1409 de->rec_len = cpu_to_le16(rlen = blocksize);
1411 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1414 #ifdef CONFIG_EXT3_INDEX
1416 * Returns 0 for success, or a negative error value
1418 static int ext3_dx_add_entry(handle_t *handle, struct dentry *dentry,
1419 struct inode *inode)
1421 struct dx_frame frames[2], *frame;
1422 struct dx_entry *entries, *at;
1423 struct dx_hash_info hinfo;
1424 struct buffer_head * bh;
1425 struct inode *dir = dentry->d_parent->d_inode;
1426 struct super_block * sb = dir->i_sb;
1427 struct ext3_dir_entry_2 *de;
1430 frame = dx_probe(dentry, 0, &hinfo, frames, &err);
1433 entries = frame->entries;
1436 if (!(bh = ext3_bread(handle,dir, dx_get_block(frame->at), 0, &err)))
1439 BUFFER_TRACE(bh, "get_write_access");
1440 err = ext3_journal_get_write_access(handle, bh);
1444 err = add_dirent_to_buf(handle, dentry, inode, 0, bh);
1445 if (err != -ENOSPC) {
1450 /* Block full, should compress but for now just split */
1451 dxtrace(printk("using %u of %u node entries\n",
1452 dx_get_count(entries), dx_get_limit(entries)));
1453 /* Need to split index? */
1454 if (dx_get_count(entries) == dx_get_limit(entries)) {
1456 unsigned icount = dx_get_count(entries);
1457 int levels = frame - frames;
1458 struct dx_entry *entries2;
1459 struct dx_node *node2;
1460 struct buffer_head *bh2;
1462 if (levels && (dx_get_count(frames->entries) ==
1463 dx_get_limit(frames->entries))) {
1464 ext3_warning(sb, __FUNCTION__,
1465 "Directory index full!\n");
1469 bh2 = ext3_append (handle, dir, &newblock, &err);
1472 node2 = (struct dx_node *)(bh2->b_data);
1473 entries2 = node2->entries;
1474 node2->fake.rec_len = cpu_to_le16(sb->s_blocksize);
1475 node2->fake.inode = 0;
1476 BUFFER_TRACE(frame->bh, "get_write_access");
1477 err = ext3_journal_get_write_access(handle, frame->bh);
1481 unsigned icount1 = icount/2, icount2 = icount - icount1;
1482 unsigned hash2 = dx_get_hash(entries + icount1);
1483 dxtrace(printk("Split index %i/%i\n", icount1, icount2));
1485 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
1486 err = ext3_journal_get_write_access(handle,
1491 memcpy ((char *) entries2, (char *) (entries + icount1),
1492 icount2 * sizeof(struct dx_entry));
1493 dx_set_count (entries, icount1);
1494 dx_set_count (entries2, icount2);
1495 dx_set_limit (entries2, dx_node_limit(dir));
1497 /* Which index block gets the new entry? */
1498 if (at - entries >= icount1) {
1499 frame->at = at = at - entries - icount1 + entries2;
1500 frame->entries = entries = entries2;
1501 swap(frame->bh, bh2);
1503 dx_insert_block (frames + 0, hash2, newblock);
1504 dxtrace(dx_show_index ("node", frames[1].entries));
1505 dxtrace(dx_show_index ("node",
1506 ((struct dx_node *) bh2->b_data)->entries));
1507 err = ext3_journal_dirty_metadata(handle, bh2);
1512 dxtrace(printk("Creating second level index...\n"));
1513 memcpy((char *) entries2, (char *) entries,
1514 icount * sizeof(struct dx_entry));
1515 dx_set_limit(entries2, dx_node_limit(dir));
1518 dx_set_count(entries, 1);
1519 dx_set_block(entries + 0, newblock);
1520 ((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels = 1;
1522 /* Add new access path frame */
1524 frame->at = at = at - entries + entries2;
1525 frame->entries = entries = entries2;
1527 err = ext3_journal_get_write_access(handle,
1532 ext3_journal_dirty_metadata(handle, frames[0].bh);
1534 de = do_split(handle, dir, &bh, frame, &hinfo, &err);
1537 err = add_dirent_to_buf(handle, dentry, inode, de, bh);
1542 ext3_std_error(dir->i_sb, err);
1552 * ext3_delete_entry deletes a directory entry by merging it with the
1555 static int ext3_delete_entry (handle_t *handle,
1557 struct ext3_dir_entry_2 * de_del,
1558 struct buffer_head * bh)
1560 struct ext3_dir_entry_2 * de, * pde;
1565 de = (struct ext3_dir_entry_2 *) bh->b_data;
1566 while (i < bh->b_size) {
1567 if (!ext3_check_dir_entry("ext3_delete_entry", dir, de, bh, i))
1570 BUFFER_TRACE(bh, "get_write_access");
1571 ext3_journal_get_write_access(handle, bh);
1574 cpu_to_le16(le16_to_cpu(pde->rec_len) +
1575 le16_to_cpu(de->rec_len));
1579 BUFFER_TRACE(bh, "call ext3_journal_dirty_metadata");
1580 ext3_journal_dirty_metadata(handle, bh);
1583 i += le16_to_cpu(de->rec_len);
1585 de = (struct ext3_dir_entry_2 *)
1586 ((char *) de + le16_to_cpu(de->rec_len));
1592 * ext3_mark_inode_dirty is somewhat expensive, so unlike ext2 we
1593 * do not perform it in these functions. We perform it at the call site,
1596 static inline void ext3_inc_count(handle_t *handle, struct inode *inode)
1601 static inline void ext3_dec_count(handle_t *handle, struct inode *inode)
1606 static int ext3_add_nondir(handle_t *handle,
1607 struct dentry *dentry, struct inode *inode)
1609 int err = ext3_add_entry(handle, dentry, inode);
1611 ext3_mark_inode_dirty(handle, inode);
1612 d_instantiate(dentry, inode);
1615 ext3_dec_count(handle, inode);
1621 * By the time this is called, we already have created
1622 * the directory cache entry for the new file, but it
1623 * is so far negative - it has no inode.
1625 * If the create succeeds, we fill in the inode information
1626 * with d_instantiate().
1628 static int ext3_create (struct inode * dir, struct dentry * dentry, int mode,
1629 struct nameidata *nd)
1632 struct inode * inode;
1635 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS +
1636 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1637 2*EXT3_QUOTA_INIT_BLOCKS);
1639 return PTR_ERR(handle);
1641 if (IS_DIRSYNC(dir))
1644 inode = ext3_new_inode (handle, dir, mode);
1645 err = PTR_ERR(inode);
1646 if (!IS_ERR(inode)) {
1647 inode->i_op = &ext3_file_inode_operations;
1648 inode->i_fop = &ext3_file_operations;
1649 ext3_set_aops(inode);
1650 err = ext3_add_nondir(handle, dentry, inode);
1652 ext3_journal_stop(handle);
1656 static int ext3_mknod (struct inode * dir, struct dentry *dentry,
1657 int mode, dev_t rdev)
1660 struct inode *inode;
1663 if (!new_valid_dev(rdev))
1666 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS +
1667 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1668 2*EXT3_QUOTA_INIT_BLOCKS);
1670 return PTR_ERR(handle);
1672 if (IS_DIRSYNC(dir))
1675 inode = ext3_new_inode (handle, dir, mode);
1676 err = PTR_ERR(inode);
1677 if (!IS_ERR(inode)) {
1678 init_special_inode(inode, inode->i_mode, rdev);
1679 #ifdef CONFIG_EXT3_FS_XATTR
1680 inode->i_op = &ext3_special_inode_operations;
1682 err = ext3_add_nondir(handle, dentry, inode);
1684 ext3_journal_stop(handle);
1688 static int ext3_mkdir(struct inode * dir, struct dentry * dentry, int mode)
1691 struct inode * inode;
1692 struct buffer_head * dir_block;
1693 struct ext3_dir_entry_2 * de;
1696 if (dir->i_nlink >= EXT3_LINK_MAX)
1699 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS +
1700 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1701 2*EXT3_QUOTA_INIT_BLOCKS);
1703 return PTR_ERR(handle);
1705 if (IS_DIRSYNC(dir))
1708 inode = ext3_new_inode (handle, dir, S_IFDIR | mode);
1709 err = PTR_ERR(inode);
1713 inode->i_op = &ext3_dir_inode_operations;
1714 inode->i_fop = &ext3_dir_operations;
1715 inode->i_size = EXT3_I(inode)->i_disksize = inode->i_sb->s_blocksize;
1716 dir_block = ext3_bread (handle, inode, 0, 1, &err);
1718 inode->i_nlink--; /* is this nlink == 0? */
1719 ext3_mark_inode_dirty(handle, inode);
1723 BUFFER_TRACE(dir_block, "get_write_access");
1724 ext3_journal_get_write_access(handle, dir_block);
1725 de = (struct ext3_dir_entry_2 *) dir_block->b_data;
1726 de->inode = cpu_to_le32(inode->i_ino);
1728 de->rec_len = cpu_to_le16(EXT3_DIR_REC_LEN(de->name_len));
1729 strcpy (de->name, ".");
1730 ext3_set_de_type(dir->i_sb, de, S_IFDIR);
1731 de = (struct ext3_dir_entry_2 *)
1732 ((char *) de + le16_to_cpu(de->rec_len));
1733 de->inode = cpu_to_le32(dir->i_ino);
1734 de->rec_len = cpu_to_le16(inode->i_sb->s_blocksize-EXT3_DIR_REC_LEN(1));
1736 strcpy (de->name, "..");
1737 ext3_set_de_type(dir->i_sb, de, S_IFDIR);
1739 BUFFER_TRACE(dir_block, "call ext3_journal_dirty_metadata");
1740 ext3_journal_dirty_metadata(handle, dir_block);
1742 ext3_mark_inode_dirty(handle, inode);
1743 err = ext3_add_entry (handle, dentry, inode);
1746 ext3_mark_inode_dirty(handle, inode);
1751 ext3_update_dx_flag(dir);
1752 ext3_mark_inode_dirty(handle, dir);
1753 d_instantiate(dentry, inode);
1755 ext3_journal_stop(handle);
1760 * routine to check that the specified directory is empty (for rmdir)
1762 static int empty_dir (struct inode * inode)
1764 unsigned long offset;
1765 struct buffer_head * bh;
1766 struct ext3_dir_entry_2 * de, * de1;
1767 struct super_block * sb;
1771 if (inode->i_size < EXT3_DIR_REC_LEN(1) + EXT3_DIR_REC_LEN(2) ||
1772 !(bh = ext3_bread (NULL, inode, 0, 0, &err))) {
1774 ext3_error(inode->i_sb, __FUNCTION__,
1775 "error %d reading directory #%lu offset 0",
1778 ext3_warning(inode->i_sb, __FUNCTION__,
1779 "bad directory (dir #%lu) - no data block",
1783 de = (struct ext3_dir_entry_2 *) bh->b_data;
1784 de1 = (struct ext3_dir_entry_2 *)
1785 ((char *) de + le16_to_cpu(de->rec_len));
1786 if (le32_to_cpu(de->inode) != inode->i_ino ||
1787 !le32_to_cpu(de1->inode) ||
1788 strcmp (".", de->name) ||
1789 strcmp ("..", de1->name)) {
1790 ext3_warning (inode->i_sb, "empty_dir",
1791 "bad directory (dir #%lu) - no `.' or `..'",
1796 offset = le16_to_cpu(de->rec_len) + le16_to_cpu(de1->rec_len);
1797 de = (struct ext3_dir_entry_2 *)
1798 ((char *) de1 + le16_to_cpu(de1->rec_len));
1799 while (offset < inode->i_size ) {
1801 (void *) de >= (void *) (bh->b_data+sb->s_blocksize)) {
1804 bh = ext3_bread (NULL, inode,
1805 offset >> EXT3_BLOCK_SIZE_BITS(sb), 0, &err);
1808 ext3_error(sb, __FUNCTION__,
1809 "error %d reading directory"
1811 err, inode->i_ino, offset);
1812 offset += sb->s_blocksize;
1815 de = (struct ext3_dir_entry_2 *) bh->b_data;
1817 if (!ext3_check_dir_entry("empty_dir", inode, de, bh, offset)) {
1818 de = (struct ext3_dir_entry_2 *)(bh->b_data +
1820 offset = (offset | (sb->s_blocksize - 1)) + 1;
1823 if (le32_to_cpu(de->inode)) {
1827 offset += le16_to_cpu(de->rec_len);
1828 de = (struct ext3_dir_entry_2 *)
1829 ((char *) de + le16_to_cpu(de->rec_len));
1835 /* ext3_orphan_add() links an unlinked or truncated inode into a list of
1836 * such inodes, starting at the superblock, in case we crash before the
1837 * file is closed/deleted, or in case the inode truncate spans multiple
1838 * transactions and the last transaction is not recovered after a crash.
1840 * At filesystem recovery time, we walk this list deleting unlinked
1841 * inodes and truncating linked inodes in ext3_orphan_cleanup().
1843 int ext3_orphan_add(handle_t *handle, struct inode *inode)
1845 struct super_block *sb = inode->i_sb;
1846 struct ext3_iloc iloc;
1850 if (!list_empty(&EXT3_I(inode)->i_orphan))
1853 /* Orphan handling is only valid for files with data blocks
1854 * being truncated, or files being unlinked. */
1856 /* @@@ FIXME: Observation from aviro:
1857 * I think I can trigger J_ASSERT in ext3_orphan_add(). We block
1858 * here (on lock_super()), so race with ext3_link() which might bump
1859 * ->i_nlink. For, say it, character device. Not a regular file,
1860 * not a directory, not a symlink and ->i_nlink > 0.
1862 J_ASSERT ((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1863 S_ISLNK(inode->i_mode)) || inode->i_nlink == 0);
1865 BUFFER_TRACE(EXT3_SB(sb)->s_sbh, "get_write_access");
1866 err = ext3_journal_get_write_access(handle, EXT3_SB(sb)->s_sbh);
1870 err = ext3_reserve_inode_write(handle, inode, &iloc);
1874 /* Insert this inode at the head of the on-disk orphan list... */
1875 NEXT_ORPHAN(inode) = le32_to_cpu(EXT3_SB(sb)->s_es->s_last_orphan);
1876 EXT3_SB(sb)->s_es->s_last_orphan = cpu_to_le32(inode->i_ino);
1877 err = ext3_journal_dirty_metadata(handle, EXT3_SB(sb)->s_sbh);
1878 rc = ext3_mark_iloc_dirty(handle, inode, &iloc);
1882 /* Only add to the head of the in-memory list if all the
1883 * previous operations succeeded. If the orphan_add is going to
1884 * fail (possibly taking the journal offline), we can't risk
1885 * leaving the inode on the orphan list: stray orphan-list
1886 * entries can cause panics at unmount time.
1888 * This is safe: on error we're going to ignore the orphan list
1889 * anyway on the next recovery. */
1891 list_add(&EXT3_I(inode)->i_orphan, &EXT3_SB(sb)->s_orphan);
1893 jbd_debug(4, "superblock will point to %ld\n", inode->i_ino);
1894 jbd_debug(4, "orphan inode %ld will point to %d\n",
1895 inode->i_ino, NEXT_ORPHAN(inode));
1898 ext3_std_error(inode->i_sb, err);
1903 * ext3_orphan_del() removes an unlinked or truncated inode from the list
1904 * of such inodes stored on disk, because it is finally being cleaned up.
1906 int ext3_orphan_del(handle_t *handle, struct inode *inode)
1908 struct list_head *prev;
1909 struct ext3_inode_info *ei = EXT3_I(inode);
1910 struct ext3_sb_info *sbi;
1911 unsigned long ino_next;
1912 struct ext3_iloc iloc;
1915 lock_super(inode->i_sb);
1916 if (list_empty(&ei->i_orphan)) {
1917 unlock_super(inode->i_sb);
1921 ino_next = NEXT_ORPHAN(inode);
1922 prev = ei->i_orphan.prev;
1923 sbi = EXT3_SB(inode->i_sb);
1925 jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino);
1927 list_del_init(&ei->i_orphan);
1929 /* If we're on an error path, we may not have a valid
1930 * transaction handle with which to update the orphan list on
1931 * disk, but we still need to remove the inode from the linked
1932 * list in memory. */
1936 err = ext3_reserve_inode_write(handle, inode, &iloc);
1940 if (prev == &sbi->s_orphan) {
1941 jbd_debug(4, "superblock will point to %lu\n", ino_next);
1942 BUFFER_TRACE(sbi->s_sbh, "get_write_access");
1943 err = ext3_journal_get_write_access(handle, sbi->s_sbh);
1946 sbi->s_es->s_last_orphan = cpu_to_le32(ino_next);
1947 err = ext3_journal_dirty_metadata(handle, sbi->s_sbh);
1949 struct ext3_iloc iloc2;
1950 struct inode *i_prev =
1951 &list_entry(prev, struct ext3_inode_info, i_orphan)->vfs_inode;
1953 jbd_debug(4, "orphan inode %lu will point to %lu\n",
1954 i_prev->i_ino, ino_next);
1955 err = ext3_reserve_inode_write(handle, i_prev, &iloc2);
1958 NEXT_ORPHAN(i_prev) = ino_next;
1959 err = ext3_mark_iloc_dirty(handle, i_prev, &iloc2);
1963 NEXT_ORPHAN(inode) = 0;
1964 err = ext3_mark_iloc_dirty(handle, inode, &iloc);
1967 ext3_std_error(inode->i_sb, err);
1969 unlock_super(inode->i_sb);
1977 static int ext3_rmdir (struct inode * dir, struct dentry *dentry)
1980 struct inode * inode;
1981 struct buffer_head * bh;
1982 struct ext3_dir_entry_2 * de;
1985 /* Initialize quotas before so that eventual writes go in
1986 * separate transaction */
1987 DQUOT_INIT(dentry->d_inode);
1988 handle = ext3_journal_start(dir, EXT3_DELETE_TRANS_BLOCKS);
1990 return PTR_ERR(handle);
1993 bh = ext3_find_entry (dentry, &de);
1997 if (IS_DIRSYNC(dir))
2000 inode = dentry->d_inode;
2003 if (le32_to_cpu(de->inode) != inode->i_ino)
2006 retval = -ENOTEMPTY;
2007 if (!empty_dir (inode))
2010 retval = ext3_delete_entry(handle, dir, de, bh);
2013 if (inode->i_nlink != 2)
2014 ext3_warning (inode->i_sb, "ext3_rmdir",
2015 "empty directory has nlink!=2 (%d)",
2019 /* There's no need to set i_disksize: the fact that i_nlink is
2020 * zero will ensure that the right thing happens during any
2023 ext3_orphan_add(handle, inode);
2024 inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME;
2025 ext3_mark_inode_dirty(handle, inode);
2027 ext3_update_dx_flag(dir);
2028 ext3_mark_inode_dirty(handle, dir);
2031 ext3_journal_stop(handle);
2036 static int ext3_unlink(struct inode * dir, struct dentry *dentry)
2039 struct inode * inode;
2040 struct buffer_head * bh;
2041 struct ext3_dir_entry_2 * de;
2044 /* Initialize quotas before so that eventual writes go
2045 * in separate transaction */
2046 DQUOT_INIT(dentry->d_inode);
2047 handle = ext3_journal_start(dir, EXT3_DELETE_TRANS_BLOCKS);
2049 return PTR_ERR(handle);
2051 if (IS_DIRSYNC(dir))
2055 bh = ext3_find_entry (dentry, &de);
2059 inode = dentry->d_inode;
2062 if (le32_to_cpu(de->inode) != inode->i_ino)
2065 if (!inode->i_nlink) {
2066 ext3_warning (inode->i_sb, "ext3_unlink",
2067 "Deleting nonexistent file (%lu), %d",
2068 inode->i_ino, inode->i_nlink);
2071 retval = ext3_delete_entry(handle, dir, de, bh);
2074 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
2075 ext3_update_dx_flag(dir);
2076 ext3_mark_inode_dirty(handle, dir);
2078 if (!inode->i_nlink)
2079 ext3_orphan_add(handle, inode);
2080 inode->i_ctime = dir->i_ctime;
2081 ext3_mark_inode_dirty(handle, inode);
2085 ext3_journal_stop(handle);
2090 static int ext3_symlink (struct inode * dir,
2091 struct dentry *dentry, const char * symname)
2094 struct inode * inode;
2097 l = strlen(symname)+1;
2098 if (l > dir->i_sb->s_blocksize)
2099 return -ENAMETOOLONG;
2101 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS +
2102 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 5 +
2103 2*EXT3_QUOTA_INIT_BLOCKS);
2105 return PTR_ERR(handle);
2107 if (IS_DIRSYNC(dir))
2110 inode = ext3_new_inode (handle, dir, S_IFLNK|S_IRWXUGO);
2111 err = PTR_ERR(inode);
2115 if (l > sizeof (EXT3_I(inode)->i_data)) {
2116 inode->i_op = &ext3_symlink_inode_operations;
2117 ext3_set_aops(inode);
2119 * page_symlink() calls into ext3_prepare/commit_write.
2120 * We have a transaction open. All is sweetness. It also sets
2121 * i_size in generic_commit_write().
2123 err = page_symlink(inode, symname, l);
2125 ext3_dec_count(handle, inode);
2126 ext3_mark_inode_dirty(handle, inode);
2131 inode->i_op = &ext3_fast_symlink_inode_operations;
2132 memcpy((char*)&EXT3_I(inode)->i_data,symname,l);
2133 inode->i_size = l-1;
2135 EXT3_I(inode)->i_disksize = inode->i_size;
2136 err = ext3_add_nondir(handle, dentry, inode);
2138 ext3_journal_stop(handle);
2142 static int ext3_link (struct dentry * old_dentry,
2143 struct inode * dir, struct dentry *dentry)
2146 struct inode *inode = old_dentry->d_inode;
2149 if (inode->i_nlink >= EXT3_LINK_MAX)
2152 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS +
2153 EXT3_INDEX_EXTRA_TRANS_BLOCKS);
2155 return PTR_ERR(handle);
2157 if (IS_DIRSYNC(dir))
2160 inode->i_ctime = CURRENT_TIME;
2161 ext3_inc_count(handle, inode);
2162 atomic_inc(&inode->i_count);
2164 err = ext3_add_nondir(handle, dentry, inode);
2165 ext3_journal_stop(handle);
2169 #define PARENT_INO(buffer) \
2170 ((struct ext3_dir_entry_2 *) ((char *) buffer + \
2171 le16_to_cpu(((struct ext3_dir_entry_2 *) buffer)->rec_len)))->inode
2174 * Anybody can rename anything with this: the permission checks are left to the
2175 * higher-level routines.
2177 static int ext3_rename (struct inode * old_dir, struct dentry *old_dentry,
2178 struct inode * new_dir,struct dentry *new_dentry)
2181 struct inode * old_inode, * new_inode;
2182 struct buffer_head * old_bh, * new_bh, * dir_bh;
2183 struct ext3_dir_entry_2 * old_de, * new_de;
2186 old_bh = new_bh = dir_bh = NULL;
2188 /* Initialize quotas before so that eventual writes go
2189 * in separate transaction */
2190 if (new_dentry->d_inode)
2191 DQUOT_INIT(new_dentry->d_inode);
2192 handle = ext3_journal_start(old_dir, 2 * EXT3_DATA_TRANS_BLOCKS +
2193 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 2);
2195 return PTR_ERR(handle);
2197 if (IS_DIRSYNC(old_dir) || IS_DIRSYNC(new_dir))
2200 old_bh = ext3_find_entry (old_dentry, &old_de);
2202 * Check for inode number is _not_ due to possible IO errors.
2203 * We might rmdir the source, keep it as pwd of some process
2204 * and merrily kill the link to whatever was created under the
2205 * same name. Goodbye sticky bit ;-<
2207 old_inode = old_dentry->d_inode;
2209 if (!old_bh || le32_to_cpu(old_de->inode) != old_inode->i_ino)
2212 new_inode = new_dentry->d_inode;
2213 new_bh = ext3_find_entry (new_dentry, &new_de);
2220 if (S_ISDIR(old_inode->i_mode)) {
2222 retval = -ENOTEMPTY;
2223 if (!empty_dir (new_inode))
2227 dir_bh = ext3_bread (handle, old_inode, 0, 0, &retval);
2230 if (le32_to_cpu(PARENT_INO(dir_bh->b_data)) != old_dir->i_ino)
2233 if (!new_inode && new_dir!=old_dir &&
2234 new_dir->i_nlink >= EXT3_LINK_MAX)
2238 retval = ext3_add_entry (handle, new_dentry, old_inode);
2242 BUFFER_TRACE(new_bh, "get write access");
2243 ext3_journal_get_write_access(handle, new_bh);
2244 new_de->inode = le32_to_cpu(old_inode->i_ino);
2245 if (EXT3_HAS_INCOMPAT_FEATURE(new_dir->i_sb,
2246 EXT3_FEATURE_INCOMPAT_FILETYPE))
2247 new_de->file_type = old_de->file_type;
2248 new_dir->i_version++;
2249 BUFFER_TRACE(new_bh, "call ext3_journal_dirty_metadata");
2250 ext3_journal_dirty_metadata(handle, new_bh);
2256 * Like most other Unix systems, set the ctime for inodes on a
2259 old_inode->i_ctime = CURRENT_TIME;
2260 ext3_mark_inode_dirty(handle, old_inode);
2265 if (le32_to_cpu(old_de->inode) != old_inode->i_ino ||
2266 old_de->name_len != old_dentry->d_name.len ||
2267 strncmp(old_de->name, old_dentry->d_name.name, old_de->name_len) ||
2268 (retval = ext3_delete_entry(handle, old_dir,
2269 old_de, old_bh)) == -ENOENT) {
2270 /* old_de could have moved from under us during htree split, so
2271 * make sure that we are deleting the right entry. We might
2272 * also be pointing to a stale entry in the unused part of
2273 * old_bh so just checking inum and the name isn't enough. */
2274 struct buffer_head *old_bh2;
2275 struct ext3_dir_entry_2 *old_de2;
2277 old_bh2 = ext3_find_entry(old_dentry, &old_de2);
2279 retval = ext3_delete_entry(handle, old_dir,
2285 ext3_warning(old_dir->i_sb, "ext3_rename",
2286 "Deleting old file (%lu), %d, error=%d",
2287 old_dir->i_ino, old_dir->i_nlink, retval);
2291 new_inode->i_nlink--;
2292 new_inode->i_ctime = CURRENT_TIME;
2294 old_dir->i_ctime = old_dir->i_mtime = CURRENT_TIME;
2295 ext3_update_dx_flag(old_dir);
2297 BUFFER_TRACE(dir_bh, "get_write_access");
2298 ext3_journal_get_write_access(handle, dir_bh);
2299 PARENT_INO(dir_bh->b_data) = le32_to_cpu(new_dir->i_ino);
2300 BUFFER_TRACE(dir_bh, "call ext3_journal_dirty_metadata");
2301 ext3_journal_dirty_metadata(handle, dir_bh);
2304 new_inode->i_nlink--;
2307 ext3_update_dx_flag(new_dir);
2308 ext3_mark_inode_dirty(handle, new_dir);
2311 ext3_mark_inode_dirty(handle, old_dir);
2313 ext3_mark_inode_dirty(handle, new_inode);
2314 if (!new_inode->i_nlink)
2315 ext3_orphan_add(handle, new_inode);
2323 ext3_journal_stop(handle);
2328 * directories can handle most operations...
2330 struct inode_operations ext3_dir_inode_operations = {
2331 .create = ext3_create,
2332 .lookup = ext3_lookup,
2334 .unlink = ext3_unlink,
2335 .symlink = ext3_symlink,
2336 .mkdir = ext3_mkdir,
2337 .rmdir = ext3_rmdir,
2338 .mknod = ext3_mknod,
2339 .rename = ext3_rename,
2340 .setattr = ext3_setattr,
2341 .setxattr = ext3_setxattr,
2342 .getxattr = ext3_getxattr,
2343 .listxattr = ext3_listxattr,
2344 .removexattr = ext3_removexattr,
2345 .permission = ext3_permission,
2348 struct inode_operations ext3_special_inode_operations = {
2349 .setattr = ext3_setattr,
2350 .setxattr = ext3_setxattr,
2351 .getxattr = ext3_getxattr,
2352 .listxattr = ext3_listxattr,
2353 .removexattr = ext3_removexattr,
2354 .permission = ext3_permission,