2 * linux/fs/ext4/balloc.c
4 * Copyright (C) 1992, 1993, 1994, 1995
5 * Remy Card (card@masi.ibp.fr)
6 * Laboratoire MASI - Institut Blaise Pascal
7 * Universite Pierre et Marie Curie (Paris VI)
9 * Enhanced block allocation by Stephen Tweedie (sct@redhat.com), 1993
10 * Big-endian to little-endian byte-swapping/bitmaps by
11 * David S. Miller (davem@caip.rutgers.edu), 1995
14 #include <linux/time.h>
15 #include <linux/capability.h>
17 #include <linux/jbd2.h>
18 #include <linux/ext4_fs.h>
19 #include <linux/ext4_jbd2.h>
20 #include <linux/quotaops.h>
21 #include <linux/buffer_head.h>
25 * balloc.c contains the blocks allocation and deallocation routines
29 * Calculate the block group number and offset, given a block number
31 void ext4_get_group_no_and_offset(struct super_block *sb, ext4_fsblk_t blocknr,
32 ext4_group_t *blockgrpp, ext4_grpblk_t *offsetp)
34 struct ext4_super_block *es = EXT4_SB(sb)->s_es;
37 blocknr = blocknr - le32_to_cpu(es->s_first_data_block);
38 offset = do_div(blocknr, EXT4_BLOCKS_PER_GROUP(sb));
46 /* Initializes an uninitialized block bitmap if given, and returns the
47 * number of blocks free in the group. */
48 unsigned ext4_init_block_bitmap(struct super_block *sb, struct buffer_head *bh,
49 ext4_group_t block_group, struct ext4_group_desc *gdp)
53 unsigned free_blocks, group_blocks;
54 struct ext4_sb_info *sbi = EXT4_SB(sb);
57 J_ASSERT_BH(bh, buffer_locked(bh));
59 /* If checksum is bad mark all blocks used to prevent allocation
60 * essentially implementing a per-group read-only flag. */
61 if (!ext4_group_desc_csum_verify(sbi, block_group, gdp)) {
62 ext4_error(sb, __FUNCTION__,
63 "Checksum bad for group %lu\n", block_group);
64 gdp->bg_free_blocks_count = 0;
65 gdp->bg_free_inodes_count = 0;
66 gdp->bg_itable_unused = 0;
67 memset(bh->b_data, 0xff, sb->s_blocksize);
70 memset(bh->b_data, 0, sb->s_blocksize);
73 /* Check for superblock and gdt backups in this group */
74 bit_max = ext4_bg_has_super(sb, block_group);
76 if (!EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_META_BG) ||
77 block_group < le32_to_cpu(sbi->s_es->s_first_meta_bg) *
78 sbi->s_desc_per_block) {
80 bit_max += ext4_bg_num_gdb(sb, block_group);
82 le16_to_cpu(sbi->s_es->s_reserved_gdt_blocks);
84 } else { /* For META_BG_BLOCK_GROUPS */
85 int group_rel = (block_group -
86 le32_to_cpu(sbi->s_es->s_first_meta_bg)) %
87 EXT4_DESC_PER_BLOCK(sb);
88 if (group_rel == 0 || group_rel == 1 ||
89 (group_rel == EXT4_DESC_PER_BLOCK(sb) - 1))
93 if (block_group == sbi->s_groups_count - 1) {
95 * Even though mke2fs always initialize first and last group
96 * if some other tool enabled the EXT4_BG_BLOCK_UNINIT we need
97 * to make sure we calculate the right free blocks
99 group_blocks = ext4_blocks_count(sbi->s_es) -
100 le32_to_cpu(sbi->s_es->s_first_data_block) -
101 (EXT4_BLOCKS_PER_GROUP(sb) * (sbi->s_groups_count -1));
103 group_blocks = EXT4_BLOCKS_PER_GROUP(sb);
106 free_blocks = group_blocks - bit_max;
109 for (bit = 0; bit < bit_max; bit++)
110 ext4_set_bit(bit, bh->b_data);
112 start = block_group * EXT4_BLOCKS_PER_GROUP(sb) +
113 le32_to_cpu(sbi->s_es->s_first_data_block);
115 /* Set bits for block and inode bitmaps, and inode table */
116 ext4_set_bit(ext4_block_bitmap(sb, gdp) - start, bh->b_data);
117 ext4_set_bit(ext4_inode_bitmap(sb, gdp) - start, bh->b_data);
118 for (bit = (ext4_inode_table(sb, gdp) - start),
119 bit_max = bit + sbi->s_itb_per_group; bit < bit_max; bit++)
120 ext4_set_bit(bit, bh->b_data);
123 * Also if the number of blocks within the group is
124 * less than the blocksize * 8 ( which is the size
125 * of bitmap ), set rest of the block bitmap to 1
127 mark_bitmap_end(group_blocks, sb->s_blocksize * 8, bh->b_data);
130 return free_blocks - sbi->s_itb_per_group - 2;
135 * The free blocks are managed by bitmaps. A file system contains several
136 * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
137 * block for inodes, N blocks for the inode table and data blocks.
139 * The file system contains group descriptors which are located after the
140 * super block. Each descriptor contains the number of the bitmap block and
141 * the free blocks count in the block. The descriptors are loaded in memory
142 * when a file system is mounted (see ext4_fill_super).
146 #define in_range(b, first, len) ((b) >= (first) && (b) <= (first) + (len) - 1)
149 * ext4_get_group_desc() -- load group descriptor from disk
151 * @block_group: given block group
152 * @bh: pointer to the buffer head to store the block
155 struct ext4_group_desc * ext4_get_group_desc(struct super_block * sb,
156 ext4_group_t block_group,
157 struct buffer_head ** bh)
159 unsigned long group_desc;
160 unsigned long offset;
161 struct ext4_group_desc * desc;
162 struct ext4_sb_info *sbi = EXT4_SB(sb);
164 if (block_group >= sbi->s_groups_count) {
165 ext4_error (sb, "ext4_get_group_desc",
166 "block_group >= groups_count - "
167 "block_group = %lu, groups_count = %lu",
168 block_group, sbi->s_groups_count);
174 group_desc = block_group >> EXT4_DESC_PER_BLOCK_BITS(sb);
175 offset = block_group & (EXT4_DESC_PER_BLOCK(sb) - 1);
176 if (!sbi->s_group_desc[group_desc]) {
177 ext4_error (sb, "ext4_get_group_desc",
178 "Group descriptor not loaded - "
179 "block_group = %lu, group_desc = %lu, desc = %lu",
180 block_group, group_desc, offset);
184 desc = (struct ext4_group_desc *)(
185 (__u8 *)sbi->s_group_desc[group_desc]->b_data +
186 offset * EXT4_DESC_SIZE(sb));
188 *bh = sbi->s_group_desc[group_desc];
193 * read_block_bitmap()
195 * @block_group: given block group
197 * Read the bitmap for a given block_group, reading into the specified
198 * slot in the superblock's bitmap cache.
200 * Return buffer_head on success or NULL in case of failure.
203 read_block_bitmap(struct super_block *sb, ext4_group_t block_group)
205 struct ext4_group_desc * desc;
206 struct buffer_head * bh = NULL;
207 ext4_fsblk_t bitmap_blk;
209 desc = ext4_get_group_desc(sb, block_group, NULL);
212 bitmap_blk = ext4_block_bitmap(sb, desc);
213 if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) {
214 bh = sb_getblk(sb, bitmap_blk);
215 if (!buffer_uptodate(bh)) {
217 if (!buffer_uptodate(bh)) {
218 ext4_init_block_bitmap(sb, bh, block_group,
220 set_buffer_uptodate(bh);
225 bh = sb_bread(sb, bitmap_blk);
228 ext4_error (sb, __FUNCTION__,
229 "Cannot read block bitmap - "
230 "block_group = %lu, block_bitmap = %llu",
231 block_group, bitmap_blk);
235 * The reservation window structure operations
236 * --------------------------------------------
237 * Operations include:
238 * dump, find, add, remove, is_empty, find_next_reservable_window, etc.
240 * We use a red-black tree to represent per-filesystem reservation
246 * __rsv_window_dump() -- Dump the filesystem block allocation reservation map
247 * @rb_root: root of per-filesystem reservation rb tree
248 * @verbose: verbose mode
249 * @fn: function which wishes to dump the reservation map
251 * If verbose is turned on, it will print the whole block reservation
252 * windows(start, end). Otherwise, it will only print out the "bad" windows,
253 * those windows that overlap with their immediate neighbors.
256 static void __rsv_window_dump(struct rb_root *root, int verbose,
260 struct ext4_reserve_window_node *rsv, *prev;
268 printk("Block Allocation Reservation Windows Map (%s):\n", fn);
270 rsv = rb_entry(n, struct ext4_reserve_window_node, rsv_node);
272 printk("reservation window 0x%p "
273 "start: %llu, end: %llu\n",
274 rsv, rsv->rsv_start, rsv->rsv_end);
275 if (rsv->rsv_start && rsv->rsv_start >= rsv->rsv_end) {
276 printk("Bad reservation %p (start >= end)\n",
280 if (prev && prev->rsv_end >= rsv->rsv_start) {
281 printk("Bad reservation %p (prev->end >= start)\n",
287 printk("Restarting reservation walk in verbose mode\n");
295 printk("Window map complete.\n");
299 #define rsv_window_dump(root, verbose) \
300 __rsv_window_dump((root), (verbose), __FUNCTION__)
302 #define rsv_window_dump(root, verbose) do {} while (0)
306 * goal_in_my_reservation()
307 * @rsv: inode's reservation window
308 * @grp_goal: given goal block relative to the allocation block group
309 * @group: the current allocation block group
310 * @sb: filesystem super block
312 * Test if the given goal block (group relative) is within the file's
313 * own block reservation window range.
315 * If the reservation window is outside the goal allocation group, return 0;
316 * grp_goal (given goal block) could be -1, which means no specific
317 * goal block. In this case, always return 1.
318 * If the goal block is within the reservation window, return 1;
319 * otherwise, return 0;
322 goal_in_my_reservation(struct ext4_reserve_window *rsv, ext4_grpblk_t grp_goal,
323 ext4_group_t group, struct super_block *sb)
325 ext4_fsblk_t group_first_block, group_last_block;
327 group_first_block = ext4_group_first_block_no(sb, group);
328 group_last_block = group_first_block + (EXT4_BLOCKS_PER_GROUP(sb) - 1);
330 if ((rsv->_rsv_start > group_last_block) ||
331 (rsv->_rsv_end < group_first_block))
333 if ((grp_goal >= 0) && ((grp_goal + group_first_block < rsv->_rsv_start)
334 || (grp_goal + group_first_block > rsv->_rsv_end)))
340 * search_reserve_window()
341 * @rb_root: root of reservation tree
342 * @goal: target allocation block
344 * Find the reserved window which includes the goal, or the previous one
345 * if the goal is not in any window.
346 * Returns NULL if there are no windows or if all windows start after the goal.
348 static struct ext4_reserve_window_node *
349 search_reserve_window(struct rb_root *root, ext4_fsblk_t goal)
351 struct rb_node *n = root->rb_node;
352 struct ext4_reserve_window_node *rsv;
358 rsv = rb_entry(n, struct ext4_reserve_window_node, rsv_node);
360 if (goal < rsv->rsv_start)
362 else if (goal > rsv->rsv_end)
368 * We've fallen off the end of the tree: the goal wasn't inside
369 * any particular node. OK, the previous node must be to one
370 * side of the interval containing the goal. If it's the RHS,
371 * we need to back up one.
373 if (rsv->rsv_start > goal) {
374 n = rb_prev(&rsv->rsv_node);
375 rsv = rb_entry(n, struct ext4_reserve_window_node, rsv_node);
381 * ext4_rsv_window_add() -- Insert a window to the block reservation rb tree.
383 * @rsv: reservation window to add
385 * Must be called with rsv_lock hold.
387 void ext4_rsv_window_add(struct super_block *sb,
388 struct ext4_reserve_window_node *rsv)
390 struct rb_root *root = &EXT4_SB(sb)->s_rsv_window_root;
391 struct rb_node *node = &rsv->rsv_node;
392 ext4_fsblk_t start = rsv->rsv_start;
394 struct rb_node ** p = &root->rb_node;
395 struct rb_node * parent = NULL;
396 struct ext4_reserve_window_node *this;
401 this = rb_entry(parent, struct ext4_reserve_window_node, rsv_node);
403 if (start < this->rsv_start)
405 else if (start > this->rsv_end)
408 rsv_window_dump(root, 1);
413 rb_link_node(node, parent, p);
414 rb_insert_color(node, root);
418 * ext4_rsv_window_remove() -- unlink a window from the reservation rb tree
420 * @rsv: reservation window to remove
422 * Mark the block reservation window as not allocated, and unlink it
423 * from the filesystem reservation window rb tree. Must be called with
426 static void rsv_window_remove(struct super_block *sb,
427 struct ext4_reserve_window_node *rsv)
429 rsv->rsv_start = EXT4_RESERVE_WINDOW_NOT_ALLOCATED;
430 rsv->rsv_end = EXT4_RESERVE_WINDOW_NOT_ALLOCATED;
431 rsv->rsv_alloc_hit = 0;
432 rb_erase(&rsv->rsv_node, &EXT4_SB(sb)->s_rsv_window_root);
436 * rsv_is_empty() -- Check if the reservation window is allocated.
437 * @rsv: given reservation window to check
439 * returns 1 if the end block is EXT4_RESERVE_WINDOW_NOT_ALLOCATED.
441 static inline int rsv_is_empty(struct ext4_reserve_window *rsv)
443 /* a valid reservation end block could not be 0 */
444 return rsv->_rsv_end == EXT4_RESERVE_WINDOW_NOT_ALLOCATED;
448 * ext4_init_block_alloc_info()
449 * @inode: file inode structure
451 * Allocate and initialize the reservation window structure, and
452 * link the window to the ext4 inode structure at last
454 * The reservation window structure is only dynamically allocated
455 * and linked to ext4 inode the first time the open file
456 * needs a new block. So, before every ext4_new_block(s) call, for
457 * regular files, we should check whether the reservation window
458 * structure exists or not. In the latter case, this function is called.
459 * Fail to do so will result in block reservation being turned off for that
462 * This function is called from ext4_get_blocks_handle(), also called
463 * when setting the reservation window size through ioctl before the file
464 * is open for write (needs block allocation).
466 * Needs truncate_mutex protection prior to call this function.
468 void ext4_init_block_alloc_info(struct inode *inode)
470 struct ext4_inode_info *ei = EXT4_I(inode);
471 struct ext4_block_alloc_info *block_i = ei->i_block_alloc_info;
472 struct super_block *sb = inode->i_sb;
474 block_i = kmalloc(sizeof(*block_i), GFP_NOFS);
476 struct ext4_reserve_window_node *rsv = &block_i->rsv_window_node;
478 rsv->rsv_start = EXT4_RESERVE_WINDOW_NOT_ALLOCATED;
479 rsv->rsv_end = EXT4_RESERVE_WINDOW_NOT_ALLOCATED;
482 * if filesystem is mounted with NORESERVATION, the goal
483 * reservation window size is set to zero to indicate
484 * block reservation is off
486 if (!test_opt(sb, RESERVATION))
487 rsv->rsv_goal_size = 0;
489 rsv->rsv_goal_size = EXT4_DEFAULT_RESERVE_BLOCKS;
490 rsv->rsv_alloc_hit = 0;
491 block_i->last_alloc_logical_block = 0;
492 block_i->last_alloc_physical_block = 0;
494 ei->i_block_alloc_info = block_i;
498 * ext4_discard_reservation()
501 * Discard(free) block reservation window on last file close, or truncate
504 * It is being called in three cases:
505 * ext4_release_file(): last writer close the file
506 * ext4_clear_inode(): last iput(), when nobody link to this file.
507 * ext4_truncate(): when the block indirect map is about to change.
510 void ext4_discard_reservation(struct inode *inode)
512 struct ext4_inode_info *ei = EXT4_I(inode);
513 struct ext4_block_alloc_info *block_i = ei->i_block_alloc_info;
514 struct ext4_reserve_window_node *rsv;
515 spinlock_t *rsv_lock = &EXT4_SB(inode->i_sb)->s_rsv_window_lock;
520 rsv = &block_i->rsv_window_node;
521 if (!rsv_is_empty(&rsv->rsv_window)) {
523 if (!rsv_is_empty(&rsv->rsv_window))
524 rsv_window_remove(inode->i_sb, rsv);
525 spin_unlock(rsv_lock);
530 * ext4_free_blocks_sb() -- Free given blocks and update quota
531 * @handle: handle to this transaction
533 * @block: start physcial block to free
534 * @count: number of blocks to free
535 * @pdquot_freed_blocks: pointer to quota
537 void ext4_free_blocks_sb(handle_t *handle, struct super_block *sb,
538 ext4_fsblk_t block, unsigned long count,
539 unsigned long *pdquot_freed_blocks)
541 struct buffer_head *bitmap_bh = NULL;
542 struct buffer_head *gd_bh;
543 ext4_group_t block_group;
546 unsigned long overflow;
547 struct ext4_group_desc * desc;
548 struct ext4_super_block * es;
549 struct ext4_sb_info *sbi;
551 ext4_grpblk_t group_freed;
553 *pdquot_freed_blocks = 0;
556 if (block < le32_to_cpu(es->s_first_data_block) ||
557 block + count < block ||
558 block + count > ext4_blocks_count(es)) {
559 ext4_error (sb, "ext4_free_blocks",
560 "Freeing blocks not in datazone - "
561 "block = %llu, count = %lu", block, count);
565 ext4_debug ("freeing block(s) %llu-%llu\n", block, block + count - 1);
569 ext4_get_group_no_and_offset(sb, block, &block_group, &bit);
571 * Check to see if we are freeing blocks across a group
574 if (bit + count > EXT4_BLOCKS_PER_GROUP(sb)) {
575 overflow = bit + count - EXT4_BLOCKS_PER_GROUP(sb);
579 bitmap_bh = read_block_bitmap(sb, block_group);
582 desc = ext4_get_group_desc (sb, block_group, &gd_bh);
586 if (in_range(ext4_block_bitmap(sb, desc), block, count) ||
587 in_range(ext4_inode_bitmap(sb, desc), block, count) ||
588 in_range(block, ext4_inode_table(sb, desc), sbi->s_itb_per_group) ||
589 in_range(block + count - 1, ext4_inode_table(sb, desc),
590 sbi->s_itb_per_group)) {
591 ext4_error (sb, "ext4_free_blocks",
592 "Freeing blocks in system zones - "
593 "Block = %llu, count = %lu",
599 * We are about to start releasing blocks in the bitmap,
600 * so we need undo access.
602 /* @@@ check errors */
603 BUFFER_TRACE(bitmap_bh, "getting undo access");
604 err = ext4_journal_get_undo_access(handle, bitmap_bh);
609 * We are about to modify some metadata. Call the journal APIs
610 * to unshare ->b_data if a currently-committing transaction is
613 BUFFER_TRACE(gd_bh, "get_write_access");
614 err = ext4_journal_get_write_access(handle, gd_bh);
618 jbd_lock_bh_state(bitmap_bh);
620 for (i = 0, group_freed = 0; i < count; i++) {
622 * An HJ special. This is expensive...
624 #ifdef CONFIG_JBD2_DEBUG
625 jbd_unlock_bh_state(bitmap_bh);
627 struct buffer_head *debug_bh;
628 debug_bh = sb_find_get_block(sb, block + i);
630 BUFFER_TRACE(debug_bh, "Deleted!");
631 if (!bh2jh(bitmap_bh)->b_committed_data)
632 BUFFER_TRACE(debug_bh,
633 "No commited data in bitmap");
634 BUFFER_TRACE2(debug_bh, bitmap_bh, "bitmap");
638 jbd_lock_bh_state(bitmap_bh);
640 if (need_resched()) {
641 jbd_unlock_bh_state(bitmap_bh);
643 jbd_lock_bh_state(bitmap_bh);
645 /* @@@ This prevents newly-allocated data from being
646 * freed and then reallocated within the same
649 * Ideally we would want to allow that to happen, but to
650 * do so requires making jbd2_journal_forget() capable of
651 * revoking the queued write of a data block, which
652 * implies blocking on the journal lock. *forget()
653 * cannot block due to truncate races.
655 * Eventually we can fix this by making jbd2_journal_forget()
656 * return a status indicating whether or not it was able
657 * to revoke the buffer. On successful revoke, it is
658 * safe not to set the allocation bit in the committed
659 * bitmap, because we know that there is no outstanding
660 * activity on the buffer any more and so it is safe to
663 BUFFER_TRACE(bitmap_bh, "set in b_committed_data");
664 J_ASSERT_BH(bitmap_bh,
665 bh2jh(bitmap_bh)->b_committed_data != NULL);
666 ext4_set_bit_atomic(sb_bgl_lock(sbi, block_group), bit + i,
667 bh2jh(bitmap_bh)->b_committed_data);
670 * We clear the bit in the bitmap after setting the committed
671 * data bit, because this is the reverse order to that which
672 * the allocator uses.
674 BUFFER_TRACE(bitmap_bh, "clear bit");
675 if (!ext4_clear_bit_atomic(sb_bgl_lock(sbi, block_group),
676 bit + i, bitmap_bh->b_data)) {
677 jbd_unlock_bh_state(bitmap_bh);
678 ext4_error(sb, __FUNCTION__,
679 "bit already cleared for block %llu",
680 (ext4_fsblk_t)(block + i));
681 jbd_lock_bh_state(bitmap_bh);
682 BUFFER_TRACE(bitmap_bh, "bit already cleared");
687 jbd_unlock_bh_state(bitmap_bh);
689 spin_lock(sb_bgl_lock(sbi, block_group));
690 desc->bg_free_blocks_count =
691 cpu_to_le16(le16_to_cpu(desc->bg_free_blocks_count) +
693 desc->bg_checksum = ext4_group_desc_csum(sbi, block_group, desc);
694 spin_unlock(sb_bgl_lock(sbi, block_group));
695 percpu_counter_add(&sbi->s_freeblocks_counter, count);
697 /* We dirtied the bitmap block */
698 BUFFER_TRACE(bitmap_bh, "dirtied bitmap block");
699 err = ext4_journal_dirty_metadata(handle, bitmap_bh);
701 /* And the group descriptor block */
702 BUFFER_TRACE(gd_bh, "dirtied group descriptor block");
703 ret = ext4_journal_dirty_metadata(handle, gd_bh);
705 *pdquot_freed_blocks += group_freed;
707 if (overflow && !err) {
715 ext4_std_error(sb, err);
720 * ext4_free_blocks() -- Free given blocks and update quota
721 * @handle: handle for this transaction
723 * @block: start physical block to free
724 * @count: number of blocks to count
726 void ext4_free_blocks(handle_t *handle, struct inode *inode,
727 ext4_fsblk_t block, unsigned long count)
729 struct super_block * sb;
730 unsigned long dquot_freed_blocks;
734 printk ("ext4_free_blocks: nonexistent device");
737 ext4_free_blocks_sb(handle, sb, block, count, &dquot_freed_blocks);
738 if (dquot_freed_blocks)
739 DQUOT_FREE_BLOCK(inode, dquot_freed_blocks);
744 * ext4_test_allocatable()
745 * @nr: given allocation block group
746 * @bh: bufferhead contains the bitmap of the given block group
748 * For ext4 allocations, we must not reuse any blocks which are
749 * allocated in the bitmap buffer's "last committed data" copy. This
750 * prevents deletes from freeing up the page for reuse until we have
751 * committed the delete transaction.
753 * If we didn't do this, then deleting something and reallocating it as
754 * data would allow the old block to be overwritten before the
755 * transaction committed (because we force data to disk before commit).
756 * This would lead to corruption if we crashed between overwriting the
757 * data and committing the delete.
759 * @@@ We may want to make this allocation behaviour conditional on
760 * data-writes at some point, and disable it for metadata allocations or
763 static int ext4_test_allocatable(ext4_grpblk_t nr, struct buffer_head *bh)
766 struct journal_head *jh = bh2jh(bh);
768 if (ext4_test_bit(nr, bh->b_data))
771 jbd_lock_bh_state(bh);
772 if (!jh->b_committed_data)
775 ret = !ext4_test_bit(nr, jh->b_committed_data);
776 jbd_unlock_bh_state(bh);
781 * bitmap_search_next_usable_block()
782 * @start: the starting block (group relative) of the search
783 * @bh: bufferhead contains the block group bitmap
784 * @maxblocks: the ending block (group relative) of the reservation
786 * The bitmap search --- search forward alternately through the actual
787 * bitmap on disk and the last-committed copy in journal, until we find a
788 * bit free in both bitmaps.
791 bitmap_search_next_usable_block(ext4_grpblk_t start, struct buffer_head *bh,
792 ext4_grpblk_t maxblocks)
795 struct journal_head *jh = bh2jh(bh);
797 while (start < maxblocks) {
798 next = ext4_find_next_zero_bit(bh->b_data, maxblocks, start);
799 if (next >= maxblocks)
801 if (ext4_test_allocatable(next, bh))
803 jbd_lock_bh_state(bh);
804 if (jh->b_committed_data)
805 start = ext4_find_next_zero_bit(jh->b_committed_data,
807 jbd_unlock_bh_state(bh);
813 * find_next_usable_block()
814 * @start: the starting block (group relative) to find next
815 * allocatable block in bitmap.
816 * @bh: bufferhead contains the block group bitmap
817 * @maxblocks: the ending block (group relative) for the search
819 * Find an allocatable block in a bitmap. We honor both the bitmap and
820 * its last-committed copy (if that exists), and perform the "most
821 * appropriate allocation" algorithm of looking for a free block near
822 * the initial goal; then for a free byte somewhere in the bitmap; then
823 * for any free bit in the bitmap.
826 find_next_usable_block(ext4_grpblk_t start, struct buffer_head *bh,
827 ext4_grpblk_t maxblocks)
829 ext4_grpblk_t here, next;
834 * The goal was occupied; search forward for a free
835 * block within the next XX blocks.
837 * end_goal is more or less random, but it has to be
838 * less than EXT4_BLOCKS_PER_GROUP. Aligning up to the
839 * next 64-bit boundary is simple..
841 ext4_grpblk_t end_goal = (start + 63) & ~63;
842 if (end_goal > maxblocks)
843 end_goal = maxblocks;
844 here = ext4_find_next_zero_bit(bh->b_data, end_goal, start);
845 if (here < end_goal && ext4_test_allocatable(here, bh))
847 ext4_debug("Bit not found near goal\n");
854 p = ((char *)bh->b_data) + (here >> 3);
855 r = memscan(p, 0, ((maxblocks + 7) >> 3) - (here >> 3));
856 next = (r - ((char *)bh->b_data)) << 3;
858 if (next < maxblocks && next >= start && ext4_test_allocatable(next, bh))
862 * The bitmap search --- search forward alternately through the actual
863 * bitmap and the last-committed copy until we find a bit free in
866 here = bitmap_search_next_usable_block(here, bh, maxblocks);
872 * @block: the free block (group relative) to allocate
873 * @bh: the bufferhead containts the block group bitmap
875 * We think we can allocate this block in this bitmap. Try to set the bit.
876 * If that succeeds then check that nobody has allocated and then freed the
877 * block since we saw that is was not marked in b_committed_data. If it _was_
878 * allocated and freed then clear the bit in the bitmap again and return
882 claim_block(spinlock_t *lock, ext4_grpblk_t block, struct buffer_head *bh)
884 struct journal_head *jh = bh2jh(bh);
887 if (ext4_set_bit_atomic(lock, block, bh->b_data))
889 jbd_lock_bh_state(bh);
890 if (jh->b_committed_data && ext4_test_bit(block,jh->b_committed_data)) {
891 ext4_clear_bit_atomic(lock, block, bh->b_data);
896 jbd_unlock_bh_state(bh);
901 * ext4_try_to_allocate()
903 * @handle: handle to this transaction
904 * @group: given allocation block group
905 * @bitmap_bh: bufferhead holds the block bitmap
906 * @grp_goal: given target block within the group
907 * @count: target number of blocks to allocate
908 * @my_rsv: reservation window
910 * Attempt to allocate blocks within a give range. Set the range of allocation
911 * first, then find the first free bit(s) from the bitmap (within the range),
912 * and at last, allocate the blocks by claiming the found free bit as allocated.
914 * To set the range of this allocation:
915 * if there is a reservation window, only try to allocate block(s) from the
916 * file's own reservation window;
917 * Otherwise, the allocation range starts from the give goal block, ends at
918 * the block group's last block.
920 * If we failed to allocate the desired block then we may end up crossing to a
921 * new bitmap. In that case we must release write access to the old one via
922 * ext4_journal_release_buffer(), else we'll run out of credits.
925 ext4_try_to_allocate(struct super_block *sb, handle_t *handle,
926 ext4_group_t group, struct buffer_head *bitmap_bh,
927 ext4_grpblk_t grp_goal, unsigned long *count,
928 struct ext4_reserve_window *my_rsv)
930 ext4_fsblk_t group_first_block;
931 ext4_grpblk_t start, end;
932 unsigned long num = 0;
934 /* we do allocation within the reservation window if we have a window */
936 group_first_block = ext4_group_first_block_no(sb, group);
937 if (my_rsv->_rsv_start >= group_first_block)
938 start = my_rsv->_rsv_start - group_first_block;
940 /* reservation window cross group boundary */
942 end = my_rsv->_rsv_end - group_first_block + 1;
943 if (end > EXT4_BLOCKS_PER_GROUP(sb))
944 /* reservation window crosses group boundary */
945 end = EXT4_BLOCKS_PER_GROUP(sb);
946 if ((start <= grp_goal) && (grp_goal < end))
955 end = EXT4_BLOCKS_PER_GROUP(sb);
958 BUG_ON(start > EXT4_BLOCKS_PER_GROUP(sb));
961 if (grp_goal < 0 || !ext4_test_allocatable(grp_goal, bitmap_bh)) {
962 grp_goal = find_next_usable_block(start, bitmap_bh, end);
968 for (i = 0; i < 7 && grp_goal > start &&
969 ext4_test_allocatable(grp_goal - 1,
977 if (!claim_block(sb_bgl_lock(EXT4_SB(sb), group),
978 grp_goal, bitmap_bh)) {
980 * The block was allocated by another thread, or it was
981 * allocated and then freed by another thread
991 while (num < *count && grp_goal < end
992 && ext4_test_allocatable(grp_goal, bitmap_bh)
993 && claim_block(sb_bgl_lock(EXT4_SB(sb), group),
994 grp_goal, bitmap_bh)) {
999 return grp_goal - num;
1006 * find_next_reservable_window():
1007 * find a reservable space within the given range.
1008 * It does not allocate the reservation window for now:
1009 * alloc_new_reservation() will do the work later.
1011 * @search_head: the head of the searching list;
1012 * This is not necessarily the list head of the whole filesystem
1014 * We have both head and start_block to assist the search
1015 * for the reservable space. The list starts from head,
1016 * but we will shift to the place where start_block is,
1017 * then start from there, when looking for a reservable space.
1019 * @size: the target new reservation window size
1021 * @group_first_block: the first block we consider to start
1022 * the real search from
1025 * the maximum block number that our goal reservable space
1026 * could start from. This is normally the last block in this
1027 * group. The search will end when we found the start of next
1028 * possible reservable space is out of this boundary.
1029 * This could handle the cross boundary reservation window
1032 * basically we search from the given range, rather than the whole
1033 * reservation double linked list, (start_block, last_block)
1034 * to find a free region that is of my size and has not
1038 static int find_next_reservable_window(
1039 struct ext4_reserve_window_node *search_head,
1040 struct ext4_reserve_window_node *my_rsv,
1041 struct super_block * sb,
1042 ext4_fsblk_t start_block,
1043 ext4_fsblk_t last_block)
1045 struct rb_node *next;
1046 struct ext4_reserve_window_node *rsv, *prev;
1048 int size = my_rsv->rsv_goal_size;
1050 /* TODO: make the start of the reservation window byte-aligned */
1051 /* cur = *start_block & ~7;*/
1058 if (cur <= rsv->rsv_end)
1059 cur = rsv->rsv_end + 1;
1062 * in the case we could not find a reservable space
1063 * that is what is expected, during the re-search, we could
1064 * remember what's the largest reservable space we could have
1065 * and return that one.
1067 * For now it will fail if we could not find the reservable
1068 * space with expected-size (or more)...
1070 if (cur > last_block)
1071 return -1; /* fail */
1074 next = rb_next(&rsv->rsv_node);
1075 rsv = rb_entry(next,struct ext4_reserve_window_node,rsv_node);
1078 * Reached the last reservation, we can just append to the
1084 if (cur + size <= rsv->rsv_start) {
1086 * Found a reserveable space big enough. We could
1087 * have a reservation across the group boundary here
1093 * we come here either :
1094 * when we reach the end of the whole list,
1095 * and there is empty reservable space after last entry in the list.
1096 * append it to the end of the list.
1098 * or we found one reservable space in the middle of the list,
1099 * return the reservation window that we could append to.
1103 if ((prev != my_rsv) && (!rsv_is_empty(&my_rsv->rsv_window)))
1104 rsv_window_remove(sb, my_rsv);
1107 * Let's book the whole avaliable window for now. We will check the
1108 * disk bitmap later and then, if there are free blocks then we adjust
1109 * the window size if it's larger than requested.
1110 * Otherwise, we will remove this node from the tree next time
1111 * call find_next_reservable_window.
1113 my_rsv->rsv_start = cur;
1114 my_rsv->rsv_end = cur + size - 1;
1115 my_rsv->rsv_alloc_hit = 0;
1118 ext4_rsv_window_add(sb, my_rsv);
1124 * alloc_new_reservation()--allocate a new reservation window
1126 * To make a new reservation, we search part of the filesystem
1127 * reservation list (the list that inside the group). We try to
1128 * allocate a new reservation window near the allocation goal,
1129 * or the beginning of the group, if there is no goal.
1131 * We first find a reservable space after the goal, then from
1132 * there, we check the bitmap for the first free block after
1133 * it. If there is no free block until the end of group, then the
1134 * whole group is full, we failed. Otherwise, check if the free
1135 * block is inside the expected reservable space, if so, we
1137 * If the first free block is outside the reservable space, then
1138 * start from the first free block, we search for next available
1141 * on succeed, a new reservation will be found and inserted into the list
1142 * It contains at least one free block, and it does not overlap with other
1143 * reservation windows.
1145 * failed: we failed to find a reservation window in this group
1147 * @rsv: the reservation
1149 * @grp_goal: The goal (group-relative). It is where the search for a
1150 * free reservable space should start from.
1151 * if we have a grp_goal(grp_goal >0 ), then start from there,
1152 * no grp_goal(grp_goal = -1), we start from the first block
1155 * @sb: the super block
1156 * @group: the group we are trying to allocate in
1157 * @bitmap_bh: the block group block bitmap
1160 static int alloc_new_reservation(struct ext4_reserve_window_node *my_rsv,
1161 ext4_grpblk_t grp_goal, struct super_block *sb,
1162 ext4_group_t group, struct buffer_head *bitmap_bh)
1164 struct ext4_reserve_window_node *search_head;
1165 ext4_fsblk_t group_first_block, group_end_block, start_block;
1166 ext4_grpblk_t first_free_block;
1167 struct rb_root *fs_rsv_root = &EXT4_SB(sb)->s_rsv_window_root;
1170 spinlock_t *rsv_lock = &EXT4_SB(sb)->s_rsv_window_lock;
1172 group_first_block = ext4_group_first_block_no(sb, group);
1173 group_end_block = group_first_block + (EXT4_BLOCKS_PER_GROUP(sb) - 1);
1176 start_block = group_first_block;
1178 start_block = grp_goal + group_first_block;
1180 size = my_rsv->rsv_goal_size;
1182 if (!rsv_is_empty(&my_rsv->rsv_window)) {
1184 * if the old reservation is cross group boundary
1185 * and if the goal is inside the old reservation window,
1186 * we will come here when we just failed to allocate from
1187 * the first part of the window. We still have another part
1188 * that belongs to the next group. In this case, there is no
1189 * point to discard our window and try to allocate a new one
1190 * in this group(which will fail). we should
1191 * keep the reservation window, just simply move on.
1193 * Maybe we could shift the start block of the reservation
1194 * window to the first block of next group.
1197 if ((my_rsv->rsv_start <= group_end_block) &&
1198 (my_rsv->rsv_end > group_end_block) &&
1199 (start_block >= my_rsv->rsv_start))
1202 if ((my_rsv->rsv_alloc_hit >
1203 (my_rsv->rsv_end - my_rsv->rsv_start + 1) / 2)) {
1205 * if the previously allocation hit ratio is
1206 * greater than 1/2, then we double the size of
1207 * the reservation window the next time,
1208 * otherwise we keep the same size window
1211 if (size > EXT4_MAX_RESERVE_BLOCKS)
1212 size = EXT4_MAX_RESERVE_BLOCKS;
1213 my_rsv->rsv_goal_size= size;
1217 spin_lock(rsv_lock);
1219 * shift the search start to the window near the goal block
1221 search_head = search_reserve_window(fs_rsv_root, start_block);
1224 * find_next_reservable_window() simply finds a reservable window
1225 * inside the given range(start_block, group_end_block).
1227 * To make sure the reservation window has a free bit inside it, we
1228 * need to check the bitmap after we found a reservable window.
1231 ret = find_next_reservable_window(search_head, my_rsv, sb,
1232 start_block, group_end_block);
1235 if (!rsv_is_empty(&my_rsv->rsv_window))
1236 rsv_window_remove(sb, my_rsv);
1237 spin_unlock(rsv_lock);
1242 * On success, find_next_reservable_window() returns the
1243 * reservation window where there is a reservable space after it.
1244 * Before we reserve this reservable space, we need
1245 * to make sure there is at least a free block inside this region.
1247 * searching the first free bit on the block bitmap and copy of
1248 * last committed bitmap alternatively, until we found a allocatable
1249 * block. Search start from the start block of the reservable space
1252 spin_unlock(rsv_lock);
1253 first_free_block = bitmap_search_next_usable_block(
1254 my_rsv->rsv_start - group_first_block,
1255 bitmap_bh, group_end_block - group_first_block + 1);
1257 if (first_free_block < 0) {
1259 * no free block left on the bitmap, no point
1260 * to reserve the space. return failed.
1262 spin_lock(rsv_lock);
1263 if (!rsv_is_empty(&my_rsv->rsv_window))
1264 rsv_window_remove(sb, my_rsv);
1265 spin_unlock(rsv_lock);
1266 return -1; /* failed */
1269 start_block = first_free_block + group_first_block;
1271 * check if the first free block is within the
1272 * free space we just reserved
1274 if (start_block >= my_rsv->rsv_start && start_block <= my_rsv->rsv_end)
1275 return 0; /* success */
1277 * if the first free bit we found is out of the reservable space
1278 * continue search for next reservable space,
1279 * start from where the free block is,
1280 * we also shift the list head to where we stopped last time
1282 search_head = my_rsv;
1283 spin_lock(rsv_lock);
1288 * try_to_extend_reservation()
1289 * @my_rsv: given reservation window
1291 * @size: the delta to extend
1293 * Attempt to expand the reservation window large enough to have
1294 * required number of free blocks
1296 * Since ext4_try_to_allocate() will always allocate blocks within
1297 * the reservation window range, if the window size is too small,
1298 * multiple blocks allocation has to stop at the end of the reservation
1299 * window. To make this more efficient, given the total number of
1300 * blocks needed and the current size of the window, we try to
1301 * expand the reservation window size if necessary on a best-effort
1302 * basis before ext4_new_blocks() tries to allocate blocks,
1304 static void try_to_extend_reservation(struct ext4_reserve_window_node *my_rsv,
1305 struct super_block *sb, int size)
1307 struct ext4_reserve_window_node *next_rsv;
1308 struct rb_node *next;
1309 spinlock_t *rsv_lock = &EXT4_SB(sb)->s_rsv_window_lock;
1311 if (!spin_trylock(rsv_lock))
1314 next = rb_next(&my_rsv->rsv_node);
1317 my_rsv->rsv_end += size;
1319 next_rsv = rb_entry(next, struct ext4_reserve_window_node, rsv_node);
1321 if ((next_rsv->rsv_start - my_rsv->rsv_end - 1) >= size)
1322 my_rsv->rsv_end += size;
1324 my_rsv->rsv_end = next_rsv->rsv_start - 1;
1326 spin_unlock(rsv_lock);
1330 * ext4_try_to_allocate_with_rsv()
1332 * @handle: handle to this transaction
1333 * @group: given allocation block group
1334 * @bitmap_bh: bufferhead holds the block bitmap
1335 * @grp_goal: given target block within the group
1336 * @count: target number of blocks to allocate
1337 * @my_rsv: reservation window
1338 * @errp: pointer to store the error code
1340 * This is the main function used to allocate a new block and its reservation
1343 * Each time when a new block allocation is need, first try to allocate from
1344 * its own reservation. If it does not have a reservation window, instead of
1345 * looking for a free bit on bitmap first, then look up the reservation list to
1346 * see if it is inside somebody else's reservation window, we try to allocate a
1347 * reservation window for it starting from the goal first. Then do the block
1348 * allocation within the reservation window.
1350 * This will avoid keeping on searching the reservation list again and
1351 * again when somebody is looking for a free block (without
1352 * reservation), and there are lots of free blocks, but they are all
1355 * We use a red-black tree for the per-filesystem reservation list.
1358 static ext4_grpblk_t
1359 ext4_try_to_allocate_with_rsv(struct super_block *sb, handle_t *handle,
1360 ext4_group_t group, struct buffer_head *bitmap_bh,
1361 ext4_grpblk_t grp_goal,
1362 struct ext4_reserve_window_node * my_rsv,
1363 unsigned long *count, int *errp)
1365 ext4_fsblk_t group_first_block, group_last_block;
1366 ext4_grpblk_t ret = 0;
1368 unsigned long num = *count;
1373 * Make sure we use undo access for the bitmap, because it is critical
1374 * that we do the frozen_data COW on bitmap buffers in all cases even
1375 * if the buffer is in BJ_Forget state in the committing transaction.
1377 BUFFER_TRACE(bitmap_bh, "get undo access for new block");
1378 fatal = ext4_journal_get_undo_access(handle, bitmap_bh);
1385 * we don't deal with reservation when
1386 * filesystem is mounted without reservation
1387 * or the file is not a regular file
1388 * or last attempt to allocate a block with reservation turned on failed
1390 if (my_rsv == NULL ) {
1391 ret = ext4_try_to_allocate(sb, handle, group, bitmap_bh,
1392 grp_goal, count, NULL);
1396 * grp_goal is a group relative block number (if there is a goal)
1397 * 0 <= grp_goal < EXT4_BLOCKS_PER_GROUP(sb)
1398 * first block is a filesystem wide block number
1399 * first block is the block number of the first block in this group
1401 group_first_block = ext4_group_first_block_no(sb, group);
1402 group_last_block = group_first_block + (EXT4_BLOCKS_PER_GROUP(sb) - 1);
1405 * Basically we will allocate a new block from inode's reservation
1408 * We need to allocate a new reservation window, if:
1409 * a) inode does not have a reservation window; or
1410 * b) last attempt to allocate a block from existing reservation
1412 * c) we come here with a goal and with a reservation window
1414 * We do not need to allocate a new reservation window if we come here
1415 * at the beginning with a goal and the goal is inside the window, or
1416 * we don't have a goal but already have a reservation window.
1417 * then we could go to allocate from the reservation window directly.
1420 if (rsv_is_empty(&my_rsv->rsv_window) || (ret < 0) ||
1421 !goal_in_my_reservation(&my_rsv->rsv_window,
1422 grp_goal, group, sb)) {
1423 if (my_rsv->rsv_goal_size < *count)
1424 my_rsv->rsv_goal_size = *count;
1425 ret = alloc_new_reservation(my_rsv, grp_goal, sb,
1430 if (!goal_in_my_reservation(&my_rsv->rsv_window,
1431 grp_goal, group, sb))
1433 } else if (grp_goal >= 0) {
1434 int curr = my_rsv->rsv_end -
1435 (grp_goal + group_first_block) + 1;
1438 try_to_extend_reservation(my_rsv, sb,
1442 if ((my_rsv->rsv_start > group_last_block) ||
1443 (my_rsv->rsv_end < group_first_block)) {
1444 rsv_window_dump(&EXT4_SB(sb)->s_rsv_window_root, 1);
1447 ret = ext4_try_to_allocate(sb, handle, group, bitmap_bh,
1448 grp_goal, &num, &my_rsv->rsv_window);
1450 my_rsv->rsv_alloc_hit += num;
1452 break; /* succeed */
1458 BUFFER_TRACE(bitmap_bh, "journal_dirty_metadata for "
1460 fatal = ext4_journal_dirty_metadata(handle, bitmap_bh);
1468 BUFFER_TRACE(bitmap_bh, "journal_release_buffer");
1469 ext4_journal_release_buffer(handle, bitmap_bh);
1474 * ext4_has_free_blocks()
1475 * @sbi: in-core super block structure.
1477 * Check if filesystem has at least 1 free block available for allocation.
1479 static int ext4_has_free_blocks(struct ext4_sb_info *sbi)
1481 ext4_fsblk_t free_blocks, root_blocks;
1483 free_blocks = percpu_counter_read_positive(&sbi->s_freeblocks_counter);
1484 root_blocks = ext4_r_blocks_count(sbi->s_es);
1485 if (free_blocks < root_blocks + 1 && !capable(CAP_SYS_RESOURCE) &&
1486 sbi->s_resuid != current->fsuid &&
1487 (sbi->s_resgid == 0 || !in_group_p (sbi->s_resgid))) {
1494 * ext4_should_retry_alloc()
1496 * @retries number of attemps has been made
1498 * ext4_should_retry_alloc() is called when ENOSPC is returned, and if
1499 * it is profitable to retry the operation, this function will wait
1500 * for the current or commiting transaction to complete, and then
1503 * if the total number of retries exceed three times, return FALSE.
1505 int ext4_should_retry_alloc(struct super_block *sb, int *retries)
1507 if (!ext4_has_free_blocks(EXT4_SB(sb)) || (*retries)++ > 3)
1510 jbd_debug(1, "%s: retrying operation after ENOSPC\n", sb->s_id);
1512 return jbd2_journal_force_commit_nested(EXT4_SB(sb)->s_journal);
1516 * ext4_new_blocks() -- core block(s) allocation function
1517 * @handle: handle to this transaction
1518 * @inode: file inode
1519 * @goal: given target block(filesystem wide)
1520 * @count: target number of blocks to allocate
1523 * ext4_new_blocks uses a goal block to assist allocation. It tries to
1524 * allocate block(s) from the block group contains the goal block first. If that
1525 * fails, it will try to allocate block(s) from other block groups without
1526 * any specific goal block.
1529 ext4_fsblk_t ext4_new_blocks(handle_t *handle, struct inode *inode,
1530 ext4_fsblk_t goal, unsigned long *count, int *errp)
1532 struct buffer_head *bitmap_bh = NULL;
1533 struct buffer_head *gdp_bh;
1534 ext4_group_t group_no;
1535 ext4_group_t goal_group;
1536 ext4_grpblk_t grp_target_blk; /* blockgroup relative goal block */
1537 ext4_grpblk_t grp_alloc_blk; /* blockgroup-relative allocated block*/
1538 ext4_fsblk_t ret_block; /* filesyetem-wide allocated block */
1539 ext4_group_t bgi; /* blockgroup iteration index */
1541 int performed_allocation = 0;
1542 ext4_grpblk_t free_blocks; /* number of free blocks in a group */
1543 struct super_block *sb;
1544 struct ext4_group_desc *gdp;
1545 struct ext4_super_block *es;
1546 struct ext4_sb_info *sbi;
1547 struct ext4_reserve_window_node *my_rsv = NULL;
1548 struct ext4_block_alloc_info *block_i;
1549 unsigned short windowsz = 0;
1550 ext4_group_t ngroups;
1551 unsigned long num = *count;
1556 printk("ext4_new_block: nonexistent device");
1561 * Check quota for allocation of this block.
1563 if (DQUOT_ALLOC_BLOCK(inode, num)) {
1569 es = EXT4_SB(sb)->s_es;
1570 ext4_debug("goal=%lu.\n", goal);
1572 * Allocate a block from reservation only when
1573 * filesystem is mounted with reservation(default,-o reservation), and
1574 * it's a regular file, and
1575 * the desired window size is greater than 0 (One could use ioctl
1576 * command EXT4_IOC_SETRSVSZ to set the window size to 0 to turn off
1577 * reservation on that particular file)
1579 block_i = EXT4_I(inode)->i_block_alloc_info;
1580 if (block_i && ((windowsz = block_i->rsv_window_node.rsv_goal_size) > 0))
1581 my_rsv = &block_i->rsv_window_node;
1583 if (!ext4_has_free_blocks(sbi)) {
1589 * First, test whether the goal block is free.
1591 if (goal < le32_to_cpu(es->s_first_data_block) ||
1592 goal >= ext4_blocks_count(es))
1593 goal = le32_to_cpu(es->s_first_data_block);
1594 ext4_get_group_no_and_offset(sb, goal, &group_no, &grp_target_blk);
1595 goal_group = group_no;
1597 gdp = ext4_get_group_desc(sb, group_no, &gdp_bh);
1601 free_blocks = le16_to_cpu(gdp->bg_free_blocks_count);
1603 * if there is not enough free blocks to make a new resevation
1604 * turn off reservation for this allocation
1606 if (my_rsv && (free_blocks < windowsz)
1607 && (rsv_is_empty(&my_rsv->rsv_window)))
1610 if (free_blocks > 0) {
1611 bitmap_bh = read_block_bitmap(sb, group_no);
1614 grp_alloc_blk = ext4_try_to_allocate_with_rsv(sb, handle,
1615 group_no, bitmap_bh, grp_target_blk,
1616 my_rsv, &num, &fatal);
1619 if (grp_alloc_blk >= 0)
1623 ngroups = EXT4_SB(sb)->s_groups_count;
1627 * Now search the rest of the groups. We assume that
1628 * i and gdp correctly point to the last group visited.
1630 for (bgi = 0; bgi < ngroups; bgi++) {
1632 if (group_no >= ngroups)
1634 gdp = ext4_get_group_desc(sb, group_no, &gdp_bh);
1637 free_blocks = le16_to_cpu(gdp->bg_free_blocks_count);
1639 * skip this group if the number of
1640 * free blocks is less than half of the reservation
1643 if (free_blocks <= (windowsz/2))
1647 bitmap_bh = read_block_bitmap(sb, group_no);
1651 * try to allocate block(s) from this group, without a goal(-1).
1653 grp_alloc_blk = ext4_try_to_allocate_with_rsv(sb, handle,
1654 group_no, bitmap_bh, -1, my_rsv,
1658 if (grp_alloc_blk >= 0)
1662 * We may end up a bogus ealier ENOSPC error due to
1663 * filesystem is "full" of reservations, but
1664 * there maybe indeed free blocks avaliable on disk
1665 * In this case, we just forget about the reservations
1666 * just do block allocation as without reservations.
1671 group_no = goal_group;
1674 /* No space left on the device */
1680 ext4_debug("using block group %d(%d)\n",
1681 group_no, gdp->bg_free_blocks_count);
1683 BUFFER_TRACE(gdp_bh, "get_write_access");
1684 fatal = ext4_journal_get_write_access(handle, gdp_bh);
1688 ret_block = grp_alloc_blk + ext4_group_first_block_no(sb, group_no);
1690 if (in_range(ext4_block_bitmap(sb, gdp), ret_block, num) ||
1691 in_range(ext4_inode_bitmap(sb, gdp), ret_block, num) ||
1692 in_range(ret_block, ext4_inode_table(sb, gdp),
1693 EXT4_SB(sb)->s_itb_per_group) ||
1694 in_range(ret_block + num - 1, ext4_inode_table(sb, gdp),
1695 EXT4_SB(sb)->s_itb_per_group)) {
1696 ext4_error(sb, "ext4_new_block",
1697 "Allocating block in system zone - "
1698 "blocks from %llu, length %lu",
1703 performed_allocation = 1;
1705 #ifdef CONFIG_JBD2_DEBUG
1707 struct buffer_head *debug_bh;
1709 /* Record bitmap buffer state in the newly allocated block */
1710 debug_bh = sb_find_get_block(sb, ret_block);
1712 BUFFER_TRACE(debug_bh, "state when allocated");
1713 BUFFER_TRACE2(debug_bh, bitmap_bh, "bitmap state");
1717 jbd_lock_bh_state(bitmap_bh);
1718 spin_lock(sb_bgl_lock(sbi, group_no));
1719 if (buffer_jbd(bitmap_bh) && bh2jh(bitmap_bh)->b_committed_data) {
1722 for (i = 0; i < num; i++) {
1723 if (ext4_test_bit(grp_alloc_blk+i,
1724 bh2jh(bitmap_bh)->b_committed_data)) {
1725 printk("%s: block was unexpectedly set in "
1726 "b_committed_data\n", __FUNCTION__);
1730 ext4_debug("found bit %d\n", grp_alloc_blk);
1731 spin_unlock(sb_bgl_lock(sbi, group_no));
1732 jbd_unlock_bh_state(bitmap_bh);
1735 if (ret_block + num - 1 >= ext4_blocks_count(es)) {
1736 ext4_error(sb, "ext4_new_block",
1737 "block(%llu) >= blocks count(%llu) - "
1738 "block_group = %lu, es == %p ", ret_block,
1739 ext4_blocks_count(es), group_no, es);
1744 * It is up to the caller to add the new buffer to a journal
1745 * list of some description. We don't know in advance whether
1746 * the caller wants to use it as metadata or data.
1748 spin_lock(sb_bgl_lock(sbi, group_no));
1749 if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT))
1750 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT);
1751 gdp->bg_free_blocks_count =
1752 cpu_to_le16(le16_to_cpu(gdp->bg_free_blocks_count)-num);
1753 gdp->bg_checksum = ext4_group_desc_csum(sbi, group_no, gdp);
1754 spin_unlock(sb_bgl_lock(sbi, group_no));
1755 percpu_counter_sub(&sbi->s_freeblocks_counter, num);
1757 BUFFER_TRACE(gdp_bh, "journal_dirty_metadata for group descriptor");
1758 err = ext4_journal_dirty_metadata(handle, gdp_bh);
1768 DQUOT_FREE_BLOCK(inode, *count-num);
1777 ext4_std_error(sb, fatal);
1780 * Undo the block allocation
1782 if (!performed_allocation)
1783 DQUOT_FREE_BLOCK(inode, *count);
1788 ext4_fsblk_t ext4_new_block(handle_t *handle, struct inode *inode,
1789 ext4_fsblk_t goal, int *errp)
1791 unsigned long count = 1;
1793 return ext4_new_blocks(handle, inode, goal, &count, errp);
1797 * ext4_count_free_blocks() -- count filesystem free blocks
1800 * Adds up the number of free blocks from each block group.
1802 ext4_fsblk_t ext4_count_free_blocks(struct super_block *sb)
1804 ext4_fsblk_t desc_count;
1805 struct ext4_group_desc *gdp;
1807 ext4_group_t ngroups = EXT4_SB(sb)->s_groups_count;
1809 struct ext4_super_block *es;
1810 ext4_fsblk_t bitmap_count;
1812 struct buffer_head *bitmap_bh = NULL;
1814 es = EXT4_SB(sb)->s_es;
1820 for (i = 0; i < ngroups; i++) {
1821 gdp = ext4_get_group_desc(sb, i, NULL);
1824 desc_count += le16_to_cpu(gdp->bg_free_blocks_count);
1826 bitmap_bh = read_block_bitmap(sb, i);
1827 if (bitmap_bh == NULL)
1830 x = ext4_count_free(bitmap_bh, sb->s_blocksize);
1831 printk(KERN_DEBUG "group %lu: stored = %d, counted = %lu\n",
1832 i, le16_to_cpu(gdp->bg_free_blocks_count), x);
1836 printk("ext4_count_free_blocks: stored = %llu"
1837 ", computed = %llu, %llu\n",
1838 EXT4_FREE_BLOCKS_COUNT(es),
1839 desc_count, bitmap_count);
1840 return bitmap_count;
1844 for (i = 0; i < ngroups; i++) {
1845 gdp = ext4_get_group_desc(sb, i, NULL);
1848 desc_count += le16_to_cpu(gdp->bg_free_blocks_count);
1855 static inline int test_root(ext4_group_t a, int b)
1864 static int ext4_group_sparse(ext4_group_t group)
1870 return (test_root(group, 7) || test_root(group, 5) ||
1871 test_root(group, 3));
1875 * ext4_bg_has_super - number of blocks used by the superblock in group
1876 * @sb: superblock for filesystem
1877 * @group: group number to check
1879 * Return the number of blocks used by the superblock (primary or backup)
1880 * in this group. Currently this will be only 0 or 1.
1882 int ext4_bg_has_super(struct super_block *sb, ext4_group_t group)
1884 if (EXT4_HAS_RO_COMPAT_FEATURE(sb,
1885 EXT4_FEATURE_RO_COMPAT_SPARSE_SUPER) &&
1886 !ext4_group_sparse(group))
1891 static unsigned long ext4_bg_num_gdb_meta(struct super_block *sb,
1894 unsigned long metagroup = group / EXT4_DESC_PER_BLOCK(sb);
1895 ext4_group_t first = metagroup * EXT4_DESC_PER_BLOCK(sb);
1896 ext4_group_t last = first + EXT4_DESC_PER_BLOCK(sb) - 1;
1898 if (group == first || group == first + 1 || group == last)
1903 static unsigned long ext4_bg_num_gdb_nometa(struct super_block *sb,
1906 if (EXT4_HAS_RO_COMPAT_FEATURE(sb,
1907 EXT4_FEATURE_RO_COMPAT_SPARSE_SUPER) &&
1908 !ext4_group_sparse(group))
1910 return EXT4_SB(sb)->s_gdb_count;
1914 * ext4_bg_num_gdb - number of blocks used by the group table in group
1915 * @sb: superblock for filesystem
1916 * @group: group number to check
1918 * Return the number of blocks used by the group descriptor table
1919 * (primary or backup) in this group. In the future there may be a
1920 * different number of descriptor blocks in each group.
1922 unsigned long ext4_bg_num_gdb(struct super_block *sb, ext4_group_t group)
1924 unsigned long first_meta_bg =
1925 le32_to_cpu(EXT4_SB(sb)->s_es->s_first_meta_bg);
1926 unsigned long metagroup = group / EXT4_DESC_PER_BLOCK(sb);
1928 if (!EXT4_HAS_INCOMPAT_FEATURE(sb,EXT4_FEATURE_INCOMPAT_META_BG) ||
1929 metagroup < first_meta_bg)
1930 return ext4_bg_num_gdb_nometa(sb,group);
1932 return ext4_bg_num_gdb_meta(sb,group);