blob: 9bb046df827a7a7a4d694dad36d727a71237a652 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/fs/ext3/namei.c
3 *
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)
8 *
9 * from
10 *
11 * linux/fs/minix/namei.c
12 *
13 * Copyright (C) 1991, 1992 Linus Torvalds
14 *
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
Dave Kleikampe9ad5622006-09-27 01:49:35 -070018 * for B-tree directories by Theodore Ts'o (tytso@mit.edu), 1998
Linus Torvalds1da177e2005-04-16 15:20:36 -070019 * Hash Tree Directory indexing (c)
Dave Kleikampe9ad5622006-09-27 01:49:35 -070020 * Daniel Phillips, 2001
Linus Torvalds1da177e2005-04-16 15:20:36 -070021 * Hash Tree Directory indexing porting
Dave Kleikampe9ad5622006-09-27 01:49:35 -070022 * Christopher Li, 2002
Linus Torvalds1da177e2005-04-16 15:20:36 -070023 * Hash Tree Directory indexing cleanup
Dave Kleikampe9ad5622006-09-27 01:49:35 -070024 * Theodore Ts'o, 2002
Linus Torvalds1da177e2005-04-16 15:20:36 -070025 */
26
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>
Jens Axboecaa38fb2006-07-23 01:41:26 +020038#include <linux/bio.h>
Ben Dooks381be2542005-10-30 15:02:56 -080039
40#include "namei.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070041#include "xattr.h"
42#include "acl.h"
43
44/*
45 * define how far ahead to read directories while searching them.
46 */
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))
51
52static struct buffer_head *ext3_append(handle_t *handle,
53 struct inode *inode,
54 u32 *block, int *err)
55{
56 struct buffer_head *bh;
57
58 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
59
60 if ((bh = ext3_bread(handle, inode, *block, 1, err))) {
61 inode->i_size += inode->i_sb->s_blocksize;
62 EXT3_I(inode)->i_disksize = inode->i_size;
63 ext3_journal_get_write_access(handle,bh);
64 }
65 return bh;
66}
67
68#ifndef assert
69#define assert(test) J_ASSERT(test)
70#endif
71
72#ifndef swap
73#define swap(x, y) do { typeof(x) z = x; x = y; y = z; } while (0)
74#endif
75
76#ifdef DX_DEBUG
77#define dxtrace(command) command
78#else
Mingming Caoae6ddcc2006-09-27 01:49:27 -070079#define dxtrace(command)
Linus Torvalds1da177e2005-04-16 15:20:36 -070080#endif
81
82struct fake_dirent
83{
84 __le32 inode;
85 __le16 rec_len;
86 u8 name_len;
87 u8 file_type;
88};
89
90struct dx_countlimit
91{
92 __le16 limit;
93 __le16 count;
94};
95
96struct dx_entry
97{
98 __le32 hash;
99 __le32 block;
100};
101
102/*
103 * dx_root_info is laid out so that if it should somehow get overlaid by a
104 * dirent the two low bits of the hash version will be zero. Therefore, the
105 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
106 */
107
108struct dx_root
109{
110 struct fake_dirent dot;
111 char dot_name[4];
112 struct fake_dirent dotdot;
113 char dotdot_name[4];
114 struct dx_root_info
115 {
116 __le32 reserved_zero;
117 u8 hash_version;
118 u8 info_length; /* 8 */
119 u8 indirect_levels;
120 u8 unused_flags;
121 }
122 info;
123 struct dx_entry entries[0];
124};
125
126struct dx_node
127{
128 struct fake_dirent fake;
129 struct dx_entry entries[0];
130};
131
132
133struct dx_frame
134{
135 struct buffer_head *bh;
136 struct dx_entry *entries;
137 struct dx_entry *at;
138};
139
140struct dx_map_entry
141{
142 u32 hash;
143 u32 offs;
144};
145
146#ifdef CONFIG_EXT3_INDEX
147static inline unsigned dx_get_block (struct dx_entry *entry);
148static void dx_set_block (struct dx_entry *entry, unsigned value);
149static inline unsigned dx_get_hash (struct dx_entry *entry);
150static void dx_set_hash (struct dx_entry *entry, unsigned value);
151static unsigned dx_get_count (struct dx_entry *entries);
152static unsigned dx_get_limit (struct dx_entry *entries);
153static void dx_set_count (struct dx_entry *entries, unsigned value);
154static void dx_set_limit (struct dx_entry *entries, unsigned value);
155static unsigned dx_root_limit (struct inode *dir, unsigned infosize);
156static unsigned dx_node_limit (struct inode *dir);
157static struct dx_frame *dx_probe(struct dentry *dentry,
158 struct inode *dir,
159 struct dx_hash_info *hinfo,
160 struct dx_frame *frame,
161 int *err);
162static void dx_release (struct dx_frame *frames);
163static int dx_make_map (struct ext3_dir_entry_2 *de, int size,
164 struct dx_hash_info *hinfo, struct dx_map_entry map[]);
165static void dx_sort_map(struct dx_map_entry *map, unsigned count);
166static struct ext3_dir_entry_2 *dx_move_dirents (char *from, char *to,
167 struct dx_map_entry *offsets, int count);
168static struct ext3_dir_entry_2* dx_pack_dirents (char *base, int size);
169static void dx_insert_block (struct dx_frame *frame, u32 hash, u32 block);
170static int ext3_htree_next_block(struct inode *dir, __u32 hash,
171 struct dx_frame *frame,
Mingming Caoae6ddcc2006-09-27 01:49:27 -0700172 struct dx_frame *frames,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 __u32 *start_hash);
174static struct buffer_head * ext3_dx_find_entry(struct dentry *dentry,
175 struct ext3_dir_entry_2 **res_dir, int *err);
176static int ext3_dx_add_entry(handle_t *handle, struct dentry *dentry,
177 struct inode *inode);
178
179/*
180 * Future: use high four bits of block for coalesce-on-delete flags
181 * Mask them off for now.
182 */
183
184static inline unsigned dx_get_block (struct dx_entry *entry)
185{
186 return le32_to_cpu(entry->block) & 0x00ffffff;
187}
188
189static inline void dx_set_block (struct dx_entry *entry, unsigned value)
190{
191 entry->block = cpu_to_le32(value);
192}
193
194static inline unsigned dx_get_hash (struct dx_entry *entry)
195{
196 return le32_to_cpu(entry->hash);
197}
198
199static inline void dx_set_hash (struct dx_entry *entry, unsigned value)
200{
201 entry->hash = cpu_to_le32(value);
202}
203
204static inline unsigned dx_get_count (struct dx_entry *entries)
205{
206 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
207}
208
209static inline unsigned dx_get_limit (struct dx_entry *entries)
210{
211 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
212}
213
214static inline void dx_set_count (struct dx_entry *entries, unsigned value)
215{
216 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
217}
218
219static inline void dx_set_limit (struct dx_entry *entries, unsigned value)
220{
221 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
222}
223
224static inline unsigned dx_root_limit (struct inode *dir, unsigned infosize)
225{
226 unsigned entry_space = dir->i_sb->s_blocksize - EXT3_DIR_REC_LEN(1) -
227 EXT3_DIR_REC_LEN(2) - infosize;
228 return 0? 20: entry_space / sizeof(struct dx_entry);
229}
230
231static inline unsigned dx_node_limit (struct inode *dir)
232{
233 unsigned entry_space = dir->i_sb->s_blocksize - EXT3_DIR_REC_LEN(0);
234 return 0? 22: entry_space / sizeof(struct dx_entry);
235}
236
237/*
238 * Debug
239 */
240#ifdef DX_DEBUG
241static void dx_show_index (char * label, struct dx_entry *entries)
242{
243 int i, n = dx_get_count (entries);
244 printk("%s index ", label);
245 for (i = 0; i < n; i++)
246 {
247 printk("%x->%u ", i? dx_get_hash(entries + i): 0, dx_get_block(entries + i));
248 }
249 printk("\n");
250}
251
252struct stats
Mingming Caoae6ddcc2006-09-27 01:49:27 -0700253{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254 unsigned names;
255 unsigned space;
256 unsigned bcount;
257};
258
259static struct stats dx_show_leaf(struct dx_hash_info *hinfo, struct ext3_dir_entry_2 *de,
260 int size, int show_names)
261{
262 unsigned names = 0, space = 0;
263 char *base = (char *) de;
264 struct dx_hash_info h = *hinfo;
265
266 printk("names: ");
267 while ((char *) de < base + size)
268 {
269 if (de->inode)
270 {
271 if (show_names)
272 {
273 int len = de->name_len;
274 char *name = de->name;
275 while (len--) printk("%c", *name++);
276 ext3fs_dirhash(de->name, de->name_len, &h);
277 printk(":%x.%u ", h.hash,
278 ((char *) de - base));
279 }
280 space += EXT3_DIR_REC_LEN(de->name_len);
Dave Kleikampe9ad5622006-09-27 01:49:35 -0700281 names++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 }
283 de = (struct ext3_dir_entry_2 *) ((char *) de + le16_to_cpu(de->rec_len));
284 }
285 printk("(%i)\n", names);
286 return (struct stats) { names, space, 1 };
287}
288
289struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
290 struct dx_entry *entries, int levels)
291{
292 unsigned blocksize = dir->i_sb->s_blocksize;
293 unsigned count = dx_get_count (entries), names = 0, space = 0, i;
294 unsigned bcount = 0;
295 struct buffer_head *bh;
296 int err;
297 printk("%i indexed blocks...\n", count);
298 for (i = 0; i < count; i++, entries++)
299 {
300 u32 block = dx_get_block(entries), hash = i? dx_get_hash(entries): 0;
301 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
302 struct stats stats;
303 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
304 if (!(bh = ext3_bread (NULL,dir, block, 0,&err))) continue;
305 stats = levels?
306 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
307 dx_show_leaf(hinfo, (struct ext3_dir_entry_2 *) bh->b_data, blocksize, 0);
308 names += stats.names;
309 space += stats.space;
310 bcount += stats.bcount;
311 brelse (bh);
312 }
313 if (bcount)
314 printk("%snames %u, fullness %u (%u%%)\n", levels?"":" ",
315 names, space/bcount,(space/bcount)*100/blocksize);
316 return (struct stats) { names, space, bcount};
317}
318#endif /* DX_DEBUG */
319
320/*
321 * Probe for a directory leaf block to search.
322 *
323 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
324 * error in the directory index, and the caller should fall back to
325 * searching the directory normally. The callers of dx_probe **MUST**
326 * check for this error code, and make sure it never gets reflected
327 * back to userspace.
328 */
329static struct dx_frame *
330dx_probe(struct dentry *dentry, struct inode *dir,
331 struct dx_hash_info *hinfo, struct dx_frame *frame_in, int *err)
332{
333 unsigned count, indirect;
334 struct dx_entry *at, *entries, *p, *q, *m;
335 struct dx_root *root;
336 struct buffer_head *bh;
337 struct dx_frame *frame = frame_in;
338 u32 hash;
339
340 frame->bh = NULL;
341 if (dentry)
342 dir = dentry->d_parent->d_inode;
343 if (!(bh = ext3_bread (NULL,dir, 0, 0, err)))
344 goto fail;
345 root = (struct dx_root *) bh->b_data;
346 if (root->info.hash_version != DX_HASH_TEA &&
347 root->info.hash_version != DX_HASH_HALF_MD4 &&
348 root->info.hash_version != DX_HASH_LEGACY) {
349 ext3_warning(dir->i_sb, __FUNCTION__,
350 "Unrecognised inode hash code %d",
351 root->info.hash_version);
352 brelse(bh);
353 *err = ERR_BAD_DX_DIR;
354 goto fail;
355 }
356 hinfo->hash_version = root->info.hash_version;
357 hinfo->seed = EXT3_SB(dir->i_sb)->s_hash_seed;
358 if (dentry)
359 ext3fs_dirhash(dentry->d_name.name, dentry->d_name.len, hinfo);
360 hash = hinfo->hash;
361
362 if (root->info.unused_flags & 1) {
363 ext3_warning(dir->i_sb, __FUNCTION__,
364 "Unimplemented inode hash flags: %#06x",
365 root->info.unused_flags);
366 brelse(bh);
367 *err = ERR_BAD_DX_DIR;
368 goto fail;
369 }
370
371 if ((indirect = root->info.indirect_levels) > 1) {
372 ext3_warning(dir->i_sb, __FUNCTION__,
373 "Unimplemented inode hash depth: %#06x",
374 root->info.indirect_levels);
375 brelse(bh);
376 *err = ERR_BAD_DX_DIR;
377 goto fail;
378 }
379
380 entries = (struct dx_entry *) (((char *)&root->info) +
381 root->info.info_length);
382 assert(dx_get_limit(entries) == dx_root_limit(dir,
383 root->info.info_length));
384 dxtrace (printk("Look up %x", hash));
385 while (1)
386 {
387 count = dx_get_count(entries);
388 assert (count && count <= dx_get_limit(entries));
389 p = entries + 1;
390 q = entries + count - 1;
391 while (p <= q)
392 {
393 m = p + (q - p)/2;
394 dxtrace(printk("."));
395 if (dx_get_hash(m) > hash)
396 q = m - 1;
397 else
398 p = m + 1;
399 }
400
401 if (0) // linear search cross check
402 {
403 unsigned n = count - 1;
404 at = entries;
405 while (n--)
406 {
407 dxtrace(printk(","));
408 if (dx_get_hash(++at) > hash)
409 {
410 at--;
411 break;
412 }
413 }
414 assert (at == p - 1);
415 }
416
417 at = p - 1;
418 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
419 frame->bh = bh;
420 frame->entries = entries;
421 frame->at = at;
422 if (!indirect--) return frame;
423 if (!(bh = ext3_bread (NULL,dir, dx_get_block(at), 0, err)))
424 goto fail2;
425 at = entries = ((struct dx_node *) bh->b_data)->entries;
426 assert (dx_get_limit(entries) == dx_node_limit (dir));
427 frame++;
428 }
429fail2:
430 while (frame >= frame_in) {
431 brelse(frame->bh);
432 frame--;
433 }
434fail:
435 return NULL;
436}
437
438static void dx_release (struct dx_frame *frames)
439{
440 if (frames[0].bh == NULL)
441 return;
442
443 if (((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels)
444 brelse(frames[1].bh);
445 brelse(frames[0].bh);
446}
447
448/*
449 * This function increments the frame pointer to search the next leaf
450 * block, and reads in the necessary intervening nodes if the search
451 * should be necessary. Whether or not the search is necessary is
452 * controlled by the hash parameter. If the hash value is even, then
453 * the search is only continued if the next block starts with that
454 * hash value. This is used if we are searching for a specific file.
455 *
456 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
457 *
458 * This function returns 1 if the caller should continue to search,
459 * or 0 if it should not. If there is an error reading one of the
460 * index blocks, it will a negative error code.
461 *
462 * If start_hash is non-null, it will be filled in with the starting
463 * hash of the next page.
464 */
465static int ext3_htree_next_block(struct inode *dir, __u32 hash,
466 struct dx_frame *frame,
Mingming Caoae6ddcc2006-09-27 01:49:27 -0700467 struct dx_frame *frames,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468 __u32 *start_hash)
469{
470 struct dx_frame *p;
471 struct buffer_head *bh;
472 int err, num_frames = 0;
473 __u32 bhash;
474
475 p = frame;
476 /*
477 * Find the next leaf page by incrementing the frame pointer.
478 * If we run out of entries in the interior node, loop around and
479 * increment pointer in the parent node. When we break out of
480 * this loop, num_frames indicates the number of interior
481 * nodes need to be read.
482 */
483 while (1) {
484 if (++(p->at) < p->entries + dx_get_count(p->entries))
485 break;
486 if (p == frames)
487 return 0;
488 num_frames++;
489 p--;
490 }
491
492 /*
493 * If the hash is 1, then continue only if the next page has a
494 * continuation hash of any value. This is used for readdir
495 * handling. Otherwise, check to see if the hash matches the
496 * desired contiuation hash. If it doesn't, return since
497 * there's no point to read in the successive index pages.
498 */
499 bhash = dx_get_hash(p->at);
500 if (start_hash)
501 *start_hash = bhash;
502 if ((hash & 1) == 0) {
503 if ((bhash & ~1) != hash)
504 return 0;
505 }
506 /*
507 * If the hash is HASH_NB_ALWAYS, we always go to the next
508 * block so no check is necessary
509 */
510 while (num_frames--) {
511 if (!(bh = ext3_bread(NULL, dir, dx_get_block(p->at),
512 0, &err)))
513 return err; /* Failure */
514 p++;
515 brelse (p->bh);
516 p->bh = bh;
517 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
518 }
519 return 1;
520}
521
522
523/*
524 * p is at least 6 bytes before the end of page
525 */
526static inline struct ext3_dir_entry_2 *ext3_next_entry(struct ext3_dir_entry_2 *p)
527{
528 return (struct ext3_dir_entry_2 *)((char*)p + le16_to_cpu(p->rec_len));
529}
530
531/*
532 * This function fills a red-black tree with information from a
533 * directory block. It returns the number directory entries loaded
534 * into the tree. If there is an error it is returned in err.
535 */
536static int htree_dirblock_to_tree(struct file *dir_file,
537 struct inode *dir, int block,
538 struct dx_hash_info *hinfo,
539 __u32 start_hash, __u32 start_minor_hash)
540{
541 struct buffer_head *bh;
542 struct ext3_dir_entry_2 *de, *top;
543 int err, count = 0;
544
545 dxtrace(printk("In htree dirblock_to_tree: block %d\n", block));
546 if (!(bh = ext3_bread (NULL, dir, block, 0, &err)))
547 return err;
548
549 de = (struct ext3_dir_entry_2 *) bh->b_data;
550 top = (struct ext3_dir_entry_2 *) ((char *) de +
551 dir->i_sb->s_blocksize -
552 EXT3_DIR_REC_LEN(0));
553 for (; de < top; de = ext3_next_entry(de)) {
Eric Sandeen40b85132006-12-06 20:36:26 -0800554 if (!ext3_check_dir_entry("htree_dirblock_to_tree", dir, de, bh,
555 (block<<EXT3_BLOCK_SIZE_BITS(dir->i_sb))
556 +((char *)de - bh->b_data))) {
557 /* On error, skip the f_pos to the next block. */
558 dir_file->f_pos = (dir_file->f_pos |
559 (dir->i_sb->s_blocksize - 1)) + 1;
560 brelse (bh);
561 return count;
562 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563 ext3fs_dirhash(de->name, de->name_len, hinfo);
564 if ((hinfo->hash < start_hash) ||
565 ((hinfo->hash == start_hash) &&
566 (hinfo->minor_hash < start_minor_hash)))
567 continue;
568 if (de->inode == 0)
569 continue;
570 if ((err = ext3_htree_store_dirent(dir_file,
571 hinfo->hash, hinfo->minor_hash, de)) != 0) {
572 brelse(bh);
573 return err;
574 }
575 count++;
576 }
577 brelse(bh);
578 return count;
579}
580
581
582/*
583 * This function fills a red-black tree with information from a
584 * directory. We start scanning the directory in hash order, starting
585 * at start_hash and start_minor_hash.
586 *
587 * This function returns the number of entries inserted into the tree,
588 * or a negative error code.
589 */
590int ext3_htree_fill_tree(struct file *dir_file, __u32 start_hash,
591 __u32 start_minor_hash, __u32 *next_hash)
592{
593 struct dx_hash_info hinfo;
594 struct ext3_dir_entry_2 *de;
595 struct dx_frame frames[2], *frame;
596 struct inode *dir;
597 int block, err;
598 int count = 0;
599 int ret;
600 __u32 hashval;
601
602 dxtrace(printk("In htree_fill_tree, start hash: %x:%x\n", start_hash,
603 start_minor_hash));
Josef "Jeff" Sipekfe21a692006-12-08 02:36:38 -0800604 dir = dir_file->f_path.dentry->d_inode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605 if (!(EXT3_I(dir)->i_flags & EXT3_INDEX_FL)) {
606 hinfo.hash_version = EXT3_SB(dir->i_sb)->s_def_hash_version;
607 hinfo.seed = EXT3_SB(dir->i_sb)->s_hash_seed;
608 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
609 start_hash, start_minor_hash);
610 *next_hash = ~0;
611 return count;
612 }
613 hinfo.hash = start_hash;
614 hinfo.minor_hash = 0;
Josef "Jeff" Sipekfe21a692006-12-08 02:36:38 -0800615 frame = dx_probe(NULL, dir_file->f_path.dentry->d_inode, &hinfo, frames, &err);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616 if (!frame)
617 return err;
618
619 /* Add '.' and '..' from the htree header */
620 if (!start_hash && !start_minor_hash) {
621 de = (struct ext3_dir_entry_2 *) frames[0].bh->b_data;
622 if ((err = ext3_htree_store_dirent(dir_file, 0, 0, de)) != 0)
623 goto errout;
624 count++;
625 }
626 if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) {
627 de = (struct ext3_dir_entry_2 *) frames[0].bh->b_data;
628 de = ext3_next_entry(de);
629 if ((err = ext3_htree_store_dirent(dir_file, 2, 0, de)) != 0)
630 goto errout;
631 count++;
632 }
633
634 while (1) {
635 block = dx_get_block(frame->at);
636 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
637 start_hash, start_minor_hash);
638 if (ret < 0) {
639 err = ret;
640 goto errout;
641 }
642 count += ret;
643 hashval = ~0;
Mingming Caoae6ddcc2006-09-27 01:49:27 -0700644 ret = ext3_htree_next_block(dir, HASH_NB_ALWAYS,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 frame, frames, &hashval);
646 *next_hash = hashval;
647 if (ret < 0) {
648 err = ret;
649 goto errout;
650 }
651 /*
652 * Stop if: (a) there are no more entries, or
653 * (b) we have inserted at least one entry and the
654 * next hash value is not a continuation
655 */
656 if ((ret == 0) ||
657 (count && ((hashval & 1) == 0)))
658 break;
659 }
660 dx_release(frames);
Mingming Caoae6ddcc2006-09-27 01:49:27 -0700661 dxtrace(printk("Fill tree: returned %d entries, next hash: %x\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700662 count, *next_hash));
663 return count;
664errout:
665 dx_release(frames);
666 return (err);
667}
668
669
670/*
671 * Directory block splitting, compacting
672 */
673
674static int dx_make_map (struct ext3_dir_entry_2 *de, int size,
675 struct dx_hash_info *hinfo, struct dx_map_entry *map_tail)
676{
677 int count = 0;
678 char *base = (char *) de;
679 struct dx_hash_info h = *hinfo;
680
681 while ((char *) de < base + size)
682 {
683 if (de->name_len && de->inode) {
684 ext3fs_dirhash(de->name, de->name_len, &h);
685 map_tail--;
686 map_tail->hash = h.hash;
687 map_tail->offs = (u32) ((char *) de - base);
688 count++;
689 cond_resched();
690 }
691 /* XXX: do we need to check rec_len == 0 case? -Chris */
692 de = (struct ext3_dir_entry_2 *) ((char *) de + le16_to_cpu(de->rec_len));
693 }
694 return count;
695}
696
697static void dx_sort_map (struct dx_map_entry *map, unsigned count)
698{
699 struct dx_map_entry *p, *q, *top = map + count - 1;
700 int more;
701 /* Combsort until bubble sort doesn't suck */
702 while (count > 2)
703 {
704 count = count*10/13;
705 if (count - 9 < 2) /* 9, 10 -> 11 */
706 count = 11;
707 for (p = top, q = p - count; q >= map; p--, q--)
708 if (p->hash < q->hash)
709 swap(*p, *q);
710 }
711 /* Garden variety bubble sort */
712 do {
713 more = 0;
714 q = top;
715 while (q-- > map)
716 {
717 if (q[1].hash >= q[0].hash)
718 continue;
719 swap(*(q+1), *q);
720 more = 1;
721 }
722 } while(more);
723}
724
725static void dx_insert_block(struct dx_frame *frame, u32 hash, u32 block)
726{
727 struct dx_entry *entries = frame->entries;
728 struct dx_entry *old = frame->at, *new = old + 1;
729 int count = dx_get_count(entries);
730
731 assert(count < dx_get_limit(entries));
732 assert(old < entries + count);
733 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
734 dx_set_hash(new, hash);
735 dx_set_block(new, block);
736 dx_set_count(entries, count + 1);
737}
738#endif
739
740
741static void ext3_update_dx_flag(struct inode *inode)
742{
743 if (!EXT3_HAS_COMPAT_FEATURE(inode->i_sb,
744 EXT3_FEATURE_COMPAT_DIR_INDEX))
745 EXT3_I(inode)->i_flags &= ~EXT3_INDEX_FL;
746}
747
748/*
749 * NOTE! unlike strncmp, ext3_match returns 1 for success, 0 for failure.
750 *
751 * `len <= EXT3_NAME_LEN' is guaranteed by caller.
752 * `de != NULL' is guaranteed by caller.
753 */
754static inline int ext3_match (int len, const char * const name,
755 struct ext3_dir_entry_2 * de)
756{
757 if (len != de->name_len)
758 return 0;
759 if (!de->inode)
760 return 0;
761 return !memcmp(name, de->name, len);
762}
763
764/*
765 * Returns 0 if not found, -1 on failure, and 1 on success
766 */
767static inline int search_dirblock(struct buffer_head * bh,
768 struct inode *dir,
769 struct dentry *dentry,
770 unsigned long offset,
771 struct ext3_dir_entry_2 ** res_dir)
772{
773 struct ext3_dir_entry_2 * de;
774 char * dlimit;
775 int de_len;
776 const char *name = dentry->d_name.name;
777 int namelen = dentry->d_name.len;
778
779 de = (struct ext3_dir_entry_2 *) bh->b_data;
780 dlimit = bh->b_data + dir->i_sb->s_blocksize;
781 while ((char *) de < dlimit) {
782 /* this code is executed quadratically often */
783 /* do minimal checking `by hand' */
784
785 if ((char *) de + namelen <= dlimit &&
786 ext3_match (namelen, name, de)) {
787 /* found a match - just to be sure, do a full check */
788 if (!ext3_check_dir_entry("ext3_find_entry",
789 dir, de, bh, offset))
790 return -1;
791 *res_dir = de;
792 return 1;
793 }
794 /* prevent looping on a bad block */
795 de_len = le16_to_cpu(de->rec_len);
796 if (de_len <= 0)
797 return -1;
798 offset += de_len;
799 de = (struct ext3_dir_entry_2 *) ((char *) de + de_len);
800 }
801 return 0;
802}
803
804
805/*
806 * ext3_find_entry()
807 *
808 * finds an entry in the specified directory with the wanted name. It
809 * returns the cache buffer in which the entry was found, and the entry
810 * itself (as a parameter - res_dir). It does NOT read the inode of the
811 * entry - you'll have to do that yourself if you want to.
812 *
813 * The returned buffer_head has ->b_count elevated. The caller is expected
814 * to brelse() it when appropriate.
815 */
816static struct buffer_head * ext3_find_entry (struct dentry *dentry,
817 struct ext3_dir_entry_2 ** res_dir)
818{
819 struct super_block * sb;
820 struct buffer_head * bh_use[NAMEI_RA_SIZE];
821 struct buffer_head * bh, *ret = NULL;
822 unsigned long start, block, b;
823 int ra_max = 0; /* Number of bh's in the readahead
824 buffer, bh_use[] */
825 int ra_ptr = 0; /* Current index into readahead
826 buffer */
827 int num = 0;
828 int nblocks, i, err;
829 struct inode *dir = dentry->d_parent->d_inode;
830 int namelen;
831 const u8 *name;
832 unsigned blocksize;
833
834 *res_dir = NULL;
835 sb = dir->i_sb;
836 blocksize = sb->s_blocksize;
837 namelen = dentry->d_name.len;
838 name = dentry->d_name.name;
839 if (namelen > EXT3_NAME_LEN)
840 return NULL;
841#ifdef CONFIG_EXT3_INDEX
842 if (is_dx(dir)) {
843 bh = ext3_dx_find_entry(dentry, res_dir, &err);
844 /*
845 * On success, or if the error was file not found,
846 * return. Otherwise, fall back to doing a search the
847 * old fashioned way.
848 */
849 if (bh || (err != ERR_BAD_DX_DIR))
850 return bh;
851 dxtrace(printk("ext3_find_entry: dx failed, falling back\n"));
852 }
853#endif
854 nblocks = dir->i_size >> EXT3_BLOCK_SIZE_BITS(sb);
855 start = EXT3_I(dir)->i_dir_start_lookup;
856 if (start >= nblocks)
857 start = 0;
858 block = start;
859restart:
860 do {
861 /*
862 * We deal with the read-ahead logic here.
863 */
864 if (ra_ptr >= ra_max) {
865 /* Refill the readahead buffer */
866 ra_ptr = 0;
867 b = block;
868 for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) {
869 /*
870 * Terminate if we reach the end of the
871 * directory and must wrap, or if our
872 * search has finished at this block.
873 */
874 if (b >= nblocks || (num && block == start)) {
875 bh_use[ra_max] = NULL;
876 break;
877 }
878 num++;
879 bh = ext3_getblk(NULL, dir, b++, 0, &err);
880 bh_use[ra_max] = bh;
881 if (bh)
Jens Axboecaa38fb2006-07-23 01:41:26 +0200882 ll_rw_block(READ_META, 1, &bh);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883 }
884 }
885 if ((bh = bh_use[ra_ptr++]) == NULL)
886 goto next;
887 wait_on_buffer(bh);
888 if (!buffer_uptodate(bh)) {
889 /* read error, skip block & hope for the best */
890 ext3_error(sb, __FUNCTION__, "reading directory #%lu "
891 "offset %lu", dir->i_ino, block);
892 brelse(bh);
893 goto next;
894 }
895 i = search_dirblock(bh, dir, dentry,
896 block << EXT3_BLOCK_SIZE_BITS(sb), res_dir);
897 if (i == 1) {
898 EXT3_I(dir)->i_dir_start_lookup = block;
899 ret = bh;
900 goto cleanup_and_exit;
901 } else {
902 brelse(bh);
903 if (i < 0)
904 goto cleanup_and_exit;
905 }
906 next:
907 if (++block >= nblocks)
908 block = 0;
909 } while (block != start);
910
911 /*
912 * If the directory has grown while we were searching, then
913 * search the last part of the directory before giving up.
914 */
915 block = nblocks;
916 nblocks = dir->i_size >> EXT3_BLOCK_SIZE_BITS(sb);
917 if (block < nblocks) {
918 start = 0;
919 goto restart;
920 }
921
922cleanup_and_exit:
923 /* Clean up the read-ahead blocks */
924 for (; ra_ptr < ra_max; ra_ptr++)
925 brelse (bh_use[ra_ptr]);
926 return ret;
927}
928
929#ifdef CONFIG_EXT3_INDEX
930static struct buffer_head * ext3_dx_find_entry(struct dentry *dentry,
931 struct ext3_dir_entry_2 **res_dir, int *err)
932{
933 struct super_block * sb;
934 struct dx_hash_info hinfo;
935 u32 hash;
936 struct dx_frame frames[2], *frame;
937 struct ext3_dir_entry_2 *de, *top;
938 struct buffer_head *bh;
939 unsigned long block;
940 int retval;
941 int namelen = dentry->d_name.len;
942 const u8 *name = dentry->d_name.name;
943 struct inode *dir = dentry->d_parent->d_inode;
944
945 sb = dir->i_sb;
Andreas Dilgeracfa1823d2005-06-23 00:09:45 -0700946 /* NFS may look up ".." - look at dx_root directory block */
947 if (namelen > 2 || name[0] != '.'||(name[1] != '.' && name[1] != '\0')){
948 if (!(frame = dx_probe(dentry, NULL, &hinfo, frames, err)))
949 return NULL;
950 } else {
951 frame = frames;
952 frame->bh = NULL; /* for dx_release() */
953 frame->at = (struct dx_entry *)frames; /* hack for zero entry*/
954 dx_set_block(frame->at, 0); /* dx_root block is 0 */
955 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700956 hash = hinfo.hash;
957 do {
958 block = dx_get_block(frame->at);
959 if (!(bh = ext3_bread (NULL,dir, block, 0, err)))
960 goto errout;
961 de = (struct ext3_dir_entry_2 *) bh->b_data;
962 top = (struct ext3_dir_entry_2 *) ((char *) de + sb->s_blocksize -
963 EXT3_DIR_REC_LEN(0));
964 for (; de < top; de = ext3_next_entry(de))
965 if (ext3_match (namelen, name, de)) {
966 if (!ext3_check_dir_entry("ext3_find_entry",
967 dir, de, bh,
968 (block<<EXT3_BLOCK_SIZE_BITS(sb))
969 +((char *)de - bh->b_data))) {
970 brelse (bh);
Dmitriy Monakhovfedee542007-05-08 00:25:34 -0700971 *err = ERR_BAD_DX_DIR;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700972 goto errout;
973 }
974 *res_dir = de;
975 dx_release (frames);
976 return bh;
977 }
978 brelse (bh);
979 /* Check to see if we should continue to search */
980 retval = ext3_htree_next_block(dir, hash, frame,
981 frames, NULL);
982 if (retval < 0) {
983 ext3_warning(sb, __FUNCTION__,
984 "error reading index page in directory #%lu",
985 dir->i_ino);
986 *err = retval;
987 goto errout;
988 }
989 } while (retval == 1);
990
991 *err = -ENOENT;
992errout:
993 dxtrace(printk("%s not found\n", name));
994 dx_release (frames);
995 return NULL;
996}
997#endif
998
999static struct dentry *ext3_lookup(struct inode * dir, struct dentry *dentry, struct nameidata *nd)
1000{
1001 struct inode * inode;
1002 struct ext3_dir_entry_2 * de;
1003 struct buffer_head * bh;
1004
1005 if (dentry->d_name.len > EXT3_NAME_LEN)
1006 return ERR_PTR(-ENAMETOOLONG);
1007
1008 bh = ext3_find_entry(dentry, &de);
1009 inode = NULL;
1010 if (bh) {
1011 unsigned long ino = le32_to_cpu(de->inode);
1012 brelse (bh);
Neil Brown2ccb48e2006-07-30 03:03:01 -07001013 if (!ext3_valid_inum(dir->i_sb, ino)) {
1014 ext3_error(dir->i_sb, "ext3_lookup",
1015 "bad inode number: %lu", ino);
1016 inode = NULL;
1017 } else
1018 inode = iget(dir->i_sb, ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001019
1020 if (!inode)
1021 return ERR_PTR(-EACCES);
1022 }
Pekka Enbergba7fe362006-01-14 13:21:08 -08001023 return d_splice_alias(inode, dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001024}
1025
1026
1027struct dentry *ext3_get_parent(struct dentry *child)
1028{
1029 unsigned long ino;
1030 struct dentry *parent;
1031 struct inode *inode;
1032 struct dentry dotdot;
1033 struct ext3_dir_entry_2 * de;
1034 struct buffer_head *bh;
1035
1036 dotdot.d_name.name = "..";
1037 dotdot.d_name.len = 2;
1038 dotdot.d_parent = child; /* confusing, isn't it! */
1039
1040 bh = ext3_find_entry(&dotdot, &de);
1041 inode = NULL;
1042 if (!bh)
1043 return ERR_PTR(-ENOENT);
1044 ino = le32_to_cpu(de->inode);
1045 brelse(bh);
Neil Brown2ccb48e2006-07-30 03:03:01 -07001046
1047 if (!ext3_valid_inum(child->d_inode->i_sb, ino)) {
1048 ext3_error(child->d_inode->i_sb, "ext3_get_parent",
1049 "bad inode number: %lu", ino);
1050 inode = NULL;
1051 } else
1052 inode = iget(child->d_inode->i_sb, ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001053
1054 if (!inode)
1055 return ERR_PTR(-EACCES);
1056
1057 parent = d_alloc_anon(inode);
1058 if (!parent) {
1059 iput(inode);
1060 parent = ERR_PTR(-ENOMEM);
1061 }
1062 return parent;
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001063}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001064
1065#define S_SHIFT 12
1066static unsigned char ext3_type_by_mode[S_IFMT >> S_SHIFT] = {
1067 [S_IFREG >> S_SHIFT] = EXT3_FT_REG_FILE,
1068 [S_IFDIR >> S_SHIFT] = EXT3_FT_DIR,
1069 [S_IFCHR >> S_SHIFT] = EXT3_FT_CHRDEV,
1070 [S_IFBLK >> S_SHIFT] = EXT3_FT_BLKDEV,
1071 [S_IFIFO >> S_SHIFT] = EXT3_FT_FIFO,
1072 [S_IFSOCK >> S_SHIFT] = EXT3_FT_SOCK,
1073 [S_IFLNK >> S_SHIFT] = EXT3_FT_SYMLINK,
1074};
1075
1076static inline void ext3_set_de_type(struct super_block *sb,
1077 struct ext3_dir_entry_2 *de,
1078 umode_t mode) {
1079 if (EXT3_HAS_INCOMPAT_FEATURE(sb, EXT3_FEATURE_INCOMPAT_FILETYPE))
1080 de->file_type = ext3_type_by_mode[(mode & S_IFMT)>>S_SHIFT];
1081}
1082
1083#ifdef CONFIG_EXT3_INDEX
1084static struct ext3_dir_entry_2 *
1085dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count)
1086{
1087 unsigned rec_len = 0;
1088
1089 while (count--) {
1090 struct ext3_dir_entry_2 *de = (struct ext3_dir_entry_2 *) (from + map->offs);
1091 rec_len = EXT3_DIR_REC_LEN(de->name_len);
1092 memcpy (to, de, rec_len);
1093 ((struct ext3_dir_entry_2 *) to)->rec_len =
1094 cpu_to_le16(rec_len);
1095 de->inode = 0;
1096 map++;
1097 to += rec_len;
1098 }
1099 return (struct ext3_dir_entry_2 *) (to - rec_len);
1100}
1101
1102static struct ext3_dir_entry_2* dx_pack_dirents(char *base, int size)
1103{
1104 struct ext3_dir_entry_2 *next, *to, *prev, *de = (struct ext3_dir_entry_2 *) base;
1105 unsigned rec_len = 0;
1106
1107 prev = to = de;
1108 while ((char*)de < base + size) {
1109 next = (struct ext3_dir_entry_2 *) ((char *) de +
1110 le16_to_cpu(de->rec_len));
1111 if (de->inode && de->name_len) {
1112 rec_len = EXT3_DIR_REC_LEN(de->name_len);
1113 if (de > to)
1114 memmove(to, de, rec_len);
1115 to->rec_len = cpu_to_le16(rec_len);
1116 prev = to;
1117 to = (struct ext3_dir_entry_2 *) (((char *) to) + rec_len);
1118 }
1119 de = next;
1120 }
1121 return prev;
1122}
1123
1124static struct ext3_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1125 struct buffer_head **bh,struct dx_frame *frame,
1126 struct dx_hash_info *hinfo, int *error)
1127{
1128 unsigned blocksize = dir->i_sb->s_blocksize;
1129 unsigned count, continued;
1130 struct buffer_head *bh2;
1131 u32 newblock;
1132 u32 hash2;
1133 struct dx_map_entry *map;
1134 char *data1 = (*bh)->b_data, *data2;
1135 unsigned split;
1136 struct ext3_dir_entry_2 *de = NULL, *de2;
Dmitriy Monakhovfedee542007-05-08 00:25:34 -07001137 int err = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001138
Dmitriy Monakhovfedee542007-05-08 00:25:34 -07001139 bh2 = ext3_append (handle, dir, &newblock, &err);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001140 if (!(bh2)) {
1141 brelse(*bh);
1142 *bh = NULL;
1143 goto errout;
1144 }
1145
1146 BUFFER_TRACE(*bh, "get_write_access");
1147 err = ext3_journal_get_write_access(handle, *bh);
Dmitriy Monakhovfedee542007-05-08 00:25:34 -07001148 if (err)
1149 goto journal_error;
1150
Linus Torvalds1da177e2005-04-16 15:20:36 -07001151 BUFFER_TRACE(frame->bh, "get_write_access");
1152 err = ext3_journal_get_write_access(handle, frame->bh);
1153 if (err)
1154 goto journal_error;
1155
1156 data2 = bh2->b_data;
1157
1158 /* create map in the end of data2 block */
1159 map = (struct dx_map_entry *) (data2 + blocksize);
1160 count = dx_make_map ((struct ext3_dir_entry_2 *) data1,
1161 blocksize, hinfo, map);
1162 map -= count;
1163 split = count/2; // need to adjust to actual middle
1164 dx_sort_map (map, count);
1165 hash2 = map[split].hash;
1166 continued = hash2 == map[split - 1].hash;
1167 dxtrace(printk("Split block %i at %x, %i/%i\n",
1168 dx_get_block(frame->at), hash2, split, count-split));
1169
1170 /* Fancy dance to stay within two buffers */
1171 de2 = dx_move_dirents(data1, data2, map + split, count - split);
1172 de = dx_pack_dirents(data1,blocksize);
1173 de->rec_len = cpu_to_le16(data1 + blocksize - (char *) de);
1174 de2->rec_len = cpu_to_le16(data2 + blocksize - (char *) de2);
1175 dxtrace(dx_show_leaf (hinfo, (struct ext3_dir_entry_2 *) data1, blocksize, 1));
1176 dxtrace(dx_show_leaf (hinfo, (struct ext3_dir_entry_2 *) data2, blocksize, 1));
1177
1178 /* Which block gets the new entry? */
1179 if (hinfo->hash >= hash2)
1180 {
1181 swap(*bh, bh2);
1182 de = de2;
1183 }
1184 dx_insert_block (frame, hash2 + continued, newblock);
1185 err = ext3_journal_dirty_metadata (handle, bh2);
1186 if (err)
1187 goto journal_error;
1188 err = ext3_journal_dirty_metadata (handle, frame->bh);
1189 if (err)
1190 goto journal_error;
1191 brelse (bh2);
1192 dxtrace(dx_show_index ("frame", frame->entries));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001193 return de;
Dmitriy Monakhovfedee542007-05-08 00:25:34 -07001194
1195journal_error:
1196 brelse(*bh);
1197 brelse(bh2);
1198 *bh = NULL;
1199 ext3_std_error(dir->i_sb, err);
1200errout:
1201 *error = err;
1202 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001203}
1204#endif
1205
1206
1207/*
1208 * Add a new entry into a directory (leaf) block. If de is non-NULL,
1209 * it points to a directory entry which is guaranteed to be large
1210 * enough for new directory entry. If de is NULL, then
1211 * add_dirent_to_buf will attempt search the directory block for
1212 * space. It will return -ENOSPC if no space is available, and -EIO
1213 * and -EEXIST if directory entry already exists.
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001214 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07001215 * NOTE! bh is NOT released in the case where ENOSPC is returned. In
1216 * all other cases bh is released.
1217 */
1218static int add_dirent_to_buf(handle_t *handle, struct dentry *dentry,
1219 struct inode *inode, struct ext3_dir_entry_2 *de,
1220 struct buffer_head * bh)
1221{
1222 struct inode *dir = dentry->d_parent->d_inode;
1223 const char *name = dentry->d_name.name;
1224 int namelen = dentry->d_name.len;
1225 unsigned long offset = 0;
1226 unsigned short reclen;
1227 int nlen, rlen, err;
1228 char *top;
1229
1230 reclen = EXT3_DIR_REC_LEN(namelen);
1231 if (!de) {
1232 de = (struct ext3_dir_entry_2 *)bh->b_data;
1233 top = bh->b_data + dir->i_sb->s_blocksize - reclen;
1234 while ((char *) de <= top) {
1235 if (!ext3_check_dir_entry("ext3_add_entry", dir, de,
1236 bh, offset)) {
1237 brelse (bh);
1238 return -EIO;
1239 }
1240 if (ext3_match (namelen, name, de)) {
1241 brelse (bh);
1242 return -EEXIST;
1243 }
1244 nlen = EXT3_DIR_REC_LEN(de->name_len);
1245 rlen = le16_to_cpu(de->rec_len);
1246 if ((de->inode? rlen - nlen: rlen) >= reclen)
1247 break;
1248 de = (struct ext3_dir_entry_2 *)((char *)de + rlen);
1249 offset += rlen;
1250 }
1251 if ((char *) de > top)
1252 return -ENOSPC;
1253 }
1254 BUFFER_TRACE(bh, "get_write_access");
1255 err = ext3_journal_get_write_access(handle, bh);
1256 if (err) {
1257 ext3_std_error(dir->i_sb, err);
1258 brelse(bh);
1259 return err;
1260 }
1261
1262 /* By now the buffer is marked for journaling */
1263 nlen = EXT3_DIR_REC_LEN(de->name_len);
1264 rlen = le16_to_cpu(de->rec_len);
1265 if (de->inode) {
1266 struct ext3_dir_entry_2 *de1 = (struct ext3_dir_entry_2 *)((char *)de + nlen);
1267 de1->rec_len = cpu_to_le16(rlen - nlen);
1268 de->rec_len = cpu_to_le16(nlen);
1269 de = de1;
1270 }
1271 de->file_type = EXT3_FT_UNKNOWN;
1272 if (inode) {
1273 de->inode = cpu_to_le32(inode->i_ino);
1274 ext3_set_de_type(dir->i_sb, de, inode->i_mode);
1275 } else
1276 de->inode = 0;
1277 de->name_len = namelen;
1278 memcpy (de->name, name, namelen);
1279 /*
1280 * XXX shouldn't update any times until successful
1281 * completion of syscall, but too many callers depend
1282 * on this.
1283 *
1284 * XXX similarly, too many callers depend on
1285 * ext3_new_inode() setting the times, but error
1286 * recovery deletes the inode, so the worst that can
1287 * happen is that the times are slightly out of date
1288 * and/or different from the directory change time.
1289 */
1290 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
1291 ext3_update_dx_flag(dir);
1292 dir->i_version++;
1293 ext3_mark_inode_dirty(handle, dir);
1294 BUFFER_TRACE(bh, "call ext3_journal_dirty_metadata");
1295 err = ext3_journal_dirty_metadata(handle, bh);
1296 if (err)
1297 ext3_std_error(dir->i_sb, err);
1298 brelse(bh);
1299 return 0;
1300}
1301
1302#ifdef CONFIG_EXT3_INDEX
1303/*
1304 * This converts a one block unindexed directory to a 3 block indexed
1305 * directory, and adds the dentry to the indexed directory.
1306 */
1307static int make_indexed_dir(handle_t *handle, struct dentry *dentry,
1308 struct inode *inode, struct buffer_head *bh)
1309{
1310 struct inode *dir = dentry->d_parent->d_inode;
1311 const char *name = dentry->d_name.name;
1312 int namelen = dentry->d_name.len;
1313 struct buffer_head *bh2;
1314 struct dx_root *root;
1315 struct dx_frame frames[2], *frame;
1316 struct dx_entry *entries;
1317 struct ext3_dir_entry_2 *de, *de2;
1318 char *data1, *top;
1319 unsigned len;
1320 int retval;
1321 unsigned blocksize;
1322 struct dx_hash_info hinfo;
1323 u32 block;
1324 struct fake_dirent *fde;
1325
1326 blocksize = dir->i_sb->s_blocksize;
1327 dxtrace(printk("Creating index\n"));
1328 retval = ext3_journal_get_write_access(handle, bh);
1329 if (retval) {
1330 ext3_std_error(dir->i_sb, retval);
1331 brelse(bh);
1332 return retval;
1333 }
1334 root = (struct dx_root *) bh->b_data;
1335
1336 bh2 = ext3_append (handle, dir, &block, &retval);
1337 if (!(bh2)) {
1338 brelse(bh);
1339 return retval;
1340 }
1341 EXT3_I(dir)->i_flags |= EXT3_INDEX_FL;
1342 data1 = bh2->b_data;
1343
1344 /* The 0th block becomes the root, move the dirents out */
1345 fde = &root->dotdot;
1346 de = (struct ext3_dir_entry_2 *)((char *)fde + le16_to_cpu(fde->rec_len));
1347 len = ((char *) root) + blocksize - (char *) de;
1348 memcpy (data1, de, len);
1349 de = (struct ext3_dir_entry_2 *) data1;
1350 top = data1 + len;
1351 while ((char *)(de2=(void*)de+le16_to_cpu(de->rec_len)) < top)
1352 de = de2;
1353 de->rec_len = cpu_to_le16(data1 + blocksize - (char *) de);
1354 /* Initialize the root; the dot dirents already exist */
1355 de = (struct ext3_dir_entry_2 *) (&root->dotdot);
1356 de->rec_len = cpu_to_le16(blocksize - EXT3_DIR_REC_LEN(2));
1357 memset (&root->info, 0, sizeof(root->info));
1358 root->info.info_length = sizeof(root->info);
1359 root->info.hash_version = EXT3_SB(dir->i_sb)->s_def_hash_version;
1360 entries = root->entries;
1361 dx_set_block (entries, 1);
1362 dx_set_count (entries, 1);
1363 dx_set_limit (entries, dx_root_limit(dir, sizeof(root->info)));
1364
1365 /* Initialize as for dx_probe */
1366 hinfo.hash_version = root->info.hash_version;
1367 hinfo.seed = EXT3_SB(dir->i_sb)->s_hash_seed;
1368 ext3fs_dirhash(name, namelen, &hinfo);
1369 frame = frames;
1370 frame->entries = entries;
1371 frame->at = entries;
1372 frame->bh = bh;
1373 bh = bh2;
1374 de = do_split(handle,dir, &bh, frame, &hinfo, &retval);
1375 dx_release (frames);
1376 if (!(de))
1377 return retval;
1378
1379 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1380}
1381#endif
1382
1383/*
1384 * ext3_add_entry()
1385 *
1386 * adds a file entry to the specified directory, using the same
1387 * semantics as ext3_find_entry(). It returns NULL if it failed.
1388 *
1389 * NOTE!! The inode part of 'de' is left at 0 - which means you
1390 * may not sleep between calling this and putting something into
1391 * the entry, as someone else might have used it while you slept.
1392 */
1393static int ext3_add_entry (handle_t *handle, struct dentry *dentry,
1394 struct inode *inode)
1395{
1396 struct inode *dir = dentry->d_parent->d_inode;
1397 unsigned long offset;
1398 struct buffer_head * bh;
1399 struct ext3_dir_entry_2 *de;
1400 struct super_block * sb;
1401 int retval;
1402#ifdef CONFIG_EXT3_INDEX
1403 int dx_fallback=0;
1404#endif
1405 unsigned blocksize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001406 u32 block, blocks;
1407
1408 sb = dir->i_sb;
1409 blocksize = sb->s_blocksize;
1410 if (!dentry->d_name.len)
1411 return -EINVAL;
1412#ifdef CONFIG_EXT3_INDEX
1413 if (is_dx(dir)) {
1414 retval = ext3_dx_add_entry(handle, dentry, inode);
1415 if (!retval || (retval != ERR_BAD_DX_DIR))
1416 return retval;
1417 EXT3_I(dir)->i_flags &= ~EXT3_INDEX_FL;
1418 dx_fallback++;
1419 ext3_mark_inode_dirty(handle, dir);
1420 }
1421#endif
1422 blocks = dir->i_size >> sb->s_blocksize_bits;
1423 for (block = 0, offset = 0; block < blocks; block++) {
1424 bh = ext3_bread(handle, dir, block, 0, &retval);
1425 if(!bh)
1426 return retval;
1427 retval = add_dirent_to_buf(handle, dentry, inode, NULL, bh);
1428 if (retval != -ENOSPC)
1429 return retval;
1430
1431#ifdef CONFIG_EXT3_INDEX
1432 if (blocks == 1 && !dx_fallback &&
1433 EXT3_HAS_COMPAT_FEATURE(sb, EXT3_FEATURE_COMPAT_DIR_INDEX))
1434 return make_indexed_dir(handle, dentry, inode, bh);
1435#endif
1436 brelse(bh);
1437 }
1438 bh = ext3_append(handle, dir, &block, &retval);
1439 if (!bh)
1440 return retval;
1441 de = (struct ext3_dir_entry_2 *) bh->b_data;
1442 de->inode = 0;
Johann Lombardi92eeccd2006-06-25 05:48:33 -07001443 de->rec_len = cpu_to_le16(blocksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001444 return add_dirent_to_buf(handle, dentry, inode, de, bh);
1445}
1446
1447#ifdef CONFIG_EXT3_INDEX
1448/*
1449 * Returns 0 for success, or a negative error value
1450 */
1451static int ext3_dx_add_entry(handle_t *handle, struct dentry *dentry,
1452 struct inode *inode)
1453{
1454 struct dx_frame frames[2], *frame;
1455 struct dx_entry *entries, *at;
1456 struct dx_hash_info hinfo;
1457 struct buffer_head * bh;
1458 struct inode *dir = dentry->d_parent->d_inode;
1459 struct super_block * sb = dir->i_sb;
1460 struct ext3_dir_entry_2 *de;
1461 int err;
1462
1463 frame = dx_probe(dentry, NULL, &hinfo, frames, &err);
1464 if (!frame)
1465 return err;
1466 entries = frame->entries;
1467 at = frame->at;
1468
1469 if (!(bh = ext3_bread(handle,dir, dx_get_block(frame->at), 0, &err)))
1470 goto cleanup;
1471
1472 BUFFER_TRACE(bh, "get_write_access");
1473 err = ext3_journal_get_write_access(handle, bh);
1474 if (err)
1475 goto journal_error;
1476
1477 err = add_dirent_to_buf(handle, dentry, inode, NULL, bh);
1478 if (err != -ENOSPC) {
1479 bh = NULL;
1480 goto cleanup;
1481 }
1482
1483 /* Block full, should compress but for now just split */
1484 dxtrace(printk("using %u of %u node entries\n",
1485 dx_get_count(entries), dx_get_limit(entries)));
1486 /* Need to split index? */
1487 if (dx_get_count(entries) == dx_get_limit(entries)) {
1488 u32 newblock;
1489 unsigned icount = dx_get_count(entries);
1490 int levels = frame - frames;
1491 struct dx_entry *entries2;
1492 struct dx_node *node2;
1493 struct buffer_head *bh2;
1494
1495 if (levels && (dx_get_count(frames->entries) ==
1496 dx_get_limit(frames->entries))) {
1497 ext3_warning(sb, __FUNCTION__,
Glauber de Oliveira Costa9f406682006-01-08 01:03:22 -08001498 "Directory index full!");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001499 err = -ENOSPC;
1500 goto cleanup;
1501 }
1502 bh2 = ext3_append (handle, dir, &newblock, &err);
1503 if (!(bh2))
1504 goto cleanup;
1505 node2 = (struct dx_node *)(bh2->b_data);
1506 entries2 = node2->entries;
1507 node2->fake.rec_len = cpu_to_le16(sb->s_blocksize);
1508 node2->fake.inode = 0;
1509 BUFFER_TRACE(frame->bh, "get_write_access");
1510 err = ext3_journal_get_write_access(handle, frame->bh);
1511 if (err)
1512 goto journal_error;
1513 if (levels) {
1514 unsigned icount1 = icount/2, icount2 = icount - icount1;
1515 unsigned hash2 = dx_get_hash(entries + icount1);
1516 dxtrace(printk("Split index %i/%i\n", icount1, icount2));
1517
1518 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
1519 err = ext3_journal_get_write_access(handle,
1520 frames[0].bh);
1521 if (err)
1522 goto journal_error;
1523
1524 memcpy ((char *) entries2, (char *) (entries + icount1),
1525 icount2 * sizeof(struct dx_entry));
1526 dx_set_count (entries, icount1);
1527 dx_set_count (entries2, icount2);
1528 dx_set_limit (entries2, dx_node_limit(dir));
1529
1530 /* Which index block gets the new entry? */
1531 if (at - entries >= icount1) {
1532 frame->at = at = at - entries - icount1 + entries2;
1533 frame->entries = entries = entries2;
1534 swap(frame->bh, bh2);
1535 }
1536 dx_insert_block (frames + 0, hash2, newblock);
1537 dxtrace(dx_show_index ("node", frames[1].entries));
1538 dxtrace(dx_show_index ("node",
1539 ((struct dx_node *) bh2->b_data)->entries));
1540 err = ext3_journal_dirty_metadata(handle, bh2);
1541 if (err)
1542 goto journal_error;
1543 brelse (bh2);
1544 } else {
1545 dxtrace(printk("Creating second level index...\n"));
1546 memcpy((char *) entries2, (char *) entries,
1547 icount * sizeof(struct dx_entry));
1548 dx_set_limit(entries2, dx_node_limit(dir));
1549
1550 /* Set up root */
1551 dx_set_count(entries, 1);
1552 dx_set_block(entries + 0, newblock);
1553 ((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels = 1;
1554
1555 /* Add new access path frame */
1556 frame = frames + 1;
1557 frame->at = at = at - entries + entries2;
1558 frame->entries = entries = entries2;
1559 frame->bh = bh2;
1560 err = ext3_journal_get_write_access(handle,
1561 frame->bh);
1562 if (err)
1563 goto journal_error;
1564 }
1565 ext3_journal_dirty_metadata(handle, frames[0].bh);
1566 }
1567 de = do_split(handle, dir, &bh, frame, &hinfo, &err);
1568 if (!de)
1569 goto cleanup;
1570 err = add_dirent_to_buf(handle, dentry, inode, de, bh);
1571 bh = NULL;
1572 goto cleanup;
1573
1574journal_error:
1575 ext3_std_error(dir->i_sb, err);
1576cleanup:
1577 if (bh)
1578 brelse(bh);
1579 dx_release(frames);
1580 return err;
1581}
1582#endif
1583
1584/*
1585 * ext3_delete_entry deletes a directory entry by merging it with the
1586 * previous entry
1587 */
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001588static int ext3_delete_entry (handle_t *handle,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001589 struct inode * dir,
1590 struct ext3_dir_entry_2 * de_del,
1591 struct buffer_head * bh)
1592{
1593 struct ext3_dir_entry_2 * de, * pde;
1594 int i;
1595
1596 i = 0;
1597 pde = NULL;
1598 de = (struct ext3_dir_entry_2 *) bh->b_data;
1599 while (i < bh->b_size) {
1600 if (!ext3_check_dir_entry("ext3_delete_entry", dir, de, bh, i))
1601 return -EIO;
1602 if (de == de_del) {
1603 BUFFER_TRACE(bh, "get_write_access");
1604 ext3_journal_get_write_access(handle, bh);
1605 if (pde)
1606 pde->rec_len =
1607 cpu_to_le16(le16_to_cpu(pde->rec_len) +
1608 le16_to_cpu(de->rec_len));
1609 else
1610 de->inode = 0;
1611 dir->i_version++;
1612 BUFFER_TRACE(bh, "call ext3_journal_dirty_metadata");
1613 ext3_journal_dirty_metadata(handle, bh);
1614 return 0;
1615 }
1616 i += le16_to_cpu(de->rec_len);
1617 pde = de;
1618 de = (struct ext3_dir_entry_2 *)
1619 ((char *) de + le16_to_cpu(de->rec_len));
1620 }
1621 return -ENOENT;
1622}
1623
Linus Torvalds1da177e2005-04-16 15:20:36 -07001624static int ext3_add_nondir(handle_t *handle,
1625 struct dentry *dentry, struct inode *inode)
1626{
1627 int err = ext3_add_entry(handle, dentry, inode);
1628 if (!err) {
1629 ext3_mark_inode_dirty(handle, inode);
1630 d_instantiate(dentry, inode);
1631 return 0;
1632 }
Eric Sandeen731b9a52007-02-10 01:46:16 -08001633 drop_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001634 iput(inode);
1635 return err;
1636}
1637
1638/*
1639 * By the time this is called, we already have created
1640 * the directory cache entry for the new file, but it
1641 * is so far negative - it has no inode.
1642 *
1643 * If the create succeeds, we fill in the inode information
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001644 * with d_instantiate().
Linus Torvalds1da177e2005-04-16 15:20:36 -07001645 */
1646static int ext3_create (struct inode * dir, struct dentry * dentry, int mode,
1647 struct nameidata *nd)
1648{
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001649 handle_t *handle;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001650 struct inode * inode;
1651 int err, retries = 0;
1652
1653retry:
Jan Kara1f545872005-06-23 22:01:04 -07001654 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
Linus Torvalds1da177e2005-04-16 15:20:36 -07001655 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
Jan Kara1f545872005-06-23 22:01:04 -07001656 2*EXT3_QUOTA_INIT_BLOCKS(dir->i_sb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001657 if (IS_ERR(handle))
1658 return PTR_ERR(handle);
1659
1660 if (IS_DIRSYNC(dir))
1661 handle->h_sync = 1;
1662
1663 inode = ext3_new_inode (handle, dir, mode);
1664 err = PTR_ERR(inode);
1665 if (!IS_ERR(inode)) {
1666 inode->i_op = &ext3_file_inode_operations;
1667 inode->i_fop = &ext3_file_operations;
1668 ext3_set_aops(inode);
1669 err = ext3_add_nondir(handle, dentry, inode);
1670 }
1671 ext3_journal_stop(handle);
1672 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
1673 goto retry;
1674 return err;
1675}
1676
1677static int ext3_mknod (struct inode * dir, struct dentry *dentry,
1678 int mode, dev_t rdev)
1679{
1680 handle_t *handle;
1681 struct inode *inode;
1682 int err, retries = 0;
1683
1684 if (!new_valid_dev(rdev))
1685 return -EINVAL;
1686
1687retry:
Jan Kara1f545872005-06-23 22:01:04 -07001688 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
Dave Kleikampe9ad5622006-09-27 01:49:35 -07001689 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
Jan Kara1f545872005-06-23 22:01:04 -07001690 2*EXT3_QUOTA_INIT_BLOCKS(dir->i_sb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001691 if (IS_ERR(handle))
1692 return PTR_ERR(handle);
1693
1694 if (IS_DIRSYNC(dir))
1695 handle->h_sync = 1;
1696
1697 inode = ext3_new_inode (handle, dir, mode);
1698 err = PTR_ERR(inode);
1699 if (!IS_ERR(inode)) {
1700 init_special_inode(inode, inode->i_mode, rdev);
1701#ifdef CONFIG_EXT3_FS_XATTR
1702 inode->i_op = &ext3_special_inode_operations;
1703#endif
1704 err = ext3_add_nondir(handle, dentry, inode);
1705 }
1706 ext3_journal_stop(handle);
1707 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
1708 goto retry;
1709 return err;
1710}
1711
1712static int ext3_mkdir(struct inode * dir, struct dentry * dentry, int mode)
1713{
1714 handle_t *handle;
1715 struct inode * inode;
1716 struct buffer_head * dir_block;
1717 struct ext3_dir_entry_2 * de;
1718 int err, retries = 0;
1719
1720 if (dir->i_nlink >= EXT3_LINK_MAX)
1721 return -EMLINK;
1722
1723retry:
Jan Kara1f545872005-06-23 22:01:04 -07001724 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
Linus Torvalds1da177e2005-04-16 15:20:36 -07001725 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 3 +
Jan Kara1f545872005-06-23 22:01:04 -07001726 2*EXT3_QUOTA_INIT_BLOCKS(dir->i_sb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001727 if (IS_ERR(handle))
1728 return PTR_ERR(handle);
1729
1730 if (IS_DIRSYNC(dir))
1731 handle->h_sync = 1;
1732
1733 inode = ext3_new_inode (handle, dir, S_IFDIR | mode);
1734 err = PTR_ERR(inode);
1735 if (IS_ERR(inode))
1736 goto out_stop;
1737
1738 inode->i_op = &ext3_dir_inode_operations;
1739 inode->i_fop = &ext3_dir_operations;
1740 inode->i_size = EXT3_I(inode)->i_disksize = inode->i_sb->s_blocksize;
1741 dir_block = ext3_bread (handle, inode, 0, 1, &err);
1742 if (!dir_block) {
Dave Hansen9a53c3a2006-09-30 23:29:03 -07001743 drop_nlink(inode); /* is this nlink == 0? */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001744 ext3_mark_inode_dirty(handle, inode);
1745 iput (inode);
1746 goto out_stop;
1747 }
1748 BUFFER_TRACE(dir_block, "get_write_access");
1749 ext3_journal_get_write_access(handle, dir_block);
1750 de = (struct ext3_dir_entry_2 *) dir_block->b_data;
1751 de->inode = cpu_to_le32(inode->i_ino);
1752 de->name_len = 1;
1753 de->rec_len = cpu_to_le16(EXT3_DIR_REC_LEN(de->name_len));
1754 strcpy (de->name, ".");
1755 ext3_set_de_type(dir->i_sb, de, S_IFDIR);
1756 de = (struct ext3_dir_entry_2 *)
1757 ((char *) de + le16_to_cpu(de->rec_len));
1758 de->inode = cpu_to_le32(dir->i_ino);
1759 de->rec_len = cpu_to_le16(inode->i_sb->s_blocksize-EXT3_DIR_REC_LEN(1));
1760 de->name_len = 2;
1761 strcpy (de->name, "..");
1762 ext3_set_de_type(dir->i_sb, de, S_IFDIR);
1763 inode->i_nlink = 2;
1764 BUFFER_TRACE(dir_block, "call ext3_journal_dirty_metadata");
1765 ext3_journal_dirty_metadata(handle, dir_block);
1766 brelse (dir_block);
1767 ext3_mark_inode_dirty(handle, inode);
1768 err = ext3_add_entry (handle, dentry, inode);
1769 if (err) {
1770 inode->i_nlink = 0;
1771 ext3_mark_inode_dirty(handle, inode);
1772 iput (inode);
1773 goto out_stop;
1774 }
Dave Hansend8c76e62006-09-30 23:29:04 -07001775 inc_nlink(dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001776 ext3_update_dx_flag(dir);
1777 ext3_mark_inode_dirty(handle, dir);
1778 d_instantiate(dentry, inode);
1779out_stop:
1780 ext3_journal_stop(handle);
1781 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
1782 goto retry;
1783 return err;
1784}
1785
1786/*
1787 * routine to check that the specified directory is empty (for rmdir)
1788 */
1789static int empty_dir (struct inode * inode)
1790{
1791 unsigned long offset;
1792 struct buffer_head * bh;
1793 struct ext3_dir_entry_2 * de, * de1;
1794 struct super_block * sb;
1795 int err = 0;
1796
1797 sb = inode->i_sb;
1798 if (inode->i_size < EXT3_DIR_REC_LEN(1) + EXT3_DIR_REC_LEN(2) ||
1799 !(bh = ext3_bread (NULL, inode, 0, 0, &err))) {
1800 if (err)
1801 ext3_error(inode->i_sb, __FUNCTION__,
1802 "error %d reading directory #%lu offset 0",
1803 err, inode->i_ino);
1804 else
1805 ext3_warning(inode->i_sb, __FUNCTION__,
1806 "bad directory (dir #%lu) - no data block",
1807 inode->i_ino);
1808 return 1;
1809 }
1810 de = (struct ext3_dir_entry_2 *) bh->b_data;
1811 de1 = (struct ext3_dir_entry_2 *)
1812 ((char *) de + le16_to_cpu(de->rec_len));
1813 if (le32_to_cpu(de->inode) != inode->i_ino ||
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001814 !le32_to_cpu(de1->inode) ||
Linus Torvalds1da177e2005-04-16 15:20:36 -07001815 strcmp (".", de->name) ||
1816 strcmp ("..", de1->name)) {
Dave Kleikampe9ad5622006-09-27 01:49:35 -07001817 ext3_warning (inode->i_sb, "empty_dir",
Linus Torvalds1da177e2005-04-16 15:20:36 -07001818 "bad directory (dir #%lu) - no `.' or `..'",
1819 inode->i_ino);
1820 brelse (bh);
1821 return 1;
1822 }
1823 offset = le16_to_cpu(de->rec_len) + le16_to_cpu(de1->rec_len);
1824 de = (struct ext3_dir_entry_2 *)
1825 ((char *) de1 + le16_to_cpu(de1->rec_len));
1826 while (offset < inode->i_size ) {
1827 if (!bh ||
1828 (void *) de >= (void *) (bh->b_data+sb->s_blocksize)) {
1829 err = 0;
1830 brelse (bh);
1831 bh = ext3_bread (NULL, inode,
1832 offset >> EXT3_BLOCK_SIZE_BITS(sb), 0, &err);
1833 if (!bh) {
1834 if (err)
1835 ext3_error(sb, __FUNCTION__,
1836 "error %d reading directory"
1837 " #%lu offset %lu",
1838 err, inode->i_ino, offset);
1839 offset += sb->s_blocksize;
1840 continue;
1841 }
1842 de = (struct ext3_dir_entry_2 *) bh->b_data;
1843 }
1844 if (!ext3_check_dir_entry("empty_dir", inode, de, bh, offset)) {
1845 de = (struct ext3_dir_entry_2 *)(bh->b_data +
1846 sb->s_blocksize);
1847 offset = (offset | (sb->s_blocksize - 1)) + 1;
1848 continue;
1849 }
1850 if (le32_to_cpu(de->inode)) {
1851 brelse (bh);
1852 return 0;
1853 }
1854 offset += le16_to_cpu(de->rec_len);
1855 de = (struct ext3_dir_entry_2 *)
1856 ((char *) de + le16_to_cpu(de->rec_len));
1857 }
1858 brelse (bh);
1859 return 1;
1860}
1861
1862/* ext3_orphan_add() links an unlinked or truncated inode into a list of
1863 * such inodes, starting at the superblock, in case we crash before the
1864 * file is closed/deleted, or in case the inode truncate spans multiple
1865 * transactions and the last transaction is not recovered after a crash.
1866 *
1867 * At filesystem recovery time, we walk this list deleting unlinked
1868 * inodes and truncating linked inodes in ext3_orphan_cleanup().
1869 */
1870int ext3_orphan_add(handle_t *handle, struct inode *inode)
1871{
1872 struct super_block *sb = inode->i_sb;
1873 struct ext3_iloc iloc;
1874 int err = 0, rc;
1875
1876 lock_super(sb);
1877 if (!list_empty(&EXT3_I(inode)->i_orphan))
1878 goto out_unlock;
1879
1880 /* Orphan handling is only valid for files with data blocks
1881 * being truncated, or files being unlinked. */
1882
1883 /* @@@ FIXME: Observation from aviro:
Mingming Caoae6ddcc2006-09-27 01:49:27 -07001884 * I think I can trigger J_ASSERT in ext3_orphan_add(). We block
Linus Torvalds1da177e2005-04-16 15:20:36 -07001885 * here (on lock_super()), so race with ext3_link() which might bump
1886 * ->i_nlink. For, say it, character device. Not a regular file,
1887 * not a directory, not a symlink and ->i_nlink > 0.
1888 */
1889 J_ASSERT ((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1890 S_ISLNK(inode->i_mode)) || inode->i_nlink == 0);
1891
1892 BUFFER_TRACE(EXT3_SB(sb)->s_sbh, "get_write_access");
1893 err = ext3_journal_get_write_access(handle, EXT3_SB(sb)->s_sbh);
1894 if (err)
1895 goto out_unlock;
1896
1897 err = ext3_reserve_inode_write(handle, inode, &iloc);
1898 if (err)
1899 goto out_unlock;
1900
1901 /* Insert this inode at the head of the on-disk orphan list... */
1902 NEXT_ORPHAN(inode) = le32_to_cpu(EXT3_SB(sb)->s_es->s_last_orphan);
1903 EXT3_SB(sb)->s_es->s_last_orphan = cpu_to_le32(inode->i_ino);
1904 err = ext3_journal_dirty_metadata(handle, EXT3_SB(sb)->s_sbh);
1905 rc = ext3_mark_iloc_dirty(handle, inode, &iloc);
1906 if (!err)
1907 err = rc;
1908
1909 /* Only add to the head of the in-memory list if all the
1910 * previous operations succeeded. If the orphan_add is going to
1911 * fail (possibly taking the journal offline), we can't risk
1912 * leaving the inode on the orphan list: stray orphan-list
1913 * entries can cause panics at unmount time.
1914 *
1915 * This is safe: on error we're going to ignore the orphan list
1916 * anyway on the next recovery. */
1917 if (!err)
1918 list_add(&EXT3_I(inode)->i_orphan, &EXT3_SB(sb)->s_orphan);
1919
Eric Sandeeneee194e2006-09-27 01:49:30 -07001920 jbd_debug(4, "superblock will point to %lu\n", inode->i_ino);
1921 jbd_debug(4, "orphan inode %lu will point to %d\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07001922 inode->i_ino, NEXT_ORPHAN(inode));
1923out_unlock:
1924 unlock_super(sb);
1925 ext3_std_error(inode->i_sb, err);
1926 return err;
1927}
1928
1929/*
1930 * ext3_orphan_del() removes an unlinked or truncated inode from the list
1931 * of such inodes stored on disk, because it is finally being cleaned up.
1932 */
1933int ext3_orphan_del(handle_t *handle, struct inode *inode)
1934{
1935 struct list_head *prev;
1936 struct ext3_inode_info *ei = EXT3_I(inode);
1937 struct ext3_sb_info *sbi;
1938 unsigned long ino_next;
1939 struct ext3_iloc iloc;
1940 int err = 0;
1941
1942 lock_super(inode->i_sb);
1943 if (list_empty(&ei->i_orphan)) {
1944 unlock_super(inode->i_sb);
1945 return 0;
1946 }
1947
1948 ino_next = NEXT_ORPHAN(inode);
1949 prev = ei->i_orphan.prev;
1950 sbi = EXT3_SB(inode->i_sb);
1951
1952 jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino);
1953
1954 list_del_init(&ei->i_orphan);
1955
1956 /* If we're on an error path, we may not have a valid
1957 * transaction handle with which to update the orphan list on
1958 * disk, but we still need to remove the inode from the linked
1959 * list in memory. */
1960 if (!handle)
1961 goto out;
1962
1963 err = ext3_reserve_inode_write(handle, inode, &iloc);
1964 if (err)
1965 goto out_err;
1966
1967 if (prev == &sbi->s_orphan) {
1968 jbd_debug(4, "superblock will point to %lu\n", ino_next);
1969 BUFFER_TRACE(sbi->s_sbh, "get_write_access");
1970 err = ext3_journal_get_write_access(handle, sbi->s_sbh);
1971 if (err)
1972 goto out_brelse;
1973 sbi->s_es->s_last_orphan = cpu_to_le32(ino_next);
1974 err = ext3_journal_dirty_metadata(handle, sbi->s_sbh);
1975 } else {
1976 struct ext3_iloc iloc2;
1977 struct inode *i_prev =
1978 &list_entry(prev, struct ext3_inode_info, i_orphan)->vfs_inode;
1979
1980 jbd_debug(4, "orphan inode %lu will point to %lu\n",
1981 i_prev->i_ino, ino_next);
1982 err = ext3_reserve_inode_write(handle, i_prev, &iloc2);
1983 if (err)
1984 goto out_brelse;
1985 NEXT_ORPHAN(i_prev) = ino_next;
1986 err = ext3_mark_iloc_dirty(handle, i_prev, &iloc2);
1987 }
1988 if (err)
1989 goto out_brelse;
1990 NEXT_ORPHAN(inode) = 0;
1991 err = ext3_mark_iloc_dirty(handle, inode, &iloc);
1992
1993out_err:
1994 ext3_std_error(inode->i_sb, err);
1995out:
1996 unlock_super(inode->i_sb);
1997 return err;
1998
1999out_brelse:
2000 brelse(iloc.bh);
2001 goto out_err;
2002}
2003
2004static int ext3_rmdir (struct inode * dir, struct dentry *dentry)
2005{
2006 int retval;
2007 struct inode * inode;
2008 struct buffer_head * bh;
2009 struct ext3_dir_entry_2 * de;
2010 handle_t *handle;
2011
2012 /* Initialize quotas before so that eventual writes go in
2013 * separate transaction */
2014 DQUOT_INIT(dentry->d_inode);
Jan Kara1f545872005-06-23 22:01:04 -07002015 handle = ext3_journal_start(dir, EXT3_DELETE_TRANS_BLOCKS(dir->i_sb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002016 if (IS_ERR(handle))
2017 return PTR_ERR(handle);
2018
2019 retval = -ENOENT;
2020 bh = ext3_find_entry (dentry, &de);
2021 if (!bh)
2022 goto end_rmdir;
2023
2024 if (IS_DIRSYNC(dir))
2025 handle->h_sync = 1;
2026
2027 inode = dentry->d_inode;
2028
2029 retval = -EIO;
2030 if (le32_to_cpu(de->inode) != inode->i_ino)
2031 goto end_rmdir;
2032
2033 retval = -ENOTEMPTY;
2034 if (!empty_dir (inode))
2035 goto end_rmdir;
2036
2037 retval = ext3_delete_entry(handle, dir, de, bh);
2038 if (retval)
2039 goto end_rmdir;
2040 if (inode->i_nlink != 2)
2041 ext3_warning (inode->i_sb, "ext3_rmdir",
2042 "empty directory has nlink!=2 (%d)",
2043 inode->i_nlink);
2044 inode->i_version++;
Dave Hansence71ec32006-09-30 23:29:06 -07002045 clear_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002046 /* There's no need to set i_disksize: the fact that i_nlink is
2047 * zero will ensure that the right thing happens during any
2048 * recovery. */
2049 inode->i_size = 0;
2050 ext3_orphan_add(handle, inode);
2051 inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
2052 ext3_mark_inode_dirty(handle, inode);
Dave Hansen9a53c3a2006-09-30 23:29:03 -07002053 drop_nlink(dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002054 ext3_update_dx_flag(dir);
2055 ext3_mark_inode_dirty(handle, dir);
2056
2057end_rmdir:
2058 ext3_journal_stop(handle);
2059 brelse (bh);
2060 return retval;
2061}
2062
2063static int ext3_unlink(struct inode * dir, struct dentry *dentry)
2064{
2065 int retval;
2066 struct inode * inode;
2067 struct buffer_head * bh;
2068 struct ext3_dir_entry_2 * de;
2069 handle_t *handle;
2070
2071 /* Initialize quotas before so that eventual writes go
2072 * in separate transaction */
2073 DQUOT_INIT(dentry->d_inode);
Jan Kara1f545872005-06-23 22:01:04 -07002074 handle = ext3_journal_start(dir, EXT3_DELETE_TRANS_BLOCKS(dir->i_sb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002075 if (IS_ERR(handle))
2076 return PTR_ERR(handle);
2077
2078 if (IS_DIRSYNC(dir))
2079 handle->h_sync = 1;
2080
2081 retval = -ENOENT;
2082 bh = ext3_find_entry (dentry, &de);
2083 if (!bh)
2084 goto end_unlink;
2085
2086 inode = dentry->d_inode;
2087
2088 retval = -EIO;
2089 if (le32_to_cpu(de->inode) != inode->i_ino)
2090 goto end_unlink;
2091
2092 if (!inode->i_nlink) {
2093 ext3_warning (inode->i_sb, "ext3_unlink",
2094 "Deleting nonexistent file (%lu), %d",
2095 inode->i_ino, inode->i_nlink);
2096 inode->i_nlink = 1;
2097 }
2098 retval = ext3_delete_entry(handle, dir, de, bh);
2099 if (retval)
2100 goto end_unlink;
2101 dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
2102 ext3_update_dx_flag(dir);
2103 ext3_mark_inode_dirty(handle, dir);
Dave Hansen9a53c3a2006-09-30 23:29:03 -07002104 drop_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002105 if (!inode->i_nlink)
2106 ext3_orphan_add(handle, inode);
2107 inode->i_ctime = dir->i_ctime;
2108 ext3_mark_inode_dirty(handle, inode);
2109 retval = 0;
2110
2111end_unlink:
2112 ext3_journal_stop(handle);
2113 brelse (bh);
2114 return retval;
2115}
2116
2117static int ext3_symlink (struct inode * dir,
2118 struct dentry *dentry, const char * symname)
2119{
2120 handle_t *handle;
2121 struct inode * inode;
2122 int l, err, retries = 0;
2123
2124 l = strlen(symname)+1;
2125 if (l > dir->i_sb->s_blocksize)
2126 return -ENAMETOOLONG;
2127
2128retry:
Jan Kara1f545872005-06-23 22:01:04 -07002129 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
Dave Kleikampe9ad5622006-09-27 01:49:35 -07002130 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 5 +
Jan Kara1f545872005-06-23 22:01:04 -07002131 2*EXT3_QUOTA_INIT_BLOCKS(dir->i_sb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002132 if (IS_ERR(handle))
2133 return PTR_ERR(handle);
2134
2135 if (IS_DIRSYNC(dir))
2136 handle->h_sync = 1;
2137
2138 inode = ext3_new_inode (handle, dir, S_IFLNK|S_IRWXUGO);
2139 err = PTR_ERR(inode);
2140 if (IS_ERR(inode))
2141 goto out_stop;
2142
2143 if (l > sizeof (EXT3_I(inode)->i_data)) {
2144 inode->i_op = &ext3_symlink_inode_operations;
2145 ext3_set_aops(inode);
2146 /*
2147 * page_symlink() calls into ext3_prepare/commit_write.
2148 * We have a transaction open. All is sweetness. It also sets
2149 * i_size in generic_commit_write().
2150 */
Kirill Korotaev0adb25d2006-03-11 03:27:13 -08002151 err = __page_symlink(inode, symname, l,
2152 mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002153 if (err) {
Eric Sandeen731b9a52007-02-10 01:46:16 -08002154 drop_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002155 ext3_mark_inode_dirty(handle, inode);
2156 iput (inode);
2157 goto out_stop;
2158 }
2159 } else {
2160 inode->i_op = &ext3_fast_symlink_inode_operations;
2161 memcpy((char*)&EXT3_I(inode)->i_data,symname,l);
2162 inode->i_size = l-1;
2163 }
2164 EXT3_I(inode)->i_disksize = inode->i_size;
2165 err = ext3_add_nondir(handle, dentry, inode);
2166out_stop:
2167 ext3_journal_stop(handle);
2168 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
2169 goto retry;
2170 return err;
2171}
2172
2173static int ext3_link (struct dentry * old_dentry,
2174 struct inode * dir, struct dentry *dentry)
2175{
2176 handle_t *handle;
2177 struct inode *inode = old_dentry->d_inode;
2178 int err, retries = 0;
2179
2180 if (inode->i_nlink >= EXT3_LINK_MAX)
2181 return -EMLINK;
Eric Sandeen2988a772007-02-10 01:46:16 -08002182 /*
2183 * Return -ENOENT if we've raced with unlink and i_nlink is 0. Doing
2184 * otherwise has the potential to corrupt the orphan inode list.
2185 */
2186 if (inode->i_nlink == 0)
2187 return -ENOENT;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002188
2189retry:
Jan Kara1f545872005-06-23 22:01:04 -07002190 handle = ext3_journal_start(dir, EXT3_DATA_TRANS_BLOCKS(dir->i_sb) +
Linus Torvalds1da177e2005-04-16 15:20:36 -07002191 EXT3_INDEX_EXTRA_TRANS_BLOCKS);
2192 if (IS_ERR(handle))
2193 return PTR_ERR(handle);
2194
2195 if (IS_DIRSYNC(dir))
2196 handle->h_sync = 1;
2197
2198 inode->i_ctime = CURRENT_TIME_SEC;
Eric Sandeen731b9a52007-02-10 01:46:16 -08002199 inc_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002200 atomic_inc(&inode->i_count);
2201
2202 err = ext3_add_nondir(handle, dentry, inode);
2203 ext3_journal_stop(handle);
2204 if (err == -ENOSPC && ext3_should_retry_alloc(dir->i_sb, &retries))
2205 goto retry;
2206 return err;
2207}
2208
2209#define PARENT_INO(buffer) \
2210 ((struct ext3_dir_entry_2 *) ((char *) buffer + \
2211 le16_to_cpu(((struct ext3_dir_entry_2 *) buffer)->rec_len)))->inode
2212
2213/*
2214 * Anybody can rename anything with this: the permission checks are left to the
2215 * higher-level routines.
2216 */
2217static int ext3_rename (struct inode * old_dir, struct dentry *old_dentry,
2218 struct inode * new_dir,struct dentry *new_dentry)
2219{
2220 handle_t *handle;
2221 struct inode * old_inode, * new_inode;
2222 struct buffer_head * old_bh, * new_bh, * dir_bh;
2223 struct ext3_dir_entry_2 * old_de, * new_de;
2224 int retval;
2225
2226 old_bh = new_bh = dir_bh = NULL;
2227
2228 /* Initialize quotas before so that eventual writes go
2229 * in separate transaction */
2230 if (new_dentry->d_inode)
2231 DQUOT_INIT(new_dentry->d_inode);
Jan Kara1f545872005-06-23 22:01:04 -07002232 handle = ext3_journal_start(old_dir, 2 *
2233 EXT3_DATA_TRANS_BLOCKS(old_dir->i_sb) +
Dave Kleikampe9ad5622006-09-27 01:49:35 -07002234 EXT3_INDEX_EXTRA_TRANS_BLOCKS + 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002235 if (IS_ERR(handle))
2236 return PTR_ERR(handle);
2237
2238 if (IS_DIRSYNC(old_dir) || IS_DIRSYNC(new_dir))
2239 handle->h_sync = 1;
2240
2241 old_bh = ext3_find_entry (old_dentry, &old_de);
2242 /*
2243 * Check for inode number is _not_ due to possible IO errors.
2244 * We might rmdir the source, keep it as pwd of some process
2245 * and merrily kill the link to whatever was created under the
2246 * same name. Goodbye sticky bit ;-<
2247 */
2248 old_inode = old_dentry->d_inode;
2249 retval = -ENOENT;
2250 if (!old_bh || le32_to_cpu(old_de->inode) != old_inode->i_ino)
2251 goto end_rename;
2252
2253 new_inode = new_dentry->d_inode;
2254 new_bh = ext3_find_entry (new_dentry, &new_de);
2255 if (new_bh) {
2256 if (!new_inode) {
2257 brelse (new_bh);
2258 new_bh = NULL;
2259 }
2260 }
2261 if (S_ISDIR(old_inode->i_mode)) {
2262 if (new_inode) {
2263 retval = -ENOTEMPTY;
2264 if (!empty_dir (new_inode))
2265 goto end_rename;
2266 }
2267 retval = -EIO;
2268 dir_bh = ext3_bread (handle, old_inode, 0, 0, &retval);
2269 if (!dir_bh)
2270 goto end_rename;
2271 if (le32_to_cpu(PARENT_INO(dir_bh->b_data)) != old_dir->i_ino)
2272 goto end_rename;
2273 retval = -EMLINK;
2274 if (!new_inode && new_dir!=old_dir &&
2275 new_dir->i_nlink >= EXT3_LINK_MAX)
2276 goto end_rename;
2277 }
2278 if (!new_bh) {
2279 retval = ext3_add_entry (handle, new_dentry, old_inode);
2280 if (retval)
2281 goto end_rename;
2282 } else {
2283 BUFFER_TRACE(new_bh, "get write access");
2284 ext3_journal_get_write_access(handle, new_bh);
2285 new_de->inode = cpu_to_le32(old_inode->i_ino);
2286 if (EXT3_HAS_INCOMPAT_FEATURE(new_dir->i_sb,
2287 EXT3_FEATURE_INCOMPAT_FILETYPE))
2288 new_de->file_type = old_de->file_type;
2289 new_dir->i_version++;
2290 BUFFER_TRACE(new_bh, "call ext3_journal_dirty_metadata");
2291 ext3_journal_dirty_metadata(handle, new_bh);
2292 brelse(new_bh);
2293 new_bh = NULL;
2294 }
2295
2296 /*
2297 * Like most other Unix systems, set the ctime for inodes on a
2298 * rename.
2299 */
2300 old_inode->i_ctime = CURRENT_TIME_SEC;
2301 ext3_mark_inode_dirty(handle, old_inode);
2302
2303 /*
2304 * ok, that's it
2305 */
2306 if (le32_to_cpu(old_de->inode) != old_inode->i_ino ||
2307 old_de->name_len != old_dentry->d_name.len ||
2308 strncmp(old_de->name, old_dentry->d_name.name, old_de->name_len) ||
2309 (retval = ext3_delete_entry(handle, old_dir,
2310 old_de, old_bh)) == -ENOENT) {
2311 /* old_de could have moved from under us during htree split, so
2312 * make sure that we are deleting the right entry. We might
2313 * also be pointing to a stale entry in the unused part of
2314 * old_bh so just checking inum and the name isn't enough. */
2315 struct buffer_head *old_bh2;
2316 struct ext3_dir_entry_2 *old_de2;
2317
2318 old_bh2 = ext3_find_entry(old_dentry, &old_de2);
2319 if (old_bh2) {
2320 retval = ext3_delete_entry(handle, old_dir,
2321 old_de2, old_bh2);
2322 brelse(old_bh2);
2323 }
2324 }
2325 if (retval) {
2326 ext3_warning(old_dir->i_sb, "ext3_rename",
2327 "Deleting old file (%lu), %d, error=%d",
2328 old_dir->i_ino, old_dir->i_nlink, retval);
2329 }
2330
2331 if (new_inode) {
Dave Hansen9a53c3a2006-09-30 23:29:03 -07002332 drop_nlink(new_inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002333 new_inode->i_ctime = CURRENT_TIME_SEC;
2334 }
2335 old_dir->i_ctime = old_dir->i_mtime = CURRENT_TIME_SEC;
2336 ext3_update_dx_flag(old_dir);
2337 if (dir_bh) {
2338 BUFFER_TRACE(dir_bh, "get_write_access");
2339 ext3_journal_get_write_access(handle, dir_bh);
2340 PARENT_INO(dir_bh->b_data) = cpu_to_le32(new_dir->i_ino);
2341 BUFFER_TRACE(dir_bh, "call ext3_journal_dirty_metadata");
2342 ext3_journal_dirty_metadata(handle, dir_bh);
Dave Hansen9a53c3a2006-09-30 23:29:03 -07002343 drop_nlink(old_dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002344 if (new_inode) {
Dave Hansen9a53c3a2006-09-30 23:29:03 -07002345 drop_nlink(new_inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002346 } else {
Dave Hansend8c76e62006-09-30 23:29:04 -07002347 inc_nlink(new_dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002348 ext3_update_dx_flag(new_dir);
2349 ext3_mark_inode_dirty(handle, new_dir);
2350 }
2351 }
2352 ext3_mark_inode_dirty(handle, old_dir);
2353 if (new_inode) {
2354 ext3_mark_inode_dirty(handle, new_inode);
2355 if (!new_inode->i_nlink)
2356 ext3_orphan_add(handle, new_inode);
2357 }
2358 retval = 0;
2359
2360end_rename:
2361 brelse (dir_bh);
2362 brelse (old_bh);
2363 brelse (new_bh);
2364 ext3_journal_stop(handle);
2365 return retval;
2366}
2367
2368/*
2369 * directories can handle most operations...
2370 */
Arjan van de Ven754661f2007-02-12 00:55:38 -08002371const struct inode_operations ext3_dir_inode_operations = {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002372 .create = ext3_create,
2373 .lookup = ext3_lookup,
2374 .link = ext3_link,
2375 .unlink = ext3_unlink,
2376 .symlink = ext3_symlink,
2377 .mkdir = ext3_mkdir,
2378 .rmdir = ext3_rmdir,
2379 .mknod = ext3_mknod,
2380 .rename = ext3_rename,
2381 .setattr = ext3_setattr,
2382#ifdef CONFIG_EXT3_FS_XATTR
2383 .setxattr = generic_setxattr,
2384 .getxattr = generic_getxattr,
2385 .listxattr = ext3_listxattr,
2386 .removexattr = generic_removexattr,
2387#endif
2388 .permission = ext3_permission,
2389};
2390
Arjan van de Ven754661f2007-02-12 00:55:38 -08002391const struct inode_operations ext3_special_inode_operations = {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002392 .setattr = ext3_setattr,
2393#ifdef CONFIG_EXT3_FS_XATTR
2394 .setxattr = generic_setxattr,
2395 .getxattr = generic_getxattr,
2396 .listxattr = ext3_listxattr,
2397 .removexattr = generic_removexattr,
2398#endif
2399 .permission = ext3_permission,
Mingming Caoae6ddcc2006-09-27 01:49:27 -07002400};