Merge branch 'v6v7' into devel
[linux/fpc-iii.git] / fs / ext3 / namei.c
blobb27ba71810ecdb57efbf7739559eb7bb76b1126e
1 /*
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)
9 * from
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
24 * Theodore Ts'o, 2002
27 #include <linux/fs.h>
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/bio.h>
40 #include "namei.h"
41 #include "xattr.h"
42 #include "acl.h"
45 * define how far ahead to read directories while searching them.
47 #define NAMEI_RA_CHUNKS 2
48 #define NAMEI_RA_BLOCKS 4
49 #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS)
50 #define NAMEI_RA_INDEX(c,b) (((c) * NAMEI_RA_BLOCKS) + (b))
52 static struct buffer_head *ext3_append(handle_t *handle,
53 struct inode *inode,
54 u32 *block, int *err)
56 struct buffer_head *bh;
58 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
60 bh = ext3_bread(handle, inode, *block, 1, err);
61 if (bh) {
62 inode->i_size += inode->i_sb->s_blocksize;
63 EXT3_I(inode)->i_disksize = inode->i_size;
64 *err = ext3_journal_get_write_access(handle, bh);
65 if (*err) {
66 brelse(bh);
67 bh = NULL;
70 return bh;
73 #ifndef assert
74 #define assert(test) J_ASSERT(test)
75 #endif
77 #ifdef DX_DEBUG
78 #define dxtrace(command) command
79 #else
80 #define dxtrace(command)
81 #endif
83 struct fake_dirent
85 __le32 inode;
86 __le16 rec_len;
87 u8 name_len;
88 u8 file_type;
91 struct dx_countlimit
93 __le16 limit;
94 __le16 count;
97 struct dx_entry
99 __le32 hash;
100 __le32 block;
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.
109 struct dx_root
111 struct fake_dirent dot;
112 char dot_name[4];
113 struct fake_dirent dotdot;
114 char dotdot_name[4];
115 struct dx_root_info
117 __le32 reserved_zero;
118 u8 hash_version;
119 u8 info_length; /* 8 */
120 u8 indirect_levels;
121 u8 unused_flags;
123 info;
124 struct dx_entry entries[0];
127 struct dx_node
129 struct fake_dirent fake;
130 struct dx_entry entries[0];
134 struct dx_frame
136 struct buffer_head *bh;
137 struct dx_entry *entries;
138 struct dx_entry *at;
141 struct dx_map_entry
143 u32 hash;
144 u16 offs;
145 u16 size;
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 qstr *entry,
159 struct inode *dir,
160 struct dx_hash_info *hinfo,
161 struct dx_frame *frame,
162 int *err);
163 static void dx_release (struct dx_frame *frames);
164 static int dx_make_map(struct ext3_dir_entry_2 *de, unsigned blocksize,
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, unsigned blocksize);
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,
174 __u32 *start_hash);
175 static struct buffer_head * ext3_dx_find_entry(struct inode *dir,
176 struct qstr *entry, struct ext3_dir_entry_2 **res_dir,
177 int *err);
178 static int ext3_dx_add_entry(handle_t *handle, struct dentry *dentry,
179 struct inode *inode);
182 * p is at least 6 bytes before the end of page
184 static inline struct ext3_dir_entry_2 *
185 ext3_next_entry(struct ext3_dir_entry_2 *p)
187 return (struct ext3_dir_entry_2 *)((char *)p +
188 ext3_rec_len_from_disk(p->rec_len));
192 * Future: use high four bits of block for coalesce-on-delete flags
193 * Mask them off for now.
196 static inline unsigned dx_get_block (struct dx_entry *entry)
198 return le32_to_cpu(entry->block) & 0x00ffffff;
201 static inline void dx_set_block (struct dx_entry *entry, unsigned value)
203 entry->block = cpu_to_le32(value);
206 static inline unsigned dx_get_hash (struct dx_entry *entry)
208 return le32_to_cpu(entry->hash);
211 static inline void dx_set_hash (struct dx_entry *entry, unsigned value)
213 entry->hash = cpu_to_le32(value);
216 static inline unsigned dx_get_count (struct dx_entry *entries)
218 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
221 static inline unsigned dx_get_limit (struct dx_entry *entries)
223 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
226 static inline void dx_set_count (struct dx_entry *entries, unsigned value)
228 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
231 static inline void dx_set_limit (struct dx_entry *entries, unsigned value)
233 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
236 static inline unsigned dx_root_limit (struct inode *dir, unsigned infosize)
238 unsigned entry_space = dir->i_sb->s_blocksize - EXT3_DIR_REC_LEN(1) -
239 EXT3_DIR_REC_LEN(2) - infosize;
240 return entry_space / sizeof(struct dx_entry);
243 static inline unsigned dx_node_limit (struct inode *dir)
245 unsigned entry_space = dir->i_sb->s_blocksize - EXT3_DIR_REC_LEN(0);
246 return entry_space / sizeof(struct dx_entry);
250 * Debug
252 #ifdef DX_DEBUG
253 static void dx_show_index (char * label, struct dx_entry *entries)
255 int i, n = dx_get_count (entries);
256 printk("%s index ", label);
257 for (i = 0; i < n; i++)
259 printk("%x->%u ", i? dx_get_hash(entries + i): 0, dx_get_block(entries + i));
261 printk("\n");
264 struct stats
266 unsigned names;
267 unsigned space;
268 unsigned bcount;
271 static struct stats dx_show_leaf(struct dx_hash_info *hinfo, struct ext3_dir_entry_2 *de,
272 int size, int show_names)
274 unsigned names = 0, space = 0;
275 char *base = (char *) de;
276 struct dx_hash_info h = *hinfo;
278 printk("names: ");
279 while ((char *) de < base + size)
281 if (de->inode)
283 if (show_names)
285 int len = de->name_len;
286 char *name = de->name;
287 while (len--) printk("%c", *name++);
288 ext3fs_dirhash(de->name, de->name_len, &h);
289 printk(":%x.%u ", h.hash,
290 ((char *) de - base));
292 space += EXT3_DIR_REC_LEN(de->name_len);
293 names++;
295 de = ext3_next_entry(de);
297 printk("(%i)\n", names);
298 return (struct stats) { names, space, 1 };
301 struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
302 struct dx_entry *entries, int levels)
304 unsigned blocksize = dir->i_sb->s_blocksize;
305 unsigned count = dx_get_count (entries), names = 0, space = 0, i;
306 unsigned bcount = 0;
307 struct buffer_head *bh;
308 int err;
309 printk("%i indexed blocks...\n", count);
310 for (i = 0; i < count; i++, entries++)
312 u32 block = dx_get_block(entries), hash = i? dx_get_hash(entries): 0;
313 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
314 struct stats stats;
315 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
316 if (!(bh = ext3_bread (NULL,dir, block, 0,&err))) continue;
317 stats = levels?
318 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
319 dx_show_leaf(hinfo, (struct ext3_dir_entry_2 *) bh->b_data, blocksize, 0);
320 names += stats.names;
321 space += stats.space;
322 bcount += stats.bcount;
323 brelse (bh);
325 if (bcount)
326 printk("%snames %u, fullness %u (%u%%)\n", levels?"":" ",
327 names, space/bcount,(space/bcount)*100/blocksize);
328 return (struct stats) { names, space, bcount};
330 #endif /* DX_DEBUG */
333 * Probe for a directory leaf block to search.
335 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
336 * error in the directory index, and the caller should fall back to
337 * searching the directory normally. The callers of dx_probe **MUST**
338 * check for this error code, and make sure it never gets reflected
339 * back to userspace.
341 static struct dx_frame *
342 dx_probe(struct qstr *entry, struct inode *dir,
343 struct dx_hash_info *hinfo, struct dx_frame *frame_in, int *err)
345 unsigned count, indirect;
346 struct dx_entry *at, *entries, *p, *q, *m;
347 struct dx_root *root;
348 struct buffer_head *bh;
349 struct dx_frame *frame = frame_in;
350 u32 hash;
352 frame->bh = NULL;
353 if (!(bh = ext3_bread (NULL,dir, 0, 0, err)))
354 goto fail;
355 root = (struct dx_root *) bh->b_data;
356 if (root->info.hash_version != DX_HASH_TEA &&
357 root->info.hash_version != DX_HASH_HALF_MD4 &&
358 root->info.hash_version != DX_HASH_LEGACY) {
359 ext3_warning(dir->i_sb, __func__,
360 "Unrecognised inode hash code %d",
361 root->info.hash_version);
362 brelse(bh);
363 *err = ERR_BAD_DX_DIR;
364 goto fail;
366 hinfo->hash_version = root->info.hash_version;
367 if (hinfo->hash_version <= DX_HASH_TEA)
368 hinfo->hash_version += EXT3_SB(dir->i_sb)->s_hash_unsigned;
369 hinfo->seed = EXT3_SB(dir->i_sb)->s_hash_seed;
370 if (entry)
371 ext3fs_dirhash(entry->name, entry->len, hinfo);
372 hash = hinfo->hash;
374 if (root->info.unused_flags & 1) {
375 ext3_warning(dir->i_sb, __func__,
376 "Unimplemented inode hash flags: %#06x",
377 root->info.unused_flags);
378 brelse(bh);
379 *err = ERR_BAD_DX_DIR;
380 goto fail;
383 if ((indirect = root->info.indirect_levels) > 1) {
384 ext3_warning(dir->i_sb, __func__,
385 "Unimplemented inode hash depth: %#06x",
386 root->info.indirect_levels);
387 brelse(bh);
388 *err = ERR_BAD_DX_DIR;
389 goto fail;
392 entries = (struct dx_entry *) (((char *)&root->info) +
393 root->info.info_length);
395 if (dx_get_limit(entries) != dx_root_limit(dir,
396 root->info.info_length)) {
397 ext3_warning(dir->i_sb, __func__,
398 "dx entry: limit != root limit");
399 brelse(bh);
400 *err = ERR_BAD_DX_DIR;
401 goto fail;
404 dxtrace (printk("Look up %x", hash));
405 while (1)
407 count = dx_get_count(entries);
408 if (!count || count > dx_get_limit(entries)) {
409 ext3_warning(dir->i_sb, __func__,
410 "dx entry: no count or count > limit");
411 brelse(bh);
412 *err = ERR_BAD_DX_DIR;
413 goto fail2;
416 p = entries + 1;
417 q = entries + count - 1;
418 while (p <= q)
420 m = p + (q - p)/2;
421 dxtrace(printk("."));
422 if (dx_get_hash(m) > hash)
423 q = m - 1;
424 else
425 p = m + 1;
428 if (0) // linear search cross check
430 unsigned n = count - 1;
431 at = entries;
432 while (n--)
434 dxtrace(printk(","));
435 if (dx_get_hash(++at) > hash)
437 at--;
438 break;
441 assert (at == p - 1);
444 at = p - 1;
445 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
446 frame->bh = bh;
447 frame->entries = entries;
448 frame->at = at;
449 if (!indirect--) return frame;
450 if (!(bh = ext3_bread (NULL,dir, dx_get_block(at), 0, err)))
451 goto fail2;
452 at = entries = ((struct dx_node *) bh->b_data)->entries;
453 if (dx_get_limit(entries) != dx_node_limit (dir)) {
454 ext3_warning(dir->i_sb, __func__,
455 "dx entry: limit != node limit");
456 brelse(bh);
457 *err = ERR_BAD_DX_DIR;
458 goto fail2;
460 frame++;
461 frame->bh = NULL;
463 fail2:
464 while (frame >= frame_in) {
465 brelse(frame->bh);
466 frame--;
468 fail:
469 if (*err == ERR_BAD_DX_DIR)
470 ext3_warning(dir->i_sb, __func__,
471 "Corrupt dir inode %ld, running e2fsck is "
472 "recommended.", dir->i_ino);
473 return NULL;
476 static void dx_release (struct dx_frame *frames)
478 if (frames[0].bh == NULL)
479 return;
481 if (((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels)
482 brelse(frames[1].bh);
483 brelse(frames[0].bh);
487 * This function increments the frame pointer to search the next leaf
488 * block, and reads in the necessary intervening nodes if the search
489 * should be necessary. Whether or not the search is necessary is
490 * controlled by the hash parameter. If the hash value is even, then
491 * the search is only continued if the next block starts with that
492 * hash value. This is used if we are searching for a specific file.
494 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
496 * This function returns 1 if the caller should continue to search,
497 * or 0 if it should not. If there is an error reading one of the
498 * index blocks, it will a negative error code.
500 * If start_hash is non-null, it will be filled in with the starting
501 * hash of the next page.
503 static int ext3_htree_next_block(struct inode *dir, __u32 hash,
504 struct dx_frame *frame,
505 struct dx_frame *frames,
506 __u32 *start_hash)
508 struct dx_frame *p;
509 struct buffer_head *bh;
510 int err, num_frames = 0;
511 __u32 bhash;
513 p = frame;
515 * Find the next leaf page by incrementing the frame pointer.
516 * If we run out of entries in the interior node, loop around and
517 * increment pointer in the parent node. When we break out of
518 * this loop, num_frames indicates the number of interior
519 * nodes need to be read.
521 while (1) {
522 if (++(p->at) < p->entries + dx_get_count(p->entries))
523 break;
524 if (p == frames)
525 return 0;
526 num_frames++;
527 p--;
531 * If the hash is 1, then continue only if the next page has a
532 * continuation hash of any value. This is used for readdir
533 * handling. Otherwise, check to see if the hash matches the
534 * desired contiuation hash. If it doesn't, return since
535 * there's no point to read in the successive index pages.
537 bhash = dx_get_hash(p->at);
538 if (start_hash)
539 *start_hash = bhash;
540 if ((hash & 1) == 0) {
541 if ((bhash & ~1) != hash)
542 return 0;
545 * If the hash is HASH_NB_ALWAYS, we always go to the next
546 * block so no check is necessary
548 while (num_frames--) {
549 if (!(bh = ext3_bread(NULL, dir, dx_get_block(p->at),
550 0, &err)))
551 return err; /* Failure */
552 p++;
553 brelse (p->bh);
554 p->bh = bh;
555 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
557 return 1;
562 * This function fills a red-black tree with information from a
563 * directory block. It returns the number directory entries loaded
564 * into the tree. If there is an error it is returned in err.
566 static int htree_dirblock_to_tree(struct file *dir_file,
567 struct inode *dir, int block,
568 struct dx_hash_info *hinfo,
569 __u32 start_hash, __u32 start_minor_hash)
571 struct buffer_head *bh;
572 struct ext3_dir_entry_2 *de, *top;
573 int err, count = 0;
575 dxtrace(printk("In htree dirblock_to_tree: block %d\n", block));
576 if (!(bh = ext3_bread (NULL, dir, block, 0, &err)))
577 return err;
579 de = (struct ext3_dir_entry_2 *) bh->b_data;
580 top = (struct ext3_dir_entry_2 *) ((char *) de +
581 dir->i_sb->s_blocksize -
582 EXT3_DIR_REC_LEN(0));
583 for (; de < top; de = ext3_next_entry(de)) {
584 if (!ext3_check_dir_entry("htree_dirblock_to_tree", dir, de, bh,
585 (block<<EXT3_BLOCK_SIZE_BITS(dir->i_sb))
586 +((char *)de - bh->b_data))) {
587 /* On error, skip the f_pos to the next block. */
588 dir_file->f_pos = (dir_file->f_pos |
589 (dir->i_sb->s_blocksize - 1)) + 1;
590 brelse (bh);
591 return count;
593 ext3fs_dirhash(de->name, de->name_len, hinfo);
594 if ((hinfo->hash < start_hash) ||
595 ((hinfo->hash == start_hash) &&
596 (hinfo->minor_hash < start_minor_hash)))
597 continue;
598 if (de->inode == 0)
599 continue;
600 if ((err = ext3_htree_store_dirent(dir_file,
601 hinfo->hash, hinfo->minor_hash, de)) != 0) {
602 brelse(bh);
603 return err;
605 count++;
607 brelse(bh);
608 return count;
613 * This function fills a red-black tree with information from a
614 * directory. We start scanning the directory in hash order, starting
615 * at start_hash and start_minor_hash.
617 * This function returns the number of entries inserted into the tree,
618 * or a negative error code.
620 int ext3_htree_fill_tree(struct file *dir_file, __u32 start_hash,
621 __u32 start_minor_hash, __u32 *next_hash)
623 struct dx_hash_info hinfo;
624 struct ext3_dir_entry_2 *de;
625 struct dx_frame frames[2], *frame;
626 struct inode *dir;
627 int block, err;
628 int count = 0;
629 int ret;
630 __u32 hashval;
632 dxtrace(printk("In htree_fill_tree, start hash: %x:%x\n", start_hash,
633 start_minor_hash));
634 dir = dir_file->f_path.dentry->d_inode;
635 if (!(EXT3_I(dir)->i_flags & EXT3_INDEX_FL)) {
636 hinfo.hash_version = EXT3_SB(dir->i_sb)->s_def_hash_version;
637 if (hinfo.hash_version <= DX_HASH_TEA)
638 hinfo.hash_version +=
639 EXT3_SB(dir->i_sb)->s_hash_unsigned;
640 hinfo.seed = EXT3_SB(dir->i_sb)->s_hash_seed;
641 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
642 start_hash, start_minor_hash);
643 *next_hash = ~0;
644 return count;
646 hinfo.hash = start_hash;
647 hinfo.minor_hash = 0;
648 frame = dx_probe(NULL, dir_file->f_path.dentry->d_inode, &hinfo, frames, &err);
649 if (!frame)
650 return err;
652 /* Add '.' and '..' from the htree header */
653 if (!start_hash && !start_minor_hash) {
654 de = (struct ext3_dir_entry_2 *) frames[0].bh->b_data;
655 if ((err = ext3_htree_store_dirent(dir_file, 0, 0, de)) != 0)
656 goto errout;
657 count++;
659 if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) {
660 de = (struct ext3_dir_entry_2 *) frames[0].bh->b_data;
661 de = ext3_next_entry(de);
662 if ((err = ext3_htree_store_dirent(dir_file, 2, 0, de)) != 0)
663 goto errout;
664 count++;
667 while (1) {
668 block = dx_get_block(frame->at);
669 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
670 start_hash, start_minor_hash);
671 if (ret < 0) {
672 err = ret;
673 goto errout;
675 count += ret;
676 hashval = ~0;
677 ret = ext3_htree_next_block(dir, HASH_NB_ALWAYS,
678 frame, frames, &hashval);
679 *next_hash = hashval;
680 if (ret < 0) {
681 err = ret;
682 goto errout;
685 * Stop if: (a) there are no more entries, or
686 * (b) we have inserted at least one entry and the
687 * next hash value is not a continuation
689 if ((ret == 0) ||
690 (count && ((hashval & 1) == 0)))
691 break;
693 dx_release(frames);
694 dxtrace(printk("Fill tree: returned %d entries, next hash: %x\n",
695 count, *next_hash));
696 return count;
697 errout:
698 dx_release(frames);
699 return (err);
704 * Directory block splitting, compacting
708 * Create map of hash values, offsets, and sizes, stored at end of block.
709 * Returns number of entries mapped.
711 static int dx_make_map(struct ext3_dir_entry_2 *de, unsigned blocksize,
712 struct dx_hash_info *hinfo, struct dx_map_entry *map_tail)
714 int count = 0;
715 char *base = (char *) de;
716 struct dx_hash_info h = *hinfo;
718 while ((char *) de < base + blocksize)
720 if (de->name_len && de->inode) {
721 ext3fs_dirhash(de->name, de->name_len, &h);
722 map_tail--;
723 map_tail->hash = h.hash;
724 map_tail->offs = (u16) ((char *) de - base);
725 map_tail->size = le16_to_cpu(de->rec_len);
726 count++;
727 cond_resched();
729 /* XXX: do we need to check rec_len == 0 case? -Chris */
730 de = ext3_next_entry(de);
732 return count;
735 /* Sort map by hash value */
736 static void dx_sort_map (struct dx_map_entry *map, unsigned count)
738 struct dx_map_entry *p, *q, *top = map + count - 1;
739 int more;
740 /* Combsort until bubble sort doesn't suck */
741 while (count > 2)
743 count = count*10/13;
744 if (count - 9 < 2) /* 9, 10 -> 11 */
745 count = 11;
746 for (p = top, q = p - count; q >= map; p--, q--)
747 if (p->hash < q->hash)
748 swap(*p, *q);
750 /* Garden variety bubble sort */
751 do {
752 more = 0;
753 q = top;
754 while (q-- > map)
756 if (q[1].hash >= q[0].hash)
757 continue;
758 swap(*(q+1), *q);
759 more = 1;
761 } while(more);
764 static void dx_insert_block(struct dx_frame *frame, u32 hash, u32 block)
766 struct dx_entry *entries = frame->entries;
767 struct dx_entry *old = frame->at, *new = old + 1;
768 int count = dx_get_count(entries);
770 assert(count < dx_get_limit(entries));
771 assert(old < entries + count);
772 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
773 dx_set_hash(new, hash);
774 dx_set_block(new, block);
775 dx_set_count(entries, count + 1);
778 static void ext3_update_dx_flag(struct inode *inode)
780 if (!EXT3_HAS_COMPAT_FEATURE(inode->i_sb,
781 EXT3_FEATURE_COMPAT_DIR_INDEX))
782 EXT3_I(inode)->i_flags &= ~EXT3_INDEX_FL;
786 * NOTE! unlike strncmp, ext3_match returns 1 for success, 0 for failure.
788 * `len <= EXT3_NAME_LEN' is guaranteed by caller.
789 * `de != NULL' is guaranteed by caller.
791 static inline int ext3_match (int len, const char * const name,
792 struct ext3_dir_entry_2 * de)
794 if (len != de->name_len)
795 return 0;
796 if (!de->inode)
797 return 0;
798 return !memcmp(name, de->name, len);
802 * Returns 0 if not found, -1 on failure, and 1 on success
804 static inline int search_dirblock(struct buffer_head * bh,
805 struct inode *dir,
806 struct qstr *child,
807 unsigned long offset,
808 struct ext3_dir_entry_2 ** res_dir)
810 struct ext3_dir_entry_2 * de;
811 char * dlimit;
812 int de_len;
813 const char *name = child->name;
814 int namelen = child->len;
816 de = (struct ext3_dir_entry_2 *) bh->b_data;
817 dlimit = bh->b_data + dir->i_sb->s_blocksize;
818 while ((char *) de < dlimit) {
819 /* this code is executed quadratically often */
820 /* do minimal checking `by hand' */
822 if ((char *) de + namelen <= dlimit &&
823 ext3_match (namelen, name, de)) {
824 /* found a match - just to be sure, do a full check */
825 if (!ext3_check_dir_entry("ext3_find_entry",
826 dir, de, bh, offset))
827 return -1;
828 *res_dir = de;
829 return 1;
831 /* prevent looping on a bad block */
832 de_len = ext3_rec_len_from_disk(de->rec_len);
833 if (de_len <= 0)
834 return -1;
835 offset += de_len;
836 de = (struct ext3_dir_entry_2 *) ((char *) de + de_len);
838 return 0;
843 * ext3_find_entry()
845 * finds an entry in the specified directory with the wanted name. It
846 * returns the cache buffer in which the entry was found, and the entry
847 * itself (as a parameter - res_dir). It does NOT read the inode of the
848 * entry - you'll have to do that yourself if you want to.
850 * The returned buffer_head has ->b_count elevated. The caller is expected
851 * to brelse() it when appropriate.
853 static struct buffer_head *ext3_find_entry(struct inode *dir,
854 struct qstr *entry,
855 struct ext3_dir_entry_2 **res_dir)
857 struct super_block * sb;
858 struct buffer_head * bh_use[NAMEI_RA_SIZE];
859 struct buffer_head * bh, *ret = NULL;
860 unsigned long start, block, b;
861 const u8 *name = entry->name;
862 int ra_max = 0; /* Number of bh's in the readahead
863 buffer, bh_use[] */
864 int ra_ptr = 0; /* Current index into readahead
865 buffer */
866 int num = 0;
867 int nblocks, i, err;
868 int namelen;
870 *res_dir = NULL;
871 sb = dir->i_sb;
872 namelen = entry->len;
873 if (namelen > EXT3_NAME_LEN)
874 return NULL;
875 if ((namelen <= 2) && (name[0] == '.') &&
876 (name[1] == '.' || name[1] == 0)) {
878 * "." or ".." will only be in the first block
879 * NFS may look up ".."; "." should be handled by the VFS
881 block = start = 0;
882 nblocks = 1;
883 goto restart;
885 if (is_dx(dir)) {
886 bh = ext3_dx_find_entry(dir, entry, res_dir, &err);
888 * On success, or if the error was file not found,
889 * return. Otherwise, fall back to doing a search the
890 * old fashioned way.
892 if (bh || (err != ERR_BAD_DX_DIR))
893 return bh;
894 dxtrace(printk("ext3_find_entry: dx failed, falling back\n"));
896 nblocks = dir->i_size >> EXT3_BLOCK_SIZE_BITS(sb);
897 start = EXT3_I(dir)->i_dir_start_lookup;
898 if (start >= nblocks)
899 start = 0;
900 block = start;
901 restart:
902 do {
904 * We deal with the read-ahead logic here.
906 if (ra_ptr >= ra_max) {
907 /* Refill the readahead buffer */
908 ra_ptr = 0;
909 b = block;
910 for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) {
912 * Terminate if we reach the end of the
913 * directory and must wrap, or if our
914 * search has finished at this block.
916 if (b >= nblocks || (num && block == start)) {
917 bh_use[ra_max] = NULL;
918 break;
920 num++;
921 bh = ext3_getblk(NULL, dir, b++, 0, &err);
922 bh_use[ra_max] = bh;
923 if (bh)
924 ll_rw_block(READ_META, 1, &bh);
927 if ((bh = bh_use[ra_ptr++]) == NULL)
928 goto next;
929 wait_on_buffer(bh);
930 if (!buffer_uptodate(bh)) {
931 /* read error, skip block & hope for the best */
932 ext3_error(sb, __func__, "reading directory #%lu "
933 "offset %lu", dir->i_ino, block);
934 brelse(bh);
935 goto next;
937 i = search_dirblock(bh, dir, entry,
938 block << EXT3_BLOCK_SIZE_BITS(sb), res_dir);
939 if (i == 1) {
940 EXT3_I(dir)->i_dir_start_lookup = block;
941 ret = bh;
942 goto cleanup_and_exit;
943 } else {
944 brelse(bh);
945 if (i < 0)
946 goto cleanup_and_exit;
948 next:
949 if (++block >= nblocks)
950 block = 0;
951 } while (block != start);
954 * If the directory has grown while we were searching, then
955 * search the last part of the directory before giving up.
957 block = nblocks;
958 nblocks = dir->i_size >> EXT3_BLOCK_SIZE_BITS(sb);
959 if (block < nblocks) {
960 start = 0;
961 goto restart;
964 cleanup_and_exit:
965 /* Clean up the read-ahead blocks */
966 for (; ra_ptr < ra_max; ra_ptr++)
967 brelse (bh_use[ra_ptr]);
968 return ret;
971 static struct buffer_head * ext3_dx_find_entry(struct inode *dir,
972 struct qstr *entry, struct ext3_dir_entry_2 **res_dir,
973 int *err)
975 struct super_block *sb = dir->i_sb;
976 struct dx_hash_info hinfo;
977 struct dx_frame frames[2], *frame;
978 struct buffer_head *bh;
979 unsigned long block;
980 int retval;
982 if (!(frame = dx_probe(entry, dir, &hinfo, frames, err)))
983 return NULL;
984 do {
985 block = dx_get_block(frame->at);
986 if (!(bh = ext3_bread (NULL,dir, block, 0, err)))
987 goto errout;
989 retval = search_dirblock(bh, dir, entry,
990 block << EXT3_BLOCK_SIZE_BITS(sb),
991 res_dir);
992 if (retval == 1) {
993 dx_release(frames);
994 return bh;
996 brelse(bh);
997 if (retval == -1) {
998 *err = ERR_BAD_DX_DIR;
999 goto errout;
1002 /* Check to see if we should continue to search */
1003 retval = ext3_htree_next_block(dir, hinfo.hash, frame,
1004 frames, NULL);
1005 if (retval < 0) {
1006 ext3_warning(sb, __func__,
1007 "error reading index page in directory #%lu",
1008 dir->i_ino);
1009 *err = retval;
1010 goto errout;
1012 } while (retval == 1);
1014 *err = -ENOENT;
1015 errout:
1016 dxtrace(printk("%s not found\n", name));
1017 dx_release (frames);
1018 return NULL;
1021 static struct dentry *ext3_lookup(struct inode * dir, struct dentry *dentry, struct nameidata *nd)
1023 struct inode * inode;
1024 struct ext3_dir_entry_2 * de;
1025 struct buffer_head * bh;
1027 if (dentry->d_name.len > EXT3_NAME_LEN)
1028 return ERR_PTR(-ENAMETOOLONG);
1030 bh = ext3_find_entry(dir, &dentry->d_name, &de);
1031 inode = NULL;
1032 if (bh) {
1033 unsigned long ino = le32_to_cpu(de->inode);
1034 brelse (bh);
1035 if (!ext3_valid_inum(dir->i_sb, ino)) {
1036 ext3_error(dir->i_sb, "ext3_lookup",
1037 "bad inode number: %lu", ino);
1038 return ERR_PTR(-EIO);
1040 inode = ext3_iget(dir->i_sb, ino);
1041 if (IS_ERR(inode)) {
1042 if (PTR_ERR(inode) == -ESTALE) {
1043 ext3_error(dir->i_sb, __func__,
1044 "deleted inode referenced: %lu",
1045 ino);
1046 return ERR_PTR(-EIO);
1047 } else {
1048 return ERR_CAST(inode);
1052 return d_splice_alias(inode, dentry);
1056 struct dentry *ext3_get_parent(struct dentry *child)
1058 unsigned long ino;
1059 struct qstr dotdot = {.name = "..", .len = 2};
1060 struct ext3_dir_entry_2 * de;
1061 struct buffer_head *bh;
1063 bh = ext3_find_entry(child->d_inode, &dotdot, &de);
1064 if (!bh)
1065 return ERR_PTR(-ENOENT);
1066 ino = le32_to_cpu(de->inode);
1067 brelse(bh);
1069 if (!ext3_valid_inum(child->d_inode->i_sb, ino)) {
1070 ext3_error(child->d_inode->i_sb, "ext3_get_parent",
1071 "bad inode number: %lu", ino);
1072 return ERR_PTR(-EIO);
1075 return d_obtain_alias(ext3_iget(child->d_inode->i_sb, ino));
1078 #define S_SHIFT 12
1079 static unsigned char ext3_type_by_mode[S_IFMT >> S_SHIFT] = {
1080 [S_IFREG >> S_SHIFT] = EXT3_FT_REG_FILE,
1081 [S_IFDIR >> S_SHIFT] = EXT3_FT_DIR,
1082 [S_IFCHR >> S_SHIFT] = EXT3_FT_CHRDEV,
1083 [S_IFBLK >> S_SHIFT] = EXT3_FT_BLKDEV,
1084 [S_IFIFO >> S_SHIFT] = EXT3_FT_FIFO,
1085 [S_IFSOCK >> S_SHIFT] = EXT3_FT_SOCK,
1086 [S_IFLNK >> S_SHIFT] = EXT3_FT_SYMLINK,
1089 static inline void ext3_set_de_type(struct super_block *sb,
1090 struct ext3_dir_entry_2 *de,
1091 umode_t mode) {
1092 if (EXT3_HAS_INCOMPAT_FEATURE(sb, EXT3_FEATURE_INCOMPAT_FILETYPE))
1093 de->file_type = ext3_type_by_mode[(mode & S_IFMT)>>S_SHIFT];
1097 * Move count entries from end of map between two memory locations.
1098 * Returns pointer to last entry moved.
1100 static struct ext3_dir_entry_2 *
1101 dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count)
1103 unsigned rec_len = 0;
1105 while (count--) {
1106 struct ext3_dir_entry_2 *de = (struct ext3_dir_entry_2 *) (from + map->offs);
1107 rec_len = EXT3_DIR_REC_LEN(de->name_len);
1108 memcpy (to, de, rec_len);
1109 ((struct ext3_dir_entry_2 *) to)->rec_len =
1110 ext3_rec_len_to_disk(rec_len);
1111 de->inode = 0;
1112 map++;
1113 to += rec_len;
1115 return (struct ext3_dir_entry_2 *) (to - rec_len);
1119 * Compact each dir entry in the range to the minimal rec_len.
1120 * Returns pointer to last entry in range.
1122 static struct ext3_dir_entry_2 *dx_pack_dirents(char *base, unsigned blocksize)
1124 struct ext3_dir_entry_2 *next, *to, *prev;
1125 struct ext3_dir_entry_2 *de = (struct ext3_dir_entry_2 *)base;
1126 unsigned rec_len = 0;
1128 prev = to = de;
1129 while ((char *)de < base + blocksize) {
1130 next = ext3_next_entry(de);
1131 if (de->inode && de->name_len) {
1132 rec_len = EXT3_DIR_REC_LEN(de->name_len);
1133 if (de > to)
1134 memmove(to, de, rec_len);
1135 to->rec_len = ext3_rec_len_to_disk(rec_len);
1136 prev = to;
1137 to = (struct ext3_dir_entry_2 *) (((char *) to) + rec_len);
1139 de = next;
1141 return prev;
1145 * Split a full leaf block to make room for a new dir entry.
1146 * Allocate a new block, and move entries so that they are approx. equally full.
1147 * Returns pointer to de in block into which the new entry will be inserted.
1149 static struct ext3_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1150 struct buffer_head **bh,struct dx_frame *frame,
1151 struct dx_hash_info *hinfo, int *error)
1153 unsigned blocksize = dir->i_sb->s_blocksize;
1154 unsigned count, continued;
1155 struct buffer_head *bh2;
1156 u32 newblock;
1157 u32 hash2;
1158 struct dx_map_entry *map;
1159 char *data1 = (*bh)->b_data, *data2;
1160 unsigned split, move, size;
1161 struct ext3_dir_entry_2 *de = NULL, *de2;
1162 int err = 0, i;
1164 bh2 = ext3_append (handle, dir, &newblock, &err);
1165 if (!(bh2)) {
1166 brelse(*bh);
1167 *bh = NULL;
1168 goto errout;
1171 BUFFER_TRACE(*bh, "get_write_access");
1172 err = ext3_journal_get_write_access(handle, *bh);
1173 if (err)
1174 goto journal_error;
1176 BUFFER_TRACE(frame->bh, "get_write_access");
1177 err = ext3_journal_get_write_access(handle, frame->bh);
1178 if (err)
1179 goto journal_error;
1181 data2 = bh2->b_data;
1183 /* create map in the end of data2 block */
1184 map = (struct dx_map_entry *) (data2 + blocksize);
1185 count = dx_make_map ((struct ext3_dir_entry_2 *) data1,
1186 blocksize, hinfo, map);
1187 map -= count;
1188 dx_sort_map (map, count);
1189 /* Split the existing block in the middle, size-wise */
1190 size = 0;
1191 move = 0;
1192 for (i = count-1; i >= 0; i--) {
1193 /* is more than half of this entry in 2nd half of the block? */
1194 if (size + map[i].size/2 > blocksize/2)
1195 break;
1196 size += map[i].size;
1197 move++;
1199 /* map index at which we will split */
1200 split = count - move;
1201 hash2 = map[split].hash;
1202 continued = hash2 == map[split - 1].hash;
1203 dxtrace(printk("Split block %i at %x, %i/%i\n",
1204 dx_get_block(frame->at), hash2, split, count-split));
1206 /* Fancy dance to stay within two buffers */
1207 de2 = dx_move_dirents(data1, data2, map + split, count - split);
1208 de = dx_pack_dirents(data1,blocksize);
1209 de->rec_len = ext3_rec_len_to_disk(data1 + blocksize - (char *) de);
1210 de2->rec_len = ext3_rec_len_to_disk(data2 + blocksize - (char *) de2);
1211 dxtrace(dx_show_leaf (hinfo, (struct ext3_dir_entry_2 *) data1, blocksize, 1));
1212 dxtrace(dx_show_leaf (hinfo, (struct ext3_dir_entry_2 *) data2, blocksize, 1));
1214 /* Which block gets the new entry? */
1215 if (hinfo->hash >= hash2)
1217 swap(*bh, bh2);
1218 de = de2;
1220 dx_insert_block (frame, hash2 + continued, newblock);
1221 err = ext3_journal_dirty_metadata (handle, bh2);
1222 if (err)
1223 goto journal_error;
1224 err = ext3_journal_dirty_metadata (handle, frame->bh);
1225 if (err)
1226 goto journal_error;
1227 brelse (bh2);
1228 dxtrace(dx_show_index ("frame", frame->entries));
1229 return de;
1231 journal_error:
1232 brelse(*bh);
1233 brelse(bh2);
1234 *bh = NULL;
1235 ext3_std_error(dir->i_sb, err);
1236 errout:
1237 *error = err;
1238 return NULL;
1243 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1244 * it points to a directory entry which is guaranteed to be large
1245 * enough for new directory entry. If de is NULL, then
1246 * add_dirent_to_buf will attempt search the directory block for
1247 * space. It will return -ENOSPC if no space is available, and -EIO
1248 * and -EEXIST if directory entry already exists.
1250 * NOTE! bh is NOT released in the case where ENOSPC is returned. In
1251 * all other cases bh is released.
1253 static int add_dirent_to_buf(handle_t *handle, struct dentry *dentry,
1254 struct inode *inode, struct ext3_dir_entry_2 *de,
1255 struct buffer_head * bh)
1257 struct inode *dir = dentry->d_parent->d_inode;
1258 const char *name = dentry->d_name.name;
1259 int namelen = dentry->d_name.len;
1260 unsigned long offset = 0;
1261 unsigned short reclen;
1262 int nlen, rlen, err;
1263 char *top;
1265 reclen = EXT3_DIR_REC_LEN(namelen);
1266 if (!de) {
1267 de = (struct ext3_dir_entry_2 *)bh->b_data;
1268 top = bh->b_data + dir->i_sb->s_blocksize - reclen;
1269 while ((char *) de <= top) {
1270 if (!ext3_check_dir_entry("ext3_add_entry", dir, de,
1271 bh, offset)) {
1272 brelse (bh);
1273 return -EIO;
1275 if (ext3_match (namelen, name, de)) {
1276 brelse (bh);
1277 return -EEXIST;
1279 nlen = EXT3_DIR_REC_LEN(de->name_len);
1280 rlen = ext3_rec_len_from_disk(de->rec_len);
1281 if ((de->inode? rlen - nlen: rlen) >= reclen)
1282 break;
1283 de = (struct ext3_dir_entry_2 *)((char *)de + rlen);
1284 offset += rlen;
1286 if ((char *) de > top)
1287 return -ENOSPC;
1289 BUFFER_TRACE(bh, "get_write_access");
1290 err = ext3_journal_get_write_access(handle, bh);
1291 if (err) {
1292 ext3_std_error(dir->i_sb, err);
1293 brelse(bh);
1294 return err;
1297 /* By now the buffer is marked for journaling */
1298 nlen = EXT3_DIR_REC_LEN(de->name_len);
1299 rlen = ext3_rec_len_from_disk(de->rec_len);
1300 if (de->inode) {
1301 struct ext3_dir_entry_2 *de1 = (struct ext3_dir_entry_2 *)((char *)de + nlen);
1302 de1->rec_len = ext3_rec_len_to_disk(rlen - nlen);
1303 de->rec_len = ext3_rec_len_to_disk(nlen);
1304 de = de1;
1306 de->file_type = EXT3_FT_UNKNOWN;
1307 if (inode) {
1308 de->inode = cpu_to_le32(inode->i_ino);
1309 ext3_set_de_type(dir->i_sb, de, inode->i_mode);
1310 } else
1311 de->inode = 0;
1312 de->name_len = namelen;
1313 memcpy (de->name, name, namelen);
1315 * XXX shouldn't update any times until successful
1316 * completion of syscall, but too many callers depend
1317 * on this.
1319 * XXX similarly, too many callers depend on
1320 * ext3_new_inode() setting the times, but error
1321 * recovery deletes the inode, so the worst that can
1322 * happen is that the times are slightly out of date
1323 * and/or different from the directory change time.
1325 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
1326 ext3_update_dx_flag(dir);
1327 dir->i_version++;
1328 ext3_mark_inode_dirty(handle, dir);
1329 BUFFER_TRACE(bh, "call ext3_journal_dirty_metadata");
1330 err = ext3_journal_dirty_metadata(handle, bh);
1331 if (err)
1332 ext3_std_error(dir->i_sb, err);
1333 brelse(bh);
1334 return 0;
1338 * This converts a one block unindexed directory to a 3 block indexed
1339 * directory, and adds the dentry to the indexed directory.
1341 static int make_indexed_dir(handle_t *handle, struct dentry *dentry,
1342 struct inode *inode, struct buffer_head *bh)
1344 struct inode *dir = dentry->d_parent->d_inode;
1345 const char *name = dentry->d_name.name;
1346 int namelen = dentry->d_name.len;
1347 struct buffer_head *bh2;
1348 struct dx_root *root;
1349 struct dx_frame frames[2], *frame;
1350 struct dx_entry *entries;
1351 struct ext3_dir_entry_2 *de, *de2;
1352 char *data1, *top;
1353 unsigned len;
1354 int retval;
1355 unsigned blocksize;
1356 struct dx_hash_info hinfo;
1357 u32 block;
1358 struct fake_dirent *fde;
1360 blocksize = dir->i_sb->s_blocksize;
1361 dxtrace(printk(KERN_DEBUG "Creating index: inode %lu\n", dir->i_ino));
1362 retval = ext3_journal_get_write_access(handle, bh);
1363 if (retval) {
1364 ext3_std_error(dir->i_sb, retval);
1365 brelse(bh);
1366 return retval;
1368 root = (struct dx_root *) bh->b_data;
1370 /* The 0th block becomes the root, move the dirents out */
1371 fde = &root->dotdot;
1372 de = (struct ext3_dir_entry_2 *)((char *)fde +
1373 ext3_rec_len_from_disk(fde->rec_len));
1374 if ((char *) de >= (((char *) root) + blocksize)) {
1375 ext3_error(dir->i_sb, __func__,
1376 "invalid rec_len for '..' in inode %lu",
1377 dir->i_ino);
1378 brelse(bh);
1379 return -EIO;
1381 len = ((char *) root) + blocksize - (char *) de;
1383 bh2 = ext3_append (handle, dir, &block, &retval);
1384 if (!(bh2)) {
1385 brelse(bh);
1386 return retval;
1388 EXT3_I(dir)->i_flags |= EXT3_INDEX_FL;
1389 data1 = bh2->b_data;
1391 memcpy (data1, de, len);
1392 de = (struct ext3_dir_entry_2 *) data1;
1393 top = data1 + len;
1394 while ((char *)(de2 = ext3_next_entry(de)) < top)
1395 de = de2;
1396 de->rec_len = ext3_rec_len_to_disk(data1 + blocksize - (char *) de);
1397 /* Initialize the root; the dot dirents already exist */
1398 de = (struct ext3_dir_entry_2 *) (&root->dotdot);
1399 de->rec_len = ext3_rec_len_to_disk(blocksize - EXT3_DIR_REC_LEN(2));
1400 memset (&root->info, 0, sizeof(root->info));
1401 root->info.info_length = sizeof(root->info);
1402 root->info.hash_version = EXT3_SB(dir->i_sb)->s_def_hash_version;
1403 entries = root->entries;
1404 dx_set_block (entries, 1);
1405 dx_set_count (entries, 1);
1406 dx_set_limit (entries, dx_root_limit(dir, sizeof(root->info)));
1408 /* Initialize as for dx_probe */
1409 hinfo.hash_version = root->info.hash_version;
1410 if (hinfo.hash_version <= DX_HASH_TEA)
1411 hinfo.hash_version += EXT3_SB(dir->i_sb)->s_hash_unsigned;
1412 hinfo.seed = EXT3_SB(dir->i_sb)->s_hash_seed;
1413 ext3fs_dirhash(name, namelen, &hinfo);
1414 frame = frames;
1415 frame->entries = entries;
1416 frame->at = entries;
1417 frame->bh = bh;
1418 bh = bh2;
1419 de = do_split(handle,dir, &bh, frame, &hinfo, &retval);
1420 dx_release (frames);
1421 if (!(de))
1422 return retval;
1424 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1428 * ext3_add_entry()
1430 * adds a file entry to the specified directory, using the same
1431 * semantics as ext3_find_entry(). It returns NULL if it failed.
1433 * NOTE!! The inode part of 'de' is left at 0 - which means you
1434 * may not sleep between calling this and putting something into
1435 * the entry, as someone else might have used it while you slept.
1437 static int ext3_add_entry (handle_t *handle, struct dentry *dentry,
1438 struct inode *inode)
1440 struct inode *dir = dentry->d_parent->d_inode;
1441 struct buffer_head * bh;
1442 struct ext3_dir_entry_2 *de;
1443 struct super_block * sb;
1444 int retval;
1445 int dx_fallback=0;
1446 unsigned blocksize;
1447 u32 block, blocks;
1449 sb = dir->i_sb;
1450 blocksize = sb->s_blocksize;
1451 if (!dentry->d_name.len)
1452 return -EINVAL;
1453 if (is_dx(dir)) {
1454 retval = ext3_dx_add_entry(handle, dentry, inode);
1455 if (!retval || (retval != ERR_BAD_DX_DIR))
1456 return retval;
1457 EXT3_I(dir)->i_flags &= ~EXT3_INDEX_FL;
1458 dx_fallback++;
1459 ext3_mark_inode_dirty(handle, dir);
1461 blocks = dir->i_size >> sb->s_blocksize_bits;
1462 for (block = 0; block < blocks; block++) {
1463 bh = ext3_bread(handle, dir, block, 0, &retval);
1464 if(!bh)
1465 return retval;
1466 retval = add_dirent_to_buf(handle, dentry, inode, NULL, bh);
1467 if (retval != -ENOSPC)
1468 return retval;
1470 if (blocks == 1 && !dx_fallback &&
1471 EXT3_HAS_COMPAT_FEATURE(sb, EXT3_FEATURE_COMPAT_DIR_INDEX))
1472 return make_indexed_dir(handle, dentry, inode, bh);
1473 brelse(bh);
1475 bh = ext3_append(handle, dir, &block, &retval);
1476 if (!bh)
1477 return retval;
1478 de = (struct ext3_dir_entry_2 *) bh->b_data;
1479 de->inode = 0;
1480 de->rec_len = ext3_rec_len_to_disk(blocksize);
1481 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1485 * Returns 0 for success, or a negative error value
1487 static int ext3_dx_add_entry(handle_t *handle, struct dentry *dentry,
1488 struct inode *inode)
1490 struct dx_frame frames[2], *frame;
1491 struct dx_entry *entries, *at;
1492 struct dx_hash_info hinfo;
1493 struct buffer_head * bh;
1494 struct inode *dir = dentry->d_parent->d_inode;
1495 struct super_block * sb = dir->i_sb;
1496 struct ext3_dir_entry_2 *de;
1497 int err;
1499 frame = dx_probe(&dentry->d_name, dir, &hinfo, frames, &err);
1500 if (!frame)
1501 return err;
1502 entries = frame->entries;
1503 at = frame->at;
1505 if (!(bh = ext3_bread(handle,dir, dx_get_block(frame->at), 0, &err)))
1506 goto cleanup;
1508 BUFFER_TRACE(bh, "get_write_access");
1509 err = ext3_journal_get_write_access(handle, bh);
1510 if (err)
1511 goto journal_error;
1513 err = add_dirent_to_buf(handle, dentry, inode, NULL, bh);
1514 if (err != -ENOSPC) {
1515 bh = NULL;
1516 goto cleanup;
1519 /* Block full, should compress but for now just split */
1520 dxtrace(printk("using %u of %u node entries\n",
1521 dx_get_count(entries), dx_get_limit(entries)));
1522 /* Need to split index? */
1523 if (dx_get_count(entries) == dx_get_limit(entries)) {
1524 u32 newblock;
1525 unsigned icount = dx_get_count(entries);
1526 int levels = frame - frames;
1527 struct dx_entry *entries2;
1528 struct dx_node *node2;
1529 struct buffer_head *bh2;
1531 if (levels && (dx_get_count(frames->entries) ==
1532 dx_get_limit(frames->entries))) {
1533 ext3_warning(sb, __func__,
1534 "Directory index full!");
1535 err = -ENOSPC;
1536 goto cleanup;
1538 bh2 = ext3_append (handle, dir, &newblock, &err);
1539 if (!(bh2))
1540 goto cleanup;
1541 node2 = (struct dx_node *)(bh2->b_data);
1542 entries2 = node2->entries;
1543 node2->fake.rec_len = ext3_rec_len_to_disk(sb->s_blocksize);
1544 node2->fake.inode = 0;
1545 BUFFER_TRACE(frame->bh, "get_write_access");
1546 err = ext3_journal_get_write_access(handle, frame->bh);
1547 if (err)
1548 goto journal_error;
1549 if (levels) {
1550 unsigned icount1 = icount/2, icount2 = icount - icount1;
1551 unsigned hash2 = dx_get_hash(entries + icount1);
1552 dxtrace(printk("Split index %i/%i\n", icount1, icount2));
1554 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
1555 err = ext3_journal_get_write_access(handle,
1556 frames[0].bh);
1557 if (err)
1558 goto journal_error;
1560 memcpy ((char *) entries2, (char *) (entries + icount1),
1561 icount2 * sizeof(struct dx_entry));
1562 dx_set_count (entries, icount1);
1563 dx_set_count (entries2, icount2);
1564 dx_set_limit (entries2, dx_node_limit(dir));
1566 /* Which index block gets the new entry? */
1567 if (at - entries >= icount1) {
1568 frame->at = at = at - entries - icount1 + entries2;
1569 frame->entries = entries = entries2;
1570 swap(frame->bh, bh2);
1572 dx_insert_block (frames + 0, hash2, newblock);
1573 dxtrace(dx_show_index ("node", frames[1].entries));
1574 dxtrace(dx_show_index ("node",
1575 ((struct dx_node *) bh2->b_data)->entries));
1576 err = ext3_journal_dirty_metadata(handle, bh2);
1577 if (err)
1578 goto journal_error;
1579 brelse (bh2);
1580 } else {
1581 dxtrace(printk("Creating second level index...\n"));
1582 memcpy((char *) entries2, (char *) entries,
1583 icount * sizeof(struct dx_entry));
1584 dx_set_limit(entries2, dx_node_limit(dir));
1586 /* Set up root */
1587 dx_set_count(entries, 1);
1588 dx_set_block(entries + 0, newblock);
1589 ((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels = 1;
1591 /* Add new access path frame */
1592 frame = frames + 1;
1593 frame->at = at = at - entries + entries2;
1594 frame->entries = entries = entries2;
1595 frame->bh = bh2;
1596 err = ext3_journal_get_write_access(handle,
1597 frame->bh);
1598 if (err)
1599 goto journal_error;
1601 err = ext3_journal_dirty_metadata(handle, frames[0].bh);
1602 if (err)
1603 goto journal_error;
1605 de = do_split(handle, dir, &bh, frame, &hinfo, &err);
1606 if (!de)
1607 goto cleanup;
1608 err = add_dirent_to_buf(handle, dentry, inode, de, bh);
1609 bh = NULL;
1610 goto cleanup;
1612 journal_error:
1613 ext3_std_error(dir->i_sb, err);
1614 cleanup:
1615 if (bh)
1616 brelse(bh);
1617 dx_release(frames);
1618 return err;
1622 * ext3_delete_entry deletes a directory entry by merging it with the
1623 * previous entry
1625 static int ext3_delete_entry (handle_t *handle,
1626 struct inode * dir,
1627 struct ext3_dir_entry_2 * de_del,
1628 struct buffer_head * bh)
1630 struct ext3_dir_entry_2 * de, * pde;
1631 int i;
1633 i = 0;
1634 pde = NULL;
1635 de = (struct ext3_dir_entry_2 *) bh->b_data;
1636 while (i < bh->b_size) {
1637 if (!ext3_check_dir_entry("ext3_delete_entry", dir, de, bh, i))
1638 return -EIO;
1639 if (de == de_del) {
1640 int err;
1642 BUFFER_TRACE(bh, "get_write_access");
1643 err = ext3_journal_get_write_access(handle, bh);
1644 if (err)
1645 goto journal_error;
1647 if (pde)
1648 pde->rec_len = ext3_rec_len_to_disk(
1649 ext3_rec_len_from_disk(pde->rec_len) +
1650 ext3_rec_len_from_disk(de->rec_len));
1651 else
1652 de->inode = 0;
1653 dir->i_version++;
1654 BUFFER_TRACE(bh, "call ext3_journal_dirty_metadata");
1655 err = ext3_journal_dirty_metadata(handle, bh);
1656 if (err) {
1657 journal_error:
1658 ext3_std_error(dir->i_sb, err);
1659 return err;
1661 return 0;
1663 i += ext3_rec_len_from_disk(de->rec_len);
1664 pde = de;
1665 de = ext3_next_entry(de);
1667 return -ENOENT;
1670 static int ext3_add_nondir(handle_t *handle,
1671 struct dentry *dentry, struct inode *inode)
1673 int err = ext3_add_entry(handle, dentry, inode);
1674 if (!err) {
1675 ext3_mark_inode_dirty(handle, inode);
1676 d_instantiate(dentry, inode);
1677 unlock_new_inode(inode);
1678 return 0;
1680 drop_nlink(inode);
1681 unlock_new_inode(inode);
1682 iput(inode);
1683 return err;
1687 * By the time this is called, we already have created
1688 * the directory cache entry for the new file, but it
1689 * is so far negative - it has no inode.
1691 * If the create succeeds, we fill in the inode information
1692 * with d_instantiate().
1694 static int ext3_create (struct inode * dir, struct dentry * dentry, int mode,
1695 struct nameidata *nd)
1697 handle_t *handle;
1698 struct inode * inode;
1699 int err, retries = 0;
1701 dquot_initialize(dir);
1703 retry:
1704 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
1705 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1706 EXT3_MAXQUOTAS_INIT_BLOCKS(dir->i_sb));
1707 if (IS_ERR(handle))
1708 return PTR_ERR(handle);
1710 if (IS_DIRSYNC(dir))
1711 handle->h_sync = 1;
1713 inode = ext3_new_inode (handle, dir, mode);
1714 err = PTR_ERR(inode);
1715 if (!IS_ERR(inode)) {
1716 inode->i_op = &ext3_file_inode_operations;
1717 inode->i_fop = &ext3_file_operations;
1718 ext3_set_aops(inode);
1719 err = ext3_add_nondir(handle, dentry, inode);
1721 ext3_journal_stop(handle);
1722 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
1723 goto retry;
1724 return err;
1727 static int ext3_mknod (struct inode * dir, struct dentry *dentry,
1728 int mode, dev_t rdev)
1730 handle_t *handle;
1731 struct inode *inode;
1732 int err, retries = 0;
1734 if (!new_valid_dev(rdev))
1735 return -EINVAL;
1737 dquot_initialize(dir);
1739 retry:
1740 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
1741 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1742 EXT3_MAXQUOTAS_INIT_BLOCKS(dir->i_sb));
1743 if (IS_ERR(handle))
1744 return PTR_ERR(handle);
1746 if (IS_DIRSYNC(dir))
1747 handle->h_sync = 1;
1749 inode = ext3_new_inode (handle, dir, mode);
1750 err = PTR_ERR(inode);
1751 if (!IS_ERR(inode)) {
1752 init_special_inode(inode, inode->i_mode, rdev);
1753 #ifdef CONFIG_EXT3_FS_XATTR
1754 inode->i_op = &ext3_special_inode_operations;
1755 #endif
1756 err = ext3_add_nondir(handle, dentry, inode);
1758 ext3_journal_stop(handle);
1759 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
1760 goto retry;
1761 return err;
1764 static int ext3_mkdir(struct inode * dir, struct dentry * dentry, int mode)
1766 handle_t *handle;
1767 struct inode * inode;
1768 struct buffer_head * dir_block = NULL;
1769 struct ext3_dir_entry_2 * de;
1770 int err, retries = 0;
1772 if (dir->i_nlink >= EXT3_LINK_MAX)
1773 return -EMLINK;
1775 dquot_initialize(dir);
1777 retry:
1778 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
1779 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
1780 EXT3_MAXQUOTAS_INIT_BLOCKS(dir->i_sb));
1781 if (IS_ERR(handle))
1782 return PTR_ERR(handle);
1784 if (IS_DIRSYNC(dir))
1785 handle->h_sync = 1;
1787 inode = ext3_new_inode (handle, dir, S_IFDIR | mode);
1788 err = PTR_ERR(inode);
1789 if (IS_ERR(inode))
1790 goto out_stop;
1792 inode->i_op = &ext3_dir_inode_operations;
1793 inode->i_fop = &ext3_dir_operations;
1794 inode->i_size = EXT3_I(inode)->i_disksize = inode->i_sb->s_blocksize;
1795 dir_block = ext3_bread (handle, inode, 0, 1, &err);
1796 if (!dir_block)
1797 goto out_clear_inode;
1799 BUFFER_TRACE(dir_block, "get_write_access");
1800 err = ext3_journal_get_write_access(handle, dir_block);
1801 if (err)
1802 goto out_clear_inode;
1804 de = (struct ext3_dir_entry_2 *) dir_block->b_data;
1805 de->inode = cpu_to_le32(inode->i_ino);
1806 de->name_len = 1;
1807 de->rec_len = ext3_rec_len_to_disk(EXT3_DIR_REC_LEN(de->name_len));
1808 strcpy (de->name, ".");
1809 ext3_set_de_type(dir->i_sb, de, S_IFDIR);
1810 de = ext3_next_entry(de);
1811 de->inode = cpu_to_le32(dir->i_ino);
1812 de->rec_len = ext3_rec_len_to_disk(inode->i_sb->s_blocksize -
1813 EXT3_DIR_REC_LEN(1));
1814 de->name_len = 2;
1815 strcpy (de->name, "..");
1816 ext3_set_de_type(dir->i_sb, de, S_IFDIR);
1817 inode->i_nlink = 2;
1818 BUFFER_TRACE(dir_block, "call ext3_journal_dirty_metadata");
1819 err = ext3_journal_dirty_metadata(handle, dir_block);
1820 if (err)
1821 goto out_clear_inode;
1823 err = ext3_mark_inode_dirty(handle, inode);
1824 if (!err)
1825 err = ext3_add_entry (handle, dentry, inode);
1827 if (err) {
1828 out_clear_inode:
1829 inode->i_nlink = 0;
1830 unlock_new_inode(inode);
1831 ext3_mark_inode_dirty(handle, inode);
1832 iput (inode);
1833 goto out_stop;
1835 inc_nlink(dir);
1836 ext3_update_dx_flag(dir);
1837 err = ext3_mark_inode_dirty(handle, dir);
1838 if (err)
1839 goto out_clear_inode;
1841 d_instantiate(dentry, inode);
1842 unlock_new_inode(inode);
1843 out_stop:
1844 brelse(dir_block);
1845 ext3_journal_stop(handle);
1846 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
1847 goto retry;
1848 return err;
1852 * routine to check that the specified directory is empty (for rmdir)
1854 static int empty_dir (struct inode * inode)
1856 unsigned long offset;
1857 struct buffer_head * bh;
1858 struct ext3_dir_entry_2 * de, * de1;
1859 struct super_block * sb;
1860 int err = 0;
1862 sb = inode->i_sb;
1863 if (inode->i_size < EXT3_DIR_REC_LEN(1) + EXT3_DIR_REC_LEN(2) ||
1864 !(bh = ext3_bread (NULL, inode, 0, 0, &err))) {
1865 if (err)
1866 ext3_error(inode->i_sb, __func__,
1867 "error %d reading directory #%lu offset 0",
1868 err, inode->i_ino);
1869 else
1870 ext3_warning(inode->i_sb, __func__,
1871 "bad directory (dir #%lu) - no data block",
1872 inode->i_ino);
1873 return 1;
1875 de = (struct ext3_dir_entry_2 *) bh->b_data;
1876 de1 = ext3_next_entry(de);
1877 if (le32_to_cpu(de->inode) != inode->i_ino ||
1878 !le32_to_cpu(de1->inode) ||
1879 strcmp (".", de->name) ||
1880 strcmp ("..", de1->name)) {
1881 ext3_warning (inode->i_sb, "empty_dir",
1882 "bad directory (dir #%lu) - no `.' or `..'",
1883 inode->i_ino);
1884 brelse (bh);
1885 return 1;
1887 offset = ext3_rec_len_from_disk(de->rec_len) +
1888 ext3_rec_len_from_disk(de1->rec_len);
1889 de = ext3_next_entry(de1);
1890 while (offset < inode->i_size ) {
1891 if (!bh ||
1892 (void *) de >= (void *) (bh->b_data+sb->s_blocksize)) {
1893 err = 0;
1894 brelse (bh);
1895 bh = ext3_bread (NULL, inode,
1896 offset >> EXT3_BLOCK_SIZE_BITS(sb), 0, &err);
1897 if (!bh) {
1898 if (err)
1899 ext3_error(sb, __func__,
1900 "error %d reading directory"
1901 " #%lu offset %lu",
1902 err, inode->i_ino, offset);
1903 offset += sb->s_blocksize;
1904 continue;
1906 de = (struct ext3_dir_entry_2 *) bh->b_data;
1908 if (!ext3_check_dir_entry("empty_dir", inode, de, bh, offset)) {
1909 de = (struct ext3_dir_entry_2 *)(bh->b_data +
1910 sb->s_blocksize);
1911 offset = (offset | (sb->s_blocksize - 1)) + 1;
1912 continue;
1914 if (le32_to_cpu(de->inode)) {
1915 brelse (bh);
1916 return 0;
1918 offset += ext3_rec_len_from_disk(de->rec_len);
1919 de = ext3_next_entry(de);
1921 brelse (bh);
1922 return 1;
1925 /* ext3_orphan_add() links an unlinked or truncated inode into a list of
1926 * such inodes, starting at the superblock, in case we crash before the
1927 * file is closed/deleted, or in case the inode truncate spans multiple
1928 * transactions and the last transaction is not recovered after a crash.
1930 * At filesystem recovery time, we walk this list deleting unlinked
1931 * inodes and truncating linked inodes in ext3_orphan_cleanup().
1933 int ext3_orphan_add(handle_t *handle, struct inode *inode)
1935 struct super_block *sb = inode->i_sb;
1936 struct ext3_iloc iloc;
1937 int err = 0, rc;
1939 mutex_lock(&EXT3_SB(sb)->s_orphan_lock);
1940 if (!list_empty(&EXT3_I(inode)->i_orphan))
1941 goto out_unlock;
1943 /* Orphan handling is only valid for files with data blocks
1944 * being truncated, or files being unlinked. */
1946 /* @@@ FIXME: Observation from aviro:
1947 * I think I can trigger J_ASSERT in ext3_orphan_add(). We block
1948 * here (on s_orphan_lock), so race with ext3_link() which might bump
1949 * ->i_nlink. For, say it, character device. Not a regular file,
1950 * not a directory, not a symlink and ->i_nlink > 0.
1952 * tytso, 4/25/2009: I'm not sure how that could happen;
1953 * shouldn't the fs core protect us from these sort of
1954 * unlink()/link() races?
1956 J_ASSERT ((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1957 S_ISLNK(inode->i_mode)) || inode->i_nlink == 0);
1959 BUFFER_TRACE(EXT3_SB(sb)->s_sbh, "get_write_access");
1960 err = ext3_journal_get_write_access(handle, EXT3_SB(sb)->s_sbh);
1961 if (err)
1962 goto out_unlock;
1964 err = ext3_reserve_inode_write(handle, inode, &iloc);
1965 if (err)
1966 goto out_unlock;
1968 /* Insert this inode at the head of the on-disk orphan list... */
1969 NEXT_ORPHAN(inode) = le32_to_cpu(EXT3_SB(sb)->s_es->s_last_orphan);
1970 EXT3_SB(sb)->s_es->s_last_orphan = cpu_to_le32(inode->i_ino);
1971 err = ext3_journal_dirty_metadata(handle, EXT3_SB(sb)->s_sbh);
1972 rc = ext3_mark_iloc_dirty(handle, inode, &iloc);
1973 if (!err)
1974 err = rc;
1976 /* Only add to the head of the in-memory list if all the
1977 * previous operations succeeded. If the orphan_add is going to
1978 * fail (possibly taking the journal offline), we can't risk
1979 * leaving the inode on the orphan list: stray orphan-list
1980 * entries can cause panics at unmount time.
1982 * This is safe: on error we're going to ignore the orphan list
1983 * anyway on the next recovery. */
1984 if (!err)
1985 list_add(&EXT3_I(inode)->i_orphan, &EXT3_SB(sb)->s_orphan);
1987 jbd_debug(4, "superblock will point to %lu\n", inode->i_ino);
1988 jbd_debug(4, "orphan inode %lu will point to %d\n",
1989 inode->i_ino, NEXT_ORPHAN(inode));
1990 out_unlock:
1991 mutex_unlock(&EXT3_SB(sb)->s_orphan_lock);
1992 ext3_std_error(inode->i_sb, err);
1993 return err;
1997 * ext3_orphan_del() removes an unlinked or truncated inode from the list
1998 * of such inodes stored on disk, because it is finally being cleaned up.
2000 int ext3_orphan_del(handle_t *handle, struct inode *inode)
2002 struct list_head *prev;
2003 struct ext3_inode_info *ei = EXT3_I(inode);
2004 struct ext3_sb_info *sbi;
2005 unsigned long ino_next;
2006 struct ext3_iloc iloc;
2007 int err = 0;
2009 mutex_lock(&EXT3_SB(inode->i_sb)->s_orphan_lock);
2010 if (list_empty(&ei->i_orphan))
2011 goto out;
2013 ino_next = NEXT_ORPHAN(inode);
2014 prev = ei->i_orphan.prev;
2015 sbi = EXT3_SB(inode->i_sb);
2017 jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino);
2019 list_del_init(&ei->i_orphan);
2021 /* If we're on an error path, we may not have a valid
2022 * transaction handle with which to update the orphan list on
2023 * disk, but we still need to remove the inode from the linked
2024 * list in memory. */
2025 if (!handle)
2026 goto out;
2028 err = ext3_reserve_inode_write(handle, inode, &iloc);
2029 if (err)
2030 goto out_err;
2032 if (prev == &sbi->s_orphan) {
2033 jbd_debug(4, "superblock will point to %lu\n", ino_next);
2034 BUFFER_TRACE(sbi->s_sbh, "get_write_access");
2035 err = ext3_journal_get_write_access(handle, sbi->s_sbh);
2036 if (err)
2037 goto out_brelse;
2038 sbi->s_es->s_last_orphan = cpu_to_le32(ino_next);
2039 err = ext3_journal_dirty_metadata(handle, sbi->s_sbh);
2040 } else {
2041 struct ext3_iloc iloc2;
2042 struct inode *i_prev =
2043 &list_entry(prev, struct ext3_inode_info, i_orphan)->vfs_inode;
2045 jbd_debug(4, "orphan inode %lu will point to %lu\n",
2046 i_prev->i_ino, ino_next);
2047 err = ext3_reserve_inode_write(handle, i_prev, &iloc2);
2048 if (err)
2049 goto out_brelse;
2050 NEXT_ORPHAN(i_prev) = ino_next;
2051 err = ext3_mark_iloc_dirty(handle, i_prev, &iloc2);
2053 if (err)
2054 goto out_brelse;
2055 NEXT_ORPHAN(inode) = 0;
2056 err = ext3_mark_iloc_dirty(handle, inode, &iloc);
2058 out_err:
2059 ext3_std_error(inode->i_sb, err);
2060 out:
2061 mutex_unlock(&EXT3_SB(inode->i_sb)->s_orphan_lock);
2062 return err;
2064 out_brelse:
2065 brelse(iloc.bh);
2066 goto out_err;
2069 static int ext3_rmdir (struct inode * dir, struct dentry *dentry)
2071 int retval;
2072 struct inode * inode;
2073 struct buffer_head * bh;
2074 struct ext3_dir_entry_2 * de;
2075 handle_t *handle;
2077 /* Initialize quotas before so that eventual writes go in
2078 * separate transaction */
2079 dquot_initialize(dir);
2080 dquot_initialize(dentry->d_inode);
2082 handle = ext3_journal_start(dir, EXT3_DELETE_TRANS_BLOCKS(dir->i_sb));
2083 if (IS_ERR(handle))
2084 return PTR_ERR(handle);
2086 retval = -ENOENT;
2087 bh = ext3_find_entry(dir, &dentry->d_name, &de);
2088 if (!bh)
2089 goto end_rmdir;
2091 if (IS_DIRSYNC(dir))
2092 handle->h_sync = 1;
2094 inode = dentry->d_inode;
2096 retval = -EIO;
2097 if (le32_to_cpu(de->inode) != inode->i_ino)
2098 goto end_rmdir;
2100 retval = -ENOTEMPTY;
2101 if (!empty_dir (inode))
2102 goto end_rmdir;
2104 retval = ext3_delete_entry(handle, dir, de, bh);
2105 if (retval)
2106 goto end_rmdir;
2107 if (inode->i_nlink != 2)
2108 ext3_warning (inode->i_sb, "ext3_rmdir",
2109 "empty directory has nlink!=2 (%d)",
2110 inode->i_nlink);
2111 inode->i_version++;
2112 clear_nlink(inode);
2113 /* There's no need to set i_disksize: the fact that i_nlink is
2114 * zero will ensure that the right thing happens during any
2115 * recovery. */
2116 inode->i_size = 0;
2117 ext3_orphan_add(handle, inode);
2118 inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
2119 ext3_mark_inode_dirty(handle, inode);
2120 drop_nlink(dir);
2121 ext3_update_dx_flag(dir);
2122 ext3_mark_inode_dirty(handle, dir);
2124 end_rmdir:
2125 ext3_journal_stop(handle);
2126 brelse (bh);
2127 return retval;
2130 static int ext3_unlink(struct inode * dir, struct dentry *dentry)
2132 int retval;
2133 struct inode * inode;
2134 struct buffer_head * bh;
2135 struct ext3_dir_entry_2 * de;
2136 handle_t *handle;
2138 /* Initialize quotas before so that eventual writes go
2139 * in separate transaction */
2140 dquot_initialize(dir);
2141 dquot_initialize(dentry->d_inode);
2143 handle = ext3_journal_start(dir, EXT3_DELETE_TRANS_BLOCKS(dir->i_sb));
2144 if (IS_ERR(handle))
2145 return PTR_ERR(handle);
2147 if (IS_DIRSYNC(dir))
2148 handle->h_sync = 1;
2150 retval = -ENOENT;
2151 bh = ext3_find_entry(dir, &dentry->d_name, &de);
2152 if (!bh)
2153 goto end_unlink;
2155 inode = dentry->d_inode;
2157 retval = -EIO;
2158 if (le32_to_cpu(de->inode) != inode->i_ino)
2159 goto end_unlink;
2161 if (!inode->i_nlink) {
2162 ext3_warning (inode->i_sb, "ext3_unlink",
2163 "Deleting nonexistent file (%lu), %d",
2164 inode->i_ino, inode->i_nlink);
2165 inode->i_nlink = 1;
2167 retval = ext3_delete_entry(handle, dir, de, bh);
2168 if (retval)
2169 goto end_unlink;
2170 dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
2171 ext3_update_dx_flag(dir);
2172 ext3_mark_inode_dirty(handle, dir);
2173 drop_nlink(inode);
2174 if (!inode->i_nlink)
2175 ext3_orphan_add(handle, inode);
2176 inode->i_ctime = dir->i_ctime;
2177 ext3_mark_inode_dirty(handle, inode);
2178 retval = 0;
2180 end_unlink:
2181 ext3_journal_stop(handle);
2182 brelse (bh);
2183 return retval;
2186 static int ext3_symlink (struct inode * dir,
2187 struct dentry *dentry, const char * symname)
2189 handle_t *handle;
2190 struct inode * inode;
2191 int l, err, retries = 0;
2193 l = strlen(symname)+1;
2194 if (l > dir->i_sb->s_blocksize)
2195 return -ENAMETOOLONG;
2197 dquot_initialize(dir);
2199 retry:
2200 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
2201 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 5 +
2202 EXT3_MAXQUOTAS_INIT_BLOCKS(dir->i_sb));
2203 if (IS_ERR(handle))
2204 return PTR_ERR(handle);
2206 if (IS_DIRSYNC(dir))
2207 handle->h_sync = 1;
2209 inode = ext3_new_inode (handle, dir, S_IFLNK|S_IRWXUGO);
2210 err = PTR_ERR(inode);
2211 if (IS_ERR(inode))
2212 goto out_stop;
2214 if (l > sizeof (EXT3_I(inode)->i_data)) {
2215 inode->i_op = &ext3_symlink_inode_operations;
2216 ext3_set_aops(inode);
2218 * page_symlink() calls into ext3_prepare/commit_write.
2219 * We have a transaction open. All is sweetness. It also sets
2220 * i_size in generic_commit_write().
2222 err = __page_symlink(inode, symname, l, 1);
2223 if (err) {
2224 drop_nlink(inode);
2225 unlock_new_inode(inode);
2226 ext3_mark_inode_dirty(handle, inode);
2227 iput (inode);
2228 goto out_stop;
2230 } else {
2231 inode->i_op = &ext3_fast_symlink_inode_operations;
2232 memcpy((char*)&EXT3_I(inode)->i_data,symname,l);
2233 inode->i_size = l-1;
2235 EXT3_I(inode)->i_disksize = inode->i_size;
2236 err = ext3_add_nondir(handle, dentry, inode);
2237 out_stop:
2238 ext3_journal_stop(handle);
2239 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
2240 goto retry;
2241 return err;
2244 static int ext3_link (struct dentry * old_dentry,
2245 struct inode * dir, struct dentry *dentry)
2247 handle_t *handle;
2248 struct inode *inode = old_dentry->d_inode;
2249 int err, retries = 0;
2251 if (inode->i_nlink >= EXT3_LINK_MAX)
2252 return -EMLINK;
2254 dquot_initialize(dir);
2257 * Return -ENOENT if we've raced with unlink and i_nlink is 0. Doing
2258 * otherwise has the potential to corrupt the orphan inode list.
2260 if (inode->i_nlink == 0)
2261 return -ENOENT;
2263 retry:
2264 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
2265 EXT3_INDEX_EXTRA_TRANS_BLOCKS);
2266 if (IS_ERR(handle))
2267 return PTR_ERR(handle);
2269 if (IS_DIRSYNC(dir))
2270 handle->h_sync = 1;
2272 inode->i_ctime = CURRENT_TIME_SEC;
2273 inc_nlink(inode);
2274 ihold(inode);
2276 err = ext3_add_entry(handle, dentry, inode);
2277 if (!err) {
2278 ext3_mark_inode_dirty(handle, inode);
2279 d_instantiate(dentry, inode);
2280 } else {
2281 drop_nlink(inode);
2282 iput(inode);
2284 ext3_journal_stop(handle);
2285 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
2286 goto retry;
2287 return err;
2290 #define PARENT_INO(buffer) \
2291 (ext3_next_entry((struct ext3_dir_entry_2 *)(buffer))->inode)
2294 * Anybody can rename anything with this: the permission checks are left to the
2295 * higher-level routines.
2297 static int ext3_rename (struct inode * old_dir, struct dentry *old_dentry,
2298 struct inode * new_dir,struct dentry *new_dentry)
2300 handle_t *handle;
2301 struct inode * old_inode, * new_inode;
2302 struct buffer_head * old_bh, * new_bh, * dir_bh;
2303 struct ext3_dir_entry_2 * old_de, * new_de;
2304 int retval, flush_file = 0;
2306 dquot_initialize(old_dir);
2307 dquot_initialize(new_dir);
2309 old_bh = new_bh = dir_bh = NULL;
2311 /* Initialize quotas before so that eventual writes go
2312 * in separate transaction */
2313 if (new_dentry->d_inode)
2314 dquot_initialize(new_dentry->d_inode);
2315 handle = ext3_journal_start(old_dir, 2 *
2316 EXT3_DATA_TRANS_BLOCKS(old_dir->i_sb) +
2317 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 2);
2318 if (IS_ERR(handle))
2319 return PTR_ERR(handle);
2321 if (IS_DIRSYNC(old_dir) || IS_DIRSYNC(new_dir))
2322 handle->h_sync = 1;
2324 old_bh = ext3_find_entry(old_dir, &old_dentry->d_name, &old_de);
2326 * Check for inode number is _not_ due to possible IO errors.
2327 * We might rmdir the source, keep it as pwd of some process
2328 * and merrily kill the link to whatever was created under the
2329 * same name. Goodbye sticky bit ;-<
2331 old_inode = old_dentry->d_inode;
2332 retval = -ENOENT;
2333 if (!old_bh || le32_to_cpu(old_de->inode) != old_inode->i_ino)
2334 goto end_rename;
2336 new_inode = new_dentry->d_inode;
2337 new_bh = ext3_find_entry(new_dir, &new_dentry->d_name, &new_de);
2338 if (new_bh) {
2339 if (!new_inode) {
2340 brelse (new_bh);
2341 new_bh = NULL;
2344 if (S_ISDIR(old_inode->i_mode)) {
2345 if (new_inode) {
2346 retval = -ENOTEMPTY;
2347 if (!empty_dir (new_inode))
2348 goto end_rename;
2350 retval = -EIO;
2351 dir_bh = ext3_bread (handle, old_inode, 0, 0, &retval);
2352 if (!dir_bh)
2353 goto end_rename;
2354 if (le32_to_cpu(PARENT_INO(dir_bh->b_data)) != old_dir->i_ino)
2355 goto end_rename;
2356 retval = -EMLINK;
2357 if (!new_inode && new_dir!=old_dir &&
2358 new_dir->i_nlink >= EXT3_LINK_MAX)
2359 goto end_rename;
2361 if (!new_bh) {
2362 retval = ext3_add_entry (handle, new_dentry, old_inode);
2363 if (retval)
2364 goto end_rename;
2365 } else {
2366 BUFFER_TRACE(new_bh, "get write access");
2367 retval = ext3_journal_get_write_access(handle, new_bh);
2368 if (retval)
2369 goto journal_error;
2370 new_de->inode = cpu_to_le32(old_inode->i_ino);
2371 if (EXT3_HAS_INCOMPAT_FEATURE(new_dir->i_sb,
2372 EXT3_FEATURE_INCOMPAT_FILETYPE))
2373 new_de->file_type = old_de->file_type;
2374 new_dir->i_version++;
2375 new_dir->i_ctime = new_dir->i_mtime = CURRENT_TIME_SEC;
2376 ext3_mark_inode_dirty(handle, new_dir);
2377 BUFFER_TRACE(new_bh, "call ext3_journal_dirty_metadata");
2378 retval = ext3_journal_dirty_metadata(handle, new_bh);
2379 if (retval)
2380 goto journal_error;
2381 brelse(new_bh);
2382 new_bh = NULL;
2386 * Like most other Unix systems, set the ctime for inodes on a
2387 * rename.
2389 old_inode->i_ctime = CURRENT_TIME_SEC;
2390 ext3_mark_inode_dirty(handle, old_inode);
2393 * ok, that's it
2395 if (le32_to_cpu(old_de->inode) != old_inode->i_ino ||
2396 old_de->name_len != old_dentry->d_name.len ||
2397 strncmp(old_de->name, old_dentry->d_name.name, old_de->name_len) ||
2398 (retval = ext3_delete_entry(handle, old_dir,
2399 old_de, old_bh)) == -ENOENT) {
2400 /* old_de could have moved from under us during htree split, so
2401 * make sure that we are deleting the right entry. We might
2402 * also be pointing to a stale entry in the unused part of
2403 * old_bh so just checking inum and the name isn't enough. */
2404 struct buffer_head *old_bh2;
2405 struct ext3_dir_entry_2 *old_de2;
2407 old_bh2 = ext3_find_entry(old_dir, &old_dentry->d_name,
2408 &old_de2);
2409 if (old_bh2) {
2410 retval = ext3_delete_entry(handle, old_dir,
2411 old_de2, old_bh2);
2412 brelse(old_bh2);
2415 if (retval) {
2416 ext3_warning(old_dir->i_sb, "ext3_rename",
2417 "Deleting old file (%lu), %d, error=%d",
2418 old_dir->i_ino, old_dir->i_nlink, retval);
2421 if (new_inode) {
2422 drop_nlink(new_inode);
2423 new_inode->i_ctime = CURRENT_TIME_SEC;
2425 old_dir->i_ctime = old_dir->i_mtime = CURRENT_TIME_SEC;
2426 ext3_update_dx_flag(old_dir);
2427 if (dir_bh) {
2428 BUFFER_TRACE(dir_bh, "get_write_access");
2429 retval = ext3_journal_get_write_access(handle, dir_bh);
2430 if (retval)
2431 goto journal_error;
2432 PARENT_INO(dir_bh->b_data) = cpu_to_le32(new_dir->i_ino);
2433 BUFFER_TRACE(dir_bh, "call ext3_journal_dirty_metadata");
2434 retval = ext3_journal_dirty_metadata(handle, dir_bh);
2435 if (retval) {
2436 journal_error:
2437 ext3_std_error(new_dir->i_sb, retval);
2438 goto end_rename;
2440 drop_nlink(old_dir);
2441 if (new_inode) {
2442 drop_nlink(new_inode);
2443 } else {
2444 inc_nlink(new_dir);
2445 ext3_update_dx_flag(new_dir);
2446 ext3_mark_inode_dirty(handle, new_dir);
2449 ext3_mark_inode_dirty(handle, old_dir);
2450 if (new_inode) {
2451 ext3_mark_inode_dirty(handle, new_inode);
2452 if (!new_inode->i_nlink)
2453 ext3_orphan_add(handle, new_inode);
2454 if (ext3_should_writeback_data(new_inode))
2455 flush_file = 1;
2457 retval = 0;
2459 end_rename:
2460 brelse (dir_bh);
2461 brelse (old_bh);
2462 brelse (new_bh);
2463 ext3_journal_stop(handle);
2464 if (retval == 0 && flush_file)
2465 filemap_flush(old_inode->i_mapping);
2466 return retval;
2470 * directories can handle most operations...
2472 const struct inode_operations ext3_dir_inode_operations = {
2473 .create = ext3_create,
2474 .lookup = ext3_lookup,
2475 .link = ext3_link,
2476 .unlink = ext3_unlink,
2477 .symlink = ext3_symlink,
2478 .mkdir = ext3_mkdir,
2479 .rmdir = ext3_rmdir,
2480 .mknod = ext3_mknod,
2481 .rename = ext3_rename,
2482 .setattr = ext3_setattr,
2483 #ifdef CONFIG_EXT3_FS_XATTR
2484 .setxattr = generic_setxattr,
2485 .getxattr = generic_getxattr,
2486 .listxattr = ext3_listxattr,
2487 .removexattr = generic_removexattr,
2488 #endif
2489 .check_acl = ext3_check_acl,
2492 const struct inode_operations ext3_special_inode_operations = {
2493 .setattr = ext3_setattr,
2494 #ifdef CONFIG_EXT3_FS_XATTR
2495 .setxattr = generic_setxattr,
2496 .getxattr = generic_getxattr,
2497 .listxattr = ext3_listxattr,
2498 .removexattr = generic_removexattr,
2499 #endif
2500 .check_acl = ext3_check_acl,