Blame view
fs/ext3/balloc.c
62.1 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 6 7 8 9 10 11 12 |
/* * linux/fs/ext3/balloc.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) * * Enhanced block allocation by Stephen Tweedie (sct@redhat.com), 1993 * Big-endian to little-endian byte-swapping/bitmaps by * David S. Miller (davem@caip.rutgers.edu), 1995 */ |
1da177e4c Linux-2.6.12-rc2 |
13 |
#include <linux/time.h> |
16f7e0fe2 [PATCH] capable/c... |
14 |
#include <linux/capability.h> |
1da177e4c Linux-2.6.12-rc2 |
15 |
#include <linux/fs.h> |
5a0e3ad6a include cleanup: ... |
16 |
#include <linux/slab.h> |
1da177e4c Linux-2.6.12-rc2 |
17 18 19 20 21 |
#include <linux/jbd.h> #include <linux/ext3_fs.h> #include <linux/ext3_jbd.h> #include <linux/quotaops.h> #include <linux/buffer_head.h> |
b853b96b1 ext3: Add batched... |
22 |
#include <linux/blkdev.h> |
785c4bcc0 ext3: Add fixed t... |
23 |
#include <trace/events/ext3.h> |
1da177e4c Linux-2.6.12-rc2 |
24 25 26 27 28 29 30 31 32 33 34 35 36 |
/* * balloc.c contains the blocks allocation and deallocation routines */ /* * The free blocks 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. The descriptors are loaded in memory |
e627432c2 [PATCH] ext[234]:... |
37 |
* when a file system is mounted (see ext3_fill_super). |
1da177e4c Linux-2.6.12-rc2 |
38 39 40 41 |
*/ #define in_range(b, first, len) ((b) >= (first) && (b) <= (first) + (len) - 1) |
b853b96b1 ext3: Add batched... |
42 43 44 45 46 47 48 49 50 51 52 53 54 55 |
/* * Calculate the block group number and offset, given a block number */ static void ext3_get_group_no_and_offset(struct super_block *sb, ext3_fsblk_t blocknr, unsigned long *blockgrpp, ext3_grpblk_t *offsetp) { struct ext3_super_block *es = EXT3_SB(sb)->s_es; blocknr = blocknr - le32_to_cpu(es->s_first_data_block); if (offsetp) *offsetp = blocknr % EXT3_BLOCKS_PER_GROUP(sb); if (blockgrpp) *blockgrpp = blocknr / EXT3_BLOCKS_PER_GROUP(sb); } |
36faadc14 [PATCH] ext3: mor... |
56 57 |
/** * ext3_get_group_desc() -- load group descriptor from disk |
e9ad5620b [PATCH] ext3: Mor... |
58 |
* @sb: super block |
36faadc14 [PATCH] ext3: mor... |
59 60 61 62 |
* @block_group: given block group * @bh: pointer to the buffer head to store the block * group descriptor */ |
1da177e4c Linux-2.6.12-rc2 |
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 |
struct ext3_group_desc * ext3_get_group_desc(struct super_block * sb, unsigned int block_group, struct buffer_head ** bh) { unsigned long group_desc; unsigned long offset; struct ext3_group_desc * desc; struct ext3_sb_info *sbi = EXT3_SB(sb); if (block_group >= sbi->s_groups_count) { ext3_error (sb, "ext3_get_group_desc", "block_group >= groups_count - " "block_group = %d, groups_count = %lu", block_group, sbi->s_groups_count); return NULL; } smp_rmb(); group_desc = block_group >> EXT3_DESC_PER_BLOCK_BITS(sb); offset = block_group & (EXT3_DESC_PER_BLOCK(sb) - 1); if (!sbi->s_group_desc[group_desc]) { ext3_error (sb, "ext3_get_group_desc", "Group descriptor not loaded - " "block_group = %d, group_desc = %lu, desc = %lu", block_group, group_desc, offset); return NULL; } desc = (struct ext3_group_desc *) sbi->s_group_desc[group_desc]->b_data; if (bh) *bh = sbi->s_group_desc[group_desc]; return desc + offset; } |
f762e9054 ext3: add block b... |
97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 |
static int ext3_valid_block_bitmap(struct super_block *sb, struct ext3_group_desc *desc, unsigned int block_group, struct buffer_head *bh) { ext3_grpblk_t offset; ext3_grpblk_t next_zero_bit; ext3_fsblk_t bitmap_blk; ext3_fsblk_t group_first_block; group_first_block = ext3_group_first_block_no(sb, block_group); /* check whether block bitmap block number is set */ bitmap_blk = le32_to_cpu(desc->bg_block_bitmap); offset = bitmap_blk - group_first_block; if (!ext3_test_bit(offset, bh->b_data)) /* bad block bitmap */ goto err_out; /* check whether the inode bitmap block number is set */ bitmap_blk = le32_to_cpu(desc->bg_inode_bitmap); offset = bitmap_blk - group_first_block; if (!ext3_test_bit(offset, bh->b_data)) /* bad block bitmap */ goto err_out; /* check whether the inode table block number is set */ bitmap_blk = le32_to_cpu(desc->bg_inode_table); offset = bitmap_blk - group_first_block; next_zero_bit = ext3_find_next_zero_bit(bh->b_data, offset + EXT3_SB(sb)->s_itb_per_group, offset); if (next_zero_bit >= offset + EXT3_SB(sb)->s_itb_per_group) /* good bitmap for inode tables */ return 1; err_out: |
e05b6b524 ext3: replace rem... |
134 |
ext3_error(sb, __func__, |
f762e9054 ext3: add block b... |
135 136 137 138 139 |
"Invalid block bitmap - " "block_group = %d, block = %lu", block_group, bitmap_blk); return 0; } |
36faadc14 [PATCH] ext3: mor... |
140 141 142 143 144 |
/** * read_block_bitmap() * @sb: super block * @block_group: given block group * |
f762e9054 ext3: add block b... |
145 146 |
* Read the bitmap for a given block_group,and validate the * bits for block/inode/inode tables are set in the bitmaps |
1da177e4c Linux-2.6.12-rc2 |
147 148 149 150 151 152 153 154 |
* * Return buffer_head on success or NULL in case of failure. */ static struct buffer_head * read_block_bitmap(struct super_block *sb, unsigned int block_group) { struct ext3_group_desc * desc; struct buffer_head * bh = NULL; |
f762e9054 ext3: add block b... |
155 |
ext3_fsblk_t bitmap_blk; |
1da177e4c Linux-2.6.12-rc2 |
156 |
|
f762e9054 ext3: add block b... |
157 |
desc = ext3_get_group_desc(sb, block_group, NULL); |
1da177e4c Linux-2.6.12-rc2 |
158 |
if (!desc) |
f762e9054 ext3: add block b... |
159 |
return NULL; |
785c4bcc0 ext3: Add fixed t... |
160 |
trace_ext3_read_block_bitmap(sb, block_group); |
f762e9054 ext3: add block b... |
161 162 163 |
bitmap_blk = le32_to_cpu(desc->bg_block_bitmap); bh = sb_getblk(sb, bitmap_blk); if (unlikely(!bh)) { |
e05b6b524 ext3: replace rem... |
164 |
ext3_error(sb, __func__, |
1da177e4c Linux-2.6.12-rc2 |
165 166 167 |
"Cannot read block bitmap - " "block_group = %d, block_bitmap = %u", block_group, le32_to_cpu(desc->bg_block_bitmap)); |
f762e9054 ext3: add block b... |
168 169 170 171 172 173 174 |
return NULL; } if (likely(bh_uptodate_or_lock(bh))) return bh; if (bh_submit_read(bh) < 0) { brelse(bh); |
e05b6b524 ext3: replace rem... |
175 |
ext3_error(sb, __func__, |
f762e9054 ext3: add block b... |
176 177 178 179 180 |
"Cannot read block bitmap - " "block_group = %d, block_bitmap = %u", block_group, le32_to_cpu(desc->bg_block_bitmap)); return NULL; } |
2588ef83f ext3: retry block... |
181 182 183 184 185 |
ext3_valid_block_bitmap(sb, desc, block_group, bh); /* * file system mounted not to panic on error, continue with corrupt * bitmap */ |
0b832a4b9 Revert "ext2/ext3... |
186 |
return bh; |
1da177e4c Linux-2.6.12-rc2 |
187 188 189 190 191 192 193 |
} /* * The reservation window structure operations * -------------------------------------------- * Operations include: * dump, find, add, remove, is_empty, find_next_reservable_window, etc. * |
36faadc14 [PATCH] ext3: mor... |
194 195 |
* We use a red-black tree to represent per-filesystem reservation * windows. |
1da177e4c Linux-2.6.12-rc2 |
196 |
* |
36faadc14 [PATCH] ext3: mor... |
197 198 199 200 201 202 203 204 205 206 207 |
*/ /** * __rsv_window_dump() -- Dump the filesystem block allocation reservation map * @rb_root: root of per-filesystem reservation rb tree * @verbose: verbose mode * @fn: function which wishes to dump the reservation map * * If verbose is turned on, it will print the whole block reservation * windows(start, end). Otherwise, it will only print out the "bad" windows, * those windows that overlap with their immediate neighbors. |
1da177e4c Linux-2.6.12-rc2 |
208 |
*/ |
321fb9e81 [PATCH] ext3: tur... |
209 |
#if 1 |
1da177e4c Linux-2.6.12-rc2 |
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 |
static void __rsv_window_dump(struct rb_root *root, int verbose, const char *fn) { struct rb_node *n; struct ext3_reserve_window_node *rsv, *prev; int bad; restart: n = rb_first(root); bad = 0; prev = NULL; printk("Block Allocation Reservation Windows Map (%s): ", fn); while (n) { |
c56d2561f [PATCH] ext3 ball... |
225 |
rsv = rb_entry(n, struct ext3_reserve_window_node, rsv_node); |
1da177e4c Linux-2.6.12-rc2 |
226 227 |
if (verbose) printk("reservation window 0x%p " |
321fb9e81 [PATCH] ext3: tur... |
228 229 |
"start: %lu, end: %lu ", |
1da177e4c Linux-2.6.12-rc2 |
230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 |
rsv, rsv->rsv_start, rsv->rsv_end); if (rsv->rsv_start && rsv->rsv_start >= rsv->rsv_end) { printk("Bad reservation %p (start >= end) ", rsv); bad = 1; } if (prev && prev->rsv_end >= rsv->rsv_start) { printk("Bad reservation %p (prev->end >= start) ", rsv); bad = 1; } if (bad) { if (!verbose) { printk("Restarting reservation walk in verbose mode "); verbose = 1; goto restart; } } n = rb_next(n); prev = rsv; } printk("Window map complete. "); |
269b26191 fs/ext3: use BUG_ON |
256 |
BUG_ON(bad); |
1da177e4c Linux-2.6.12-rc2 |
257 258 |
} #define rsv_window_dump(root, verbose) \ |
e05b6b524 ext3: replace rem... |
259 |
__rsv_window_dump((root), (verbose), __func__) |
1da177e4c Linux-2.6.12-rc2 |
260 261 262 |
#else #define rsv_window_dump(root, verbose) do {} while (0) #endif |
36faadc14 [PATCH] ext3: mor... |
263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 |
/** * goal_in_my_reservation() * @rsv: inode's reservation window * @grp_goal: given goal block relative to the allocation block group * @group: the current allocation block group * @sb: filesystem super block * * Test if the given goal block (group relative) is within the file's * own block reservation window range. * * If the reservation window is outside the goal allocation group, return 0; * grp_goal (given goal block) could be -1, which means no specific * goal block. In this case, always return 1. * If the goal block is within the reservation window, return 1; * otherwise, return 0; */ |
1da177e4c Linux-2.6.12-rc2 |
279 |
static int |
1c2bf374a [PATCH] ext3_fsbl... |
280 |
goal_in_my_reservation(struct ext3_reserve_window *rsv, ext3_grpblk_t grp_goal, |
1da177e4c Linux-2.6.12-rc2 |
281 282 |
unsigned int group, struct super_block * sb) { |
1c2bf374a [PATCH] ext3_fsbl... |
283 |
ext3_fsblk_t group_first_block, group_last_block; |
1da177e4c Linux-2.6.12-rc2 |
284 |
|
43d23f903 [PATCH] ext3_fsbl... |
285 |
group_first_block = ext3_group_first_block_no(sb, group); |
32c2d2bc4 [PATCH] more ext3... |
286 |
group_last_block = group_first_block + (EXT3_BLOCKS_PER_GROUP(sb) - 1); |
1da177e4c Linux-2.6.12-rc2 |
287 288 289 290 |
if ((rsv->_rsv_start > group_last_block) || (rsv->_rsv_end < group_first_block)) return 0; |
1c2bf374a [PATCH] ext3_fsbl... |
291 292 |
if ((grp_goal >= 0) && ((grp_goal + group_first_block < rsv->_rsv_start) || (grp_goal + group_first_block > rsv->_rsv_end))) |
1da177e4c Linux-2.6.12-rc2 |
293 294 295 |
return 0; return 1; } |
36faadc14 [PATCH] ext3: mor... |
296 297 298 299 300 |
/** * search_reserve_window() * @rb_root: root of reservation tree * @goal: target allocation block * |
1da177e4c Linux-2.6.12-rc2 |
301 302 303 304 305 |
* Find the reserved window which includes the goal, or the previous one * if the goal is not in any window. * Returns NULL if there are no windows or if all windows start after the goal. */ static struct ext3_reserve_window_node * |
1c2bf374a [PATCH] ext3_fsbl... |
306 |
search_reserve_window(struct rb_root *root, ext3_fsblk_t goal) |
1da177e4c Linux-2.6.12-rc2 |
307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 |
{ struct rb_node *n = root->rb_node; struct ext3_reserve_window_node *rsv; if (!n) return NULL; do { rsv = rb_entry(n, struct ext3_reserve_window_node, rsv_node); if (goal < rsv->rsv_start) n = n->rb_left; else if (goal > rsv->rsv_end) n = n->rb_right; else return rsv; } while (n); /* * We've fallen off the end of the tree: the goal wasn't inside * any particular node. OK, the previous node must be to one * side of the interval containing the goal. If it's the RHS, * we need to back up one. */ if (rsv->rsv_start > goal) { n = rb_prev(&rsv->rsv_node); rsv = rb_entry(n, struct ext3_reserve_window_node, rsv_node); } return rsv; } |
36faadc14 [PATCH] ext3: mor... |
336 337 338 339 340 341 342 |
/** * ext3_rsv_window_add() -- Insert a window to the block reservation rb tree. * @sb: super block * @rsv: reservation window to add * * Must be called with rsv_lock hold. */ |
1da177e4c Linux-2.6.12-rc2 |
343 344 345 346 347 |
void ext3_rsv_window_add(struct super_block *sb, struct ext3_reserve_window_node *rsv) { struct rb_root *root = &EXT3_SB(sb)->s_rsv_window_root; struct rb_node *node = &rsv->rsv_node; |
1c2bf374a [PATCH] ext3_fsbl... |
348 |
ext3_fsblk_t start = rsv->rsv_start; |
1da177e4c Linux-2.6.12-rc2 |
349 350 351 352 |
struct rb_node ** p = &root->rb_node; struct rb_node * parent = NULL; struct ext3_reserve_window_node *this; |
785c4bcc0 ext3: Add fixed t... |
353 |
trace_ext3_rsv_window_add(sb, rsv); |
1da177e4c Linux-2.6.12-rc2 |
354 355 356 357 358 359 360 361 362 |
while (*p) { parent = *p; this = rb_entry(parent, struct ext3_reserve_window_node, rsv_node); if (start < this->rsv_start) p = &(*p)->rb_left; else if (start > this->rsv_end) p = &(*p)->rb_right; |
321fb9e81 [PATCH] ext3: tur... |
363 364 |
else { rsv_window_dump(root, 1); |
1da177e4c Linux-2.6.12-rc2 |
365 |
BUG(); |
321fb9e81 [PATCH] ext3: tur... |
366 |
} |
1da177e4c Linux-2.6.12-rc2 |
367 368 369 370 371 |
} rb_link_node(node, parent, p); rb_insert_color(node, root); } |
36faadc14 [PATCH] ext3: mor... |
372 373 374 375 376 377 378 379 380 |
/** * ext3_rsv_window_remove() -- unlink a window from the reservation rb tree * @sb: super block * @rsv: reservation window to remove * * Mark the block reservation window as not allocated, and unlink it * from the filesystem reservation window rb tree. Must be called with * rsv_lock hold. */ |
1da177e4c Linux-2.6.12-rc2 |
381 382 383 384 385 386 387 388 |
static void rsv_window_remove(struct super_block *sb, struct ext3_reserve_window_node *rsv) { rsv->rsv_start = EXT3_RESERVE_WINDOW_NOT_ALLOCATED; rsv->rsv_end = EXT3_RESERVE_WINDOW_NOT_ALLOCATED; rsv->rsv_alloc_hit = 0; rb_erase(&rsv->rsv_node, &EXT3_SB(sb)->s_rsv_window_root); } |
36faadc14 [PATCH] ext3: mor... |
389 390 391 392 393 394 |
/* * rsv_is_empty() -- Check if the reservation window is allocated. * @rsv: given reservation window to check * * returns 1 if the end block is EXT3_RESERVE_WINDOW_NOT_ALLOCATED. */ |
1da177e4c Linux-2.6.12-rc2 |
395 396 397 |
static inline int rsv_is_empty(struct ext3_reserve_window *rsv) { /* a valid reservation end block could not be 0 */ |
36faadc14 [PATCH] ext3: mor... |
398 |
return rsv->_rsv_end == EXT3_RESERVE_WINDOW_NOT_ALLOCATED; |
1da177e4c Linux-2.6.12-rc2 |
399 |
} |
36faadc14 [PATCH] ext3: mor... |
400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 |
/** * ext3_init_block_alloc_info() * @inode: file inode structure * * Allocate and initialize the reservation window structure, and * link the window to the ext3 inode structure at last * * The reservation window structure is only dynamically allocated * and linked to ext3 inode the first time the open file * needs a new block. So, before every ext3_new_block(s) call, for * regular files, we should check whether the reservation window * structure exists or not. In the latter case, this function is called. * Fail to do so will result in block reservation being turned off for that * open file. * * This function is called from ext3_get_blocks_handle(), also called * when setting the reservation window size through ioctl before the file * is open for write (needs block allocation). * * Needs truncate_mutex protection prior to call this function. */ |
1da177e4c Linux-2.6.12-rc2 |
422 423 424 |
void ext3_init_block_alloc_info(struct inode *inode) { struct ext3_inode_info *ei = EXT3_I(inode); |
46130222d fs/ext3/balloc.c:... |
425 |
struct ext3_block_alloc_info *block_i; |
1da177e4c Linux-2.6.12-rc2 |
426 427 428 429 430 431 432 433 |
struct super_block *sb = inode->i_sb; block_i = kmalloc(sizeof(*block_i), GFP_NOFS); if (block_i) { struct ext3_reserve_window_node *rsv = &block_i->rsv_window_node; rsv->rsv_start = EXT3_RESERVE_WINDOW_NOT_ALLOCATED; rsv->rsv_end = EXT3_RESERVE_WINDOW_NOT_ALLOCATED; |
e9ad5620b [PATCH] ext3: Mor... |
434 |
/* |
1da177e4c Linux-2.6.12-rc2 |
435 436 437 438 439 440 441 442 443 444 445 446 447 448 |
* if filesystem is mounted with NORESERVATION, the goal * reservation window size is set to zero to indicate * block reservation is off */ if (!test_opt(sb, RESERVATION)) rsv->rsv_goal_size = 0; else rsv->rsv_goal_size = EXT3_DEFAULT_RESERVE_BLOCKS; rsv->rsv_alloc_hit = 0; block_i->last_alloc_logical_block = 0; block_i->last_alloc_physical_block = 0; } ei->i_block_alloc_info = block_i; } |
36faadc14 [PATCH] ext3: mor... |
449 450 451 452 453 454 455 456 457 458 459 460 461 |
/** * ext3_discard_reservation() * @inode: inode * * Discard(free) block reservation window on last file close, or truncate * or at last iput(). * * It is being called in three cases: * ext3_release_file(): last writer close the file * ext3_clear_inode(): last iput(), when nobody link to this file. * ext3_truncate(): when the block indirect map is about to change. * */ |
1da177e4c Linux-2.6.12-rc2 |
462 463 464 465 466 467 468 469 470 471 472 473 474 |
void ext3_discard_reservation(struct inode *inode) { struct ext3_inode_info *ei = EXT3_I(inode); struct ext3_block_alloc_info *block_i = ei->i_block_alloc_info; struct ext3_reserve_window_node *rsv; spinlock_t *rsv_lock = &EXT3_SB(inode->i_sb)->s_rsv_window_lock; if (!block_i) return; rsv = &block_i->rsv_window_node; if (!rsv_is_empty(&rsv->rsv_window)) { spin_lock(rsv_lock); |
785c4bcc0 ext3: Add fixed t... |
475 476 |
if (!rsv_is_empty(&rsv->rsv_window)) { trace_ext3_discard_reservation(inode, rsv); |
1da177e4c Linux-2.6.12-rc2 |
477 |
rsv_window_remove(inode->i_sb, rsv); |
785c4bcc0 ext3: Add fixed t... |
478 |
} |
1da177e4c Linux-2.6.12-rc2 |
479 480 481 |
spin_unlock(rsv_lock); } } |
36faadc14 [PATCH] ext3: mor... |
482 483 484 485 486 487 488 489 |
/** * ext3_free_blocks_sb() -- Free given blocks and update quota * @handle: handle to this transaction * @sb: super block * @block: start physcial block to free * @count: number of blocks to free * @pdquot_freed_blocks: pointer to quota */ |
1da177e4c Linux-2.6.12-rc2 |
490 |
void ext3_free_blocks_sb(handle_t *handle, struct super_block *sb, |
1c2bf374a [PATCH] ext3_fsbl... |
491 492 |
ext3_fsblk_t block, unsigned long count, unsigned long *pdquot_freed_blocks) |
1da177e4c Linux-2.6.12-rc2 |
493 494 495 496 |
{ struct buffer_head *bitmap_bh = NULL; struct buffer_head *gd_bh; unsigned long block_group; |
1c2bf374a [PATCH] ext3_fsbl... |
497 |
ext3_grpblk_t bit; |
1da177e4c Linux-2.6.12-rc2 |
498 499 500 501 502 503 |
unsigned long i; unsigned long overflow; struct ext3_group_desc * desc; struct ext3_super_block * es; struct ext3_sb_info *sbi; int err = 0, ret; |
1c2bf374a [PATCH] ext3_fsbl... |
504 |
ext3_grpblk_t group_freed; |
1da177e4c Linux-2.6.12-rc2 |
505 506 507 508 509 510 511 512 513 |
*pdquot_freed_blocks = 0; sbi = EXT3_SB(sb); es = sbi->s_es; if (block < le32_to_cpu(es->s_first_data_block) || block + count < block || block + count > le32_to_cpu(es->s_blocks_count)) { ext3_error (sb, "ext3_free_blocks", "Freeing blocks not in datazone - " |
1c2bf374a [PATCH] ext3_fsbl... |
514 |
"block = "E3FSBLK", count = %lu", block, count); |
1da177e4c Linux-2.6.12-rc2 |
515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 |
goto error_return; } ext3_debug ("freeing block(s) %lu-%lu ", block, block + count - 1); do_more: overflow = 0; block_group = (block - le32_to_cpu(es->s_first_data_block)) / EXT3_BLOCKS_PER_GROUP(sb); bit = (block - le32_to_cpu(es->s_first_data_block)) % EXT3_BLOCKS_PER_GROUP(sb); /* * Check to see if we are freeing blocks across a group * boundary. */ if (bit + count > EXT3_BLOCKS_PER_GROUP(sb)) { overflow = bit + count - EXT3_BLOCKS_PER_GROUP(sb); count -= overflow; } brelse(bitmap_bh); bitmap_bh = read_block_bitmap(sb, block_group); if (!bitmap_bh) goto error_return; desc = ext3_get_group_desc (sb, block_group, &gd_bh); if (!desc) goto error_return; if (in_range (le32_to_cpu(desc->bg_block_bitmap), block, count) || in_range (le32_to_cpu(desc->bg_inode_bitmap), block, count) || in_range (block, le32_to_cpu(desc->bg_inode_table), sbi->s_itb_per_group) || in_range (block + count - 1, le32_to_cpu(desc->bg_inode_table), |
feda58d37 ext3: return afte... |
548 |
sbi->s_itb_per_group)) { |
1da177e4c Linux-2.6.12-rc2 |
549 550 |
ext3_error (sb, "ext3_free_blocks", "Freeing blocks in system zones - " |
1c2bf374a [PATCH] ext3_fsbl... |
551 |
"Block = "E3FSBLK", count = %lu", |
1da177e4c Linux-2.6.12-rc2 |
552 |
block, count); |
feda58d37 ext3: return afte... |
553 554 |
goto error_return; } |
1da177e4c Linux-2.6.12-rc2 |
555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 |
/* * We are about to start releasing blocks in the bitmap, * so we need undo access. */ /* @@@ check errors */ BUFFER_TRACE(bitmap_bh, "getting undo access"); err = ext3_journal_get_undo_access(handle, bitmap_bh); if (err) goto error_return; /* * We are about to modify some metadata. Call the journal APIs * to unshare ->b_data if a currently-committing transaction is * using it */ BUFFER_TRACE(gd_bh, "get_write_access"); err = ext3_journal_get_write_access(handle, gd_bh); if (err) goto error_return; jbd_lock_bh_state(bitmap_bh); for (i = 0, group_freed = 0; i < count; i++) { /* * An HJ special. This is expensive... */ #ifdef CONFIG_JBD_DEBUG jbd_unlock_bh_state(bitmap_bh); { struct buffer_head *debug_bh; debug_bh = sb_find_get_block(sb, block + i); if (debug_bh) { BUFFER_TRACE(debug_bh, "Deleted!"); if (!bh2jh(bitmap_bh)->b_committed_data) BUFFER_TRACE(debug_bh, |
25985edce Fix common misspe... |
591 |
"No committed data in bitmap"); |
1da177e4c Linux-2.6.12-rc2 |
592 593 594 595 596 597 598 599 600 601 602 603 604 |
BUFFER_TRACE2(debug_bh, bitmap_bh, "bitmap"); __brelse(debug_bh); } } jbd_lock_bh_state(bitmap_bh); #endif if (need_resched()) { jbd_unlock_bh_state(bitmap_bh); cond_resched(); jbd_lock_bh_state(bitmap_bh); } /* @@@ This prevents newly-allocated data from being * freed and then reallocated within the same |
ae6ddcc5f [PATCH] ext3 and ... |
605 606 |
* transaction. * |
1da177e4c Linux-2.6.12-rc2 |
607 608 609 610 611 612 613 614 615 616 617 618 |
* Ideally we would want to allow that to happen, but to * do so requires making journal_forget() capable of * revoking the queued write of a data block, which * implies blocking on the journal lock. *forget() * cannot block due to truncate races. * * Eventually we can fix this by making journal_forget() * return a status indicating whether or not it was able * to revoke the buffer. On successful revoke, it is * safe not to set the allocation bit in the committed * bitmap, because we know that there is no outstanding * activity on the buffer any more and so it is safe to |
ae6ddcc5f [PATCH] ext3 and ... |
619 |
* reallocate it. |
1da177e4c Linux-2.6.12-rc2 |
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 |
*/ BUFFER_TRACE(bitmap_bh, "set in b_committed_data"); J_ASSERT_BH(bitmap_bh, bh2jh(bitmap_bh)->b_committed_data != NULL); ext3_set_bit_atomic(sb_bgl_lock(sbi, block_group), bit + i, bh2jh(bitmap_bh)->b_committed_data); /* * We clear the bit in the bitmap after setting the committed * data bit, because this is the reverse order to that which * the allocator uses. */ BUFFER_TRACE(bitmap_bh, "clear bit"); if (!ext3_clear_bit_atomic(sb_bgl_lock(sbi, block_group), bit + i, bitmap_bh->b_data)) { jbd_unlock_bh_state(bitmap_bh); |
e05b6b524 ext3: replace rem... |
636 |
ext3_error(sb, __func__, |
1c2bf374a [PATCH] ext3_fsbl... |
637 638 |
"bit already cleared for block "E3FSBLK, block + i); |
1da177e4c Linux-2.6.12-rc2 |
639 640 641 642 643 644 645 646 647 |
jbd_lock_bh_state(bitmap_bh); BUFFER_TRACE(bitmap_bh, "bit already cleared"); } else { group_freed++; } } jbd_unlock_bh_state(bitmap_bh); spin_lock(sb_bgl_lock(sbi, block_group)); |
50e8a2890 ext3: replace all... |
648 |
le16_add_cpu(&desc->bg_free_blocks_count, group_freed); |
1da177e4c Linux-2.6.12-rc2 |
649 |
spin_unlock(sb_bgl_lock(sbi, block_group)); |
aa0dff2d0 lib: percpu_count... |
650 |
percpu_counter_add(&sbi->s_freeblocks_counter, count); |
1da177e4c Linux-2.6.12-rc2 |
651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 |
/* We dirtied the bitmap block */ BUFFER_TRACE(bitmap_bh, "dirtied bitmap block"); err = ext3_journal_dirty_metadata(handle, bitmap_bh); /* And the group descriptor block */ BUFFER_TRACE(gd_bh, "dirtied group descriptor block"); ret = ext3_journal_dirty_metadata(handle, gd_bh); if (!err) err = ret; *pdquot_freed_blocks += group_freed; if (overflow && !err) { block += count; count = overflow; goto do_more; } |
ca41f7b91 ext3: remove ->wr... |
667 |
|
1da177e4c Linux-2.6.12-rc2 |
668 669 670 671 672 |
error_return: brelse(bitmap_bh); ext3_std_error(sb, err); return; } |
36faadc14 [PATCH] ext3: mor... |
673 674 675 676 677 678 679 |
/** * ext3_free_blocks() -- Free given blocks and update quota * @handle: handle for this transaction * @inode: inode * @block: start physical block to free * @count: number of blocks to count */ |
1da177e4c Linux-2.6.12-rc2 |
680 |
void ext3_free_blocks(handle_t *handle, struct inode *inode, |
1c2bf374a [PATCH] ext3_fsbl... |
681 |
ext3_fsblk_t block, unsigned long count) |
1da177e4c Linux-2.6.12-rc2 |
682 |
{ |
785c4bcc0 ext3: Add fixed t... |
683 |
struct super_block *sb = inode->i_sb; |
1c2bf374a [PATCH] ext3_fsbl... |
684 |
unsigned long dquot_freed_blocks; |
1da177e4c Linux-2.6.12-rc2 |
685 |
|
785c4bcc0 ext3: Add fixed t... |
686 |
trace_ext3_free_blocks(inode, block, count); |
1da177e4c Linux-2.6.12-rc2 |
687 688 |
ext3_free_blocks_sb(handle, sb, block, count, &dquot_freed_blocks); if (dquot_freed_blocks) |
5dd4056db dquot: cleanup sp... |
689 |
dquot_free_block(inode, dquot_freed_blocks); |
1da177e4c Linux-2.6.12-rc2 |
690 691 |
return; } |
36faadc14 [PATCH] ext3: mor... |
692 693 694 695 696 |
/** * ext3_test_allocatable() * @nr: given allocation block group * @bh: bufferhead contains the bitmap of the given block group * |
1da177e4c Linux-2.6.12-rc2 |
697 698 699 700 701 702 703 704 705 |
* For ext3 allocations, we must not reuse any blocks which are * allocated in the bitmap buffer's "last committed data" copy. This * prevents deletes from freeing up the page for reuse until we have * committed the delete transaction. * * If we didn't do this, then deleting something and reallocating it as * data would allow the old block to be overwritten before the * transaction committed (because we force data to disk before commit). * This would lead to corruption if we crashed between overwriting the |
ae6ddcc5f [PATCH] ext3 and ... |
706 |
* data and committing the delete. |
1da177e4c Linux-2.6.12-rc2 |
707 708 709 710 711 |
* * @@@ We may want to make this allocation behaviour conditional on * data-writes at some point, and disable it for metadata allocations or * sync-data inodes. */ |
1c2bf374a [PATCH] ext3_fsbl... |
712 |
static int ext3_test_allocatable(ext3_grpblk_t nr, struct buffer_head *bh) |
1da177e4c Linux-2.6.12-rc2 |
713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 |
{ int ret; struct journal_head *jh = bh2jh(bh); if (ext3_test_bit(nr, bh->b_data)) return 0; jbd_lock_bh_state(bh); if (!jh->b_committed_data) ret = 1; else ret = !ext3_test_bit(nr, jh->b_committed_data); jbd_unlock_bh_state(bh); return ret; } |
36faadc14 [PATCH] ext3: mor... |
728 729 730 731 732 733 734 735 736 737 |
/** * bitmap_search_next_usable_block() * @start: the starting block (group relative) of the search * @bh: bufferhead contains the block group bitmap * @maxblocks: the ending block (group relative) of the reservation * * The bitmap search --- search forward alternately through the actual * bitmap on disk and the last-committed copy in journal, until we find a * bit free in both bitmaps. */ |
1c2bf374a [PATCH] ext3_fsbl... |
738 739 740 |
static ext3_grpblk_t bitmap_search_next_usable_block(ext3_grpblk_t start, struct buffer_head *bh, ext3_grpblk_t maxblocks) |
1da177e4c Linux-2.6.12-rc2 |
741 |
{ |
1c2bf374a [PATCH] ext3_fsbl... |
742 |
ext3_grpblk_t next; |
1da177e4c Linux-2.6.12-rc2 |
743 |
struct journal_head *jh = bh2jh(bh); |
1da177e4c Linux-2.6.12-rc2 |
744 745 746 747 748 749 750 751 752 |
while (start < maxblocks) { next = ext3_find_next_zero_bit(bh->b_data, maxblocks, start); if (next >= maxblocks) return -1; if (ext3_test_allocatable(next, bh)) return next; jbd_lock_bh_state(bh); if (jh->b_committed_data) start = ext3_find_next_zero_bit(jh->b_committed_data, |
e9ad5620b [PATCH] ext3: Mor... |
753 |
maxblocks, next); |
1da177e4c Linux-2.6.12-rc2 |
754 755 756 757 |
jbd_unlock_bh_state(bh); } return -1; } |
36faadc14 [PATCH] ext3: mor... |
758 759 760 761 762 763 764 765 |
/** * find_next_usable_block() * @start: the starting block (group relative) to find next * allocatable block in bitmap. * @bh: bufferhead contains the block group bitmap * @maxblocks: the ending block (group relative) for the search * * Find an allocatable block in a bitmap. We honor both the bitmap and |
1da177e4c Linux-2.6.12-rc2 |
766 767 768 769 770 |
* its last-committed copy (if that exists), and perform the "most * appropriate allocation" algorithm of looking for a free block near * the initial goal; then for a free byte somewhere in the bitmap; then * for any free bit in the bitmap. */ |
1c2bf374a [PATCH] ext3_fsbl... |
771 772 773 |
static ext3_grpblk_t find_next_usable_block(ext3_grpblk_t start, struct buffer_head *bh, ext3_grpblk_t maxblocks) |
1da177e4c Linux-2.6.12-rc2 |
774 |
{ |
1c2bf374a [PATCH] ext3_fsbl... |
775 |
ext3_grpblk_t here, next; |
1da177e4c Linux-2.6.12-rc2 |
776 777 778 779 |
char *p, *r; if (start > 0) { /* |
ae6ddcc5f [PATCH] ext3 and ... |
780 |
* The goal was occupied; search forward for a free |
1da177e4c Linux-2.6.12-rc2 |
781 782 783 784 785 786 |
* block within the next XX blocks. * * end_goal is more or less random, but it has to be * less than EXT3_BLOCKS_PER_GROUP. Aligning up to the * next 64-bit boundary is simple.. */ |
1c2bf374a [PATCH] ext3_fsbl... |
787 |
ext3_grpblk_t end_goal = (start + 63) & ~63; |
1da177e4c Linux-2.6.12-rc2 |
788 789 790 791 792 793 794 795 796 797 798 799 |
if (end_goal > maxblocks) end_goal = maxblocks; here = ext3_find_next_zero_bit(bh->b_data, end_goal, start); if (here < end_goal && ext3_test_allocatable(here, bh)) return here; ext3_debug("Bit not found near goal "); } here = start; if (here < 0) here = 0; |
57e94d864 ext3: Remove unne... |
800 |
p = bh->b_data + (here >> 3); |
7d1c520bb [PATCH] ext3 ball... |
801 |
r = memscan(p, 0, ((maxblocks + 7) >> 3) - (here >> 3)); |
57e94d864 ext3: Remove unne... |
802 |
next = (r - bh->b_data) << 3; |
1da177e4c Linux-2.6.12-rc2 |
803 804 805 806 807 808 809 810 811 812 813 814 |
if (next < maxblocks && next >= start && ext3_test_allocatable(next, bh)) return next; /* * The bitmap search --- search forward alternately through the actual * bitmap and the last-committed copy until we find a bit free in * both */ here = bitmap_search_next_usable_block(here, bh, maxblocks); return here; } |
36faadc14 [PATCH] ext3: mor... |
815 816 |
/** * claim_block() |
a4c18ad2e ext3: Update kern... |
817 |
* @lock: the spin lock for this block group |
36faadc14 [PATCH] ext3: mor... |
818 |
* @block: the free block (group relative) to allocate |
a4c18ad2e ext3: Update kern... |
819 |
* @bh: the buffer_head contains the block group bitmap |
36faadc14 [PATCH] ext3: mor... |
820 |
* |
1da177e4c Linux-2.6.12-rc2 |
821 822 823 824 825 826 827 |
* We think we can allocate this block in this bitmap. Try to set the bit. * If that succeeds then check that nobody has allocated and then freed the * block since we saw that is was not marked in b_committed_data. If it _was_ * allocated and freed then clear the bit in the bitmap again and return * zero (failure). */ static inline int |
1c2bf374a [PATCH] ext3_fsbl... |
828 |
claim_block(spinlock_t *lock, ext3_grpblk_t block, struct buffer_head *bh) |
1da177e4c Linux-2.6.12-rc2 |
829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 |
{ struct journal_head *jh = bh2jh(bh); int ret; if (ext3_set_bit_atomic(lock, block, bh->b_data)) return 0; jbd_lock_bh_state(bh); if (jh->b_committed_data && ext3_test_bit(block,jh->b_committed_data)) { ext3_clear_bit_atomic(lock, block, bh->b_data); ret = 0; } else { ret = 1; } jbd_unlock_bh_state(bh); return ret; } |
36faadc14 [PATCH] ext3: mor... |
845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 |
/** * ext3_try_to_allocate() * @sb: superblock * @handle: handle to this transaction * @group: given allocation block group * @bitmap_bh: bufferhead holds the block bitmap * @grp_goal: given target block within the group * @count: target number of blocks to allocate * @my_rsv: reservation window * * Attempt to allocate blocks within a give range. Set the range of allocation * first, then find the first free bit(s) from the bitmap (within the range), * and at last, allocate the blocks by claiming the found free bit as allocated. * * To set the range of this allocation: |
e9ad5620b [PATCH] ext3: Mor... |
860 |
* if there is a reservation window, only try to allocate block(s) from the |
36faadc14 [PATCH] ext3: mor... |
861 862 |
* file's own reservation window; * Otherwise, the allocation range starts from the give goal block, ends at |
e9ad5620b [PATCH] ext3: Mor... |
863 |
* the block group's last block. |
36faadc14 [PATCH] ext3: mor... |
864 |
* |
1da177e4c Linux-2.6.12-rc2 |
865 866 867 868 |
* If we failed to allocate the desired block then we may end up crossing to a * new bitmap. In that case we must release write access to the old one via * ext3_journal_release_buffer(), else we'll run out of credits. */ |
1c2bf374a [PATCH] ext3_fsbl... |
869 |
static ext3_grpblk_t |
1da177e4c Linux-2.6.12-rc2 |
870 |
ext3_try_to_allocate(struct super_block *sb, handle_t *handle, int group, |
1c2bf374a [PATCH] ext3_fsbl... |
871 |
struct buffer_head *bitmap_bh, ext3_grpblk_t grp_goal, |
b54e41ec1 [PATCH] ext3_get_... |
872 |
unsigned long *count, struct ext3_reserve_window *my_rsv) |
1da177e4c Linux-2.6.12-rc2 |
873 |
{ |
1c2bf374a [PATCH] ext3_fsbl... |
874 875 |
ext3_fsblk_t group_first_block; ext3_grpblk_t start, end; |
b54e41ec1 [PATCH] ext3_get_... |
876 |
unsigned long num = 0; |
1da177e4c Linux-2.6.12-rc2 |
877 878 879 |
/* we do allocation within the reservation window if we have a window */ if (my_rsv) { |
43d23f903 [PATCH] ext3_fsbl... |
880 |
group_first_block = ext3_group_first_block_no(sb, group); |
1da177e4c Linux-2.6.12-rc2 |
881 882 883 884 885 886 887 888 889 |
if (my_rsv->_rsv_start >= group_first_block) start = my_rsv->_rsv_start - group_first_block; else /* reservation window cross group boundary */ start = 0; end = my_rsv->_rsv_end - group_first_block + 1; if (end > EXT3_BLOCKS_PER_GROUP(sb)) /* reservation window crosses group boundary */ end = EXT3_BLOCKS_PER_GROUP(sb); |
1c2bf374a [PATCH] ext3_fsbl... |
890 891 |
if ((start <= grp_goal) && (grp_goal < end)) start = grp_goal; |
1da177e4c Linux-2.6.12-rc2 |
892 |
else |
1c2bf374a [PATCH] ext3_fsbl... |
893 |
grp_goal = -1; |
1da177e4c Linux-2.6.12-rc2 |
894 |
} else { |
1c2bf374a [PATCH] ext3_fsbl... |
895 896 |
if (grp_goal > 0) start = grp_goal; |
1da177e4c Linux-2.6.12-rc2 |
897 898 899 900 901 902 903 904 |
else start = 0; end = EXT3_BLOCKS_PER_GROUP(sb); } BUG_ON(start > EXT3_BLOCKS_PER_GROUP(sb)); repeat: |
1c2bf374a [PATCH] ext3_fsbl... |
905 906 907 |
if (grp_goal < 0 || !ext3_test_allocatable(grp_goal, bitmap_bh)) { grp_goal = find_next_usable_block(start, bitmap_bh, end); if (grp_goal < 0) |
1da177e4c Linux-2.6.12-rc2 |
908 909 910 |
goto fail_access; if (!my_rsv) { int i; |
1c2bf374a [PATCH] ext3_fsbl... |
911 912 |
for (i = 0; i < 7 && grp_goal > start && ext3_test_allocatable(grp_goal - 1, |
1da177e4c Linux-2.6.12-rc2 |
913 |
bitmap_bh); |
1c2bf374a [PATCH] ext3_fsbl... |
914 |
i++, grp_goal--) |
1da177e4c Linux-2.6.12-rc2 |
915 916 917 |
; } } |
1c2bf374a [PATCH] ext3_fsbl... |
918 |
start = grp_goal; |
1da177e4c Linux-2.6.12-rc2 |
919 |
|
36faadc14 [PATCH] ext3: mor... |
920 921 |
if (!claim_block(sb_bgl_lock(EXT3_SB(sb), group), grp_goal, bitmap_bh)) { |
1da177e4c Linux-2.6.12-rc2 |
922 923 924 925 926 |
/* * The block was allocated by another thread, or it was * allocated and then freed by another thread */ start++; |
1c2bf374a [PATCH] ext3_fsbl... |
927 |
grp_goal++; |
1da177e4c Linux-2.6.12-rc2 |
928 929 930 931 |
if (start >= end) goto fail_access; goto repeat; } |
b54e41ec1 [PATCH] ext3_get_... |
932 |
num++; |
1c2bf374a [PATCH] ext3_fsbl... |
933 934 935 |
grp_goal++; while (num < *count && grp_goal < end && ext3_test_allocatable(grp_goal, bitmap_bh) |
36faadc14 [PATCH] ext3: mor... |
936 937 |
&& claim_block(sb_bgl_lock(EXT3_SB(sb), group), grp_goal, bitmap_bh)) { |
b54e41ec1 [PATCH] ext3_get_... |
938 |
num++; |
1c2bf374a [PATCH] ext3_fsbl... |
939 |
grp_goal++; |
b54e41ec1 [PATCH] ext3_get_... |
940 941 |
} *count = num; |
1c2bf374a [PATCH] ext3_fsbl... |
942 |
return grp_goal - num; |
1da177e4c Linux-2.6.12-rc2 |
943 |
fail_access: |
b54e41ec1 [PATCH] ext3_get_... |
944 |
*count = num; |
1da177e4c Linux-2.6.12-rc2 |
945 946 947 948 |
return -1; } /** |
e9ad5620b [PATCH] ext3: Mor... |
949 |
* find_next_reservable_window(): |
1da177e4c Linux-2.6.12-rc2 |
950 951 952 953 |
* find a reservable space within the given range. * It does not allocate the reservation window for now: * alloc_new_reservation() will do the work later. * |
e9ad5620b [PATCH] ext3: Mor... |
954 |
* @search_head: the head of the searching list; |
1da177e4c Linux-2.6.12-rc2 |
955 956 957 958 959 960 961 |
* This is not necessarily the list head of the whole filesystem * * We have both head and start_block to assist the search * for the reservable space. The list starts from head, * but we will shift to the place where start_block is, * then start from there, when looking for a reservable space. * |
a4c18ad2e ext3: Update kern... |
962 |
* @my_rsv: the reservation window |
1da177e4c Linux-2.6.12-rc2 |
963 |
* |
a4c18ad2e ext3: Update kern... |
964 965 966 |
* @sb: the super block * * @start_block: the first block we consider to start |
1da177e4c Linux-2.6.12-rc2 |
967 968 |
* the real search from * |
e9ad5620b [PATCH] ext3: Mor... |
969 |
* @last_block: |
1da177e4c Linux-2.6.12-rc2 |
970 971 972 973 974 975 976 |
* the maximum block number that our goal reservable space * could start from. This is normally the last block in this * group. The search will end when we found the start of next * possible reservable space is out of this boundary. * This could handle the cross boundary reservation window * request. * |
e9ad5620b [PATCH] ext3: Mor... |
977 978 979 980 |
* basically we search from the given range, rather than the whole * reservation double linked list, (start_block, last_block) * to find a free region that is of my size and has not * been reserved. |
1da177e4c Linux-2.6.12-rc2 |
981 |
* |
1da177e4c Linux-2.6.12-rc2 |
982 |
*/ |
21fe3471c [PATCH] ext3: red... |
983 |
static int find_next_reservable_window( |
1da177e4c Linux-2.6.12-rc2 |
984 |
struct ext3_reserve_window_node *search_head, |
21fe3471c [PATCH] ext3: red... |
985 |
struct ext3_reserve_window_node *my_rsv, |
1c2bf374a [PATCH] ext3_fsbl... |
986 987 988 |
struct super_block * sb, ext3_fsblk_t start_block, ext3_fsblk_t last_block) |
1da177e4c Linux-2.6.12-rc2 |
989 990 991 |
{ struct rb_node *next; struct ext3_reserve_window_node *rsv, *prev; |
1c2bf374a [PATCH] ext3_fsbl... |
992 |
ext3_fsblk_t cur; |
21fe3471c [PATCH] ext3: red... |
993 |
int size = my_rsv->rsv_goal_size; |
1da177e4c Linux-2.6.12-rc2 |
994 995 996 |
/* TODO: make the start of the reservation window byte-aligned */ /* cur = *start_block & ~7;*/ |
21fe3471c [PATCH] ext3: red... |
997 |
cur = start_block; |
1da177e4c Linux-2.6.12-rc2 |
998 999 |
rsv = search_head; if (!rsv) |
21fe3471c [PATCH] ext3: red... |
1000 |
return -1; |
1da177e4c Linux-2.6.12-rc2 |
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 |
while (1) { if (cur <= rsv->rsv_end) cur = rsv->rsv_end + 1; /* TODO? * in the case we could not find a reservable space * that is what is expected, during the re-search, we could * remember what's the largest reservable space we could have * and return that one. * * For now it will fail if we could not find the reservable * space with expected-size (or more)... */ if (cur > last_block) |
21fe3471c [PATCH] ext3: red... |
1016 |
return -1; /* fail */ |
1da177e4c Linux-2.6.12-rc2 |
1017 1018 1019 |
prev = rsv; next = rb_next(&rsv->rsv_node); |
c56d2561f [PATCH] ext3 ball... |
1020 |
rsv = rb_entry(next,struct ext3_reserve_window_node,rsv_node); |
1da177e4c Linux-2.6.12-rc2 |
1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 |
/* * Reached the last reservation, we can just append to the * previous one. */ if (!next) break; if (cur + size <= rsv->rsv_start) { /* * Found a reserveable space big enough. We could * have a reservation across the group boundary here |
e9ad5620b [PATCH] ext3: Mor... |
1033 |
*/ |
1da177e4c Linux-2.6.12-rc2 |
1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 |
break; } } /* * we come here either : * when we reach the end of the whole list, * and there is empty reservable space after last entry in the list. * append it to the end of the list. * * or we found one reservable space in the middle of the list, * return the reservation window that we could append to. * succeed. */ |
21fe3471c [PATCH] ext3: red... |
1047 1048 1049 1050 1051 |
if ((prev != my_rsv) && (!rsv_is_empty(&my_rsv->rsv_window))) rsv_window_remove(sb, my_rsv); /* |
25985edce Fix common misspe... |
1052 |
* Let's book the whole available window for now. We will check the |
21fe3471c [PATCH] ext3: red... |
1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 |
* disk bitmap later and then, if there are free blocks then we adjust * the window size if it's larger than requested. * Otherwise, we will remove this node from the tree next time * call find_next_reservable_window. */ my_rsv->rsv_start = cur; my_rsv->rsv_end = cur + size - 1; my_rsv->rsv_alloc_hit = 0; if (prev != my_rsv) ext3_rsv_window_add(sb, my_rsv); return 0; |
1da177e4c Linux-2.6.12-rc2 |
1066 1067 1068 |
} /** |
e9ad5620b [PATCH] ext3: Mor... |
1069 |
* alloc_new_reservation()--allocate a new reservation window |
1da177e4c Linux-2.6.12-rc2 |
1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 |
* * To make a new reservation, we search part of the filesystem * reservation list (the list that inside the group). We try to * allocate a new reservation window near the allocation goal, * or the beginning of the group, if there is no goal. * * We first find a reservable space after the goal, then from * there, we check the bitmap for the first free block after * it. If there is no free block until the end of group, then the * whole group is full, we failed. Otherwise, check if the free * block is inside the expected reservable space, if so, we * succeed. * If the first free block is outside the reservable space, then * start from the first free block, we search for next available * space, and go on. * * on succeed, a new reservation will be found and inserted into the list * It contains at least one free block, and it does not overlap with other * reservation windows. * * failed: we failed to find a reservation window in this group * |
a4c18ad2e ext3: Update kern... |
1092 |
* @my_rsv: the reservation window |
1da177e4c Linux-2.6.12-rc2 |
1093 |
* |
1c2bf374a [PATCH] ext3_fsbl... |
1094 |
* @grp_goal: The goal (group-relative). It is where the search for a |
1da177e4c Linux-2.6.12-rc2 |
1095 |
* free reservable space should start from. |
1c2bf374a [PATCH] ext3_fsbl... |
1096 1097 |
* if we have a grp_goal(grp_goal >0 ), then start from there, * no grp_goal(grp_goal = -1), we start from the first block |
1da177e4c Linux-2.6.12-rc2 |
1098 1099 1100 1101 1102 |
* of the group. * * @sb: the super block * @group: the group we are trying to allocate in * @bitmap_bh: the block group block bitmap |
21fe3471c [PATCH] ext3: red... |
1103 |
* |
1da177e4c Linux-2.6.12-rc2 |
1104 1105 |
*/ static int alloc_new_reservation(struct ext3_reserve_window_node *my_rsv, |
1c2bf374a [PATCH] ext3_fsbl... |
1106 |
ext3_grpblk_t grp_goal, struct super_block *sb, |
1da177e4c Linux-2.6.12-rc2 |
1107 1108 1109 |
unsigned int group, struct buffer_head *bitmap_bh) { struct ext3_reserve_window_node *search_head; |
1c2bf374a [PATCH] ext3_fsbl... |
1110 1111 |
ext3_fsblk_t group_first_block, group_end_block, start_block; ext3_grpblk_t first_free_block; |
1da177e4c Linux-2.6.12-rc2 |
1112 1113 |
struct rb_root *fs_rsv_root = &EXT3_SB(sb)->s_rsv_window_root; unsigned long size; |
21fe3471c [PATCH] ext3: red... |
1114 1115 |
int ret; spinlock_t *rsv_lock = &EXT3_SB(sb)->s_rsv_window_lock; |
1da177e4c Linux-2.6.12-rc2 |
1116 |
|
43d23f903 [PATCH] ext3_fsbl... |
1117 |
group_first_block = ext3_group_first_block_no(sb, group); |
32c2d2bc4 [PATCH] more ext3... |
1118 |
group_end_block = group_first_block + (EXT3_BLOCKS_PER_GROUP(sb) - 1); |
1da177e4c Linux-2.6.12-rc2 |
1119 |
|
1c2bf374a [PATCH] ext3_fsbl... |
1120 |
if (grp_goal < 0) |
1da177e4c Linux-2.6.12-rc2 |
1121 1122 |
start_block = group_first_block; else |
1c2bf374a [PATCH] ext3_fsbl... |
1123 |
start_block = grp_goal + group_first_block; |
1da177e4c Linux-2.6.12-rc2 |
1124 |
|
785c4bcc0 ext3: Add fixed t... |
1125 |
trace_ext3_alloc_new_reservation(sb, start_block); |
1da177e4c Linux-2.6.12-rc2 |
1126 |
size = my_rsv->rsv_goal_size; |
21fe3471c [PATCH] ext3: red... |
1127 |
|
1da177e4c Linux-2.6.12-rc2 |
1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 |
if (!rsv_is_empty(&my_rsv->rsv_window)) { /* * if the old reservation is cross group boundary * and if the goal is inside the old reservation window, * we will come here when we just failed to allocate from * the first part of the window. We still have another part * that belongs to the next group. In this case, there is no * point to discard our window and try to allocate a new one * in this group(which will fail). we should * keep the reservation window, just simply move on. * * Maybe we could shift the start block of the reservation * window to the first block of next group. */ if ((my_rsv->rsv_start <= group_end_block) && (my_rsv->rsv_end > group_end_block) && (start_block >= my_rsv->rsv_start)) return -1; if ((my_rsv->rsv_alloc_hit > (my_rsv->rsv_end - my_rsv->rsv_start + 1) / 2)) { /* |
36faadc14 [PATCH] ext3: mor... |
1151 1152 1153 1154 |
* if the previously allocation hit ratio is * greater than 1/2, then we double the size of * the reservation window the next time, * otherwise we keep the same size window |
1da177e4c Linux-2.6.12-rc2 |
1155 1156 1157 1158 1159 1160 1161 |
*/ size = size * 2; if (size > EXT3_MAX_RESERVE_BLOCKS) size = EXT3_MAX_RESERVE_BLOCKS; my_rsv->rsv_goal_size= size; } } |
21fe3471c [PATCH] ext3: red... |
1162 1163 |
spin_lock(rsv_lock); |
1da177e4c Linux-2.6.12-rc2 |
1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 |
/* * shift the search start to the window near the goal block */ search_head = search_reserve_window(fs_rsv_root, start_block); /* * find_next_reservable_window() simply finds a reservable window * inside the given range(start_block, group_end_block). * * To make sure the reservation window has a free bit inside it, we * need to check the bitmap after we found a reservable window. */ retry: |
21fe3471c [PATCH] ext3: red... |
1177 1178 1179 1180 1181 1182 1183 1184 1185 |
ret = find_next_reservable_window(search_head, my_rsv, sb, start_block, group_end_block); if (ret == -1) { if (!rsv_is_empty(&my_rsv->rsv_window)) rsv_window_remove(sb, my_rsv); spin_unlock(rsv_lock); return -1; } |
1da177e4c Linux-2.6.12-rc2 |
1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 |
/* * On success, find_next_reservable_window() returns the * reservation window where there is a reservable space after it. * Before we reserve this reservable space, we need * to make sure there is at least a free block inside this region. * * searching the first free bit on the block bitmap and copy of * last committed bitmap alternatively, until we found a allocatable * block. Search start from the start block of the reservable space * we just found. */ |
21fe3471c [PATCH] ext3: red... |
1197 |
spin_unlock(rsv_lock); |
1da177e4c Linux-2.6.12-rc2 |
1198 |
first_free_block = bitmap_search_next_usable_block( |
21fe3471c [PATCH] ext3: red... |
1199 |
my_rsv->rsv_start - group_first_block, |
1da177e4c Linux-2.6.12-rc2 |
1200 1201 1202 1203 1204 1205 1206 |
bitmap_bh, group_end_block - group_first_block + 1); if (first_free_block < 0) { /* * no free block left on the bitmap, no point * to reserve the space. return failed. */ |
21fe3471c [PATCH] ext3: red... |
1207 1208 1209 1210 1211 |
spin_lock(rsv_lock); if (!rsv_is_empty(&my_rsv->rsv_window)) rsv_window_remove(sb, my_rsv); spin_unlock(rsv_lock); return -1; /* failed */ |
1da177e4c Linux-2.6.12-rc2 |
1212 |
} |
21fe3471c [PATCH] ext3: red... |
1213 |
|
1da177e4c Linux-2.6.12-rc2 |
1214 1215 1216 |
start_block = first_free_block + group_first_block; /* * check if the first free block is within the |
21fe3471c [PATCH] ext3: red... |
1217 |
* free space we just reserved |
1da177e4c Linux-2.6.12-rc2 |
1218 |
*/ |
785c4bcc0 ext3: Add fixed t... |
1219 1220 1221 |
if (start_block >= my_rsv->rsv_start && start_block <= my_rsv->rsv_end) { trace_ext3_reserved(sb, start_block, my_rsv); |
21fe3471c [PATCH] ext3: red... |
1222 |
return 0; /* success */ |
785c4bcc0 ext3: Add fixed t... |
1223 |
} |
1da177e4c Linux-2.6.12-rc2 |
1224 1225 |
/* * if the first free bit we found is out of the reservable space |
21fe3471c [PATCH] ext3: red... |
1226 |
* continue search for next reservable space, |
1da177e4c Linux-2.6.12-rc2 |
1227 1228 1229 |
* start from where the free block is, * we also shift the list head to where we stopped last time */ |
21fe3471c [PATCH] ext3: red... |
1230 1231 |
search_head = my_rsv; spin_lock(rsv_lock); |
1da177e4c Linux-2.6.12-rc2 |
1232 |
goto retry; |
1da177e4c Linux-2.6.12-rc2 |
1233 |
} |
36faadc14 [PATCH] ext3: mor... |
1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 |
/** * try_to_extend_reservation() * @my_rsv: given reservation window * @sb: super block * @size: the delta to extend * * Attempt to expand the reservation window large enough to have * required number of free blocks * * Since ext3_try_to_allocate() will always allocate blocks within * the reservation window range, if the window size is too small, * multiple blocks allocation has to stop at the end of the reservation * window. To make this more efficient, given the total number of * blocks needed and the current size of the window, we try to * expand the reservation window size if necessary on a best-effort * basis before ext3_new_blocks() tries to allocate blocks, */ |
d48589bfa [PATCH] ext3_get_... |
1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 |
static void try_to_extend_reservation(struct ext3_reserve_window_node *my_rsv, struct super_block *sb, int size) { struct ext3_reserve_window_node *next_rsv; struct rb_node *next; spinlock_t *rsv_lock = &EXT3_SB(sb)->s_rsv_window_lock; if (!spin_trylock(rsv_lock)) return; next = rb_next(&my_rsv->rsv_node); if (!next) my_rsv->rsv_end += size; else { |
c56d2561f [PATCH] ext3 ball... |
1266 |
next_rsv = rb_entry(next, struct ext3_reserve_window_node, rsv_node); |
d48589bfa [PATCH] ext3_get_... |
1267 1268 1269 1270 1271 1272 1273 1274 |
if ((next_rsv->rsv_start - my_rsv->rsv_end - 1) >= size) my_rsv->rsv_end += size; else my_rsv->rsv_end = next_rsv->rsv_start - 1; } spin_unlock(rsv_lock); } |
36faadc14 [PATCH] ext3: mor... |
1275 1276 1277 1278 1279 1280 1281 |
/** * ext3_try_to_allocate_with_rsv() * @sb: superblock * @handle: handle to this transaction * @group: given allocation block group * @bitmap_bh: bufferhead holds the block bitmap * @grp_goal: given target block within the group |
36faadc14 [PATCH] ext3: mor... |
1282 |
* @my_rsv: reservation window |
a4c18ad2e ext3: Update kern... |
1283 |
* @count: target number of blocks to allocate |
36faadc14 [PATCH] ext3: mor... |
1284 1285 |
* @errp: pointer to store the error code * |
1da177e4c Linux-2.6.12-rc2 |
1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 |
* This is the main function used to allocate a new block and its reservation * window. * * Each time when a new block allocation is need, first try to allocate from * its own reservation. If it does not have a reservation window, instead of * looking for a free bit on bitmap first, then look up the reservation list to * see if it is inside somebody else's reservation window, we try to allocate a * reservation window for it starting from the goal first. Then do the block * allocation within the reservation window. * * This will avoid keeping on searching the reservation list again and |
5b1168792 [PATCH] Locking p... |
1297 |
* again when somebody is looking for a free block (without |
1da177e4c Linux-2.6.12-rc2 |
1298 1299 1300 |
* reservation), and there are lots of free blocks, but they are all * being reserved. * |
36faadc14 [PATCH] ext3: mor... |
1301 |
* We use a red-black tree for the per-filesystem reservation list. |
1da177e4c Linux-2.6.12-rc2 |
1302 1303 |
* */ |
1c2bf374a [PATCH] ext3_fsbl... |
1304 |
static ext3_grpblk_t |
1da177e4c Linux-2.6.12-rc2 |
1305 1306 |
ext3_try_to_allocate_with_rsv(struct super_block *sb, handle_t *handle, unsigned int group, struct buffer_head *bitmap_bh, |
1c2bf374a [PATCH] ext3_fsbl... |
1307 1308 |
ext3_grpblk_t grp_goal, struct ext3_reserve_window_node * my_rsv, |
b54e41ec1 [PATCH] ext3_get_... |
1309 |
unsigned long *count, int *errp) |
1da177e4c Linux-2.6.12-rc2 |
1310 |
{ |
32c2d2bc4 [PATCH] more ext3... |
1311 |
ext3_fsblk_t group_first_block, group_last_block; |
1c2bf374a [PATCH] ext3_fsbl... |
1312 |
ext3_grpblk_t ret = 0; |
1da177e4c Linux-2.6.12-rc2 |
1313 |
int fatal; |
b54e41ec1 [PATCH] ext3_get_... |
1314 |
unsigned long num = *count; |
1da177e4c Linux-2.6.12-rc2 |
1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 |
*errp = 0; /* * Make sure we use undo access for the bitmap, because it is critical * that we do the frozen_data COW on bitmap buffers in all cases even * if the buffer is in BJ_Forget state in the committing transaction. */ BUFFER_TRACE(bitmap_bh, "get undo access for new block"); fatal = ext3_journal_get_undo_access(handle, bitmap_bh); if (fatal) { *errp = fatal; return -1; } /* * we don't deal with reservation when * filesystem is mounted without reservation * or the file is not a regular file * or last attempt to allocate a block with reservation turned on failed */ if (my_rsv == NULL ) { |
b54e41ec1 [PATCH] ext3_get_... |
1337 |
ret = ext3_try_to_allocate(sb, handle, group, bitmap_bh, |
1c2bf374a [PATCH] ext3_fsbl... |
1338 |
grp_goal, count, NULL); |
1da177e4c Linux-2.6.12-rc2 |
1339 1340 |
goto out; } |
1da177e4c Linux-2.6.12-rc2 |
1341 |
/* |
1c2bf374a [PATCH] ext3_fsbl... |
1342 |
* grp_goal is a group relative block number (if there is a goal) |
165024232 [PATCH] ext3 ball... |
1343 |
* 0 <= grp_goal < EXT3_BLOCKS_PER_GROUP(sb) |
1da177e4c Linux-2.6.12-rc2 |
1344 1345 1346 |
* first block is a filesystem wide block number * first block is the block number of the first block in this group */ |
43d23f903 [PATCH] ext3_fsbl... |
1347 |
group_first_block = ext3_group_first_block_no(sb, group); |
32c2d2bc4 [PATCH] more ext3... |
1348 |
group_last_block = group_first_block + (EXT3_BLOCKS_PER_GROUP(sb) - 1); |
1da177e4c Linux-2.6.12-rc2 |
1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 |
/* * Basically we will allocate a new block from inode's reservation * window. * * We need to allocate a new reservation window, if: * a) inode does not have a reservation window; or * b) last attempt to allocate a block from existing reservation * failed; or * c) we come here with a goal and with a reservation window * * We do not need to allocate a new reservation window if we come here * at the beginning with a goal and the goal is inside the window, or * we don't have a goal but already have a reservation window. * then we could go to allocate from the reservation window directly. */ while (1) { |
21fe3471c [PATCH] ext3: red... |
1366 |
if (rsv_is_empty(&my_rsv->rsv_window) || (ret < 0) || |
36faadc14 [PATCH] ext3: mor... |
1367 1368 |
!goal_in_my_reservation(&my_rsv->rsv_window, grp_goal, group, sb)) { |
d48589bfa [PATCH] ext3_get_... |
1369 1370 |
if (my_rsv->rsv_goal_size < *count) my_rsv->rsv_goal_size = *count; |
1c2bf374a [PATCH] ext3_fsbl... |
1371 |
ret = alloc_new_reservation(my_rsv, grp_goal, sb, |
1da177e4c Linux-2.6.12-rc2 |
1372 |
group, bitmap_bh); |
1da177e4c Linux-2.6.12-rc2 |
1373 1374 |
if (ret < 0) break; /* failed */ |
36faadc14 [PATCH] ext3: mor... |
1375 1376 |
if (!goal_in_my_reservation(&my_rsv->rsv_window, grp_goal, group, sb)) |
1c2bf374a [PATCH] ext3_fsbl... |
1377 |
grp_goal = -1; |
165024232 [PATCH] ext3 ball... |
1378 |
} else if (grp_goal >= 0) { |
2bd94bd79 [PATCH] ext3: fix... |
1379 1380 1381 1382 1383 1384 1385 |
int curr = my_rsv->rsv_end - (grp_goal + group_first_block) + 1; if (curr < *count) try_to_extend_reservation(my_rsv, sb, *count - curr); } |
d48589bfa [PATCH] ext3_get_... |
1386 |
|
32c2d2bc4 [PATCH] more ext3... |
1387 1388 |
if ((my_rsv->rsv_start > group_last_block) || (my_rsv->rsv_end < group_first_block)) { |
321fb9e81 [PATCH] ext3: tur... |
1389 |
rsv_window_dump(&EXT3_SB(sb)->s_rsv_window_root, 1); |
1da177e4c Linux-2.6.12-rc2 |
1390 |
BUG(); |
321fb9e81 [PATCH] ext3: tur... |
1391 |
} |
36faadc14 [PATCH] ext3: mor... |
1392 1393 |
ret = ext3_try_to_allocate(sb, handle, group, bitmap_bh, grp_goal, &num, &my_rsv->rsv_window); |
1da177e4c Linux-2.6.12-rc2 |
1394 |
if (ret >= 0) { |
b54e41ec1 [PATCH] ext3_get_... |
1395 1396 |
my_rsv->rsv_alloc_hit += num; *count = num; |
1da177e4c Linux-2.6.12-rc2 |
1397 1398 |
break; /* succeed */ } |
b54e41ec1 [PATCH] ext3_get_... |
1399 |
num = *count; |
1da177e4c Linux-2.6.12-rc2 |
1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 |
} out: if (ret >= 0) { BUFFER_TRACE(bitmap_bh, "journal_dirty_metadata for " "bitmap block"); fatal = ext3_journal_dirty_metadata(handle, bitmap_bh); if (fatal) { *errp = fatal; return -1; } return ret; } BUFFER_TRACE(bitmap_bh, "journal_release_buffer"); ext3_journal_release_buffer(handle, bitmap_bh); return ret; } |
36faadc14 [PATCH] ext3: mor... |
1417 1418 1419 1420 1421 1422 |
/** * ext3_has_free_blocks() * @sbi: in-core super block structure. * * Check if filesystem has at least 1 free block available for allocation. */ |
6360e21f9 ext3: Allow quota... |
1423 |
static int ext3_has_free_blocks(struct ext3_sb_info *sbi, int use_reservation) |
1da177e4c Linux-2.6.12-rc2 |
1424 |
{ |
1c2bf374a [PATCH] ext3_fsbl... |
1425 |
ext3_fsblk_t free_blocks, root_blocks; |
1da177e4c Linux-2.6.12-rc2 |
1426 1427 1428 1429 |
free_blocks = percpu_counter_read_positive(&sbi->s_freeblocks_counter); root_blocks = le32_to_cpu(sbi->s_es->s_r_blocks_count); if (free_blocks < root_blocks + 1 && !capable(CAP_SYS_RESOURCE) && |
6360e21f9 ext3: Allow quota... |
1430 |
!use_reservation && sbi->s_resuid != current_fsuid() && |
1da177e4c Linux-2.6.12-rc2 |
1431 1432 1433 1434 1435 |
(sbi->s_resgid == 0 || !in_group_p (sbi->s_resgid))) { return 0; } return 1; } |
36faadc14 [PATCH] ext3: mor... |
1436 1437 1438 1439 1440 |
/** * ext3_should_retry_alloc() * @sb: super block * @retries number of attemps has been made * |
1da177e4c Linux-2.6.12-rc2 |
1441 1442 |
* ext3_should_retry_alloc() is called when ENOSPC is returned, and if * it is profitable to retry the operation, this function will wait |
25985edce Fix common misspe... |
1443 |
* for the current or committing transaction to complete, and then |
1da177e4c Linux-2.6.12-rc2 |
1444 |
* return TRUE. |
36faadc14 [PATCH] ext3: mor... |
1445 1446 |
* * if the total number of retries exceed three times, return FALSE. |
1da177e4c Linux-2.6.12-rc2 |
1447 1448 1449 |
*/ int ext3_should_retry_alloc(struct super_block *sb, int *retries) { |
6360e21f9 ext3: Allow quota... |
1450 |
if (!ext3_has_free_blocks(EXT3_SB(sb), 0) || (*retries)++ > 3) |
1da177e4c Linux-2.6.12-rc2 |
1451 1452 1453 1454 1455 1456 1457 |
return 0; jbd_debug(1, "%s: retrying operation after ENOSPC ", sb->s_id); return journal_force_commit_nested(EXT3_SB(sb)->s_journal); } |
36faadc14 [PATCH] ext3: mor... |
1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 |
/** * ext3_new_blocks() -- core block(s) allocation function * @handle: handle to this transaction * @inode: file inode * @goal: given target block(filesystem wide) * @count: target number of blocks to allocate * @errp: error code * * ext3_new_blocks uses a goal block to assist allocation. It tries to * allocate block(s) from the block group contains the goal block first. If that * fails, it will try to allocate block(s) from other block groups without * any specific goal block. * |
1da177e4c Linux-2.6.12-rc2 |
1471 |
*/ |
1c2bf374a [PATCH] ext3_fsbl... |
1472 1473 |
ext3_fsblk_t ext3_new_blocks(handle_t *handle, struct inode *inode, ext3_fsblk_t goal, unsigned long *count, int *errp) |
1da177e4c Linux-2.6.12-rc2 |
1474 1475 1476 1477 1478 |
{ struct buffer_head *bitmap_bh = NULL; struct buffer_head *gdp_bh; int group_no; int goal_group; |
1c2bf374a [PATCH] ext3_fsbl... |
1479 1480 1481 |
ext3_grpblk_t grp_target_blk; /* blockgroup relative goal block */ ext3_grpblk_t grp_alloc_blk; /* blockgroup-relative allocated block*/ ext3_fsblk_t ret_block; /* filesyetem-wide allocated block */ |
1da177e4c Linux-2.6.12-rc2 |
1482 |
int bgi; /* blockgroup iteration index */ |
1da177e4c Linux-2.6.12-rc2 |
1483 1484 |
int fatal = 0, err; int performed_allocation = 0; |
1c2bf374a [PATCH] ext3_fsbl... |
1485 |
ext3_grpblk_t free_blocks; /* number of free blocks in a group */ |
1da177e4c Linux-2.6.12-rc2 |
1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 |
struct super_block *sb; struct ext3_group_desc *gdp; struct ext3_super_block *es; struct ext3_sb_info *sbi; struct ext3_reserve_window_node *my_rsv = NULL; struct ext3_block_alloc_info *block_i; unsigned short windowsz = 0; #ifdef EXT3FS_DEBUG static int goal_hits, goal_attempts; #endif unsigned long ngroups; |
b54e41ec1 [PATCH] ext3_get_... |
1497 |
unsigned long num = *count; |
1da177e4c Linux-2.6.12-rc2 |
1498 1499 1500 |
*errp = -ENOSPC; sb = inode->i_sb; |
1da177e4c Linux-2.6.12-rc2 |
1501 1502 1503 1504 |
/* * Check quota for allocation of this block. */ |
5dd4056db dquot: cleanup sp... |
1505 1506 1507 |
err = dquot_alloc_block(inode, num); if (err) { *errp = err; |
1da177e4c Linux-2.6.12-rc2 |
1508 1509 |
return 0; } |
785c4bcc0 ext3: Add fixed t... |
1510 |
trace_ext3_request_blocks(inode, goal, num); |
1da177e4c Linux-2.6.12-rc2 |
1511 |
sbi = EXT3_SB(sb); |
785c4bcc0 ext3: Add fixed t... |
1512 |
es = sbi->s_es; |
1da177e4c Linux-2.6.12-rc2 |
1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 |
ext3_debug("goal=%lu. ", goal); /* * Allocate a block from reservation only when * filesystem is mounted with reservation(default,-o reservation), and * it's a regular file, and * the desired window size is greater than 0 (One could use ioctl * command EXT3_IOC_SETRSVSZ to set the window size to 0 to turn off * reservation on that particular file) */ block_i = EXT3_I(inode)->i_block_alloc_info; if (block_i && ((windowsz = block_i->rsv_window_node.rsv_goal_size) > 0)) my_rsv = &block_i->rsv_window_node; |
6360e21f9 ext3: Allow quota... |
1526 |
if (!ext3_has_free_blocks(sbi, IS_NOQUOTA(inode))) { |
1da177e4c Linux-2.6.12-rc2 |
1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 |
*errp = -ENOSPC; goto out; } /* * First, test whether the goal block is free. */ if (goal < le32_to_cpu(es->s_first_data_block) || goal >= le32_to_cpu(es->s_blocks_count)) goal = le32_to_cpu(es->s_first_data_block); group_no = (goal - le32_to_cpu(es->s_first_data_block)) / EXT3_BLOCKS_PER_GROUP(sb); |
08fb306fe [PATCH] ext3 file... |
1539 1540 |
goal_group = group_no; retry_alloc: |
1da177e4c Linux-2.6.12-rc2 |
1541 1542 1543 |
gdp = ext3_get_group_desc(sb, group_no, &gdp_bh); if (!gdp) goto io_error; |
1da177e4c Linux-2.6.12-rc2 |
1544 1545 1546 1547 1548 1549 |
free_blocks = le16_to_cpu(gdp->bg_free_blocks_count); /* * if there is not enough free blocks to make a new resevation * turn off reservation for this allocation */ if (my_rsv && (free_blocks < windowsz) |
46d01a225 ext3: fix ext3 bl... |
1550 |
&& (free_blocks > 0) |
1da177e4c Linux-2.6.12-rc2 |
1551 1552 1553 1554 |
&& (rsv_is_empty(&my_rsv->rsv_window))) my_rsv = NULL; if (free_blocks > 0) { |
1c2bf374a [PATCH] ext3_fsbl... |
1555 |
grp_target_blk = ((goal - le32_to_cpu(es->s_first_data_block)) % |
1da177e4c Linux-2.6.12-rc2 |
1556 1557 1558 1559 |
EXT3_BLOCKS_PER_GROUP(sb)); bitmap_bh = read_block_bitmap(sb, group_no); if (!bitmap_bh) goto io_error; |
1c2bf374a [PATCH] ext3_fsbl... |
1560 1561 1562 |
grp_alloc_blk = ext3_try_to_allocate_with_rsv(sb, handle, group_no, bitmap_bh, grp_target_blk, my_rsv, &num, &fatal); |
1da177e4c Linux-2.6.12-rc2 |
1563 1564 |
if (fatal) goto out; |
1c2bf374a [PATCH] ext3_fsbl... |
1565 |
if (grp_alloc_blk >= 0) |
1da177e4c Linux-2.6.12-rc2 |
1566 1567 1568 1569 1570 1571 1572 |
goto allocated; } ngroups = EXT3_SB(sb)->s_groups_count; smp_rmb(); /* |
ae6ddcc5f [PATCH] ext3 and ... |
1573 |
* Now search the rest of the groups. We assume that |
144704e52 ext[234]: fix com... |
1574 |
* group_no and gdp correctly point to the last group visited. |
1da177e4c Linux-2.6.12-rc2 |
1575 1576 1577 1578 1579 1580 |
*/ for (bgi = 0; bgi < ngroups; bgi++) { group_no++; if (group_no >= ngroups) group_no = 0; gdp = ext3_get_group_desc(sb, group_no, &gdp_bh); |
2823b5535 [PATCH] ext3 ball... |
1581 1582 |
if (!gdp) goto io_error; |
1da177e4c Linux-2.6.12-rc2 |
1583 1584 |
free_blocks = le16_to_cpu(gdp->bg_free_blocks_count); /* |
8cef107a1 ext3: Avoid loadi... |
1585 1586 1587 1588 1589 1590 |
* skip this group (and avoid loading bitmap) if there * are no free blocks */ if (!free_blocks) continue; /* |
1da177e4c Linux-2.6.12-rc2 |
1591 1592 1593 1594 |
* skip this group if the number of * free blocks is less than half of the reservation * window size. */ |
46d01a225 ext3: fix ext3 bl... |
1595 |
if (my_rsv && (free_blocks <= (windowsz/2))) |
1da177e4c Linux-2.6.12-rc2 |
1596 1597 1598 1599 1600 1601 |
continue; brelse(bitmap_bh); bitmap_bh = read_block_bitmap(sb, group_no); if (!bitmap_bh) goto io_error; |
1c2bf374a [PATCH] ext3_fsbl... |
1602 1603 1604 1605 1606 1607 |
/* * try to allocate block(s) from this group, without a goal(-1). */ grp_alloc_blk = ext3_try_to_allocate_with_rsv(sb, handle, group_no, bitmap_bh, -1, my_rsv, &num, &fatal); |
1da177e4c Linux-2.6.12-rc2 |
1608 1609 |
if (fatal) goto out; |
1c2bf374a [PATCH] ext3_fsbl... |
1610 |
if (grp_alloc_blk >= 0) |
1da177e4c Linux-2.6.12-rc2 |
1611 1612 1613 |
goto allocated; } /* |
25985edce Fix common misspe... |
1614 |
* We may end up a bogus earlier ENOSPC error due to |
1da177e4c Linux-2.6.12-rc2 |
1615 |
* filesystem is "full" of reservations, but |
25985edce Fix common misspe... |
1616 |
* there maybe indeed free blocks available on disk |
1da177e4c Linux-2.6.12-rc2 |
1617 1618 1619 1620 1621 |
* In this case, we just forget about the reservations * just do block allocation as without reservations. */ if (my_rsv) { my_rsv = NULL; |
ef5036782 [PATCH] ext3 ball... |
1622 |
windowsz = 0; |
1da177e4c Linux-2.6.12-rc2 |
1623 |
group_no = goal_group; |
08fb306fe [PATCH] ext3 file... |
1624 |
goto retry_alloc; |
1da177e4c Linux-2.6.12-rc2 |
1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 |
} /* No space left on the device */ *errp = -ENOSPC; goto out; allocated: ext3_debug("using block group %d(%d) ", group_no, gdp->bg_free_blocks_count); BUFFER_TRACE(gdp_bh, "get_write_access"); fatal = ext3_journal_get_write_access(handle, gdp_bh); if (fatal) goto out; |
43d23f903 [PATCH] ext3_fsbl... |
1640 |
ret_block = grp_alloc_blk + ext3_group_first_block_no(sb, group_no); |
1da177e4c Linux-2.6.12-rc2 |
1641 |
|
1c2bf374a [PATCH] ext3_fsbl... |
1642 1643 1644 |
if (in_range(le32_to_cpu(gdp->bg_block_bitmap), ret_block, num) || in_range(le32_to_cpu(gdp->bg_inode_bitmap), ret_block, num) || in_range(ret_block, le32_to_cpu(gdp->bg_inode_table), |
faa569763 [PATCH] ext3_get_... |
1645 |
EXT3_SB(sb)->s_itb_per_group) || |
1c2bf374a [PATCH] ext3_fsbl... |
1646 |
in_range(ret_block + num - 1, le32_to_cpu(gdp->bg_inode_table), |
feda58d37 ext3: return afte... |
1647 |
EXT3_SB(sb)->s_itb_per_group)) { |
1da177e4c Linux-2.6.12-rc2 |
1648 1649 |
ext3_error(sb, "ext3_new_block", "Allocating block in system zone - " |
1c2bf374a [PATCH] ext3_fsbl... |
1650 1651 |
"blocks from "E3FSBLK", length %lu", ret_block, num); |
2588ef83f ext3: retry block... |
1652 1653 1654 1655 1656 |
/* * claim_block() marked the blocks we allocated as in use. So we * may want to selectively mark some of the blocks as free. */ goto retry_alloc; |
feda58d37 ext3: return afte... |
1657 |
} |
1da177e4c Linux-2.6.12-rc2 |
1658 1659 1660 1661 1662 1663 1664 1665 |
performed_allocation = 1; #ifdef CONFIG_JBD_DEBUG { struct buffer_head *debug_bh; /* Record bitmap buffer state in the newly allocated block */ |
1c2bf374a [PATCH] ext3_fsbl... |
1666 |
debug_bh = sb_find_get_block(sb, ret_block); |
1da177e4c Linux-2.6.12-rc2 |
1667 1668 1669 1670 1671 1672 1673 1674 1675 |
if (debug_bh) { BUFFER_TRACE(debug_bh, "state when allocated"); BUFFER_TRACE2(debug_bh, bitmap_bh, "bitmap state"); brelse(debug_bh); } } jbd_lock_bh_state(bitmap_bh); spin_lock(sb_bgl_lock(sbi, group_no)); if (buffer_jbd(bitmap_bh) && bh2jh(bitmap_bh)->b_committed_data) { |
faa569763 [PATCH] ext3_get_... |
1676 1677 1678 |
int i; for (i = 0; i < num; i++) { |
1c2bf374a [PATCH] ext3_fsbl... |
1679 |
if (ext3_test_bit(grp_alloc_blk+i, |
faa569763 [PATCH] ext3_get_... |
1680 1681 |
bh2jh(bitmap_bh)->b_committed_data)) { printk("%s: block was unexpectedly set in " |
e05b6b524 ext3: replace rem... |
1682 1683 |
"b_committed_data ", __func__); |
faa569763 [PATCH] ext3_get_... |
1684 |
} |
1da177e4c Linux-2.6.12-rc2 |
1685 1686 |
} } |
1c2bf374a [PATCH] ext3_fsbl... |
1687 1688 |
ext3_debug("found bit %d ", grp_alloc_blk); |
1da177e4c Linux-2.6.12-rc2 |
1689 1690 1691 |
spin_unlock(sb_bgl_lock(sbi, group_no)); jbd_unlock_bh_state(bitmap_bh); #endif |
faa569763 [PATCH] ext3_get_... |
1692 |
if (ret_block + num - 1 >= le32_to_cpu(es->s_blocks_count)) { |
1da177e4c Linux-2.6.12-rc2 |
1693 |
ext3_error(sb, "ext3_new_block", |
1c2bf374a [PATCH] ext3_fsbl... |
1694 |
"block("E3FSBLK") >= blocks count(%d) - " |
1da177e4c Linux-2.6.12-rc2 |
1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 |
"block_group = %d, es == %p ", ret_block, le32_to_cpu(es->s_blocks_count), group_no, es); goto out; } /* * It is up to the caller to add the new buffer to a journal * list of some description. We don't know in advance whether * the caller wants to use it as metadata or data. */ |
1c2bf374a [PATCH] ext3_fsbl... |
1705 1706 |
ext3_debug("allocating block %lu. Goal hits %d of %d. ", |
1da177e4c Linux-2.6.12-rc2 |
1707 1708 1709 |
ret_block, goal_hits, goal_attempts); spin_lock(sb_bgl_lock(sbi, group_no)); |
50e8a2890 ext3: replace all... |
1710 |
le16_add_cpu(&gdp->bg_free_blocks_count, -num); |
1da177e4c Linux-2.6.12-rc2 |
1711 |
spin_unlock(sb_bgl_lock(sbi, group_no)); |
3cb4f9fa0 lib: percpu_count... |
1712 |
percpu_counter_sub(&sbi->s_freeblocks_counter, num); |
1da177e4c Linux-2.6.12-rc2 |
1713 1714 1715 1716 1717 |
BUFFER_TRACE(gdp_bh, "journal_dirty_metadata for group descriptor"); err = ext3_journal_dirty_metadata(handle, gdp_bh); if (!fatal) fatal = err; |
1da177e4c Linux-2.6.12-rc2 |
1718 1719 1720 1721 1722 |
if (fatal) goto out; *errp = 0; brelse(bitmap_bh); |
5dd4056db dquot: cleanup sp... |
1723 |
dquot_free_block(inode, *count-num); |
b54e41ec1 [PATCH] ext3_get_... |
1724 |
*count = num; |
785c4bcc0 ext3: Add fixed t... |
1725 1726 1727 |
trace_ext3_allocate_blocks(inode, goal, num, (unsigned long long)ret_block); |
1da177e4c Linux-2.6.12-rc2 |
1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 |
return ret_block; io_error: *errp = -EIO; out: if (fatal) { *errp = fatal; ext3_std_error(sb, fatal); } /* * Undo the block allocation */ if (!performed_allocation) |
5dd4056db dquot: cleanup sp... |
1741 |
dquot_free_block(inode, *count); |
1da177e4c Linux-2.6.12-rc2 |
1742 1743 1744 |
brelse(bitmap_bh); return 0; } |
1c2bf374a [PATCH] ext3_fsbl... |
1745 1746 |
ext3_fsblk_t ext3_new_block(handle_t *handle, struct inode *inode, ext3_fsblk_t goal, int *errp) |
b54e41ec1 [PATCH] ext3_get_... |
1747 1748 1749 1750 1751 |
{ unsigned long count = 1; return ext3_new_blocks(handle, inode, goal, &count, errp); } |
36faadc14 [PATCH] ext3: mor... |
1752 1753 1754 1755 1756 1757 |
/** * ext3_count_free_blocks() -- count filesystem free blocks * @sb: superblock * * Adds up the number of free blocks from each block group. */ |
43d23f903 [PATCH] ext3_fsbl... |
1758 |
ext3_fsblk_t ext3_count_free_blocks(struct super_block *sb) |
1da177e4c Linux-2.6.12-rc2 |
1759 |
{ |
43d23f903 [PATCH] ext3_fsbl... |
1760 |
ext3_fsblk_t desc_count; |
1da177e4c Linux-2.6.12-rc2 |
1761 1762 |
struct ext3_group_desc *gdp; int i; |
8bdac5d1e [PATCH] ext3: EXT... |
1763 |
unsigned long ngroups = EXT3_SB(sb)->s_groups_count; |
1da177e4c Linux-2.6.12-rc2 |
1764 1765 |
#ifdef EXT3FS_DEBUG struct ext3_super_block *es; |
43d23f903 [PATCH] ext3_fsbl... |
1766 1767 |
ext3_fsblk_t bitmap_count; unsigned long x; |
1da177e4c Linux-2.6.12-rc2 |
1768 |
struct buffer_head *bitmap_bh = NULL; |
1da177e4c Linux-2.6.12-rc2 |
1769 1770 1771 1772 |
es = EXT3_SB(sb)->s_es; desc_count = 0; bitmap_count = 0; gdp = NULL; |
8bdac5d1e [PATCH] ext3: EXT... |
1773 |
|
5b1168792 [PATCH] Locking p... |
1774 |
smp_rmb(); |
8bdac5d1e [PATCH] ext3: EXT... |
1775 |
for (i = 0; i < ngroups; i++) { |
1da177e4c Linux-2.6.12-rc2 |
1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 |
gdp = ext3_get_group_desc(sb, i, NULL); if (!gdp) continue; desc_count += le16_to_cpu(gdp->bg_free_blocks_count); brelse(bitmap_bh); bitmap_bh = read_block_bitmap(sb, i); if (bitmap_bh == NULL) continue; x = ext3_count_free(bitmap_bh, sb->s_blocksize); printk("group %d: stored = %d, counted = %lu ", i, le16_to_cpu(gdp->bg_free_blocks_count), x); bitmap_count += x; } brelse(bitmap_bh); |
43d23f903 [PATCH] ext3_fsbl... |
1792 1793 1794 1795 1796 |
printk("ext3_count_free_blocks: stored = "E3FSBLK ", computed = "E3FSBLK", "E3FSBLK" ", le32_to_cpu(es->s_free_blocks_count), desc_count, bitmap_count); |
1da177e4c Linux-2.6.12-rc2 |
1797 1798 1799 |
return bitmap_count; #else desc_count = 0; |
1da177e4c Linux-2.6.12-rc2 |
1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 |
smp_rmb(); for (i = 0; i < ngroups; i++) { gdp = ext3_get_group_desc(sb, i, NULL); if (!gdp) continue; desc_count += le16_to_cpu(gdp->bg_free_blocks_count); } return desc_count; #endif } |
1da177e4c Linux-2.6.12-rc2 |
1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 |
static inline int test_root(int a, int b) { int num = b; while (a > num) num *= b; return num == a; } static int ext3_group_sparse(int group) { if (group <= 1) return 1; if (!(group & 1)) return 0; return (test_root(group, 7) || test_root(group, 5) || test_root(group, 3)); } /** * ext3_bg_has_super - number of blocks used by the superblock in group * @sb: superblock for filesystem * @group: group number to check * * Return the number of blocks used by the superblock (primary or backup) * in this group. Currently this will be only 0 or 1. */ int ext3_bg_has_super(struct super_block *sb, int group) { |
b5a7c4f58 [PATCH] ext3: Pro... |
1840 1841 1842 |
if (EXT3_HAS_RO_COMPAT_FEATURE(sb, EXT3_FEATURE_RO_COMPAT_SPARSE_SUPER) && !ext3_group_sparse(group)) |
1da177e4c Linux-2.6.12-rc2 |
1843 1844 1845 |
return 0; return 1; } |
b5a7c4f58 [PATCH] ext3: Pro... |
1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 |
static unsigned long ext3_bg_num_gdb_meta(struct super_block *sb, int group) { unsigned long metagroup = group / EXT3_DESC_PER_BLOCK(sb); unsigned long first = metagroup * EXT3_DESC_PER_BLOCK(sb); unsigned long last = first + EXT3_DESC_PER_BLOCK(sb) - 1; if (group == first || group == first + 1 || group == last) return 1; return 0; } static unsigned long ext3_bg_num_gdb_nometa(struct super_block *sb, int group) { |
859cb9367 ext[234]: cleanup... |
1859 |
return ext3_bg_has_super(sb, group) ? EXT3_SB(sb)->s_gdb_count : 0; |
b5a7c4f58 [PATCH] ext3: Pro... |
1860 |
} |
1da177e4c Linux-2.6.12-rc2 |
1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 |
/** * ext3_bg_num_gdb - number of blocks used by the group table in group * @sb: superblock for filesystem * @group: group number to check * * Return the number of blocks used by the group descriptor table * (primary or backup) in this group. In the future there may be a * different number of descriptor blocks in each group. */ unsigned long ext3_bg_num_gdb(struct super_block *sb, int group) { |
b5a7c4f58 [PATCH] ext3: Pro... |
1872 1873 1874 1875 1876 1877 1878 |
unsigned long first_meta_bg = le32_to_cpu(EXT3_SB(sb)->s_es->s_first_meta_bg); unsigned long metagroup = group / EXT3_DESC_PER_BLOCK(sb); if (!EXT3_HAS_INCOMPAT_FEATURE(sb,EXT3_FEATURE_INCOMPAT_META_BG) || metagroup < first_meta_bg) return ext3_bg_num_gdb_nometa(sb,group); |
1da177e4c Linux-2.6.12-rc2 |
1879 |
|
b5a7c4f58 [PATCH] ext3: Pro... |
1880 1881 1882 |
return ext3_bg_num_gdb_meta(sb,group); } |
b853b96b1 ext3: Add batched... |
1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 |
/** * ext3_trim_all_free -- function to trim all free space in alloc. group * @sb: super block for file system * @group: allocation group to trim * @start: first group block to examine * @max: last group block to examine * @gdp: allocation group description structure * @minblocks: minimum extent block count * * ext3_trim_all_free walks through group's block bitmap searching for free * blocks. When the free block is found, it tries to allocate this block and * consequent free block to get the biggest free extent possible, until it * reaches any used block. Then issue a TRIM command on this extent and free * the extent in the block bitmap. This is done until whole group is scanned. */ |
3ee77f209 ext3/balloc.c: lo... |
1899 1900 1901 1902 |
static ext3_grpblk_t ext3_trim_all_free(struct super_block *sb, unsigned int group, ext3_grpblk_t start, ext3_grpblk_t max, ext3_grpblk_t minblocks) |
b853b96b1 ext3: Add batched... |
1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 |
{ handle_t *handle; ext3_grpblk_t next, free_blocks, bit, freed, count = 0; ext3_fsblk_t discard_block; struct ext3_sb_info *sbi; struct buffer_head *gdp_bh, *bitmap_bh = NULL; struct ext3_group_desc *gdp; int err = 0, ret = 0; /* * We will update one block bitmap, and one group descriptor */ handle = ext3_journal_start_sb(sb, 2); if (IS_ERR(handle)) return PTR_ERR(handle); bitmap_bh = read_block_bitmap(sb, group); if (!bitmap_bh) { err = -EIO; goto err_out; } BUFFER_TRACE(bitmap_bh, "getting undo access"); err = ext3_journal_get_undo_access(handle, bitmap_bh); if (err) goto err_out; gdp = ext3_get_group_desc(sb, group, &gdp_bh); if (!gdp) { err = -EIO; goto err_out; } BUFFER_TRACE(gdp_bh, "get_write_access"); err = ext3_journal_get_write_access(handle, gdp_bh); if (err) goto err_out; free_blocks = le16_to_cpu(gdp->bg_free_blocks_count); sbi = EXT3_SB(sb); /* Walk through the whole group */ while (start < max) { start = bitmap_search_next_usable_block(start, bitmap_bh, max); if (start < 0) break; next = start; /* * Allocate contiguous free extents by setting bits in the * block bitmap */ while (next < max && claim_block(sb_bgl_lock(sbi, group), next, bitmap_bh)) { next++; } /* We did not claim any blocks */ if (next == start) continue; discard_block = (ext3_fsblk_t)start + ext3_group_first_block_no(sb, group); /* Update counters */ spin_lock(sb_bgl_lock(sbi, group)); le16_add_cpu(&gdp->bg_free_blocks_count, start - next); spin_unlock(sb_bgl_lock(sbi, group)); percpu_counter_sub(&sbi->s_freeblocks_counter, next - start); |
bbac751dc ext3: speed up gr... |
1973 |
free_blocks -= next - start; |
b853b96b1 ext3: Add batched... |
1974 1975 1976 |
/* Do not issue a TRIM on extents smaller than minblocks */ if ((next - start) < minblocks) goto free_extent; |
785c4bcc0 ext3: Add fixed t... |
1977 |
trace_ext3_discard_blocks(sb, discard_block, next - start); |
b853b96b1 ext3: Add batched... |
1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 |
/* Send the TRIM command down to the device */ err = sb_issue_discard(sb, discard_block, next - start, GFP_NOFS, 0); count += (next - start); free_extent: freed = 0; /* * Clear bits in the bitmap */ for (bit = start; bit < next; bit++) { BUFFER_TRACE(bitmap_bh, "clear bit"); if (!ext3_clear_bit_atomic(sb_bgl_lock(sbi, group), bit, bitmap_bh->b_data)) { ext3_error(sb, __func__, "bit already cleared for block "E3FSBLK, (unsigned long)bit); BUFFER_TRACE(bitmap_bh, "bit already cleared"); } else { freed++; } } /* Update couters */ spin_lock(sb_bgl_lock(sbi, group)); le16_add_cpu(&gdp->bg_free_blocks_count, freed); spin_unlock(sb_bgl_lock(sbi, group)); percpu_counter_add(&sbi->s_freeblocks_counter, freed); start = next; if (err < 0) { if (err != -EOPNOTSUPP) ext3_warning(sb, __func__, "Discard command " "returned error %d ", err); break; } if (fatal_signal_pending(current)) { err = -ERESTARTSYS; break; } cond_resched(); /* No more suitable extents */ |
bbac751dc ext3: speed up gr... |
2024 |
if (free_blocks < minblocks) |
b853b96b1 ext3: Add batched... |
2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 |
break; } /* We dirtied the bitmap block */ BUFFER_TRACE(bitmap_bh, "dirtied bitmap block"); ret = ext3_journal_dirty_metadata(handle, bitmap_bh); if (!err) err = ret; /* And the group descriptor block */ BUFFER_TRACE(gdp_bh, "dirtied group descriptor block"); ret = ext3_journal_dirty_metadata(handle, gdp_bh); if (!err) err = ret; ext3_debug("trimmed %d blocks in the group %d ", count, group); err_out: if (err) count = err; ext3_journal_stop(handle); brelse(bitmap_bh); return count; } /** * ext3_trim_fs() -- trim ioctl handle function * @sb: superblock for filesystem * @start: First Byte to trim * @len: number of Bytes to trim from start * @minlen: minimum extent length in Bytes * * ext3_trim_fs goes through all allocation groups containing Bytes from * start to start+len. For each such a group ext3_trim_all_free function * is invoked to trim all free space. */ int ext3_trim_fs(struct super_block *sb, struct fstrim_range *range) { ext3_grpblk_t last_block, first_block, free_blocks; unsigned long first_group, last_group; unsigned long group, ngroups; struct ext3_group_desc *gdp; struct ext3_super_block *es = EXT3_SB(sb)->s_es; uint64_t start, len, minlen, trimmed; ext3_fsblk_t max_blks = le32_to_cpu(es->s_blocks_count); int ret = 0; |
4b44dd300 ext3: Adjust trim... |
2074 2075 |
start = (range->start >> sb->s_blocksize_bits) + le32_to_cpu(es->s_first_data_block); |
b853b96b1 ext3: Add batched... |
2076 2077 2078 2079 2080 2081 2082 |
len = range->len >> sb->s_blocksize_bits; minlen = range->minlen >> sb->s_blocksize_bits; trimmed = 0; if (unlikely(minlen > EXT3_BLOCKS_PER_GROUP(sb))) return -EINVAL; if (start >= max_blks) |
2c2ea9451 ext3: Return -EIN... |
2083 |
return -EINVAL; |
b853b96b1 ext3: Add batched... |
2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 |
if (start + len > max_blks) len = max_blks - start; ngroups = EXT3_SB(sb)->s_groups_count; smp_rmb(); /* Determine first and last group to examine based on start and len */ ext3_get_group_no_and_offset(sb, (ext3_fsblk_t) start, &first_group, &first_block); ext3_get_group_no_and_offset(sb, (ext3_fsblk_t) (start + len), &last_group, &last_block); last_group = (last_group > ngroups - 1) ? ngroups - 1 : last_group; last_block = EXT3_BLOCKS_PER_GROUP(sb); if (first_group > last_group) return -EINVAL; for (group = first_group; group <= last_group; group++) { gdp = ext3_get_group_desc(sb, group, NULL); if (!gdp) break; free_blocks = le16_to_cpu(gdp->bg_free_blocks_count); if (free_blocks < minlen) continue; |
425fa4107 ext3: Fix an over... |
2109 2110 2111 2112 2113 2114 2115 |
/* * For all the groups except the last one, last block will * always be EXT3_BLOCKS_PER_GROUP(sb), so we only need to * change it for the last group in which case first_block + * len < EXT3_BLOCKS_PER_GROUP(sb). */ if (first_block + len < EXT3_BLOCKS_PER_GROUP(sb)) |
b853b96b1 ext3: Add batched... |
2116 |
last_block = first_block + len; |
425fa4107 ext3: Fix an over... |
2117 |
len -= last_block - first_block; |
b853b96b1 ext3: Add batched... |
2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 |
ret = ext3_trim_all_free(sb, group, first_block, last_block, minlen); if (ret < 0) break; trimmed += ret; first_block = 0; } if (ret >= 0) ret = 0; |
b853b96b1 ext3: Add batched... |
2130 2131 2132 2133 |
range->len = trimmed * sb->s_blocksize; return ret; } |