blob: 69078079b19cc46c03921193246473923d8964c1 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/fs/ext3/ialloc.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 * BSD ufs-inspired inode and directory allocation by
10 * Stephen Tweedie (sct@redhat.com), 1993
11 * Big-endian to little-endian byte-swapping/bitmaps by
12 * David S. Miller (davem@caip.rutgers.edu), 1995
13 */
14
15#include <linux/time.h>
16#include <linux/fs.h>
17#include <linux/jbd.h>
18#include <linux/ext3_fs.h>
19#include <linux/ext3_jbd.h>
20#include <linux/stat.h>
21#include <linux/string.h>
22#include <linux/quotaops.h>
23#include <linux/buffer_head.h>
24#include <linux/random.h>
25#include <linux/bitops.h>
26
27#include <asm/byteorder.h>
28
Ben Dooks381be2542005-10-30 15:02:56 -080029#include "bitmap.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include "xattr.h"
31#include "acl.h"
32
33/*
34 * ialloc.c contains the inodes allocation and deallocation routines
35 */
36
37/*
38 * The free inodes are managed by bitmaps. A file system contains several
39 * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
40 * block for inodes, N blocks for the inode table and data blocks.
41 *
42 * The file system contains group descriptors which are located after the
43 * super block. Each descriptor contains the number of the bitmap block and
44 * the free blocks count in the block.
45 */
46
47
48/*
49 * Read the inode allocation bitmap for a given block_group, reading
50 * into the specified slot in the superblock's bitmap cache.
51 *
52 * Return buffer_head of bitmap on success or NULL.
53 */
54static struct buffer_head *
55read_inode_bitmap(struct super_block * sb, unsigned long block_group)
56{
57 struct ext3_group_desc *desc;
58 struct buffer_head *bh = NULL;
59
60 desc = ext3_get_group_desc(sb, block_group, NULL);
61 if (!desc)
62 goto error_out;
63
64 bh = sb_bread(sb, le32_to_cpu(desc->bg_inode_bitmap));
65 if (!bh)
66 ext3_error(sb, "read_inode_bitmap",
67 "Cannot read inode bitmap - "
68 "block_group = %lu, inode_bitmap = %u",
69 block_group, le32_to_cpu(desc->bg_inode_bitmap));
70error_out:
71 return bh;
72}
73
74/*
75 * NOTE! When we get the inode, we're the only people
76 * that have access to it, and as such there are no
77 * race conditions we have to worry about. The inode
78 * is not on the hash-lists, and it cannot be reached
79 * through the filesystem because the directory entry
80 * has been deleted earlier.
81 *
82 * HOWEVER: we must make sure that we get no aliases,
83 * which means that we have to call "clear_inode()"
84 * _before_ we mark the inode not in use in the inode
85 * bitmaps. Otherwise a newly created file might use
86 * the same inode number (not actually the same pointer
87 * though), and then we'd have two inodes sharing the
88 * same inode number and space on the harddisk.
89 */
90void ext3_free_inode (handle_t *handle, struct inode * inode)
91{
92 struct super_block * sb = inode->i_sb;
93 int is_directory;
94 unsigned long ino;
95 struct buffer_head *bitmap_bh = NULL;
96 struct buffer_head *bh2;
97 unsigned long block_group;
98 unsigned long bit;
99 struct ext3_group_desc * gdp;
100 struct ext3_super_block * es;
101 struct ext3_sb_info *sbi;
102 int fatal = 0, err;
103
104 if (atomic_read(&inode->i_count) > 1) {
105 printk ("ext3_free_inode: inode has count=%d\n",
106 atomic_read(&inode->i_count));
107 return;
108 }
109 if (inode->i_nlink) {
110 printk ("ext3_free_inode: inode has nlink=%d\n",
111 inode->i_nlink);
112 return;
113 }
114 if (!sb) {
115 printk("ext3_free_inode: inode on nonexistent device\n");
116 return;
117 }
118 sbi = EXT3_SB(sb);
119
120 ino = inode->i_ino;
121 ext3_debug ("freeing inode %lu\n", ino);
122
123 /*
124 * Note: we must free any quota before locking the superblock,
125 * as writing the quota to disk may need the lock as well.
126 */
127 DQUOT_INIT(inode);
128 ext3_xattr_delete_inode(handle, inode);
129 DQUOT_FREE_INODE(inode);
130 DQUOT_DROP(inode);
131
132 is_directory = S_ISDIR(inode->i_mode);
133
134 /* Do this BEFORE marking the inode not in use or returning an error */
135 clear_inode (inode);
136
137 es = EXT3_SB(sb)->s_es;
138 if (ino < EXT3_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) {
139 ext3_error (sb, "ext3_free_inode",
140 "reserved or nonexistent inode %lu", ino);
141 goto error_return;
142 }
143 block_group = (ino - 1) / EXT3_INODES_PER_GROUP(sb);
144 bit = (ino - 1) % EXT3_INODES_PER_GROUP(sb);
145 bitmap_bh = read_inode_bitmap(sb, block_group);
146 if (!bitmap_bh)
147 goto error_return;
148
149 BUFFER_TRACE(bitmap_bh, "get_write_access");
150 fatal = ext3_journal_get_write_access(handle, bitmap_bh);
151 if (fatal)
152 goto error_return;
153
154 /* Ok, now we can actually update the inode bitmaps.. */
155 if (!ext3_clear_bit_atomic(sb_bgl_lock(sbi, block_group),
156 bit, bitmap_bh->b_data))
157 ext3_error (sb, "ext3_free_inode",
158 "bit already cleared for inode %lu", ino);
159 else {
160 gdp = ext3_get_group_desc (sb, block_group, &bh2);
161
162 BUFFER_TRACE(bh2, "get_write_access");
163 fatal = ext3_journal_get_write_access(handle, bh2);
164 if (fatal) goto error_return;
165
166 if (gdp) {
167 spin_lock(sb_bgl_lock(sbi, block_group));
168 gdp->bg_free_inodes_count = cpu_to_le16(
169 le16_to_cpu(gdp->bg_free_inodes_count) + 1);
170 if (is_directory)
171 gdp->bg_used_dirs_count = cpu_to_le16(
172 le16_to_cpu(gdp->bg_used_dirs_count) - 1);
173 spin_unlock(sb_bgl_lock(sbi, block_group));
174 percpu_counter_inc(&sbi->s_freeinodes_counter);
175 if (is_directory)
176 percpu_counter_dec(&sbi->s_dirs_counter);
177
178 }
179 BUFFER_TRACE(bh2, "call ext3_journal_dirty_metadata");
180 err = ext3_journal_dirty_metadata(handle, bh2);
181 if (!fatal) fatal = err;
182 }
183 BUFFER_TRACE(bitmap_bh, "call ext3_journal_dirty_metadata");
184 err = ext3_journal_dirty_metadata(handle, bitmap_bh);
185 if (!fatal)
186 fatal = err;
187 sb->s_dirt = 1;
188error_return:
189 brelse(bitmap_bh);
190 ext3_std_error(sb, fatal);
191}
192
193/*
194 * There are two policies for allocating an inode. If the new inode is
195 * a directory, then a forward search is made for a block group with both
196 * free space and a low directory-to-inode ratio; if that fails, then of
197 * the groups with above-average free space, that group with the fewest
198 * directories already is chosen.
199 *
200 * For other inodes, search forward from the parent directory\'s block
201 * group to find a free inode.
202 */
203static int find_group_dir(struct super_block *sb, struct inode *parent)
204{
205 int ngroups = EXT3_SB(sb)->s_groups_count;
206 int freei, avefreei;
207 struct ext3_group_desc *desc, *best_desc = NULL;
208 struct buffer_head *bh;
209 int group, best_group = -1;
210
211 freei = percpu_counter_read_positive(&EXT3_SB(sb)->s_freeinodes_counter);
212 avefreei = freei / ngroups;
213
214 for (group = 0; group < ngroups; group++) {
215 desc = ext3_get_group_desc (sb, group, &bh);
216 if (!desc || !desc->bg_free_inodes_count)
217 continue;
218 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
219 continue;
220 if (!best_desc ||
221 (le16_to_cpu(desc->bg_free_blocks_count) >
222 le16_to_cpu(best_desc->bg_free_blocks_count))) {
223 best_group = group;
224 best_desc = desc;
225 }
226 }
227 return best_group;
228}
229
230/*
231 * Orlov's allocator for directories.
232 *
233 * We always try to spread first-level directories.
234 *
235 * If there are blockgroups with both free inodes and free blocks counts
236 * not worse than average we return one with smallest directory count.
237 * Otherwise we simply return a random group.
238 *
239 * For the rest rules look so:
240 *
241 * It's OK to put directory into a group unless
242 * it has too many directories already (max_dirs) or
243 * it has too few free inodes left (min_inodes) or
244 * it has too few free blocks left (min_blocks) or
245 * it's already running too large debt (max_debt).
246 * Parent's group is prefered, if it doesn't satisfy these
247 * conditions we search cyclically through the rest. If none
248 * of the groups look good we just look for a group with more
249 * free inodes than average (starting at parent's group).
250 *
251 * Debt is incremented each time we allocate a directory and decremented
252 * when we allocate an inode, within 0--255.
253 */
254
255#define INODE_COST 64
256#define BLOCK_COST 256
257
258static int find_group_orlov(struct super_block *sb, struct inode *parent)
259{
260 int parent_group = EXT3_I(parent)->i_block_group;
261 struct ext3_sb_info *sbi = EXT3_SB(sb);
262 struct ext3_super_block *es = sbi->s_es;
263 int ngroups = sbi->s_groups_count;
264 int inodes_per_group = EXT3_INODES_PER_GROUP(sb);
265 int freei, avefreei;
266 int freeb, avefreeb;
267 int blocks_per_dir, ndirs;
268 int max_debt, max_dirs, min_blocks, min_inodes;
269 int group = -1, i;
270 struct ext3_group_desc *desc;
271 struct buffer_head *bh;
272
273 freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter);
274 avefreei = freei / ngroups;
275 freeb = percpu_counter_read_positive(&sbi->s_freeblocks_counter);
276 avefreeb = freeb / ngroups;
277 ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter);
278
279 if ((parent == sb->s_root->d_inode) ||
280 (EXT3_I(parent)->i_flags & EXT3_TOPDIR_FL)) {
281 int best_ndir = inodes_per_group;
282 int best_group = -1;
283
284 get_random_bytes(&group, sizeof(group));
285 parent_group = (unsigned)group % ngroups;
286 for (i = 0; i < ngroups; i++) {
287 group = (parent_group + i) % ngroups;
288 desc = ext3_get_group_desc (sb, group, &bh);
289 if (!desc || !desc->bg_free_inodes_count)
290 continue;
291 if (le16_to_cpu(desc->bg_used_dirs_count) >= best_ndir)
292 continue;
293 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
294 continue;
295 if (le16_to_cpu(desc->bg_free_blocks_count) < avefreeb)
296 continue;
297 best_group = group;
298 best_ndir = le16_to_cpu(desc->bg_used_dirs_count);
299 }
300 if (best_group >= 0)
301 return best_group;
302 goto fallback;
303 }
304
305 blocks_per_dir = (le32_to_cpu(es->s_blocks_count) - freeb) / ndirs;
306
307 max_dirs = ndirs / ngroups + inodes_per_group / 16;
308 min_inodes = avefreei - inodes_per_group / 4;
309 min_blocks = avefreeb - EXT3_BLOCKS_PER_GROUP(sb) / 4;
310
311 max_debt = EXT3_BLOCKS_PER_GROUP(sb) / max(blocks_per_dir, BLOCK_COST);
312 if (max_debt * INODE_COST > inodes_per_group)
313 max_debt = inodes_per_group / INODE_COST;
314 if (max_debt > 255)
315 max_debt = 255;
316 if (max_debt == 0)
317 max_debt = 1;
318
319 for (i = 0; i < ngroups; i++) {
320 group = (parent_group + i) % ngroups;
321 desc = ext3_get_group_desc (sb, group, &bh);
322 if (!desc || !desc->bg_free_inodes_count)
323 continue;
324 if (le16_to_cpu(desc->bg_used_dirs_count) >= max_dirs)
325 continue;
326 if (le16_to_cpu(desc->bg_free_inodes_count) < min_inodes)
327 continue;
328 if (le16_to_cpu(desc->bg_free_blocks_count) < min_blocks)
329 continue;
330 return group;
331 }
332
333fallback:
334 for (i = 0; i < ngroups; i++) {
335 group = (parent_group + i) % ngroups;
336 desc = ext3_get_group_desc (sb, group, &bh);
337 if (!desc || !desc->bg_free_inodes_count)
338 continue;
339 if (le16_to_cpu(desc->bg_free_inodes_count) >= avefreei)
340 return group;
341 }
342
343 if (avefreei) {
344 /*
345 * The free-inodes counter is approximate, and for really small
346 * filesystems the above test can fail to find any blockgroups
347 */
348 avefreei = 0;
349 goto fallback;
350 }
351
352 return -1;
353}
354
355static int find_group_other(struct super_block *sb, struct inode *parent)
356{
357 int parent_group = EXT3_I(parent)->i_block_group;
358 int ngroups = EXT3_SB(sb)->s_groups_count;
359 struct ext3_group_desc *desc;
360 struct buffer_head *bh;
361 int group, i;
362
363 /*
364 * Try to place the inode in its parent directory
365 */
366 group = parent_group;
367 desc = ext3_get_group_desc (sb, group, &bh);
368 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
369 le16_to_cpu(desc->bg_free_blocks_count))
370 return group;
371
372 /*
373 * We're going to place this inode in a different blockgroup from its
374 * parent. We want to cause files in a common directory to all land in
375 * the same blockgroup. But we want files which are in a different
376 * directory which shares a blockgroup with our parent to land in a
377 * different blockgroup.
378 *
379 * So add our directory's i_ino into the starting point for the hash.
380 */
381 group = (group + parent->i_ino) % ngroups;
382
383 /*
384 * Use a quadratic hash to find a group with a free inode and some free
385 * blocks.
386 */
387 for (i = 1; i < ngroups; i <<= 1) {
388 group += i;
389 if (group >= ngroups)
390 group -= ngroups;
391 desc = ext3_get_group_desc (sb, group, &bh);
392 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
393 le16_to_cpu(desc->bg_free_blocks_count))
394 return group;
395 }
396
397 /*
398 * That failed: try linear search for a free inode, even if that group
399 * has no free blocks.
400 */
401 group = parent_group;
402 for (i = 0; i < ngroups; i++) {
403 if (++group >= ngroups)
404 group = 0;
405 desc = ext3_get_group_desc (sb, group, &bh);
406 if (desc && le16_to_cpu(desc->bg_free_inodes_count))
407 return group;
408 }
409
410 return -1;
411}
412
413/*
414 * There are two policies for allocating an inode. If the new inode is
415 * a directory, then a forward search is made for a block group with both
416 * free space and a low directory-to-inode ratio; if that fails, then of
417 * the groups with above-average free space, that group with the fewest
418 * directories already is chosen.
419 *
420 * For other inodes, search forward from the parent directory's block
421 * group to find a free inode.
422 */
423struct inode *ext3_new_inode(handle_t *handle, struct inode * dir, int mode)
424{
425 struct super_block *sb;
426 struct buffer_head *bitmap_bh = NULL;
427 struct buffer_head *bh2;
428 int group;
429 unsigned long ino = 0;
430 struct inode * inode;
431 struct ext3_group_desc * gdp = NULL;
432 struct ext3_super_block * es;
433 struct ext3_inode_info *ei;
434 struct ext3_sb_info *sbi;
435 int err = 0;
436 struct inode *ret;
437 int i;
438
439 /* Cannot create files in a deleted directory */
440 if (!dir || !dir->i_nlink)
441 return ERR_PTR(-EPERM);
442
443 sb = dir->i_sb;
444 inode = new_inode(sb);
445 if (!inode)
446 return ERR_PTR(-ENOMEM);
447 ei = EXT3_I(inode);
448
449 sbi = EXT3_SB(sb);
450 es = sbi->s_es;
451 if (S_ISDIR(mode)) {
452 if (test_opt (sb, OLDALLOC))
453 group = find_group_dir(sb, dir);
454 else
455 group = find_group_orlov(sb, dir);
456 } else
457 group = find_group_other(sb, dir);
458
459 err = -ENOSPC;
460 if (group == -1)
461 goto out;
462
463 for (i = 0; i < sbi->s_groups_count; i++) {
464 err = -EIO;
465
466 gdp = ext3_get_group_desc(sb, group, &bh2);
467 if (!gdp)
468 goto fail;
469
470 brelse(bitmap_bh);
471 bitmap_bh = read_inode_bitmap(sb, group);
472 if (!bitmap_bh)
473 goto fail;
474
475 ino = 0;
476
477repeat_in_this_group:
478 ino = ext3_find_next_zero_bit((unsigned long *)
479 bitmap_bh->b_data, EXT3_INODES_PER_GROUP(sb), ino);
480 if (ino < EXT3_INODES_PER_GROUP(sb)) {
481
482 BUFFER_TRACE(bitmap_bh, "get_write_access");
483 err = ext3_journal_get_write_access(handle, bitmap_bh);
484 if (err)
485 goto fail;
486
487 if (!ext3_set_bit_atomic(sb_bgl_lock(sbi, group),
488 ino, bitmap_bh->b_data)) {
489 /* we won it */
490 BUFFER_TRACE(bitmap_bh,
491 "call ext3_journal_dirty_metadata");
492 err = ext3_journal_dirty_metadata(handle,
493 bitmap_bh);
494 if (err)
495 goto fail;
496 goto got;
497 }
498 /* we lost it */
499 journal_release_buffer(handle, bitmap_bh);
500
501 if (++ino < EXT3_INODES_PER_GROUP(sb))
502 goto repeat_in_this_group;
503 }
504
505 /*
506 * This case is possible in concurrent environment. It is very
507 * rare. We cannot repeat the find_group_xxx() call because
508 * that will simply return the same blockgroup, because the
509 * group descriptor metadata has not yet been updated.
510 * So we just go onto the next blockgroup.
511 */
512 if (++group == sbi->s_groups_count)
513 group = 0;
514 }
515 err = -ENOSPC;
516 goto out;
517
518got:
519 ino += group * EXT3_INODES_PER_GROUP(sb) + 1;
520 if (ino < EXT3_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) {
521 ext3_error (sb, "ext3_new_inode",
522 "reserved inode or inode > inodes count - "
523 "block_group = %d, inode=%lu", group, ino);
524 err = -EIO;
525 goto fail;
526 }
527
528 BUFFER_TRACE(bh2, "get_write_access");
529 err = ext3_journal_get_write_access(handle, bh2);
530 if (err) goto fail;
531 spin_lock(sb_bgl_lock(sbi, group));
532 gdp->bg_free_inodes_count =
533 cpu_to_le16(le16_to_cpu(gdp->bg_free_inodes_count) - 1);
534 if (S_ISDIR(mode)) {
535 gdp->bg_used_dirs_count =
536 cpu_to_le16(le16_to_cpu(gdp->bg_used_dirs_count) + 1);
537 }
538 spin_unlock(sb_bgl_lock(sbi, group));
539 BUFFER_TRACE(bh2, "call ext3_journal_dirty_metadata");
540 err = ext3_journal_dirty_metadata(handle, bh2);
541 if (err) goto fail;
542
543 percpu_counter_dec(&sbi->s_freeinodes_counter);
544 if (S_ISDIR(mode))
545 percpu_counter_inc(&sbi->s_dirs_counter);
546 sb->s_dirt = 1;
547
548 inode->i_uid = current->fsuid;
549 if (test_opt (sb, GRPID))
550 inode->i_gid = dir->i_gid;
551 else if (dir->i_mode & S_ISGID) {
552 inode->i_gid = dir->i_gid;
553 if (S_ISDIR(mode))
554 mode |= S_ISGID;
555 } else
556 inode->i_gid = current->fsgid;
557 inode->i_mode = mode;
558
559 inode->i_ino = ino;
560 /* This is the optimal IO size (for stat), not the fs block size */
561 inode->i_blksize = PAGE_SIZE;
562 inode->i_blocks = 0;
563 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
564
565 memset(ei->i_data, 0, sizeof(ei->i_data));
566 ei->i_dir_start_lookup = 0;
567 ei->i_disksize = 0;
568
569 ei->i_flags = EXT3_I(dir)->i_flags & ~EXT3_INDEX_FL;
570 if (S_ISLNK(mode))
571 ei->i_flags &= ~(EXT3_IMMUTABLE_FL|EXT3_APPEND_FL);
572 /* dirsync only applies to directories */
573 if (!S_ISDIR(mode))
574 ei->i_flags &= ~EXT3_DIRSYNC_FL;
575#ifdef EXT3_FRAGMENTS
576 ei->i_faddr = 0;
577 ei->i_frag_no = 0;
578 ei->i_frag_size = 0;
579#endif
580 ei->i_file_acl = 0;
581 ei->i_dir_acl = 0;
582 ei->i_dtime = 0;
583 ei->i_block_alloc_info = NULL;
584 ei->i_block_group = group;
585
586 ext3_set_inode_flags(inode);
587 if (IS_DIRSYNC(inode))
588 handle->h_sync = 1;
589 insert_inode_hash(inode);
590 spin_lock(&sbi->s_next_gen_lock);
591 inode->i_generation = sbi->s_next_generation++;
592 spin_unlock(&sbi->s_next_gen_lock);
593
594 ei->i_state = EXT3_STATE_NEW;
595 ei->i_extra_isize =
596 (EXT3_INODE_SIZE(inode->i_sb) > EXT3_GOOD_OLD_INODE_SIZE) ?
597 sizeof(struct ext3_inode) - EXT3_GOOD_OLD_INODE_SIZE : 0;
598
599 ret = inode;
600 if(DQUOT_ALLOC_INODE(inode)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601 err = -EDQUOT;
Chris Sykesdc7b5fd2005-09-27 21:45:23 -0700602 goto fail_drop;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603 }
Chris Sykesdc7b5fd2005-09-27 21:45:23 -0700604
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605 err = ext3_init_acl(handle, inode, dir);
Chris Sykesdc7b5fd2005-09-27 21:45:23 -0700606 if (err)
607 goto fail_free_drop;
608
Stephen Smalleyac509602005-09-09 13:01:41 -0700609 err = ext3_init_security(handle,inode, dir);
Chris Sykesdc7b5fd2005-09-27 21:45:23 -0700610 if (err)
611 goto fail_free_drop;
612
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613 err = ext3_mark_inode_dirty(handle, inode);
614 if (err) {
615 ext3_std_error(sb, err);
Chris Sykesdc7b5fd2005-09-27 21:45:23 -0700616 goto fail_free_drop;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700617 }
618
619 ext3_debug("allocating inode %lu\n", inode->i_ino);
620 goto really_out;
621fail:
622 ext3_std_error(sb, err);
623out:
624 iput(inode);
625 ret = ERR_PTR(err);
626really_out:
627 brelse(bitmap_bh);
628 return ret;
629
Chris Sykesdc7b5fd2005-09-27 21:45:23 -0700630fail_free_drop:
631 DQUOT_FREE_INODE(inode);
632
633fail_drop:
634 DQUOT_DROP(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635 inode->i_flags |= S_NOQUOTA;
636 inode->i_nlink = 0;
637 iput(inode);
638 brelse(bitmap_bh);
639 return ERR_PTR(err);
640}
641
642/* Verify that we are loading a valid orphan from disk */
643struct inode *ext3_orphan_get(struct super_block *sb, unsigned long ino)
644{
645 unsigned long max_ino = le32_to_cpu(EXT3_SB(sb)->s_es->s_inodes_count);
646 unsigned long block_group;
647 int bit;
648 struct buffer_head *bitmap_bh = NULL;
649 struct inode *inode = NULL;
650
651 /* Error cases - e2fsck has already cleaned up for us */
652 if (ino > max_ino) {
653 ext3_warning(sb, __FUNCTION__,
Glauber de Oliveira Costa9f406682006-01-08 01:03:22 -0800654 "bad orphan ino %lu! e2fsck was run?", ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700655 goto out;
656 }
657
658 block_group = (ino - 1) / EXT3_INODES_PER_GROUP(sb);
659 bit = (ino - 1) % EXT3_INODES_PER_GROUP(sb);
660 bitmap_bh = read_inode_bitmap(sb, block_group);
661 if (!bitmap_bh) {
662 ext3_warning(sb, __FUNCTION__,
Glauber de Oliveira Costa9f406682006-01-08 01:03:22 -0800663 "inode bitmap error for orphan %lu", ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664 goto out;
665 }
666
667 /* Having the inode bit set should be a 100% indicator that this
668 * is a valid orphan (no e2fsck run on fs). Orphans also include
669 * inodes that were being truncated, so we can't check i_nlink==0.
670 */
671 if (!ext3_test_bit(bit, bitmap_bh->b_data) ||
672 !(inode = iget(sb, ino)) || is_bad_inode(inode) ||
673 NEXT_ORPHAN(inode) > max_ino) {
674 ext3_warning(sb, __FUNCTION__,
Glauber de Oliveira Costa9f406682006-01-08 01:03:22 -0800675 "bad orphan inode %lu! e2fsck was run?", ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700676 printk(KERN_NOTICE "ext3_test_bit(bit=%d, block=%llu) = %d\n",
677 bit, (unsigned long long)bitmap_bh->b_blocknr,
678 ext3_test_bit(bit, bitmap_bh->b_data));
679 printk(KERN_NOTICE "inode=%p\n", inode);
680 if (inode) {
681 printk(KERN_NOTICE "is_bad_inode(inode)=%d\n",
682 is_bad_inode(inode));
683 printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n",
684 NEXT_ORPHAN(inode));
685 printk(KERN_NOTICE "max_ino=%lu\n", max_ino);
686 }
687 /* Avoid freeing blocks if we got a bad deleted inode */
688 if (inode && inode->i_nlink == 0)
689 inode->i_blocks = 0;
690 iput(inode);
691 inode = NULL;
692 }
693out:
694 brelse(bitmap_bh);
695 return inode;
696}
697
698unsigned long ext3_count_free_inodes (struct super_block * sb)
699{
700 unsigned long desc_count;
701 struct ext3_group_desc *gdp;
702 int i;
703#ifdef EXT3FS_DEBUG
704 struct ext3_super_block *es;
705 unsigned long bitmap_count, x;
706 struct buffer_head *bitmap_bh = NULL;
707
Linus Torvalds1da177e2005-04-16 15:20:36 -0700708 es = EXT3_SB(sb)->s_es;
709 desc_count = 0;
710 bitmap_count = 0;
711 gdp = NULL;
712 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
713 gdp = ext3_get_group_desc (sb, i, NULL);
714 if (!gdp)
715 continue;
716 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
717 brelse(bitmap_bh);
718 bitmap_bh = read_inode_bitmap(sb, i);
719 if (!bitmap_bh)
720 continue;
721
722 x = ext3_count_free(bitmap_bh, EXT3_INODES_PER_GROUP(sb) / 8);
723 printk("group %d: stored = %d, counted = %lu\n",
724 i, le16_to_cpu(gdp->bg_free_inodes_count), x);
725 bitmap_count += x;
726 }
727 brelse(bitmap_bh);
728 printk("ext3_count_free_inodes: stored = %u, computed = %lu, %lu\n",
729 le32_to_cpu(es->s_free_inodes_count), desc_count, bitmap_count);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730 return desc_count;
731#else
732 desc_count = 0;
733 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
734 gdp = ext3_get_group_desc (sb, i, NULL);
735 if (!gdp)
736 continue;
737 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
738 cond_resched();
739 }
740 return desc_count;
741#endif
742}
743
744/* Called at mount-time, super-block is locked */
745unsigned long ext3_count_dirs (struct super_block * sb)
746{
747 unsigned long count = 0;
748 int i;
749
750 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
751 struct ext3_group_desc *gdp = ext3_get_group_desc (sb, i, NULL);
752 if (!gdp)
753 continue;
754 count += le16_to_cpu(gdp->bg_used_dirs_count);
755 }
756 return count;
757}
758