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)
75 #define dxtrace(command) command
77 #define dxtrace(command)
101 * dx_root_info is laid out so that if it should somehow get overlaid by a
102 * dirent the two low bits of the hash version will be zero. Therefore, the
103 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
108 struct fake_dirent dot
;
110 struct fake_dirent dotdot
;
114 __le32 reserved_zero
;
116 u8 info_length
; /* 8 */
121 struct dx_entry entries
[0];
126 struct fake_dirent fake
;
127 struct dx_entry entries
[0];
133 struct buffer_head
*bh
;
134 struct dx_entry
*entries
;
144 #ifdef CONFIG_EXT3_INDEX
145 static inline unsigned dx_get_block (struct dx_entry
*entry
);
146 static void dx_set_block (struct dx_entry
*entry
, unsigned value
);
147 static inline unsigned dx_get_hash (struct dx_entry
*entry
);
148 static void dx_set_hash (struct dx_entry
*entry
, unsigned value
);
149 static unsigned dx_get_count (struct dx_entry
*entries
);
150 static unsigned dx_get_limit (struct dx_entry
*entries
);
151 static void dx_set_count (struct dx_entry
*entries
, unsigned value
);
152 static void dx_set_limit (struct dx_entry
*entries
, unsigned value
);
153 static unsigned dx_root_limit (struct inode
*dir
, unsigned infosize
);
154 static unsigned dx_node_limit (struct inode
*dir
);
155 static struct dx_frame
*dx_probe(struct dentry
*dentry
,
157 struct dx_hash_info
*hinfo
,
158 struct dx_frame
*frame
,
160 static void dx_release (struct dx_frame
*frames
);
161 static int dx_make_map (struct ext3_dir_entry_2
*de
, int size
,
162 struct dx_hash_info
*hinfo
, struct dx_map_entry map
[]);
163 static void dx_sort_map(struct dx_map_entry
*map
, unsigned count
);
164 static struct ext3_dir_entry_2
*dx_move_dirents (char *from
, char *to
,
165 struct dx_map_entry
*offsets
, int count
);
166 static struct ext3_dir_entry_2
* dx_pack_dirents (char *base
, int size
);
167 static void dx_insert_block (struct dx_frame
*frame
, u32 hash
, u32 block
);
168 static int ext3_htree_next_block(struct inode
*dir
, __u32 hash
,
169 struct dx_frame
*frame
,
170 struct dx_frame
*frames
,
172 static struct buffer_head
* ext3_dx_find_entry(struct dentry
*dentry
,
173 struct ext3_dir_entry_2
**res_dir
, int *err
);
174 static int ext3_dx_add_entry(handle_t
*handle
, struct dentry
*dentry
,
175 struct inode
*inode
);
178 * Future: use high four bits of block for coalesce-on-delete flags
179 * Mask them off for now.
182 static inline unsigned dx_get_block (struct dx_entry
*entry
)
184 return le32_to_cpu(entry
->block
) & 0x00ffffff;
187 static inline void dx_set_block (struct dx_entry
*entry
, unsigned value
)
189 entry
->block
= cpu_to_le32(value
);
192 static inline unsigned dx_get_hash (struct dx_entry
*entry
)
194 return le32_to_cpu(entry
->hash
);
197 static inline void dx_set_hash (struct dx_entry
*entry
, unsigned value
)
199 entry
->hash
= cpu_to_le32(value
);
202 static inline unsigned dx_get_count (struct dx_entry
*entries
)
204 return le16_to_cpu(((struct dx_countlimit
*) entries
)->count
);
207 static inline unsigned dx_get_limit (struct dx_entry
*entries
)
209 return le16_to_cpu(((struct dx_countlimit
*) entries
)->limit
);
212 static inline void dx_set_count (struct dx_entry
*entries
, unsigned value
)
214 ((struct dx_countlimit
*) entries
)->count
= cpu_to_le16(value
);
217 static inline void dx_set_limit (struct dx_entry
*entries
, unsigned value
)
219 ((struct dx_countlimit
*) entries
)->limit
= cpu_to_le16(value
);
222 static inline unsigned dx_root_limit (struct inode
*dir
, unsigned infosize
)
224 unsigned entry_space
= dir
->i_sb
->s_blocksize
- EXT3_DIR_REC_LEN(1) -
225 EXT3_DIR_REC_LEN(2) - infosize
;
226 return 0? 20: entry_space
/ sizeof(struct dx_entry
);
229 static inline unsigned dx_node_limit (struct inode
*dir
)
231 unsigned entry_space
= dir
->i_sb
->s_blocksize
- EXT3_DIR_REC_LEN(0);
232 return 0? 22: entry_space
/ sizeof(struct dx_entry
);
239 static void dx_show_index (char * label
, struct dx_entry
*entries
)
241 int i
, n
= dx_get_count (entries
);
242 printk("%s index ", label
);
243 for (i
= 0; i
< n
; i
++)
245 printk("%x->%u ", i
? dx_get_hash(entries
+ i
): 0, dx_get_block(entries
+ i
));
257 static struct stats
dx_show_leaf(struct dx_hash_info
*hinfo
, struct ext3_dir_entry_2
*de
,
258 int size
, int show_names
)
260 unsigned names
= 0, space
= 0;
261 char *base
= (char *) de
;
262 struct dx_hash_info h
= *hinfo
;
265 while ((char *) de
< base
+ size
)
271 int len
= de
->name_len
;
272 char *name
= de
->name
;
273 while (len
--) printk("%c", *name
++);
274 ext3fs_dirhash(de
->name
, de
->name_len
, &h
);
275 printk(":%x.%u ", h
.hash
,
276 ((char *) de
- base
));
278 space
+= EXT3_DIR_REC_LEN(de
->name_len
);
281 de
= (struct ext3_dir_entry_2
*) ((char *) de
+ le16_to_cpu(de
->rec_len
));
283 printk("(%i)\n", names
);
284 return (struct stats
) { names
, space
, 1 };
287 struct stats
dx_show_entries(struct dx_hash_info
*hinfo
, struct inode
*dir
,
288 struct dx_entry
*entries
, int levels
)
290 unsigned blocksize
= dir
->i_sb
->s_blocksize
;
291 unsigned count
= dx_get_count (entries
), names
= 0, space
= 0, i
;
293 struct buffer_head
*bh
;
295 printk("%i indexed blocks...\n", count
);
296 for (i
= 0; i
< count
; i
++, entries
++)
298 u32 block
= dx_get_block(entries
), hash
= i
? dx_get_hash(entries
): 0;
299 u32 range
= i
< count
- 1? (dx_get_hash(entries
+ 1) - hash
): ~hash
;
301 printk("%s%3u:%03u hash %8x/%8x ",levels
?"":" ", i
, block
, hash
, range
);
302 if (!(bh
= ext3_bread (NULL
,dir
, block
, 0,&err
))) continue;
304 dx_show_entries(hinfo
, dir
, ((struct dx_node
*) bh
->b_data
)->entries
, levels
- 1):
305 dx_show_leaf(hinfo
, (struct ext3_dir_entry_2
*) bh
->b_data
, blocksize
, 0);
306 names
+= stats
.names
;
307 space
+= stats
.space
;
308 bcount
+= stats
.bcount
;
312 printk("%snames %u, fullness %u (%u%%)\n", levels
?"":" ",
313 names
, space
/bcount
,(space
/bcount
)*100/blocksize
);
314 return (struct stats
) { names
, space
, bcount
};
316 #endif /* DX_DEBUG */
319 * Probe for a directory leaf block to search.
321 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
322 * error in the directory index, and the caller should fall back to
323 * searching the directory normally. The callers of dx_probe **MUST**
324 * check for this error code, and make sure it never gets reflected
327 static struct dx_frame
*
328 dx_probe(struct dentry
*dentry
, struct inode
*dir
,
329 struct dx_hash_info
*hinfo
, struct dx_frame
*frame_in
, int *err
)
331 unsigned count
, indirect
;
332 struct dx_entry
*at
, *entries
, *p
, *q
, *m
;
333 struct dx_root
*root
;
334 struct buffer_head
*bh
;
335 struct dx_frame
*frame
= frame_in
;
340 dir
= dentry
->d_parent
->d_inode
;
341 if (!(bh
= ext3_bread (NULL
,dir
, 0, 0, err
)))
343 root
= (struct dx_root
*) bh
->b_data
;
344 if (root
->info
.hash_version
!= DX_HASH_TEA
&&
345 root
->info
.hash_version
!= DX_HASH_HALF_MD4
&&
346 root
->info
.hash_version
!= DX_HASH_LEGACY
) {
347 ext3_warning(dir
->i_sb
, __FUNCTION__
,
348 "Unrecognised inode hash code %d",
349 root
->info
.hash_version
);
351 *err
= ERR_BAD_DX_DIR
;
354 hinfo
->hash_version
= root
->info
.hash_version
;
355 hinfo
->seed
= EXT3_SB(dir
->i_sb
)->s_hash_seed
;
357 ext3fs_dirhash(dentry
->d_name
.name
, dentry
->d_name
.len
, hinfo
);
360 if (root
->info
.unused_flags
& 1) {
361 ext3_warning(dir
->i_sb
, __FUNCTION__
,
362 "Unimplemented inode hash flags: %#06x",
363 root
->info
.unused_flags
);
365 *err
= ERR_BAD_DX_DIR
;
369 if ((indirect
= root
->info
.indirect_levels
) > 1) {
370 ext3_warning(dir
->i_sb
, __FUNCTION__
,
371 "Unimplemented inode hash depth: %#06x",
372 root
->info
.indirect_levels
);
374 *err
= ERR_BAD_DX_DIR
;
378 entries
= (struct dx_entry
*) (((char *)&root
->info
) +
379 root
->info
.info_length
);
380 assert(dx_get_limit(entries
) == dx_root_limit(dir
,
381 root
->info
.info_length
));
382 dxtrace (printk("Look up %x", hash
));
385 count
= dx_get_count(entries
);
386 assert (count
&& count
<= dx_get_limit(entries
));
388 q
= entries
+ count
- 1;
392 dxtrace(printk("."));
393 if (dx_get_hash(m
) > hash
)
399 if (0) // linear search cross check
401 unsigned n
= count
- 1;
405 dxtrace(printk(","));
406 if (dx_get_hash(++at
) > hash
)
412 assert (at
== p
- 1);
416 dxtrace(printk(" %x->%u\n", at
== entries
? 0: dx_get_hash(at
), dx_get_block(at
)));
418 frame
->entries
= entries
;
420 if (!indirect
--) return frame
;
421 if (!(bh
= ext3_bread (NULL
,dir
, dx_get_block(at
), 0, err
)))
423 at
= entries
= ((struct dx_node
*) bh
->b_data
)->entries
;
424 assert (dx_get_limit(entries
) == dx_node_limit (dir
));
428 while (frame
>= frame_in
) {
436 static void dx_release (struct dx_frame
*frames
)
438 if (frames
[0].bh
== NULL
)
441 if (((struct dx_root
*) frames
[0].bh
->b_data
)->info
.indirect_levels
)
442 brelse(frames
[1].bh
);
443 brelse(frames
[0].bh
);
447 * This function increments the frame pointer to search the next leaf
448 * block, and reads in the necessary intervening nodes if the search
449 * should be necessary. Whether or not the search is necessary is
450 * controlled by the hash parameter. If the hash value is even, then
451 * the search is only continued if the next block starts with that
452 * hash value. This is used if we are searching for a specific file.
454 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
456 * This function returns 1 if the caller should continue to search,
457 * or 0 if it should not. If there is an error reading one of the
458 * index blocks, it will a negative error code.
460 * If start_hash is non-null, it will be filled in with the starting
461 * hash of the next page.
463 static int ext3_htree_next_block(struct inode
*dir
, __u32 hash
,
464 struct dx_frame
*frame
,
465 struct dx_frame
*frames
,
469 struct buffer_head
*bh
;
470 int err
, num_frames
= 0;
475 * Find the next leaf page by incrementing the frame pointer.
476 * If we run out of entries in the interior node, loop around and
477 * increment pointer in the parent node. When we break out of
478 * this loop, num_frames indicates the number of interior
479 * nodes need to be read.
482 if (++(p
->at
) < p
->entries
+ dx_get_count(p
->entries
))
491 * If the hash is 1, then continue only if the next page has a
492 * continuation hash of any value. This is used for readdir
493 * handling. Otherwise, check to see if the hash matches the
494 * desired contiuation hash. If it doesn't, return since
495 * there's no point to read in the successive index pages.
497 bhash
= dx_get_hash(p
->at
);
500 if ((hash
& 1) == 0) {
501 if ((bhash
& ~1) != hash
)
505 * If the hash is HASH_NB_ALWAYS, we always go to the next
506 * block so no check is necessary
508 while (num_frames
--) {
509 if (!(bh
= ext3_bread(NULL
, dir
, dx_get_block(p
->at
),
511 return err
; /* Failure */
515 p
->at
= p
->entries
= ((struct dx_node
*) bh
->b_data
)->entries
;
522 * p is at least 6 bytes before the end of page
524 static inline struct ext3_dir_entry_2
*ext3_next_entry(struct ext3_dir_entry_2
*p
)
526 return (struct ext3_dir_entry_2
*)((char*)p
+ le16_to_cpu(p
->rec_len
));
530 * This function fills a red-black tree with information from a
531 * directory block. It returns the number directory entries loaded
532 * into the tree. If there is an error it is returned in err.
534 static int htree_dirblock_to_tree(struct file
*dir_file
,
535 struct inode
*dir
, int block
,
536 struct dx_hash_info
*hinfo
,
537 __u32 start_hash
, __u32 start_minor_hash
)
539 struct buffer_head
*bh
;
540 struct ext3_dir_entry_2
*de
, *top
;
543 dxtrace(printk("In htree dirblock_to_tree: block %d\n", block
));
544 if (!(bh
= ext3_bread (NULL
, dir
, block
, 0, &err
)))
547 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
548 top
= (struct ext3_dir_entry_2
*) ((char *) de
+
549 dir
->i_sb
->s_blocksize
-
550 EXT3_DIR_REC_LEN(0));
551 for (; de
< top
; de
= ext3_next_entry(de
)) {
552 ext3fs_dirhash(de
->name
, de
->name_len
, hinfo
);
553 if ((hinfo
->hash
< start_hash
) ||
554 ((hinfo
->hash
== start_hash
) &&
555 (hinfo
->minor_hash
< start_minor_hash
)))
559 if ((err
= ext3_htree_store_dirent(dir_file
,
560 hinfo
->hash
, hinfo
->minor_hash
, de
)) != 0) {
572 * This function fills a red-black tree with information from a
573 * directory. We start scanning the directory in hash order, starting
574 * at start_hash and start_minor_hash.
576 * This function returns the number of entries inserted into the tree,
577 * or a negative error code.
579 int ext3_htree_fill_tree(struct file
*dir_file
, __u32 start_hash
,
580 __u32 start_minor_hash
, __u32
*next_hash
)
582 struct dx_hash_info hinfo
;
583 struct ext3_dir_entry_2
*de
;
584 struct dx_frame frames
[2], *frame
;
591 dxtrace(printk("In htree_fill_tree, start hash: %x:%x\n", start_hash
,
593 dir
= dir_file
->f_dentry
->d_inode
;
594 if (!(EXT3_I(dir
)->i_flags
& EXT3_INDEX_FL
)) {
595 hinfo
.hash_version
= EXT3_SB(dir
->i_sb
)->s_def_hash_version
;
596 hinfo
.seed
= EXT3_SB(dir
->i_sb
)->s_hash_seed
;
597 count
= htree_dirblock_to_tree(dir_file
, dir
, 0, &hinfo
,
598 start_hash
, start_minor_hash
);
602 hinfo
.hash
= start_hash
;
603 hinfo
.minor_hash
= 0;
604 frame
= dx_probe(NULL
, dir_file
->f_dentry
->d_inode
, &hinfo
, frames
, &err
);
608 /* Add '.' and '..' from the htree header */
609 if (!start_hash
&& !start_minor_hash
) {
610 de
= (struct ext3_dir_entry_2
*) frames
[0].bh
->b_data
;
611 if ((err
= ext3_htree_store_dirent(dir_file
, 0, 0, de
)) != 0)
613 de
= ext3_next_entry(de
);
614 if ((err
= ext3_htree_store_dirent(dir_file
, 0, 0, de
)) != 0)
620 block
= dx_get_block(frame
->at
);
621 ret
= htree_dirblock_to_tree(dir_file
, dir
, block
, &hinfo
,
622 start_hash
, start_minor_hash
);
629 ret
= ext3_htree_next_block(dir
, HASH_NB_ALWAYS
,
630 frame
, frames
, &hashval
);
631 *next_hash
= hashval
;
637 * Stop if: (a) there are no more entries, or
638 * (b) we have inserted at least one entry and the
639 * next hash value is not a continuation
642 (count
&& ((hashval
& 1) == 0)))
646 dxtrace(printk("Fill tree: returned %d entries, next hash: %x\n",
656 * Directory block splitting, compacting
659 static int dx_make_map (struct ext3_dir_entry_2
*de
, int size
,
660 struct dx_hash_info
*hinfo
, struct dx_map_entry
*map_tail
)
663 char *base
= (char *) de
;
664 struct dx_hash_info h
= *hinfo
;
666 while ((char *) de
< base
+ size
)
668 if (de
->name_len
&& de
->inode
) {
669 ext3fs_dirhash(de
->name
, de
->name_len
, &h
);
671 map_tail
->hash
= h
.hash
;
672 map_tail
->offs
= (u32
) ((char *) de
- base
);
675 /* XXX: do we need to check rec_len == 0 case? -Chris */
676 de
= (struct ext3_dir_entry_2
*) ((char *) de
+ le16_to_cpu(de
->rec_len
));
681 static void dx_sort_map (struct dx_map_entry
*map
, unsigned count
)
683 struct dx_map_entry
*p
, *q
, *top
= map
+ count
- 1;
685 /* Combsort until bubble sort doesn't suck */
689 if (count
- 9 < 2) /* 9, 10 -> 11 */
691 for (p
= top
, q
= p
- count
; q
>= map
; p
--, q
--)
692 if (p
->hash
< q
->hash
)
695 /* Garden variety bubble sort */
701 if (q
[1].hash
>= q
[0].hash
)
709 static void dx_insert_block(struct dx_frame
*frame
, u32 hash
, u32 block
)
711 struct dx_entry
*entries
= frame
->entries
;
712 struct dx_entry
*old
= frame
->at
, *new = old
+ 1;
713 int count
= dx_get_count(entries
);
715 assert(count
< dx_get_limit(entries
));
716 assert(old
< entries
+ count
);
717 memmove(new + 1, new, (char *)(entries
+ count
) - (char *)(new));
718 dx_set_hash(new, hash
);
719 dx_set_block(new, block
);
720 dx_set_count(entries
, count
+ 1);
725 static void ext3_update_dx_flag(struct inode
*inode
)
727 if (!EXT3_HAS_COMPAT_FEATURE(inode
->i_sb
,
728 EXT3_FEATURE_COMPAT_DIR_INDEX
))
729 EXT3_I(inode
)->i_flags
&= ~EXT3_INDEX_FL
;
733 * NOTE! unlike strncmp, ext3_match returns 1 for success, 0 for failure.
735 * `len <= EXT3_NAME_LEN' is guaranteed by caller.
736 * `de != NULL' is guaranteed by caller.
738 static inline int ext3_match (int len
, const char * const name
,
739 struct ext3_dir_entry_2
* de
)
741 if (len
!= de
->name_len
)
745 return !memcmp(name
, de
->name
, len
);
749 * Returns 0 if not found, -1 on failure, and 1 on success
751 static inline int search_dirblock(struct buffer_head
* bh
,
753 struct dentry
*dentry
,
754 unsigned long offset
,
755 struct ext3_dir_entry_2
** res_dir
)
757 struct ext3_dir_entry_2
* de
;
760 const char *name
= dentry
->d_name
.name
;
761 int namelen
= dentry
->d_name
.len
;
763 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
764 dlimit
= bh
->b_data
+ dir
->i_sb
->s_blocksize
;
765 while ((char *) de
< dlimit
) {
766 /* this code is executed quadratically often */
767 /* do minimal checking `by hand' */
769 if ((char *) de
+ namelen
<= dlimit
&&
770 ext3_match (namelen
, name
, de
)) {
771 /* found a match - just to be sure, do a full check */
772 if (!ext3_check_dir_entry("ext3_find_entry",
773 dir
, de
, bh
, offset
))
778 /* prevent looping on a bad block */
779 de_len
= le16_to_cpu(de
->rec_len
);
783 de
= (struct ext3_dir_entry_2
*) ((char *) de
+ de_len
);
792 * finds an entry in the specified directory with the wanted name. It
793 * returns the cache buffer in which the entry was found, and the entry
794 * itself (as a parameter - res_dir). It does NOT read the inode of the
795 * entry - you'll have to do that yourself if you want to.
797 * The returned buffer_head has ->b_count elevated. The caller is expected
798 * to brelse() it when appropriate.
800 static struct buffer_head
* ext3_find_entry (struct dentry
*dentry
,
801 struct ext3_dir_entry_2
** res_dir
)
803 struct super_block
* sb
;
804 struct buffer_head
* bh_use
[NAMEI_RA_SIZE
];
805 struct buffer_head
* bh
, *ret
= NULL
;
806 unsigned long start
, block
, b
;
807 int ra_max
= 0; /* Number of bh's in the readahead
809 int ra_ptr
= 0; /* Current index into readahead
813 struct inode
*dir
= dentry
->d_parent
->d_inode
;
820 blocksize
= sb
->s_blocksize
;
821 namelen
= dentry
->d_name
.len
;
822 name
= dentry
->d_name
.name
;
823 if (namelen
> EXT3_NAME_LEN
)
825 #ifdef CONFIG_EXT3_INDEX
827 bh
= ext3_dx_find_entry(dentry
, res_dir
, &err
);
829 * On success, or if the error was file not found,
830 * return. Otherwise, fall back to doing a search the
833 if (bh
|| (err
!= ERR_BAD_DX_DIR
))
835 dxtrace(printk("ext3_find_entry: dx failed, falling back\n"));
838 nblocks
= dir
->i_size
>> EXT3_BLOCK_SIZE_BITS(sb
);
839 start
= EXT3_I(dir
)->i_dir_start_lookup
;
840 if (start
>= nblocks
)
846 * We deal with the read-ahead logic here.
848 if (ra_ptr
>= ra_max
) {
849 /* Refill the readahead buffer */
852 for (ra_max
= 0; ra_max
< NAMEI_RA_SIZE
; ra_max
++) {
854 * Terminate if we reach the end of the
855 * directory and must wrap, or if our
856 * search has finished at this block.
858 if (b
>= nblocks
|| (num
&& block
== start
)) {
859 bh_use
[ra_max
] = NULL
;
863 bh
= ext3_getblk(NULL
, dir
, b
++, 0, &err
);
866 ll_rw_block(READ
, 1, &bh
);
869 if ((bh
= bh_use
[ra_ptr
++]) == NULL
)
872 if (!buffer_uptodate(bh
)) {
873 /* read error, skip block & hope for the best */
874 ext3_error(sb
, __FUNCTION__
, "reading directory #%lu "
875 "offset %lu\n", dir
->i_ino
, block
);
879 i
= search_dirblock(bh
, dir
, dentry
,
880 block
<< EXT3_BLOCK_SIZE_BITS(sb
), res_dir
);
882 EXT3_I(dir
)->i_dir_start_lookup
= block
;
884 goto cleanup_and_exit
;
888 goto cleanup_and_exit
;
891 if (++block
>= nblocks
)
893 } while (block
!= start
);
896 * If the directory has grown while we were searching, then
897 * search the last part of the directory before giving up.
900 nblocks
= dir
->i_size
>> EXT3_BLOCK_SIZE_BITS(sb
);
901 if (block
< nblocks
) {
907 /* Clean up the read-ahead blocks */
908 for (; ra_ptr
< ra_max
; ra_ptr
++)
909 brelse (bh_use
[ra_ptr
]);
913 #ifdef CONFIG_EXT3_INDEX
914 static struct buffer_head
* ext3_dx_find_entry(struct dentry
*dentry
,
915 struct ext3_dir_entry_2
**res_dir
, int *err
)
917 struct super_block
* sb
;
918 struct dx_hash_info hinfo
;
920 struct dx_frame frames
[2], *frame
;
921 struct ext3_dir_entry_2
*de
, *top
;
922 struct buffer_head
*bh
;
925 int namelen
= dentry
->d_name
.len
;
926 const u8
*name
= dentry
->d_name
.name
;
927 struct inode
*dir
= dentry
->d_parent
->d_inode
;
930 if (!(frame
= dx_probe(dentry
, NULL
, &hinfo
, frames
, err
)))
934 block
= dx_get_block(frame
->at
);
935 if (!(bh
= ext3_bread (NULL
,dir
, block
, 0, err
)))
937 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
938 top
= (struct ext3_dir_entry_2
*) ((char *) de
+ sb
->s_blocksize
-
939 EXT3_DIR_REC_LEN(0));
940 for (; de
< top
; de
= ext3_next_entry(de
))
941 if (ext3_match (namelen
, name
, de
)) {
942 if (!ext3_check_dir_entry("ext3_find_entry",
944 (block
<<EXT3_BLOCK_SIZE_BITS(sb
))
945 +((char *)de
- bh
->b_data
))) {
954 /* Check to see if we should continue to search */
955 retval
= ext3_htree_next_block(dir
, hash
, frame
,
958 ext3_warning(sb
, __FUNCTION__
,
959 "error reading index page in directory #%lu",
964 } while (retval
== 1);
968 dxtrace(printk("%s not found\n", name
));
974 static struct dentry
*ext3_lookup(struct inode
* dir
, struct dentry
*dentry
, struct nameidata
*nd
)
976 struct inode
* inode
;
977 struct ext3_dir_entry_2
* de
;
978 struct buffer_head
* bh
;
980 if (dentry
->d_name
.len
> EXT3_NAME_LEN
)
981 return ERR_PTR(-ENAMETOOLONG
);
983 bh
= ext3_find_entry(dentry
, &de
);
986 unsigned long ino
= le32_to_cpu(de
->inode
);
988 inode
= iget(dir
->i_sb
, ino
);
991 return ERR_PTR(-EACCES
);
994 return d_splice_alias(inode
, dentry
);
995 d_add(dentry
, inode
);
1000 struct dentry
*ext3_get_parent(struct dentry
*child
)
1003 struct dentry
*parent
;
1004 struct inode
*inode
;
1005 struct dentry dotdot
;
1006 struct ext3_dir_entry_2
* de
;
1007 struct buffer_head
*bh
;
1009 dotdot
.d_name
.name
= "..";
1010 dotdot
.d_name
.len
= 2;
1011 dotdot
.d_parent
= child
; /* confusing, isn't it! */
1013 bh
= ext3_find_entry(&dotdot
, &de
);
1016 return ERR_PTR(-ENOENT
);
1017 ino
= le32_to_cpu(de
->inode
);
1019 inode
= iget(child
->d_inode
->i_sb
, ino
);
1022 return ERR_PTR(-EACCES
);
1024 parent
= d_alloc_anon(inode
);
1027 parent
= ERR_PTR(-ENOMEM
);
1033 static unsigned char ext3_type_by_mode
[S_IFMT
>> S_SHIFT
] = {
1034 [S_IFREG
>> S_SHIFT
] = EXT3_FT_REG_FILE
,
1035 [S_IFDIR
>> S_SHIFT
] = EXT3_FT_DIR
,
1036 [S_IFCHR
>> S_SHIFT
] = EXT3_FT_CHRDEV
,
1037 [S_IFBLK
>> S_SHIFT
] = EXT3_FT_BLKDEV
,
1038 [S_IFIFO
>> S_SHIFT
] = EXT3_FT_FIFO
,
1039 [S_IFSOCK
>> S_SHIFT
] = EXT3_FT_SOCK
,
1040 [S_IFLNK
>> S_SHIFT
] = EXT3_FT_SYMLINK
,
1043 static inline void ext3_set_de_type(struct super_block
*sb
,
1044 struct ext3_dir_entry_2
*de
,
1046 if (EXT3_HAS_INCOMPAT_FEATURE(sb
, EXT3_FEATURE_INCOMPAT_FILETYPE
))
1047 de
->file_type
= ext3_type_by_mode
[(mode
& S_IFMT
)>>S_SHIFT
];
1050 #ifdef CONFIG_EXT3_INDEX
1051 static struct ext3_dir_entry_2
*
1052 dx_move_dirents(char *from
, char *to
, struct dx_map_entry
*map
, int count
)
1054 unsigned rec_len
= 0;
1057 struct ext3_dir_entry_2
*de
= (struct ext3_dir_entry_2
*) (from
+ map
->offs
);
1058 rec_len
= EXT3_DIR_REC_LEN(de
->name_len
);
1059 memcpy (to
, de
, rec_len
);
1060 ((struct ext3_dir_entry_2
*) to
)->rec_len
=
1061 cpu_to_le16(rec_len
);
1066 return (struct ext3_dir_entry_2
*) (to
- rec_len
);
1069 static struct ext3_dir_entry_2
* dx_pack_dirents(char *base
, int size
)
1071 struct ext3_dir_entry_2
*next
, *to
, *prev
, *de
= (struct ext3_dir_entry_2
*) base
;
1072 unsigned rec_len
= 0;
1075 while ((char*)de
< base
+ size
) {
1076 next
= (struct ext3_dir_entry_2
*) ((char *) de
+
1077 le16_to_cpu(de
->rec_len
));
1078 if (de
->inode
&& de
->name_len
) {
1079 rec_len
= EXT3_DIR_REC_LEN(de
->name_len
);
1081 memmove(to
, de
, rec_len
);
1082 to
->rec_len
= cpu_to_le16(rec_len
);
1084 to
= (struct ext3_dir_entry_2
*) (((char *) to
) + rec_len
);
1091 static struct ext3_dir_entry_2
*do_split(handle_t
*handle
, struct inode
*dir
,
1092 struct buffer_head
**bh
,struct dx_frame
*frame
,
1093 struct dx_hash_info
*hinfo
, int *error
)
1095 unsigned blocksize
= dir
->i_sb
->s_blocksize
;
1096 unsigned count
, continued
;
1097 struct buffer_head
*bh2
;
1100 struct dx_map_entry
*map
;
1101 char *data1
= (*bh
)->b_data
, *data2
;
1103 struct ext3_dir_entry_2
*de
= NULL
, *de2
;
1106 bh2
= ext3_append (handle
, dir
, &newblock
, error
);
1113 BUFFER_TRACE(*bh
, "get_write_access");
1114 err
= ext3_journal_get_write_access(handle
, *bh
);
1120 ext3_std_error(dir
->i_sb
, err
);
1123 BUFFER_TRACE(frame
->bh
, "get_write_access");
1124 err
= ext3_journal_get_write_access(handle
, frame
->bh
);
1128 data2
= bh2
->b_data
;
1130 /* create map in the end of data2 block */
1131 map
= (struct dx_map_entry
*) (data2
+ blocksize
);
1132 count
= dx_make_map ((struct ext3_dir_entry_2
*) data1
,
1133 blocksize
, hinfo
, map
);
1135 split
= count
/2; // need to adjust to actual middle
1136 dx_sort_map (map
, count
);
1137 hash2
= map
[split
].hash
;
1138 continued
= hash2
== map
[split
- 1].hash
;
1139 dxtrace(printk("Split block %i at %x, %i/%i\n",
1140 dx_get_block(frame
->at
), hash2
, split
, count
-split
));
1142 /* Fancy dance to stay within two buffers */
1143 de2
= dx_move_dirents(data1
, data2
, map
+ split
, count
- split
);
1144 de
= dx_pack_dirents(data1
,blocksize
);
1145 de
->rec_len
= cpu_to_le16(data1
+ blocksize
- (char *) de
);
1146 de2
->rec_len
= cpu_to_le16(data2
+ blocksize
- (char *) de2
);
1147 dxtrace(dx_show_leaf (hinfo
, (struct ext3_dir_entry_2
*) data1
, blocksize
, 1));
1148 dxtrace(dx_show_leaf (hinfo
, (struct ext3_dir_entry_2
*) data2
, blocksize
, 1));
1150 /* Which block gets the new entry? */
1151 if (hinfo
->hash
>= hash2
)
1156 dx_insert_block (frame
, hash2
+ continued
, newblock
);
1157 err
= ext3_journal_dirty_metadata (handle
, bh2
);
1160 err
= ext3_journal_dirty_metadata (handle
, frame
->bh
);
1164 dxtrace(dx_show_index ("frame", frame
->entries
));
1172 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1173 * it points to a directory entry which is guaranteed to be large
1174 * enough for new directory entry. If de is NULL, then
1175 * add_dirent_to_buf will attempt search the directory block for
1176 * space. It will return -ENOSPC if no space is available, and -EIO
1177 * and -EEXIST if directory entry already exists.
1179 * NOTE! bh is NOT released in the case where ENOSPC is returned. In
1180 * all other cases bh is released.
1182 static int add_dirent_to_buf(handle_t
*handle
, struct dentry
*dentry
,
1183 struct inode
*inode
, struct ext3_dir_entry_2
*de
,
1184 struct buffer_head
* bh
)
1186 struct inode
*dir
= dentry
->d_parent
->d_inode
;
1187 const char *name
= dentry
->d_name
.name
;
1188 int namelen
= dentry
->d_name
.len
;
1189 unsigned long offset
= 0;
1190 unsigned short reclen
;
1191 int nlen
, rlen
, err
;
1194 reclen
= EXT3_DIR_REC_LEN(namelen
);
1196 de
= (struct ext3_dir_entry_2
*)bh
->b_data
;
1197 top
= bh
->b_data
+ dir
->i_sb
->s_blocksize
- reclen
;
1198 while ((char *) de
<= top
) {
1199 if (!ext3_check_dir_entry("ext3_add_entry", dir
, de
,
1204 if (ext3_match (namelen
, name
, de
)) {
1208 nlen
= EXT3_DIR_REC_LEN(de
->name_len
);
1209 rlen
= le16_to_cpu(de
->rec_len
);
1210 if ((de
->inode
? rlen
- nlen
: rlen
) >= reclen
)
1212 de
= (struct ext3_dir_entry_2
*)((char *)de
+ rlen
);
1215 if ((char *) de
> top
)
1218 BUFFER_TRACE(bh
, "get_write_access");
1219 err
= ext3_journal_get_write_access(handle
, bh
);
1221 ext3_std_error(dir
->i_sb
, err
);
1226 /* By now the buffer is marked for journaling */
1227 nlen
= EXT3_DIR_REC_LEN(de
->name_len
);
1228 rlen
= le16_to_cpu(de
->rec_len
);
1230 struct ext3_dir_entry_2
*de1
= (struct ext3_dir_entry_2
*)((char *)de
+ nlen
);
1231 de1
->rec_len
= cpu_to_le16(rlen
- nlen
);
1232 de
->rec_len
= cpu_to_le16(nlen
);
1235 de
->file_type
= EXT3_FT_UNKNOWN
;
1237 de
->inode
= cpu_to_le32(inode
->i_ino
);
1238 ext3_set_de_type(dir
->i_sb
, de
, inode
->i_mode
);
1241 de
->name_len
= namelen
;
1242 memcpy (de
->name
, name
, namelen
);
1244 * XXX shouldn't update any times until successful
1245 * completion of syscall, but too many callers depend
1248 * XXX similarly, too many callers depend on
1249 * ext3_new_inode() setting the times, but error
1250 * recovery deletes the inode, so the worst that can
1251 * happen is that the times are slightly out of date
1252 * and/or different from the directory change time.
1254 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
1255 ext3_update_dx_flag(dir
);
1257 ext3_mark_inode_dirty(handle
, dir
);
1258 BUFFER_TRACE(bh
, "call ext3_journal_dirty_metadata");
1259 err
= ext3_journal_dirty_metadata(handle
, bh
);
1261 ext3_std_error(dir
->i_sb
, err
);
1266 #ifdef CONFIG_EXT3_INDEX
1268 * This converts a one block unindexed directory to a 3 block indexed
1269 * directory, and adds the dentry to the indexed directory.
1271 static int make_indexed_dir(handle_t
*handle
, struct dentry
*dentry
,
1272 struct inode
*inode
, struct buffer_head
*bh
)
1274 struct inode
*dir
= dentry
->d_parent
->d_inode
;
1275 const char *name
= dentry
->d_name
.name
;
1276 int namelen
= dentry
->d_name
.len
;
1277 struct buffer_head
*bh2
;
1278 struct dx_root
*root
;
1279 struct dx_frame frames
[2], *frame
;
1280 struct dx_entry
*entries
;
1281 struct ext3_dir_entry_2
*de
, *de2
;
1286 struct dx_hash_info hinfo
;
1288 struct fake_dirent
*fde
;
1290 blocksize
= dir
->i_sb
->s_blocksize
;
1291 dxtrace(printk("Creating index\n"));
1292 retval
= ext3_journal_get_write_access(handle
, bh
);
1294 ext3_std_error(dir
->i_sb
, retval
);
1298 root
= (struct dx_root
*) bh
->b_data
;
1300 bh2
= ext3_append (handle
, dir
, &block
, &retval
);
1305 EXT3_I(dir
)->i_flags
|= EXT3_INDEX_FL
;
1306 data1
= bh2
->b_data
;
1308 /* The 0th block becomes the root, move the dirents out */
1309 fde
= &root
->dotdot
;
1310 de
= (struct ext3_dir_entry_2
*)((char *)fde
+ le16_to_cpu(fde
->rec_len
));
1311 len
= ((char *) root
) + blocksize
- (char *) de
;
1312 memcpy (data1
, de
, len
);
1313 de
= (struct ext3_dir_entry_2
*) data1
;
1315 while ((char *)(de2
=(void*)de
+le16_to_cpu(de
->rec_len
)) < top
)
1317 de
->rec_len
= cpu_to_le16(data1
+ blocksize
- (char *) de
);
1318 /* Initialize the root; the dot dirents already exist */
1319 de
= (struct ext3_dir_entry_2
*) (&root
->dotdot
);
1320 de
->rec_len
= cpu_to_le16(blocksize
- EXT3_DIR_REC_LEN(2));
1321 memset (&root
->info
, 0, sizeof(root
->info
));
1322 root
->info
.info_length
= sizeof(root
->info
);
1323 root
->info
.hash_version
= EXT3_SB(dir
->i_sb
)->s_def_hash_version
;
1324 entries
= root
->entries
;
1325 dx_set_block (entries
, 1);
1326 dx_set_count (entries
, 1);
1327 dx_set_limit (entries
, dx_root_limit(dir
, sizeof(root
->info
)));
1329 /* Initialize as for dx_probe */
1330 hinfo
.hash_version
= root
->info
.hash_version
;
1331 hinfo
.seed
= EXT3_SB(dir
->i_sb
)->s_hash_seed
;
1332 ext3fs_dirhash(name
, namelen
, &hinfo
);
1334 frame
->entries
= entries
;
1335 frame
->at
= entries
;
1338 de
= do_split(handle
,dir
, &bh
, frame
, &hinfo
, &retval
);
1339 dx_release (frames
);
1343 return add_dirent_to_buf(handle
, dentry
, inode
, de
, bh
);
1350 * adds a file entry to the specified directory, using the same
1351 * semantics as ext3_find_entry(). It returns NULL if it failed.
1353 * NOTE!! The inode part of 'de' is left at 0 - which means you
1354 * may not sleep between calling this and putting something into
1355 * the entry, as someone else might have used it while you slept.
1357 static int ext3_add_entry (handle_t
*handle
, struct dentry
*dentry
,
1358 struct inode
*inode
)
1360 struct inode
*dir
= dentry
->d_parent
->d_inode
;
1361 unsigned long offset
;
1362 struct buffer_head
* bh
;
1363 struct ext3_dir_entry_2
*de
;
1364 struct super_block
* sb
;
1366 #ifdef CONFIG_EXT3_INDEX
1370 unsigned nlen
, rlen
;
1374 blocksize
= sb
->s_blocksize
;
1375 if (!dentry
->d_name
.len
)
1377 #ifdef CONFIG_EXT3_INDEX
1379 retval
= ext3_dx_add_entry(handle
, dentry
, inode
);
1380 if (!retval
|| (retval
!= ERR_BAD_DX_DIR
))
1382 EXT3_I(dir
)->i_flags
&= ~EXT3_INDEX_FL
;
1384 ext3_mark_inode_dirty(handle
, dir
);
1387 blocks
= dir
->i_size
>> sb
->s_blocksize_bits
;
1388 for (block
= 0, offset
= 0; block
< blocks
; block
++) {
1389 bh
= ext3_bread(handle
, dir
, block
, 0, &retval
);
1392 retval
= add_dirent_to_buf(handle
, dentry
, inode
, NULL
, bh
);
1393 if (retval
!= -ENOSPC
)
1396 #ifdef CONFIG_EXT3_INDEX
1397 if (blocks
== 1 && !dx_fallback
&&
1398 EXT3_HAS_COMPAT_FEATURE(sb
, EXT3_FEATURE_COMPAT_DIR_INDEX
))
1399 return make_indexed_dir(handle
, dentry
, inode
, bh
);
1403 bh
= ext3_append(handle
, dir
, &block
, &retval
);
1406 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
1408 de
->rec_len
= cpu_to_le16(rlen
= blocksize
);
1410 return add_dirent_to_buf(handle
, dentry
, inode
, de
, bh
);
1413 #ifdef CONFIG_EXT3_INDEX
1415 * Returns 0 for success, or a negative error value
1417 static int ext3_dx_add_entry(handle_t
*handle
, struct dentry
*dentry
,
1418 struct inode
*inode
)
1420 struct dx_frame frames
[2], *frame
;
1421 struct dx_entry
*entries
, *at
;
1422 struct dx_hash_info hinfo
;
1423 struct buffer_head
* bh
;
1424 struct inode
*dir
= dentry
->d_parent
->d_inode
;
1425 struct super_block
* sb
= dir
->i_sb
;
1426 struct ext3_dir_entry_2
*de
;
1429 frame
= dx_probe(dentry
, NULL
, &hinfo
, frames
, &err
);
1432 entries
= frame
->entries
;
1435 if (!(bh
= ext3_bread(handle
,dir
, dx_get_block(frame
->at
), 0, &err
)))
1438 BUFFER_TRACE(bh
, "get_write_access");
1439 err
= ext3_journal_get_write_access(handle
, bh
);
1443 err
= add_dirent_to_buf(handle
, dentry
, inode
, NULL
, bh
);
1444 if (err
!= -ENOSPC
) {
1449 /* Block full, should compress but for now just split */
1450 dxtrace(printk("using %u of %u node entries\n",
1451 dx_get_count(entries
), dx_get_limit(entries
)));
1452 /* Need to split index? */
1453 if (dx_get_count(entries
) == dx_get_limit(entries
)) {
1455 unsigned icount
= dx_get_count(entries
);
1456 int levels
= frame
- frames
;
1457 struct dx_entry
*entries2
;
1458 struct dx_node
*node2
;
1459 struct buffer_head
*bh2
;
1461 if (levels
&& (dx_get_count(frames
->entries
) ==
1462 dx_get_limit(frames
->entries
))) {
1463 ext3_warning(sb
, __FUNCTION__
,
1464 "Directory index full!\n");
1468 bh2
= ext3_append (handle
, dir
, &newblock
, &err
);
1471 node2
= (struct dx_node
*)(bh2
->b_data
);
1472 entries2
= node2
->entries
;
1473 node2
->fake
.rec_len
= cpu_to_le16(sb
->s_blocksize
);
1474 node2
->fake
.inode
= 0;
1475 BUFFER_TRACE(frame
->bh
, "get_write_access");
1476 err
= ext3_journal_get_write_access(handle
, frame
->bh
);
1480 unsigned icount1
= icount
/2, icount2
= icount
- icount1
;
1481 unsigned hash2
= dx_get_hash(entries
+ icount1
);
1482 dxtrace(printk("Split index %i/%i\n", icount1
, icount2
));
1484 BUFFER_TRACE(frame
->bh
, "get_write_access"); /* index root */
1485 err
= ext3_journal_get_write_access(handle
,
1490 memcpy ((char *) entries2
, (char *) (entries
+ icount1
),
1491 icount2
* sizeof(struct dx_entry
));
1492 dx_set_count (entries
, icount1
);
1493 dx_set_count (entries2
, icount2
);
1494 dx_set_limit (entries2
, dx_node_limit(dir
));
1496 /* Which index block gets the new entry? */
1497 if (at
- entries
>= icount1
) {
1498 frame
->at
= at
= at
- entries
- icount1
+ entries2
;
1499 frame
->entries
= entries
= entries2
;
1500 swap(frame
->bh
, bh2
);
1502 dx_insert_block (frames
+ 0, hash2
, newblock
);
1503 dxtrace(dx_show_index ("node", frames
[1].entries
));
1504 dxtrace(dx_show_index ("node",
1505 ((struct dx_node
*) bh2
->b_data
)->entries
));
1506 err
= ext3_journal_dirty_metadata(handle
, bh2
);
1511 dxtrace(printk("Creating second level index...\n"));
1512 memcpy((char *) entries2
, (char *) entries
,
1513 icount
* sizeof(struct dx_entry
));
1514 dx_set_limit(entries2
, dx_node_limit(dir
));
1517 dx_set_count(entries
, 1);
1518 dx_set_block(entries
+ 0, newblock
);
1519 ((struct dx_root
*) frames
[0].bh
->b_data
)->info
.indirect_levels
= 1;
1521 /* Add new access path frame */
1523 frame
->at
= at
= at
- entries
+ entries2
;
1524 frame
->entries
= entries
= entries2
;
1526 err
= ext3_journal_get_write_access(handle
,
1531 ext3_journal_dirty_metadata(handle
, frames
[0].bh
);
1533 de
= do_split(handle
, dir
, &bh
, frame
, &hinfo
, &err
);
1536 err
= add_dirent_to_buf(handle
, dentry
, inode
, de
, bh
);
1541 ext3_std_error(dir
->i_sb
, err
);
1551 * ext3_delete_entry deletes a directory entry by merging it with the
1554 static int ext3_delete_entry (handle_t
*handle
,
1556 struct ext3_dir_entry_2
* de_del
,
1557 struct buffer_head
* bh
)
1559 struct ext3_dir_entry_2
* de
, * pde
;
1564 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
1565 while (i
< bh
->b_size
) {
1566 if (!ext3_check_dir_entry("ext3_delete_entry", dir
, de
, bh
, i
))
1569 BUFFER_TRACE(bh
, "get_write_access");
1570 ext3_journal_get_write_access(handle
, bh
);
1573 cpu_to_le16(le16_to_cpu(pde
->rec_len
) +
1574 le16_to_cpu(de
->rec_len
));
1578 BUFFER_TRACE(bh
, "call ext3_journal_dirty_metadata");
1579 ext3_journal_dirty_metadata(handle
, bh
);
1582 i
+= le16_to_cpu(de
->rec_len
);
1584 de
= (struct ext3_dir_entry_2
*)
1585 ((char *) de
+ le16_to_cpu(de
->rec_len
));
1591 * ext3_mark_inode_dirty is somewhat expensive, so unlike ext2 we
1592 * do not perform it in these functions. We perform it at the call site,
1595 static inline void ext3_inc_count(handle_t
*handle
, struct inode
*inode
)
1600 static inline void ext3_dec_count(handle_t
*handle
, struct inode
*inode
)
1605 static int ext3_add_nondir(handle_t
*handle
,
1606 struct dentry
*dentry
, struct inode
*inode
)
1608 int err
= ext3_add_entry(handle
, dentry
, inode
);
1610 ext3_mark_inode_dirty(handle
, inode
);
1611 d_instantiate(dentry
, inode
);
1614 ext3_dec_count(handle
, inode
);
1620 * By the time this is called, we already have created
1621 * the directory cache entry for the new file, but it
1622 * is so far negative - it has no inode.
1624 * If the create succeeds, we fill in the inode information
1625 * with d_instantiate().
1627 static int ext3_create (struct inode
* dir
, struct dentry
* dentry
, int mode
,
1628 struct nameidata
*nd
)
1631 struct inode
* inode
;
1632 int err
, retries
= 0;
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
);
1653 if (err
== -ENOSPC
&& ext3_should_retry_alloc(dir
->i_sb
, &retries
))
1658 static int ext3_mknod (struct inode
* dir
, struct dentry
*dentry
,
1659 int mode
, dev_t rdev
)
1662 struct inode
*inode
;
1663 int err
, retries
= 0;
1665 if (!new_valid_dev(rdev
))
1669 handle
= ext3_journal_start(dir
, EXT3_DATA_TRANS_BLOCKS
+
1670 EXT3_INDEX_EXTRA_TRANS_BLOCKS
+ 3 +
1671 2*EXT3_QUOTA_INIT_BLOCKS
);
1673 return PTR_ERR(handle
);
1675 if (IS_DIRSYNC(dir
))
1678 inode
= ext3_new_inode (handle
, dir
, mode
);
1679 err
= PTR_ERR(inode
);
1680 if (!IS_ERR(inode
)) {
1681 init_special_inode(inode
, inode
->i_mode
, rdev
);
1682 #ifdef CONFIG_EXT3_FS_XATTR
1683 inode
->i_op
= &ext3_special_inode_operations
;
1685 err
= ext3_add_nondir(handle
, dentry
, inode
);
1687 ext3_journal_stop(handle
);
1688 if (err
== -ENOSPC
&& ext3_should_retry_alloc(dir
->i_sb
, &retries
))
1693 static int ext3_mkdir(struct inode
* dir
, struct dentry
* dentry
, int mode
)
1696 struct inode
* inode
;
1697 struct buffer_head
* dir_block
;
1698 struct ext3_dir_entry_2
* de
;
1699 int err
, retries
= 0;
1701 if (dir
->i_nlink
>= EXT3_LINK_MAX
)
1705 handle
= ext3_journal_start(dir
, EXT3_DATA_TRANS_BLOCKS
+
1706 EXT3_INDEX_EXTRA_TRANS_BLOCKS
+ 3 +
1707 2*EXT3_QUOTA_INIT_BLOCKS
);
1709 return PTR_ERR(handle
);
1711 if (IS_DIRSYNC(dir
))
1714 inode
= ext3_new_inode (handle
, dir
, S_IFDIR
| mode
);
1715 err
= PTR_ERR(inode
);
1719 inode
->i_op
= &ext3_dir_inode_operations
;
1720 inode
->i_fop
= &ext3_dir_operations
;
1721 inode
->i_size
= EXT3_I(inode
)->i_disksize
= inode
->i_sb
->s_blocksize
;
1722 dir_block
= ext3_bread (handle
, inode
, 0, 1, &err
);
1724 inode
->i_nlink
--; /* is this nlink == 0? */
1725 ext3_mark_inode_dirty(handle
, inode
);
1729 BUFFER_TRACE(dir_block
, "get_write_access");
1730 ext3_journal_get_write_access(handle
, dir_block
);
1731 de
= (struct ext3_dir_entry_2
*) dir_block
->b_data
;
1732 de
->inode
= cpu_to_le32(inode
->i_ino
);
1734 de
->rec_len
= cpu_to_le16(EXT3_DIR_REC_LEN(de
->name_len
));
1735 strcpy (de
->name
, ".");
1736 ext3_set_de_type(dir
->i_sb
, de
, S_IFDIR
);
1737 de
= (struct ext3_dir_entry_2
*)
1738 ((char *) de
+ le16_to_cpu(de
->rec_len
));
1739 de
->inode
= cpu_to_le32(dir
->i_ino
);
1740 de
->rec_len
= cpu_to_le16(inode
->i_sb
->s_blocksize
-EXT3_DIR_REC_LEN(1));
1742 strcpy (de
->name
, "..");
1743 ext3_set_de_type(dir
->i_sb
, de
, S_IFDIR
);
1745 BUFFER_TRACE(dir_block
, "call ext3_journal_dirty_metadata");
1746 ext3_journal_dirty_metadata(handle
, dir_block
);
1748 ext3_mark_inode_dirty(handle
, inode
);
1749 err
= ext3_add_entry (handle
, dentry
, inode
);
1752 ext3_mark_inode_dirty(handle
, inode
);
1757 ext3_update_dx_flag(dir
);
1758 ext3_mark_inode_dirty(handle
, dir
);
1759 d_instantiate(dentry
, inode
);
1761 ext3_journal_stop(handle
);
1762 if (err
== -ENOSPC
&& ext3_should_retry_alloc(dir
->i_sb
, &retries
))
1768 * routine to check that the specified directory is empty (for rmdir)
1770 static int empty_dir (struct inode
* inode
)
1772 unsigned long offset
;
1773 struct buffer_head
* bh
;
1774 struct ext3_dir_entry_2
* de
, * de1
;
1775 struct super_block
* sb
;
1779 if (inode
->i_size
< EXT3_DIR_REC_LEN(1) + EXT3_DIR_REC_LEN(2) ||
1780 !(bh
= ext3_bread (NULL
, inode
, 0, 0, &err
))) {
1782 ext3_error(inode
->i_sb
, __FUNCTION__
,
1783 "error %d reading directory #%lu offset 0",
1786 ext3_warning(inode
->i_sb
, __FUNCTION__
,
1787 "bad directory (dir #%lu) - no data block",
1791 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
1792 de1
= (struct ext3_dir_entry_2
*)
1793 ((char *) de
+ le16_to_cpu(de
->rec_len
));
1794 if (le32_to_cpu(de
->inode
) != inode
->i_ino
||
1795 !le32_to_cpu(de1
->inode
) ||
1796 strcmp (".", de
->name
) ||
1797 strcmp ("..", de1
->name
)) {
1798 ext3_warning (inode
->i_sb
, "empty_dir",
1799 "bad directory (dir #%lu) - no `.' or `..'",
1804 offset
= le16_to_cpu(de
->rec_len
) + le16_to_cpu(de1
->rec_len
);
1805 de
= (struct ext3_dir_entry_2
*)
1806 ((char *) de1
+ le16_to_cpu(de1
->rec_len
));
1807 while (offset
< inode
->i_size
) {
1809 (void *) de
>= (void *) (bh
->b_data
+sb
->s_blocksize
)) {
1812 bh
= ext3_bread (NULL
, inode
,
1813 offset
>> EXT3_BLOCK_SIZE_BITS(sb
), 0, &err
);
1816 ext3_error(sb
, __FUNCTION__
,
1817 "error %d reading directory"
1819 err
, inode
->i_ino
, offset
);
1820 offset
+= sb
->s_blocksize
;
1823 de
= (struct ext3_dir_entry_2
*) bh
->b_data
;
1825 if (!ext3_check_dir_entry("empty_dir", inode
, de
, bh
, offset
)) {
1826 de
= (struct ext3_dir_entry_2
*)(bh
->b_data
+
1828 offset
= (offset
| (sb
->s_blocksize
- 1)) + 1;
1831 if (le32_to_cpu(de
->inode
)) {
1835 offset
+= le16_to_cpu(de
->rec_len
);
1836 de
= (struct ext3_dir_entry_2
*)
1837 ((char *) de
+ le16_to_cpu(de
->rec_len
));
1843 /* ext3_orphan_add() links an unlinked or truncated inode into a list of
1844 * such inodes, starting at the superblock, in case we crash before the
1845 * file is closed/deleted, or in case the inode truncate spans multiple
1846 * transactions and the last transaction is not recovered after a crash.
1848 * At filesystem recovery time, we walk this list deleting unlinked
1849 * inodes and truncating linked inodes in ext3_orphan_cleanup().
1851 int ext3_orphan_add(handle_t
*handle
, struct inode
*inode
)
1853 struct super_block
*sb
= inode
->i_sb
;
1854 struct ext3_iloc iloc
;
1858 if (!list_empty(&EXT3_I(inode
)->i_orphan
))
1861 /* Orphan handling is only valid for files with data blocks
1862 * being truncated, or files being unlinked. */
1864 /* @@@ FIXME: Observation from aviro:
1865 * I think I can trigger J_ASSERT in ext3_orphan_add(). We block
1866 * here (on lock_super()), so race with ext3_link() which might bump
1867 * ->i_nlink. For, say it, character device. Not a regular file,
1868 * not a directory, not a symlink and ->i_nlink > 0.
1870 J_ASSERT ((S_ISREG(inode
->i_mode
) || S_ISDIR(inode
->i_mode
) ||
1871 S_ISLNK(inode
->i_mode
)) || inode
->i_nlink
== 0);
1873 BUFFER_TRACE(EXT3_SB(sb
)->s_sbh
, "get_write_access");
1874 err
= ext3_journal_get_write_access(handle
, EXT3_SB(sb
)->s_sbh
);
1878 err
= ext3_reserve_inode_write(handle
, inode
, &iloc
);
1882 /* Insert this inode at the head of the on-disk orphan list... */
1883 NEXT_ORPHAN(inode
) = le32_to_cpu(EXT3_SB(sb
)->s_es
->s_last_orphan
);
1884 EXT3_SB(sb
)->s_es
->s_last_orphan
= cpu_to_le32(inode
->i_ino
);
1885 err
= ext3_journal_dirty_metadata(handle
, EXT3_SB(sb
)->s_sbh
);
1886 rc
= ext3_mark_iloc_dirty(handle
, inode
, &iloc
);
1890 /* Only add to the head of the in-memory list if all the
1891 * previous operations succeeded. If the orphan_add is going to
1892 * fail (possibly taking the journal offline), we can't risk
1893 * leaving the inode on the orphan list: stray orphan-list
1894 * entries can cause panics at unmount time.
1896 * This is safe: on error we're going to ignore the orphan list
1897 * anyway on the next recovery. */
1899 list_add(&EXT3_I(inode
)->i_orphan
, &EXT3_SB(sb
)->s_orphan
);
1901 jbd_debug(4, "superblock will point to %ld\n", inode
->i_ino
);
1902 jbd_debug(4, "orphan inode %ld will point to %d\n",
1903 inode
->i_ino
, NEXT_ORPHAN(inode
));
1906 ext3_std_error(inode
->i_sb
, err
);
1911 * ext3_orphan_del() removes an unlinked or truncated inode from the list
1912 * of such inodes stored on disk, because it is finally being cleaned up.
1914 int ext3_orphan_del(handle_t
*handle
, struct inode
*inode
)
1916 struct list_head
*prev
;
1917 struct ext3_inode_info
*ei
= EXT3_I(inode
);
1918 struct ext3_sb_info
*sbi
;
1919 unsigned long ino_next
;
1920 struct ext3_iloc iloc
;
1923 lock_super(inode
->i_sb
);
1924 if (list_empty(&ei
->i_orphan
)) {
1925 unlock_super(inode
->i_sb
);
1929 ino_next
= NEXT_ORPHAN(inode
);
1930 prev
= ei
->i_orphan
.prev
;
1931 sbi
= EXT3_SB(inode
->i_sb
);
1933 jbd_debug(4, "remove inode %lu from orphan list\n", inode
->i_ino
);
1935 list_del_init(&ei
->i_orphan
);
1937 /* If we're on an error path, we may not have a valid
1938 * transaction handle with which to update the orphan list on
1939 * disk, but we still need to remove the inode from the linked
1940 * list in memory. */
1944 err
= ext3_reserve_inode_write(handle
, inode
, &iloc
);
1948 if (prev
== &sbi
->s_orphan
) {
1949 jbd_debug(4, "superblock will point to %lu\n", ino_next
);
1950 BUFFER_TRACE(sbi
->s_sbh
, "get_write_access");
1951 err
= ext3_journal_get_write_access(handle
, sbi
->s_sbh
);
1954 sbi
->s_es
->s_last_orphan
= cpu_to_le32(ino_next
);
1955 err
= ext3_journal_dirty_metadata(handle
, sbi
->s_sbh
);
1957 struct ext3_iloc iloc2
;
1958 struct inode
*i_prev
=
1959 &list_entry(prev
, struct ext3_inode_info
, i_orphan
)->vfs_inode
;
1961 jbd_debug(4, "orphan inode %lu will point to %lu\n",
1962 i_prev
->i_ino
, ino_next
);
1963 err
= ext3_reserve_inode_write(handle
, i_prev
, &iloc2
);
1966 NEXT_ORPHAN(i_prev
) = ino_next
;
1967 err
= ext3_mark_iloc_dirty(handle
, i_prev
, &iloc2
);
1971 NEXT_ORPHAN(inode
) = 0;
1972 err
= ext3_mark_iloc_dirty(handle
, inode
, &iloc
);
1975 ext3_std_error(inode
->i_sb
, err
);
1977 unlock_super(inode
->i_sb
);
1985 static int ext3_rmdir (struct inode
* dir
, struct dentry
*dentry
)
1988 struct inode
* inode
;
1989 struct buffer_head
* bh
;
1990 struct ext3_dir_entry_2
* de
;
1993 /* Initialize quotas before so that eventual writes go in
1994 * separate transaction */
1995 DQUOT_INIT(dentry
->d_inode
);
1996 handle
= ext3_journal_start(dir
, EXT3_DELETE_TRANS_BLOCKS
);
1998 return PTR_ERR(handle
);
2001 bh
= ext3_find_entry (dentry
, &de
);
2005 if (IS_DIRSYNC(dir
))
2008 inode
= dentry
->d_inode
;
2011 if (le32_to_cpu(de
->inode
) != inode
->i_ino
)
2014 retval
= -ENOTEMPTY
;
2015 if (!empty_dir (inode
))
2018 retval
= ext3_delete_entry(handle
, dir
, de
, bh
);
2021 if (inode
->i_nlink
!= 2)
2022 ext3_warning (inode
->i_sb
, "ext3_rmdir",
2023 "empty directory has nlink!=2 (%d)",
2027 /* There's no need to set i_disksize: the fact that i_nlink is
2028 * zero will ensure that the right thing happens during any
2031 ext3_orphan_add(handle
, inode
);
2032 inode
->i_ctime
= dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
2033 ext3_mark_inode_dirty(handle
, inode
);
2035 ext3_update_dx_flag(dir
);
2036 ext3_mark_inode_dirty(handle
, dir
);
2039 ext3_journal_stop(handle
);
2044 static int ext3_unlink(struct inode
* dir
, struct dentry
*dentry
)
2047 struct inode
* inode
;
2048 struct buffer_head
* bh
;
2049 struct ext3_dir_entry_2
* de
;
2052 /* Initialize quotas before so that eventual writes go
2053 * in separate transaction */
2054 DQUOT_INIT(dentry
->d_inode
);
2055 handle
= ext3_journal_start(dir
, EXT3_DELETE_TRANS_BLOCKS
);
2057 return PTR_ERR(handle
);
2059 if (IS_DIRSYNC(dir
))
2063 bh
= ext3_find_entry (dentry
, &de
);
2067 inode
= dentry
->d_inode
;
2070 if (le32_to_cpu(de
->inode
) != inode
->i_ino
)
2073 if (!inode
->i_nlink
) {
2074 ext3_warning (inode
->i_sb
, "ext3_unlink",
2075 "Deleting nonexistent file (%lu), %d",
2076 inode
->i_ino
, inode
->i_nlink
);
2079 retval
= ext3_delete_entry(handle
, dir
, de
, bh
);
2082 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
2083 ext3_update_dx_flag(dir
);
2084 ext3_mark_inode_dirty(handle
, dir
);
2086 if (!inode
->i_nlink
)
2087 ext3_orphan_add(handle
, inode
);
2088 inode
->i_ctime
= dir
->i_ctime
;
2089 ext3_mark_inode_dirty(handle
, inode
);
2093 ext3_journal_stop(handle
);
2098 static int ext3_symlink (struct inode
* dir
,
2099 struct dentry
*dentry
, const char * symname
)
2102 struct inode
* inode
;
2103 int l
, err
, retries
= 0;
2105 l
= strlen(symname
)+1;
2106 if (l
> dir
->i_sb
->s_blocksize
)
2107 return -ENAMETOOLONG
;
2110 handle
= ext3_journal_start(dir
, EXT3_DATA_TRANS_BLOCKS
+
2111 EXT3_INDEX_EXTRA_TRANS_BLOCKS
+ 5 +
2112 2*EXT3_QUOTA_INIT_BLOCKS
);
2114 return PTR_ERR(handle
);
2116 if (IS_DIRSYNC(dir
))
2119 inode
= ext3_new_inode (handle
, dir
, S_IFLNK
|S_IRWXUGO
);
2120 err
= PTR_ERR(inode
);
2124 if (l
> sizeof (EXT3_I(inode
)->i_data
)) {
2125 inode
->i_op
= &ext3_symlink_inode_operations
;
2126 ext3_set_aops(inode
);
2128 * page_symlink() calls into ext3_prepare/commit_write.
2129 * We have a transaction open. All is sweetness. It also sets
2130 * i_size in generic_commit_write().
2132 err
= page_symlink(inode
, symname
, l
);
2134 ext3_dec_count(handle
, inode
);
2135 ext3_mark_inode_dirty(handle
, inode
);
2140 inode
->i_op
= &ext3_fast_symlink_inode_operations
;
2141 memcpy((char*)&EXT3_I(inode
)->i_data
,symname
,l
);
2142 inode
->i_size
= l
-1;
2144 EXT3_I(inode
)->i_disksize
= inode
->i_size
;
2145 err
= ext3_add_nondir(handle
, dentry
, inode
);
2147 ext3_journal_stop(handle
);
2148 if (err
== -ENOSPC
&& ext3_should_retry_alloc(dir
->i_sb
, &retries
))
2153 static int ext3_link (struct dentry
* old_dentry
,
2154 struct inode
* dir
, struct dentry
*dentry
)
2157 struct inode
*inode
= old_dentry
->d_inode
;
2158 int err
, retries
= 0;
2160 if (inode
->i_nlink
>= EXT3_LINK_MAX
)
2164 handle
= ext3_journal_start(dir
, EXT3_DATA_TRANS_BLOCKS
+
2165 EXT3_INDEX_EXTRA_TRANS_BLOCKS
);
2167 return PTR_ERR(handle
);
2169 if (IS_DIRSYNC(dir
))
2172 inode
->i_ctime
= CURRENT_TIME
;
2173 ext3_inc_count(handle
, inode
);
2174 atomic_inc(&inode
->i_count
);
2176 err
= ext3_add_nondir(handle
, dentry
, inode
);
2177 ext3_journal_stop(handle
);
2178 if (err
== -ENOSPC
&& ext3_should_retry_alloc(dir
->i_sb
, &retries
))
2183 #define PARENT_INO(buffer) \
2184 ((struct ext3_dir_entry_2 *) ((char *) buffer + \
2185 le16_to_cpu(((struct ext3_dir_entry_2 *) buffer)->rec_len)))->inode
2188 * Anybody can rename anything with this: the permission checks are left to the
2189 * higher-level routines.
2191 static int ext3_rename (struct inode
* old_dir
, struct dentry
*old_dentry
,
2192 struct inode
* new_dir
,struct dentry
*new_dentry
)
2195 struct inode
* old_inode
, * new_inode
;
2196 struct buffer_head
* old_bh
, * new_bh
, * dir_bh
;
2197 struct ext3_dir_entry_2
* old_de
, * new_de
;
2200 old_bh
= new_bh
= dir_bh
= NULL
;
2202 /* Initialize quotas before so that eventual writes go
2203 * in separate transaction */
2204 if (new_dentry
->d_inode
)
2205 DQUOT_INIT(new_dentry
->d_inode
);
2206 handle
= ext3_journal_start(old_dir
, 2 * EXT3_DATA_TRANS_BLOCKS
+
2207 EXT3_INDEX_EXTRA_TRANS_BLOCKS
+ 2);
2209 return PTR_ERR(handle
);
2211 if (IS_DIRSYNC(old_dir
) || IS_DIRSYNC(new_dir
))
2214 old_bh
= ext3_find_entry (old_dentry
, &old_de
);
2216 * Check for inode number is _not_ due to possible IO errors.
2217 * We might rmdir the source, keep it as pwd of some process
2218 * and merrily kill the link to whatever was created under the
2219 * same name. Goodbye sticky bit ;-<
2221 old_inode
= old_dentry
->d_inode
;
2223 if (!old_bh
|| le32_to_cpu(old_de
->inode
) != old_inode
->i_ino
)
2226 new_inode
= new_dentry
->d_inode
;
2227 new_bh
= ext3_find_entry (new_dentry
, &new_de
);
2234 if (S_ISDIR(old_inode
->i_mode
)) {
2236 retval
= -ENOTEMPTY
;
2237 if (!empty_dir (new_inode
))
2241 dir_bh
= ext3_bread (handle
, old_inode
, 0, 0, &retval
);
2244 if (le32_to_cpu(PARENT_INO(dir_bh
->b_data
)) != old_dir
->i_ino
)
2247 if (!new_inode
&& new_dir
!=old_dir
&&
2248 new_dir
->i_nlink
>= EXT3_LINK_MAX
)
2252 retval
= ext3_add_entry (handle
, new_dentry
, old_inode
);
2256 BUFFER_TRACE(new_bh
, "get write access");
2257 ext3_journal_get_write_access(handle
, new_bh
);
2258 new_de
->inode
= cpu_to_le32(old_inode
->i_ino
);
2259 if (EXT3_HAS_INCOMPAT_FEATURE(new_dir
->i_sb
,
2260 EXT3_FEATURE_INCOMPAT_FILETYPE
))
2261 new_de
->file_type
= old_de
->file_type
;
2262 new_dir
->i_version
++;
2263 BUFFER_TRACE(new_bh
, "call ext3_journal_dirty_metadata");
2264 ext3_journal_dirty_metadata(handle
, new_bh
);
2270 * Like most other Unix systems, set the ctime for inodes on a
2273 old_inode
->i_ctime
= CURRENT_TIME
;
2274 ext3_mark_inode_dirty(handle
, old_inode
);
2279 if (le32_to_cpu(old_de
->inode
) != old_inode
->i_ino
||
2280 old_de
->name_len
!= old_dentry
->d_name
.len
||
2281 strncmp(old_de
->name
, old_dentry
->d_name
.name
, old_de
->name_len
) ||
2282 (retval
= ext3_delete_entry(handle
, old_dir
,
2283 old_de
, old_bh
)) == -ENOENT
) {
2284 /* old_de could have moved from under us during htree split, so
2285 * make sure that we are deleting the right entry. We might
2286 * also be pointing to a stale entry in the unused part of
2287 * old_bh so just checking inum and the name isn't enough. */
2288 struct buffer_head
*old_bh2
;
2289 struct ext3_dir_entry_2
*old_de2
;
2291 old_bh2
= ext3_find_entry(old_dentry
, &old_de2
);
2293 retval
= ext3_delete_entry(handle
, old_dir
,
2299 ext3_warning(old_dir
->i_sb
, "ext3_rename",
2300 "Deleting old file (%lu), %d, error=%d",
2301 old_dir
->i_ino
, old_dir
->i_nlink
, retval
);
2305 new_inode
->i_nlink
--;
2306 new_inode
->i_ctime
= CURRENT_TIME
;
2308 old_dir
->i_ctime
= old_dir
->i_mtime
= CURRENT_TIME
;
2309 ext3_update_dx_flag(old_dir
);
2311 BUFFER_TRACE(dir_bh
, "get_write_access");
2312 ext3_journal_get_write_access(handle
, dir_bh
);
2313 PARENT_INO(dir_bh
->b_data
) = cpu_to_le32(new_dir
->i_ino
);
2314 BUFFER_TRACE(dir_bh
, "call ext3_journal_dirty_metadata");
2315 ext3_journal_dirty_metadata(handle
, dir_bh
);
2318 new_inode
->i_nlink
--;
2321 ext3_update_dx_flag(new_dir
);
2322 ext3_mark_inode_dirty(handle
, new_dir
);
2325 ext3_mark_inode_dirty(handle
, old_dir
);
2327 ext3_mark_inode_dirty(handle
, new_inode
);
2328 if (!new_inode
->i_nlink
)
2329 ext3_orphan_add(handle
, new_inode
);
2337 ext3_journal_stop(handle
);
2342 * directories can handle most operations...
2344 struct inode_operations ext3_dir_inode_operations
= {
2345 .create
= ext3_create
,
2346 .lookup
= ext3_lookup
,
2348 .unlink
= ext3_unlink
,
2349 .symlink
= ext3_symlink
,
2350 .mkdir
= ext3_mkdir
,
2351 .rmdir
= ext3_rmdir
,
2352 .mknod
= ext3_mknod
,
2353 .rename
= ext3_rename
,
2354 .setattr
= ext3_setattr
,
2355 .setxattr
= ext3_setxattr
,
2356 .getxattr
= ext3_getxattr
,
2357 .listxattr
= ext3_listxattr
,
2358 .removexattr
= ext3_removexattr
,
2359 .permission
= ext3_permission
,
2362 struct inode_operations ext3_special_inode_operations
= {
2363 .setattr
= ext3_setattr
,
2364 .setxattr
= ext3_setxattr
,
2365 .getxattr
= ext3_getxattr
,
2366 .listxattr
= ext3_listxattr
,
2367 .removexattr
= ext3_removexattr
,
2368 .permission
= ext3_permission
,