Blame view
fs/ext2/ialloc.c
18.3 KB
b24413180 License cleanup: ... |
1 |
// SPDX-License-Identifier: GPL-2.0 |
1da177e4c Linux-2.6.12-rc2 |
2 3 4 5 6 7 8 9 10 11 12 13 14 |
/* * linux/fs/ext2/ialloc.c * * Copyright (C) 1992, 1993, 1994, 1995 * Remy Card (card@masi.ibp.fr) * Laboratoire MASI - Institut Blaise Pascal * Universite Pierre et Marie Curie (Paris VI) * * BSD ufs-inspired inode and directory allocation by * Stephen Tweedie (sct@dcs.ed.ac.uk), 1993 * Big-endian to little-endian byte-swapping/bitmaps by * David S. Miller (davem@caip.rutgers.edu), 1995 */ |
1da177e4c Linux-2.6.12-rc2 |
15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 |
#include <linux/quotaops.h> #include <linux/sched.h> #include <linux/backing-dev.h> #include <linux/buffer_head.h> #include <linux/random.h> #include "ext2.h" #include "xattr.h" #include "acl.h" /* * ialloc.c contains the inodes allocation and deallocation routines */ /* * The free inodes are managed by bitmaps. A file system contains several * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap * block for inodes, N blocks for the inode table and data blocks. * * The file system contains group descriptors which are located after the * super block. Each descriptor contains the number of the bitmap block and * the free blocks count in the block. */ /* * Read the inode allocation bitmap for a given block_group, reading * into the specified slot in the superblock's bitmap cache. * * Return buffer_head of bitmap on success or NULL. */ static struct buffer_head * read_inode_bitmap(struct super_block * sb, unsigned long block_group) { struct ext2_group_desc *desc; struct buffer_head *bh = NULL; desc = ext2_get_group_desc(sb, block_group, NULL); if (!desc) goto error_out; bh = sb_bread(sb, le32_to_cpu(desc->bg_inode_bitmap)); if (!bh) ext2_error(sb, "read_inode_bitmap", "Cannot read inode bitmap - " "block_group = %lu, inode_bitmap = %u", block_group, le32_to_cpu(desc->bg_inode_bitmap)); error_out: return bh; } static void ext2_release_inode(struct super_block *sb, int group, int dir) { struct ext2_group_desc * desc; struct buffer_head *bh; desc = ext2_get_group_desc(sb, group, &bh); if (!desc) { ext2_error(sb, "ext2_release_inode", "can't get descriptor for group %d", group); return; } spin_lock(sb_bgl_lock(EXT2_SB(sb), group)); |
fba4d3997 ext2: le*_add_cpu... |
78 |
le16_add_cpu(&desc->bg_free_inodes_count, 1); |
1da177e4c Linux-2.6.12-rc2 |
79 |
if (dir) |
fba4d3997 ext2: le*_add_cpu... |
80 |
le16_add_cpu(&desc->bg_used_dirs_count, -1); |
1da177e4c Linux-2.6.12-rc2 |
81 82 83 |
spin_unlock(sb_bgl_lock(EXT2_SB(sb), group)); if (dir) percpu_counter_dec(&EXT2_SB(sb)->s_dirs_counter); |
1da177e4c Linux-2.6.12-rc2 |
84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 |
mark_buffer_dirty(bh); } /* * NOTE! When we get the inode, we're the only people * that have access to it, and as such there are no * race conditions we have to worry about. The inode * is not on the hash-lists, and it cannot be reached * through the filesystem because the directory entry * has been deleted earlier. * * HOWEVER: we must make sure that we get no aliases, * which means that we have to call "clear_inode()" * _before_ we mark the inode not in use in the inode * bitmaps. Otherwise a newly created file might use * the same inode number (not actually the same pointer * though), and then we'd have two inodes sharing the * same inode number and space on the harddisk. */ void ext2_free_inode (struct inode * inode) { struct super_block * sb = inode->i_sb; int is_directory; unsigned long ino; |
524e4a1d1 ext2: remove usel... |
108 |
struct buffer_head *bitmap_bh; |
1da177e4c Linux-2.6.12-rc2 |
109 110 111 112 113 114 115 116 117 118 119 120 |
unsigned long block_group; unsigned long bit; struct ext2_super_block * es; ino = inode->i_ino; ext2_debug ("freeing inode %lu ", ino); /* * Note: we must free any quota before locking the superblock, * as writing the quota to disk may need the lock as well. */ |
72edc4d08 merge ext2 delete... |
121 |
/* Quota is already initialized in iput() */ |
72edc4d08 merge ext2 delete... |
122 123 |
dquot_free_inode(inode); dquot_drop(inode); |
1da177e4c Linux-2.6.12-rc2 |
124 125 126 |
es = EXT2_SB(sb)->s_es; is_directory = S_ISDIR(inode->i_mode); |
1da177e4c Linux-2.6.12-rc2 |
127 128 129 130 |
if (ino < EXT2_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) { ext2_error (sb, "ext2_free_inode", "reserved or nonexistent inode %lu", ino); |
524e4a1d1 ext2: remove usel... |
131 |
return; |
1da177e4c Linux-2.6.12-rc2 |
132 133 134 |
} block_group = (ino - 1) / EXT2_INODES_PER_GROUP(sb); bit = (ino - 1) % EXT2_INODES_PER_GROUP(sb); |
1da177e4c Linux-2.6.12-rc2 |
135 136 |
bitmap_bh = read_inode_bitmap(sb, block_group); if (!bitmap_bh) |
524e4a1d1 ext2: remove usel... |
137 |
return; |
1da177e4c Linux-2.6.12-rc2 |
138 139 140 141 142 143 144 145 146 |
/* Ok, now we can actually update the inode bitmaps.. */ if (!ext2_clear_bit_atomic(sb_bgl_lock(EXT2_SB(sb), block_group), bit, (void *) bitmap_bh->b_data)) ext2_error (sb, "ext2_free_inode", "bit already cleared for inode %lu", ino); else ext2_release_inode(sb, block_group, is_directory); mark_buffer_dirty(bitmap_bh); |
1751e8a6c Rename superblock... |
147 |
if (sb->s_flags & SB_SYNCHRONOUS) |
1da177e4c Linux-2.6.12-rc2 |
148 |
sync_dirty_buffer(bitmap_bh); |
524e4a1d1 ext2: remove usel... |
149 |
|
1da177e4c Linux-2.6.12-rc2 |
150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 |
brelse(bitmap_bh); } /* * We perform asynchronous prereading of the new inode's inode block when * we create the inode, in the expectation that the inode will be written * back soon. There are two reasons: * * - When creating a large number of files, the async prereads will be * nicely merged into large reads * - When writing out a large number of inodes, we don't need to keep on * stalling the writes while we read the inode block. * * FIXME: ext2_get_group_desc() needs to be simplified. */ static void ext2_preread_inode(struct inode *inode) { unsigned long block_group; unsigned long offset; unsigned long block; |
1da177e4c Linux-2.6.12-rc2 |
170 171 |
struct ext2_group_desc * gdp; struct backing_dev_info *bdi; |
de1414a65 fs: export inode_... |
172 |
bdi = inode_to_bdi(inode); |
7f58351a7 ext2: code cleanu... |
173 |
if (bdi_rw_congested(bdi)) |
1da177e4c Linux-2.6.12-rc2 |
174 175 176 |
return; block_group = (inode->i_ino - 1) / EXT2_INODES_PER_GROUP(inode->i_sb); |
ef2fb6798 remove unused bh ... |
177 |
gdp = ext2_get_group_desc(inode->i_sb, block_group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 |
if (gdp == NULL) return; /* * Figure out the offset within the block group inode table */ offset = ((inode->i_ino - 1) % EXT2_INODES_PER_GROUP(inode->i_sb)) * EXT2_INODE_SIZE(inode->i_sb); block = le32_to_cpu(gdp->bg_inode_table) + (offset >> EXT2_BLOCK_SIZE_BITS(inode->i_sb)); sb_breadahead(inode->i_sb, block); } /* * There are two policies for allocating an inode. If the new inode is * a directory, then a forward search is made for a block group with both * free space and a low directory-to-inode ratio; if that fails, then of * the groups with above-average free space, that group with the fewest * directories already is chosen. * * For other inodes, search forward from the parent directory\'s block * group to find a free inode. */ static int find_group_dir(struct super_block *sb, struct inode *parent) { int ngroups = EXT2_SB(sb)->s_groups_count; int avefreei = ext2_count_free_inodes(sb) / ngroups; struct ext2_group_desc *desc, *best_desc = NULL; |
1da177e4c Linux-2.6.12-rc2 |
206 207 208 |
int group, best_group = -1; for (group = 0; group < ngroups; group++) { |
ef2fb6798 remove unused bh ... |
209 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
210 211 212 213 214 215 216 217 218 |
if (!desc || !desc->bg_free_inodes_count) continue; if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei) continue; if (!best_desc || (le16_to_cpu(desc->bg_free_blocks_count) > le16_to_cpu(best_desc->bg_free_blocks_count))) { best_group = group; best_desc = desc; |
1da177e4c Linux-2.6.12-rc2 |
219 220 |
} } |
1da177e4c Linux-2.6.12-rc2 |
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 |
return best_group; } /* * Orlov's allocator for directories. * * We always try to spread first-level directories. * * If there are blockgroups with both free inodes and free blocks counts * not worse than average we return one with smallest directory count. * Otherwise we simply return a random group. * * For the rest rules look so: * * It's OK to put directory into a group unless * it has too many directories already (max_dirs) or * it has too few free inodes left (min_inodes) or * it has too few free blocks left (min_blocks) or * it's already running too large debt (max_debt). |
1cc8dcf56 ext*: spelling fi... |
241 |
* Parent's group is preferred, if it doesn't satisfy these |
1da177e4c Linux-2.6.12-rc2 |
242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 |
* conditions we search cyclically through the rest. If none * of the groups look good we just look for a group with more * free inodes than average (starting at parent's group). * * Debt is incremented each time we allocate a directory and decremented * when we allocate an inode, within 0--255. */ #define INODE_COST 64 #define BLOCK_COST 256 static int find_group_orlov(struct super_block *sb, struct inode *parent) { int parent_group = EXT2_I(parent)->i_block_group; struct ext2_sb_info *sbi = EXT2_SB(sb); struct ext2_super_block *es = sbi->s_es; int ngroups = sbi->s_groups_count; int inodes_per_group = EXT2_INODES_PER_GROUP(sb); int freei; int avefreei; int free_blocks; int avefreeb; int blocks_per_dir; int ndirs; int max_debt, max_dirs, min_blocks, min_inodes; int group = -1, i; struct ext2_group_desc *desc; |
1da177e4c Linux-2.6.12-rc2 |
269 270 271 272 273 274 |
freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter); avefreei = freei / ngroups; free_blocks = percpu_counter_read_positive(&sbi->s_freeblocks_counter); avefreeb = free_blocks / ngroups; ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter); |
2b0143b5c VFS: normal files... |
275 |
if ((parent == d_inode(sb->s_root)) || |
1da177e4c Linux-2.6.12-rc2 |
276 277 |
(EXT2_I(parent)->i_flags & EXT2_TOPDIR_FL)) { struct ext2_group_desc *best_desc = NULL; |
1da177e4c Linux-2.6.12-rc2 |
278 279 |
int best_ndir = inodes_per_group; int best_group = -1; |
e878167af ext2/3: use prand... |
280 |
group = prandom_u32(); |
1da177e4c Linux-2.6.12-rc2 |
281 282 283 |
parent_group = (unsigned)group % ngroups; for (i = 0; i < ngroups; i++) { group = (parent_group + i) % ngroups; |
ef2fb6798 remove unused bh ... |
284 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
285 286 287 288 289 290 291 292 293 294 295 |
if (!desc || !desc->bg_free_inodes_count) continue; if (le16_to_cpu(desc->bg_used_dirs_count) >= best_ndir) continue; if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei) continue; if (le16_to_cpu(desc->bg_free_blocks_count) < avefreeb) continue; best_group = group; best_ndir = le16_to_cpu(desc->bg_used_dirs_count); best_desc = desc; |
1da177e4c Linux-2.6.12-rc2 |
296 297 298 |
} if (best_group >= 0) { desc = best_desc; |
1da177e4c Linux-2.6.12-rc2 |
299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 |
group = best_group; goto found; } goto fallback; } if (ndirs == 0) ndirs = 1; /* percpu_counters are approximate... */ blocks_per_dir = (le32_to_cpu(es->s_blocks_count)-free_blocks) / ndirs; max_dirs = ndirs / ngroups + inodes_per_group / 16; min_inodes = avefreei - inodes_per_group / 4; min_blocks = avefreeb - EXT2_BLOCKS_PER_GROUP(sb) / 4; max_debt = EXT2_BLOCKS_PER_GROUP(sb) / max(blocks_per_dir, BLOCK_COST); if (max_debt * INODE_COST > inodes_per_group) max_debt = inodes_per_group / INODE_COST; if (max_debt > 255) max_debt = 255; if (max_debt == 0) max_debt = 1; for (i = 0; i < ngroups; i++) { group = (parent_group + i) % ngroups; |
ef2fb6798 remove unused bh ... |
324 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 |
if (!desc || !desc->bg_free_inodes_count) continue; if (sbi->s_debts[group] >= max_debt) continue; if (le16_to_cpu(desc->bg_used_dirs_count) >= max_dirs) continue; if (le16_to_cpu(desc->bg_free_inodes_count) < min_inodes) continue; if (le16_to_cpu(desc->bg_free_blocks_count) < min_blocks) continue; goto found; } fallback: for (i = 0; i < ngroups; i++) { group = (parent_group + i) % ngroups; |
ef2fb6798 remove unused bh ... |
341 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 |
if (!desc || !desc->bg_free_inodes_count) continue; if (le16_to_cpu(desc->bg_free_inodes_count) >= avefreei) goto found; } if (avefreei) { /* * The free-inodes counter is approximate, and for really small * filesystems the above test can fail to find any blockgroups */ avefreei = 0; goto fallback; } return -1; found: return group; } static int find_group_other(struct super_block *sb, struct inode *parent) { int parent_group = EXT2_I(parent)->i_block_group; int ngroups = EXT2_SB(sb)->s_groups_count; struct ext2_group_desc *desc; |
1da177e4c Linux-2.6.12-rc2 |
368 369 370 371 372 373 |
int group, i; /* * Try to place the inode in its parent directory */ group = parent_group; |
ef2fb6798 remove unused bh ... |
374 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 |
if (desc && le16_to_cpu(desc->bg_free_inodes_count) && le16_to_cpu(desc->bg_free_blocks_count)) goto found; /* * We're going to place this inode in a different blockgroup from its * parent. We want to cause files in a common directory to all land in * the same blockgroup. But we want files which are in a different * directory which shares a blockgroup with our parent to land in a * different blockgroup. * * So add our directory's i_ino into the starting point for the hash. */ group = (group + parent->i_ino) % ngroups; /* * Use a quadratic hash to find a group with a free inode and some * free blocks. */ for (i = 1; i < ngroups; i <<= 1) { group += i; if (group >= ngroups) group -= ngroups; |
ef2fb6798 remove unused bh ... |
398 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
399 400 401 402 403 404 405 406 407 408 409 410 411 |
if (desc && le16_to_cpu(desc->bg_free_inodes_count) && le16_to_cpu(desc->bg_free_blocks_count)) goto found; } /* * That failed: try linear search for a free inode, even if that group * has no free blocks. */ group = parent_group; for (i = 0; i < ngroups; i++) { if (++group >= ngroups) group = 0; |
ef2fb6798 remove unused bh ... |
412 |
desc = ext2_get_group_desc (sb, group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
413 414 415 416 417 418 419 420 421 |
if (desc && le16_to_cpu(desc->bg_free_inodes_count)) goto found; } return -1; found: return group; } |
3ea40bc94 ext2: propagate u... |
422 |
struct inode *ext2_new_inode(struct inode *dir, umode_t mode, |
2a7dba391 fs/vfs/security: ... |
423 |
const struct qstr *qstr) |
1da177e4c Linux-2.6.12-rc2 |
424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 |
{ struct super_block *sb; struct buffer_head *bitmap_bh = NULL; struct buffer_head *bh2; int group, i; ino_t ino = 0; struct inode * inode; struct ext2_group_desc *gdp; struct ext2_super_block *es; struct ext2_inode_info *ei; struct ext2_sb_info *sbi; int err; sb = dir->i_sb; inode = new_inode(sb); if (!inode) return ERR_PTR(-ENOMEM); ei = EXT2_I(inode); sbi = EXT2_SB(sb); es = sbi->s_es; if (S_ISDIR(mode)) { if (test_opt(sb, OLDALLOC)) group = find_group_dir(sb, dir); else group = find_group_orlov(sb, dir); } else group = find_group_other(sb, dir); if (group == -1) { err = -ENOSPC; goto fail; } for (i = 0; i < sbi->s_groups_count; i++) { gdp = ext2_get_group_desc(sb, group, &bh2); |
f7a1c358e ext2: Check retur... |
460 461 462 463 464 |
if (!gdp) { if (++group == sbi->s_groups_count) group = 0; continue; } |
1da177e4c Linux-2.6.12-rc2 |
465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 |
brelse(bitmap_bh); bitmap_bh = read_inode_bitmap(sb, group); if (!bitmap_bh) { err = -EIO; goto fail; } ino = 0; repeat_in_this_group: ino = ext2_find_next_zero_bit((unsigned long *)bitmap_bh->b_data, EXT2_INODES_PER_GROUP(sb), ino); if (ino >= EXT2_INODES_PER_GROUP(sb)) { /* * Rare race: find_group_xx() decided that there were * free inodes in this group, but by the time we tried * to allocate one, they're all gone. This can also * occur because the counters which find_group_orlov() * uses are approximate. So just go and search the * next block group. */ if (++group == sbi->s_groups_count) group = 0; continue; } if (ext2_set_bit_atomic(sb_bgl_lock(sbi, group), ino, bitmap_bh->b_data)) { /* we lost this inode */ if (++ino >= EXT2_INODES_PER_GROUP(sb)) { /* this group is exhausted, try next group */ if (++group == sbi->s_groups_count) group = 0; continue; } /* try to find free inode in the same group */ goto repeat_in_this_group; } goto got; } /* * Scanned all blockgroups. */ |
dc1f73802 ext2: add missing... |
507 |
brelse(bitmap_bh); |
1da177e4c Linux-2.6.12-rc2 |
508 509 510 511 |
err = -ENOSPC; goto fail; got: mark_buffer_dirty(bitmap_bh); |
1751e8a6c Rename superblock... |
512 |
if (sb->s_flags & SB_SYNCHRONOUS) |
1da177e4c Linux-2.6.12-rc2 |
513 514 515 516 517 518 519 520 521 522 523 524 |
sync_dirty_buffer(bitmap_bh); brelse(bitmap_bh); ino += group * EXT2_INODES_PER_GROUP(sb) + 1; if (ino < EXT2_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) { ext2_error (sb, "ext2_new_inode", "reserved inode or inode > inodes count - " "block_group = %d,inode=%lu", group, (unsigned long) ino); err = -EIO; goto fail; } |
aa0dff2d0 lib: percpu_count... |
525 |
percpu_counter_add(&sbi->s_freeinodes_counter, -1); |
1da177e4c Linux-2.6.12-rc2 |
526 527 528 529 |
if (S_ISDIR(mode)) percpu_counter_inc(&sbi->s_dirs_counter); spin_lock(sb_bgl_lock(sbi, group)); |
fba4d3997 ext2: le*_add_cpu... |
530 |
le16_add_cpu(&gdp->bg_free_inodes_count, -1); |
1da177e4c Linux-2.6.12-rc2 |
531 532 533 |
if (S_ISDIR(mode)) { if (sbi->s_debts[group] < 255) sbi->s_debts[group]++; |
fba4d3997 ext2: le*_add_cpu... |
534 |
le16_add_cpu(&gdp->bg_used_dirs_count, 1); |
1da177e4c Linux-2.6.12-rc2 |
535 536 537 538 539 |
} else { if (sbi->s_debts[group]) sbi->s_debts[group]--; } spin_unlock(sb_bgl_lock(sbi, group)); |
1da177e4c Linux-2.6.12-rc2 |
540 |
mark_buffer_dirty(bh2); |
ffba102d7 ext2: replace ino... |
541 542 543 |
if (test_opt(sb, GRPID)) { inode->i_mode = mode; inode->i_uid = current_fsuid(); |
1da177e4c Linux-2.6.12-rc2 |
544 |
inode->i_gid = dir->i_gid; |
1da177e4c Linux-2.6.12-rc2 |
545 |
} else |
ffba102d7 ext2: replace ino... |
546 |
inode_init_owner(inode, dir, mode); |
1da177e4c Linux-2.6.12-rc2 |
547 548 |
inode->i_ino = ino; |
1da177e4c Linux-2.6.12-rc2 |
549 |
inode->i_blocks = 0; |
02027d42c fs: Replace CURRE... |
550 |
inode->i_mtime = inode->i_atime = inode->i_ctime = current_time(inode); |
1da177e4c Linux-2.6.12-rc2 |
551 |
memset(ei->i_data, 0, sizeof(ei->i_data)); |
ef8b64618 ext2: tighten res... |
552 553 |
ei->i_flags = ext2_mask_flags(mode, EXT2_I(dir)->i_flags & EXT2_FL_INHERITED); |
1da177e4c Linux-2.6.12-rc2 |
554 555 556 557 558 559 |
ei->i_faddr = 0; ei->i_frag_no = 0; ei->i_frag_size = 0; ei->i_file_acl = 0; ei->i_dir_acl = 0; ei->i_dtime = 0; |
a686cd898 ext2 reservations |
560 |
ei->i_block_alloc_info = NULL; |
1da177e4c Linux-2.6.12-rc2 |
561 |
ei->i_block_group = group; |
1da177e4c Linux-2.6.12-rc2 |
562 563 564 565 566 567 |
ei->i_dir_start_lookup = 0; ei->i_state = EXT2_STATE_NEW; ext2_set_inode_flags(inode); spin_lock(&sbi->s_next_gen_lock); inode->i_generation = sbi->s_next_generation++; spin_unlock(&sbi->s_next_gen_lock); |
41080b5a2 nfsd race fixes: ... |
568 |
if (insert_inode_locked(inode) < 0) { |
ef6919c28 ext2: Fix error h... |
569 570 571 572 573 |
ext2_error(sb, "ext2_new_inode", "inode number already in use - inode=%lu", (unsigned long) ino); err = -EIO; goto fail; |
41080b5a2 nfsd race fixes: ... |
574 |
} |
1da177e4c Linux-2.6.12-rc2 |
575 |
|
c2edb305d ext2: Handle erro... |
576 577 578 |
err = dquot_initialize(inode); if (err) goto fail_drop; |
63936ddaa dquot: cleanup in... |
579 580 |
err = dquot_alloc_inode(inode); if (err) |
9ed6c2fb3 [PATCH] Fix ext2_... |
581 |
goto fail_drop; |
9ed6c2fb3 [PATCH] Fix ext2_... |
582 |
|
1da177e4c Linux-2.6.12-rc2 |
583 |
err = ext2_init_acl(inode, dir); |
9ed6c2fb3 [PATCH] Fix ext2_... |
584 585 |
if (err) goto fail_free_drop; |
2a7dba391 fs/vfs/security: ... |
586 |
err = ext2_init_security(inode, dir, qstr); |
9ed6c2fb3 [PATCH] Fix ext2_... |
587 588 |
if (err) goto fail_free_drop; |
1da177e4c Linux-2.6.12-rc2 |
589 590 591 592 593 |
mark_inode_dirty(inode); ext2_debug("allocating inode %lu ", inode->i_ino); ext2_preread_inode(inode); return inode; |
9ed6c2fb3 [PATCH] Fix ext2_... |
594 |
fail_free_drop: |
63936ddaa dquot: cleanup in... |
595 |
dquot_free_inode(inode); |
9ed6c2fb3 [PATCH] Fix ext2_... |
596 597 |
fail_drop: |
9f7547580 dquot: cleanup dq... |
598 |
dquot_drop(inode); |
1da177e4c Linux-2.6.12-rc2 |
599 |
inode->i_flags |= S_NOQUOTA; |
6d6b77f16 filesystems: add ... |
600 |
clear_nlink(inode); |
2e5afe54e ext2: make sure t... |
601 |
discard_new_inode(inode); |
1da177e4c Linux-2.6.12-rc2 |
602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 |
return ERR_PTR(err); fail: make_bad_inode(inode); iput(inode); return ERR_PTR(err); } unsigned long ext2_count_free_inodes (struct super_block * sb) { struct ext2_group_desc *desc; unsigned long desc_count = 0; int i; #ifdef EXT2FS_DEBUG struct ext2_super_block *es; unsigned long bitmap_count = 0; struct buffer_head *bitmap_bh = NULL; |
1da177e4c Linux-2.6.12-rc2 |
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 |
es = EXT2_SB(sb)->s_es; for (i = 0; i < EXT2_SB(sb)->s_groups_count; i++) { unsigned x; desc = ext2_get_group_desc (sb, i, NULL); if (!desc) continue; desc_count += le16_to_cpu(desc->bg_free_inodes_count); brelse(bitmap_bh); bitmap_bh = read_inode_bitmap(sb, i); if (!bitmap_bh) continue; x = ext2_count_free(bitmap_bh, EXT2_INODES_PER_GROUP(sb) / 8); printk("group %d: stored = %d, counted = %u ", i, le16_to_cpu(desc->bg_free_inodes_count), x); bitmap_count += x; } brelse(bitmap_bh); printk("ext2_count_free_inodes: stored = %lu, computed = %lu, %lu ", |
ecd0afa3c ext2: use memweig... |
642 |
(unsigned long) |
1da177e4c Linux-2.6.12-rc2 |
643 644 |
percpu_counter_read(&EXT2_SB(sb)->s_freeinodes_counter), desc_count, bitmap_count); |
1da177e4c Linux-2.6.12-rc2 |
645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 |
return desc_count; #else for (i = 0; i < EXT2_SB(sb)->s_groups_count; i++) { desc = ext2_get_group_desc (sb, i, NULL); if (!desc) continue; desc_count += le16_to_cpu(desc->bg_free_inodes_count); } return desc_count; #endif } /* Called at mount-time, super-block is locked */ unsigned long ext2_count_dirs (struct super_block * sb) { unsigned long count = 0; int i; for (i = 0; i < EXT2_SB(sb)->s_groups_count; i++) { struct ext2_group_desc *gdp = ext2_get_group_desc (sb, i, NULL); if (!gdp) continue; count += le16_to_cpu(gdp->bg_used_dirs_count); } return count; } |