1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com
4 * Written by Alex Tomas <alex@clusterfs.com>
9 * mballoc.c contains the multiblocks allocation routines
12 #include "ext4_jbd2.h"
14 #include <linux/log2.h>
15 #include <linux/module.h>
16 #include <linux/slab.h>
17 #include <linux/nospec.h>
18 #include <linux/backing-dev.h>
19 #include <trace/events/ext4.h>
23 * - test ext4_ext_search_left() and ext4_ext_search_right()
24 * - search for metadata in few groups
27 * - normalization should take into account whether file is still open
28 * - discard preallocations if no free space left (policy?)
29 * - don't normalize tails
31 * - reservation for superuser
34 * - bitmap read-ahead (proposed by Oleg Drokin aka green)
35 * - track min/max extents in each group for better group selection
36 * - mb_mark_used() may allocate chunk right after splitting buddy
37 * - tree of groups sorted by number of free blocks
42 * The allocation request involve request for multiple number of blocks
43 * near to the goal(block) value specified.
45 * During initialization phase of the allocator we decide to use the
46 * group preallocation or inode preallocation depending on the size of
47 * the file. The size of the file could be the resulting file size we
48 * would have after allocation, or the current file size, which ever
49 * is larger. If the size is less than sbi->s_mb_stream_request we
50 * select to use the group preallocation. The default value of
51 * s_mb_stream_request is 16 blocks. This can also be tuned via
52 * /sys/fs/ext4/<partition>/mb_stream_req. The value is represented in
53 * terms of number of blocks.
55 * The main motivation for having small file use group preallocation is to
56 * ensure that we have small files closer together on the disk.
58 * First stage the allocator looks at the inode prealloc list,
59 * ext4_inode_info->i_prealloc_list, which contains list of prealloc
60 * spaces for this particular inode. The inode prealloc space is
63 * pa_lstart -> the logical start block for this prealloc space
64 * pa_pstart -> the physical start block for this prealloc space
65 * pa_len -> length for this prealloc space (in clusters)
66 * pa_free -> free space available in this prealloc space (in clusters)
68 * The inode preallocation space is used looking at the _logical_ start
69 * block. If only the logical file block falls within the range of prealloc
70 * space we will consume the particular prealloc space. This makes sure that
71 * we have contiguous physical blocks representing the file blocks
73 * The important thing to be noted in case of inode prealloc space is that
74 * we don't modify the values associated to inode prealloc space except
77 * If we are not able to find blocks in the inode prealloc space and if we
78 * have the group allocation flag set then we look at the locality group
79 * prealloc space. These are per CPU prealloc list represented as
81 * ext4_sb_info.s_locality_groups[smp_processor_id()]
83 * The reason for having a per cpu locality group is to reduce the contention
84 * between CPUs. It is possible to get scheduled at this point.
86 * The locality group prealloc space is used looking at whether we have
87 * enough free space (pa_free) within the prealloc space.
89 * If we can't allocate blocks via inode prealloc or/and locality group
90 * prealloc then we look at the buddy cache. The buddy cache is represented
91 * by ext4_sb_info.s_buddy_cache (struct inode) whose file offset gets
92 * mapped to the buddy and bitmap information regarding different
93 * groups. The buddy information is attached to buddy cache inode so that
94 * we can access them through the page cache. The information regarding
95 * each group is loaded via ext4_mb_load_buddy. The information involve
96 * block bitmap and buddy information. The information are stored in the
100 * [ group 0 bitmap][ group 0 buddy] [group 1][ group 1]...
103 * one block each for bitmap and buddy information. So for each group we
104 * take up 2 blocks. A page can contain blocks_per_page (PAGE_SIZE /
105 * blocksize) blocks. So it can have information regarding groups_per_page
106 * which is blocks_per_page/2
108 * The buddy cache inode is not stored on disk. The inode is thrown
109 * away when the filesystem is unmounted.
111 * We look for count number of blocks in the buddy cache. If we were able
112 * to locate that many free blocks we return with additional information
113 * regarding rest of the contiguous physical block available
115 * Before allocating blocks via buddy cache we normalize the request
116 * blocks. This ensure we ask for more blocks that we needed. The extra
117 * blocks that we get after allocation is added to the respective prealloc
118 * list. In case of inode preallocation we follow a list of heuristics
119 * based on file size. This can be found in ext4_mb_normalize_request. If
120 * we are doing a group prealloc we try to normalize the request to
121 * sbi->s_mb_group_prealloc. The default value of s_mb_group_prealloc is
122 * dependent on the cluster size; for non-bigalloc file systems, it is
123 * 512 blocks. This can be tuned via
124 * /sys/fs/ext4/<partition>/mb_group_prealloc. The value is represented in
125 * terms of number of blocks. If we have mounted the file system with -O
126 * stripe=<value> option the group prealloc request is normalized to the
127 * smallest multiple of the stripe value (sbi->s_stripe) which is
128 * greater than the default mb_group_prealloc.
130 * If "mb_optimize_scan" mount option is set, we maintain in memory group info
131 * structures in two data structures:
133 * 1) Array of largest free order lists (sbi->s_mb_largest_free_orders)
135 * Locking: sbi->s_mb_largest_free_orders_locks(array of rw locks)
137 * This is an array of lists where the index in the array represents the
138 * largest free order in the buddy bitmap of the participating group infos of
139 * that list. So, there are exactly MB_NUM_ORDERS(sb) (which means total
140 * number of buddy bitmap orders possible) number of lists. Group-infos are
141 * placed in appropriate lists.
143 * 2) Average fragment size lists (sbi->s_mb_avg_fragment_size)
145 * Locking: sbi->s_mb_avg_fragment_size_locks(array of rw locks)
147 * This is an array of lists where in the i-th list there are groups with
148 * average fragment size >= 2^i and < 2^(i+1). The average fragment size
149 * is computed as ext4_group_info->bb_free / ext4_group_info->bb_fragments.
150 * Note that we don't bother with a special list for completely empty groups
151 * so we only have MB_NUM_ORDERS(sb) lists.
153 * When "mb_optimize_scan" mount option is set, mballoc consults the above data
154 * structures to decide the order in which groups are to be traversed for
155 * fulfilling an allocation request.
157 * At CR = 0, we look for groups which have the largest_free_order >= the order
158 * of the request. We directly look at the largest free order list in the data
159 * structure (1) above where largest_free_order = order of the request. If that
160 * list is empty, we look at remaining list in the increasing order of
161 * largest_free_order. This allows us to perform CR = 0 lookup in O(1) time.
163 * At CR = 1, we only consider groups where average fragment size > request
164 * size. So, we lookup a group which has average fragment size just above or
165 * equal to request size using our average fragment size group lists (data
166 * structure 2) in O(1) time.
168 * If "mb_optimize_scan" mount option is not set, mballoc traverses groups in
169 * linear order which requires O(N) search time for each CR 0 and CR 1 phase.
171 * The regular allocator (using the buddy cache) supports a few tunables.
173 * /sys/fs/ext4/<partition>/mb_min_to_scan
174 * /sys/fs/ext4/<partition>/mb_max_to_scan
175 * /sys/fs/ext4/<partition>/mb_order2_req
176 * /sys/fs/ext4/<partition>/mb_linear_limit
178 * The regular allocator uses buddy scan only if the request len is power of
179 * 2 blocks and the order of allocation is >= sbi->s_mb_order2_reqs. The
180 * value of s_mb_order2_reqs can be tuned via
181 * /sys/fs/ext4/<partition>/mb_order2_req. If the request len is equal to
182 * stripe size (sbi->s_stripe), we try to search for contiguous block in
183 * stripe size. This should result in better allocation on RAID setups. If
184 * not, we search in the specific group using bitmap for best extents. The
185 * tunable min_to_scan and max_to_scan control the behaviour here.
186 * min_to_scan indicate how long the mballoc __must__ look for a best
187 * extent and max_to_scan indicates how long the mballoc __can__ look for a
188 * best extent in the found extents. Searching for the blocks starts with
189 * the group specified as the goal value in allocation context via
190 * ac_g_ex. Each group is first checked based on the criteria whether it
191 * can be used for allocation. ext4_mb_good_group explains how the groups are
194 * When "mb_optimize_scan" is turned on, as mentioned above, the groups may not
195 * get traversed linearly. That may result in subsequent allocations being not
196 * close to each other. And so, the underlying device may get filled up in a
197 * non-linear fashion. While that may not matter on non-rotational devices, for
198 * rotational devices that may result in higher seek times. "mb_linear_limit"
199 * tells mballoc how many groups mballoc should search linearly before
200 * performing consulting above data structures for more efficient lookups. For
201 * non rotational devices, this value defaults to 0 and for rotational devices
202 * this is set to MB_DEFAULT_LINEAR_LIMIT.
204 * Both the prealloc space are getting populated as above. So for the first
205 * request we will hit the buddy cache which will result in this prealloc
206 * space getting filled. The prealloc space is then later used for the
207 * subsequent request.
211 * mballoc operates on the following data:
213 * - in-core buddy (actually includes buddy and bitmap)
214 * - preallocation descriptors (PAs)
216 * there are two types of preallocations:
218 * assiged to specific inode and can be used for this inode only.
219 * it describes part of inode's space preallocated to specific
220 * physical blocks. any block from that preallocated can be used
221 * independent. the descriptor just tracks number of blocks left
222 * unused. so, before taking some block from descriptor, one must
223 * make sure corresponded logical block isn't allocated yet. this
224 * also means that freeing any block within descriptor's range
225 * must discard all preallocated blocks.
227 * assigned to specific locality group which does not translate to
228 * permanent set of inodes: inode can join and leave group. space
229 * from this type of preallocation can be used for any inode. thus
230 * it's consumed from the beginning to the end.
232 * relation between them can be expressed as:
233 * in-core buddy = on-disk bitmap + preallocation descriptors
235 * this mean blocks mballoc considers used are:
236 * - allocated blocks (persistent)
237 * - preallocated blocks (non-persistent)
239 * consistency in mballoc world means that at any time a block is either
240 * free or used in ALL structures. notice: "any time" should not be read
241 * literally -- time is discrete and delimited by locks.
243 * to keep it simple, we don't use block numbers, instead we count number of
244 * blocks: how many blocks marked used/free in on-disk bitmap, buddy and PA.
246 * all operations can be expressed as:
247 * - init buddy: buddy = on-disk + PAs
248 * - new PA: buddy += N; PA = N
249 * - use inode PA: on-disk += N; PA -= N
250 * - discard inode PA buddy -= on-disk - PA; PA = 0
251 * - use locality group PA on-disk += N; PA -= N
252 * - discard locality group PA buddy -= PA; PA = 0
253 * note: 'buddy -= on-disk - PA' is used to show that on-disk bitmap
254 * is used in real operation because we can't know actual used
255 * bits from PA, only from on-disk bitmap
257 * if we follow this strict logic, then all operations above should be atomic.
258 * given some of them can block, we'd have to use something like semaphores
259 * killing performance on high-end SMP hardware. let's try to relax it using
260 * the following knowledge:
261 * 1) if buddy is referenced, it's already initialized
262 * 2) while block is used in buddy and the buddy is referenced,
263 * nobody can re-allocate that block
264 * 3) we work on bitmaps and '+' actually means 'set bits'. if on-disk has
265 * bit set and PA claims same block, it's OK. IOW, one can set bit in
266 * on-disk bitmap if buddy has same bit set or/and PA covers corresponded
269 * so, now we're building a concurrency table:
272 * blocks for PA are allocated in the buddy, buddy must be referenced
273 * until PA is linked to allocation group to avoid concurrent buddy init
275 * we need to make sure that either on-disk bitmap or PA has uptodate data
276 * given (3) we care that PA-=N operation doesn't interfere with init
278 * the simplest way would be to have buddy initialized by the discard
279 * - use locality group PA
280 * again PA-=N must be serialized with init
281 * - discard locality group PA
282 * the simplest way would be to have buddy initialized by the discard
285 * i_data_sem serializes them
287 * discard process must wait until PA isn't used by another process
288 * - use locality group PA
289 * some mutex should serialize them
290 * - discard locality group PA
291 * discard process must wait until PA isn't used by another process
294 * i_data_sem or another mutex should serializes them
296 * discard process must wait until PA isn't used by another process
297 * - use locality group PA
298 * nothing wrong here -- they're different PAs covering different blocks
299 * - discard locality group PA
300 * discard process must wait until PA isn't used by another process
302 * now we're ready to make few consequences:
303 * - PA is referenced and while it is no discard is possible
304 * - PA is referenced until block isn't marked in on-disk bitmap
305 * - PA changes only after on-disk bitmap
306 * - discard must not compete with init. either init is done before
307 * any discard or they're serialized somehow
308 * - buddy init as sum of on-disk bitmap and PAs is done atomically
310 * a special case when we've used PA to emptiness. no need to modify buddy
311 * in this case, but we should care about concurrent init
316 * Logic in few words:
321 * mark bits in on-disk bitmap
324 * - use preallocation:
325 * find proper PA (per-inode or group)
327 * mark bits in on-disk bitmap
333 * mark bits in on-disk bitmap
336 * - discard preallocations in group:
338 * move them onto local list
339 * load on-disk bitmap
341 * remove PA from object (inode or locality group)
342 * mark free blocks in-core
344 * - discard inode's preallocations:
351 * - bitlock on a group (group)
352 * - object (inode/locality) (object)
354 * - cr0 lists lock (cr0)
355 * - cr1 tree lock (cr1)
365 * - release consumed pa:
370 * - generate in-core bitmap:
374 * - discard all for given object (inode, locality group):
379 * - discard all for given group:
385 * - allocation path (ext4_mb_regular_allocator)
389 static struct kmem_cache *ext4_pspace_cachep;
390 static struct kmem_cache *ext4_ac_cachep;
391 static struct kmem_cache *ext4_free_data_cachep;
393 /* We create slab caches for groupinfo data structures based on the
394 * superblock block size. There will be one per mounted filesystem for
395 * each unique s_blocksize_bits */
396 #define NR_GRPINFO_CACHES 8
397 static struct kmem_cache *ext4_groupinfo_caches[NR_GRPINFO_CACHES];
399 static const char * const ext4_groupinfo_slab_names[NR_GRPINFO_CACHES] = {
400 "ext4_groupinfo_1k", "ext4_groupinfo_2k", "ext4_groupinfo_4k",
401 "ext4_groupinfo_8k", "ext4_groupinfo_16k", "ext4_groupinfo_32k",
402 "ext4_groupinfo_64k", "ext4_groupinfo_128k"
405 static void ext4_mb_generate_from_pa(struct super_block *sb, void *bitmap,
407 static void ext4_mb_generate_from_freelist(struct super_block *sb, void *bitmap,
409 static void ext4_mb_new_preallocation(struct ext4_allocation_context *ac);
411 static bool ext4_mb_good_group(struct ext4_allocation_context *ac,
412 ext4_group_t group, int cr);
414 static int ext4_try_to_trim_range(struct super_block *sb,
415 struct ext4_buddy *e4b, ext4_grpblk_t start,
416 ext4_grpblk_t max, ext4_grpblk_t minblocks);
419 * The algorithm using this percpu seq counter goes below:
420 * 1. We sample the percpu discard_pa_seq counter before trying for block
421 * allocation in ext4_mb_new_blocks().
422 * 2. We increment this percpu discard_pa_seq counter when we either allocate
423 * or free these blocks i.e. while marking those blocks as used/free in
424 * mb_mark_used()/mb_free_blocks().
425 * 3. We also increment this percpu seq counter when we successfully identify
426 * that the bb_prealloc_list is not empty and hence proceed for discarding
427 * of those PAs inside ext4_mb_discard_group_preallocations().
429 * Now to make sure that the regular fast path of block allocation is not
430 * affected, as a small optimization we only sample the percpu seq counter
431 * on that cpu. Only when the block allocation fails and when freed blocks
432 * found were 0, that is when we sample percpu seq counter for all cpus using
433 * below function ext4_get_discard_pa_seq_sum(). This happens after making
434 * sure that all the PAs on grp->bb_prealloc_list got freed or if it's empty.
436 static DEFINE_PER_CPU(u64, discard_pa_seq);
437 static inline u64 ext4_get_discard_pa_seq_sum(void)
442 for_each_possible_cpu(__cpu)
443 __seq += per_cpu(discard_pa_seq, __cpu);
447 static inline void *mb_correct_addr_and_bit(int *bit, void *addr)
449 #if BITS_PER_LONG == 64
450 *bit += ((unsigned long) addr & 7UL) << 3;
451 addr = (void *) ((unsigned long) addr & ~7UL);
452 #elif BITS_PER_LONG == 32
453 *bit += ((unsigned long) addr & 3UL) << 3;
454 addr = (void *) ((unsigned long) addr & ~3UL);
456 #error "how many bits you are?!"
461 static inline int mb_test_bit(int bit, void *addr)
464 * ext4_test_bit on architecture like powerpc
465 * needs unsigned long aligned address
467 addr = mb_correct_addr_and_bit(&bit, addr);
468 return ext4_test_bit(bit, addr);
471 static inline void mb_set_bit(int bit, void *addr)
473 addr = mb_correct_addr_and_bit(&bit, addr);
474 ext4_set_bit(bit, addr);
477 static inline void mb_clear_bit(int bit, void *addr)
479 addr = mb_correct_addr_and_bit(&bit, addr);
480 ext4_clear_bit(bit, addr);
483 static inline int mb_test_and_clear_bit(int bit, void *addr)
485 addr = mb_correct_addr_and_bit(&bit, addr);
486 return ext4_test_and_clear_bit(bit, addr);
489 static inline int mb_find_next_zero_bit(void *addr, int max, int start)
491 int fix = 0, ret, tmpmax;
492 addr = mb_correct_addr_and_bit(&fix, addr);
496 ret = ext4_find_next_zero_bit(addr, tmpmax, start) - fix;
502 static inline int mb_find_next_bit(void *addr, int max, int start)
504 int fix = 0, ret, tmpmax;
505 addr = mb_correct_addr_and_bit(&fix, addr);
509 ret = ext4_find_next_bit(addr, tmpmax, start) - fix;
515 static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max)
519 BUG_ON(e4b->bd_bitmap == e4b->bd_buddy);
522 if (order > e4b->bd_blkbits + 1) {
527 /* at order 0 we see each particular block */
529 *max = 1 << (e4b->bd_blkbits + 3);
530 return e4b->bd_bitmap;
533 bb = e4b->bd_buddy + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order];
534 *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order];
540 static void mb_free_blocks_double(struct inode *inode, struct ext4_buddy *e4b,
541 int first, int count)
544 struct super_block *sb = e4b->bd_sb;
546 if (unlikely(e4b->bd_info->bb_bitmap == NULL))
548 assert_spin_locked(ext4_group_lock_ptr(sb, e4b->bd_group));
549 for (i = 0; i < count; i++) {
550 if (!mb_test_bit(first + i, e4b->bd_info->bb_bitmap)) {
551 ext4_fsblk_t blocknr;
553 blocknr = ext4_group_first_block_no(sb, e4b->bd_group);
554 blocknr += EXT4_C2B(EXT4_SB(sb), first + i);
555 ext4_grp_locked_error(sb, e4b->bd_group,
556 inode ? inode->i_ino : 0,
558 "freeing block already freed "
561 ext4_mark_group_bitmap_corrupted(sb, e4b->bd_group,
562 EXT4_GROUP_INFO_BBITMAP_CORRUPT);
564 mb_clear_bit(first + i, e4b->bd_info->bb_bitmap);
568 static void mb_mark_used_double(struct ext4_buddy *e4b, int first, int count)
572 if (unlikely(e4b->bd_info->bb_bitmap == NULL))
574 assert_spin_locked(ext4_group_lock_ptr(e4b->bd_sb, e4b->bd_group));
575 for (i = 0; i < count; i++) {
576 BUG_ON(mb_test_bit(first + i, e4b->bd_info->bb_bitmap));
577 mb_set_bit(first + i, e4b->bd_info->bb_bitmap);
581 static void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap)
583 if (unlikely(e4b->bd_info->bb_bitmap == NULL))
585 if (memcmp(e4b->bd_info->bb_bitmap, bitmap, e4b->bd_sb->s_blocksize)) {
586 unsigned char *b1, *b2;
588 b1 = (unsigned char *) e4b->bd_info->bb_bitmap;
589 b2 = (unsigned char *) bitmap;
590 for (i = 0; i < e4b->bd_sb->s_blocksize; i++) {
591 if (b1[i] != b2[i]) {
592 ext4_msg(e4b->bd_sb, KERN_ERR,
593 "corruption in group %u "
594 "at byte %u(%u): %x in copy != %x "
596 e4b->bd_group, i, i * 8, b1[i], b2[i]);
603 static void mb_group_bb_bitmap_alloc(struct super_block *sb,
604 struct ext4_group_info *grp, ext4_group_t group)
606 struct buffer_head *bh;
608 grp->bb_bitmap = kmalloc(sb->s_blocksize, GFP_NOFS);
612 bh = ext4_read_block_bitmap(sb, group);
613 if (IS_ERR_OR_NULL(bh)) {
614 kfree(grp->bb_bitmap);
615 grp->bb_bitmap = NULL;
619 memcpy(grp->bb_bitmap, bh->b_data, sb->s_blocksize);
623 static void mb_group_bb_bitmap_free(struct ext4_group_info *grp)
625 kfree(grp->bb_bitmap);
629 static inline void mb_free_blocks_double(struct inode *inode,
630 struct ext4_buddy *e4b, int first, int count)
634 static inline void mb_mark_used_double(struct ext4_buddy *e4b,
635 int first, int count)
639 static inline void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap)
644 static inline void mb_group_bb_bitmap_alloc(struct super_block *sb,
645 struct ext4_group_info *grp, ext4_group_t group)
650 static inline void mb_group_bb_bitmap_free(struct ext4_group_info *grp)
656 #ifdef AGGRESSIVE_CHECK
658 #define MB_CHECK_ASSERT(assert) \
662 "Assertion failure in %s() at %s:%d: \"%s\"\n", \
663 function, file, line, # assert); \
668 static int __mb_check_buddy(struct ext4_buddy *e4b, char *file,
669 const char *function, int line)
671 struct super_block *sb = e4b->bd_sb;
672 int order = e4b->bd_blkbits + 1;
679 struct ext4_group_info *grp;
682 struct list_head *cur;
686 if (e4b->bd_info->bb_check_counter++ % 10)
690 buddy = mb_find_buddy(e4b, order, &max);
691 MB_CHECK_ASSERT(buddy);
692 buddy2 = mb_find_buddy(e4b, order - 1, &max2);
693 MB_CHECK_ASSERT(buddy2);
694 MB_CHECK_ASSERT(buddy != buddy2);
695 MB_CHECK_ASSERT(max * 2 == max2);
698 for (i = 0; i < max; i++) {
700 if (mb_test_bit(i, buddy)) {
701 /* only single bit in buddy2 may be 0 */
702 if (!mb_test_bit(i << 1, buddy2)) {
704 mb_test_bit((i<<1)+1, buddy2));
709 /* both bits in buddy2 must be 1 */
710 MB_CHECK_ASSERT(mb_test_bit(i << 1, buddy2));
711 MB_CHECK_ASSERT(mb_test_bit((i << 1) + 1, buddy2));
713 for (j = 0; j < (1 << order); j++) {
714 k = (i * (1 << order)) + j;
716 !mb_test_bit(k, e4b->bd_bitmap));
720 MB_CHECK_ASSERT(e4b->bd_info->bb_counters[order] == count);
725 buddy = mb_find_buddy(e4b, 0, &max);
726 for (i = 0; i < max; i++) {
727 if (!mb_test_bit(i, buddy)) {
728 MB_CHECK_ASSERT(i >= e4b->bd_info->bb_first_free);
736 /* check used bits only */
737 for (j = 0; j < e4b->bd_blkbits + 1; j++) {
738 buddy2 = mb_find_buddy(e4b, j, &max2);
740 MB_CHECK_ASSERT(k < max2);
741 MB_CHECK_ASSERT(mb_test_bit(k, buddy2));
744 MB_CHECK_ASSERT(!EXT4_MB_GRP_NEED_INIT(e4b->bd_info));
745 MB_CHECK_ASSERT(e4b->bd_info->bb_fragments == fragments);
747 grp = ext4_get_group_info(sb, e4b->bd_group);
748 list_for_each(cur, &grp->bb_prealloc_list) {
749 ext4_group_t groupnr;
750 struct ext4_prealloc_space *pa;
751 pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list);
752 ext4_get_group_no_and_offset(sb, pa->pa_pstart, &groupnr, &k);
753 MB_CHECK_ASSERT(groupnr == e4b->bd_group);
754 for (i = 0; i < pa->pa_len; i++)
755 MB_CHECK_ASSERT(mb_test_bit(k + i, buddy));
759 #undef MB_CHECK_ASSERT
760 #define mb_check_buddy(e4b) __mb_check_buddy(e4b, \
761 __FILE__, __func__, __LINE__)
763 #define mb_check_buddy(e4b)
767 * Divide blocks started from @first with length @len into
768 * smaller chunks with power of 2 blocks.
769 * Clear the bits in bitmap which the blocks of the chunk(s) covered,
770 * then increase bb_counters[] for corresponded chunk size.
772 static void ext4_mb_mark_free_simple(struct super_block *sb,
773 void *buddy, ext4_grpblk_t first, ext4_grpblk_t len,
774 struct ext4_group_info *grp)
776 struct ext4_sb_info *sbi = EXT4_SB(sb);
782 BUG_ON(len > EXT4_CLUSTERS_PER_GROUP(sb));
784 border = 2 << sb->s_blocksize_bits;
787 /* find how many blocks can be covered since this position */
788 max = ffs(first | border) - 1;
790 /* find how many blocks of power 2 we need to mark */
797 /* mark multiblock chunks only */
798 grp->bb_counters[min]++;
800 mb_clear_bit(first >> min,
801 buddy + sbi->s_mb_offsets[min]);
808 static int mb_avg_fragment_size_order(struct super_block *sb, ext4_grpblk_t len)
813 * We don't bother with a special lists groups with only 1 block free
814 * extents and for completely empty groups.
816 order = fls(len) - 2;
819 if (order == MB_NUM_ORDERS(sb))
824 /* Move group to appropriate avg_fragment_size list */
826 mb_update_avg_fragment_size(struct super_block *sb, struct ext4_group_info *grp)
828 struct ext4_sb_info *sbi = EXT4_SB(sb);
831 if (!test_opt2(sb, MB_OPTIMIZE_SCAN) || grp->bb_free == 0)
834 new_order = mb_avg_fragment_size_order(sb,
835 grp->bb_free / grp->bb_fragments);
836 if (new_order == grp->bb_avg_fragment_size_order)
839 if (grp->bb_avg_fragment_size_order != -1) {
840 write_lock(&sbi->s_mb_avg_fragment_size_locks[
841 grp->bb_avg_fragment_size_order]);
842 list_del(&grp->bb_avg_fragment_size_node);
843 write_unlock(&sbi->s_mb_avg_fragment_size_locks[
844 grp->bb_avg_fragment_size_order]);
846 grp->bb_avg_fragment_size_order = new_order;
847 write_lock(&sbi->s_mb_avg_fragment_size_locks[
848 grp->bb_avg_fragment_size_order]);
849 list_add_tail(&grp->bb_avg_fragment_size_node,
850 &sbi->s_mb_avg_fragment_size[grp->bb_avg_fragment_size_order]);
851 write_unlock(&sbi->s_mb_avg_fragment_size_locks[
852 grp->bb_avg_fragment_size_order]);
856 * Choose next group by traversing largest_free_order lists. Updates *new_cr if
857 * cr level needs an update.
859 static void ext4_mb_choose_next_group_cr0(struct ext4_allocation_context *ac,
860 int *new_cr, ext4_group_t *group, ext4_group_t ngroups)
862 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
863 struct ext4_group_info *iter, *grp;
866 if (ac->ac_status == AC_STATUS_FOUND)
869 if (unlikely(sbi->s_mb_stats && ac->ac_flags & EXT4_MB_CR0_OPTIMIZED))
870 atomic_inc(&sbi->s_bal_cr0_bad_suggestions);
873 for (i = ac->ac_2order; i < MB_NUM_ORDERS(ac->ac_sb); i++) {
874 if (list_empty(&sbi->s_mb_largest_free_orders[i]))
876 read_lock(&sbi->s_mb_largest_free_orders_locks[i]);
877 if (list_empty(&sbi->s_mb_largest_free_orders[i])) {
878 read_unlock(&sbi->s_mb_largest_free_orders_locks[i]);
882 list_for_each_entry(iter, &sbi->s_mb_largest_free_orders[i],
883 bb_largest_free_order_node) {
885 atomic64_inc(&sbi->s_bal_cX_groups_considered[0]);
886 if (likely(ext4_mb_good_group(ac, iter->bb_group, 0))) {
891 read_unlock(&sbi->s_mb_largest_free_orders_locks[i]);
897 /* Increment cr and search again */
900 *group = grp->bb_group;
901 ac->ac_flags |= EXT4_MB_CR0_OPTIMIZED;
906 * Choose next group by traversing average fragment size list of suitable
907 * order. Updates *new_cr if cr level needs an update.
909 static void ext4_mb_choose_next_group_cr1(struct ext4_allocation_context *ac,
910 int *new_cr, ext4_group_t *group, ext4_group_t ngroups)
912 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
913 struct ext4_group_info *grp, *iter;
916 if (unlikely(ac->ac_flags & EXT4_MB_CR1_OPTIMIZED)) {
918 atomic_inc(&sbi->s_bal_cr1_bad_suggestions);
921 for (i = mb_avg_fragment_size_order(ac->ac_sb, ac->ac_g_ex.fe_len);
922 i < MB_NUM_ORDERS(ac->ac_sb); i++) {
923 if (list_empty(&sbi->s_mb_avg_fragment_size[i]))
925 read_lock(&sbi->s_mb_avg_fragment_size_locks[i]);
926 if (list_empty(&sbi->s_mb_avg_fragment_size[i])) {
927 read_unlock(&sbi->s_mb_avg_fragment_size_locks[i]);
931 list_for_each_entry(iter, &sbi->s_mb_avg_fragment_size[i],
932 bb_avg_fragment_size_node) {
934 atomic64_inc(&sbi->s_bal_cX_groups_considered[1]);
935 if (likely(ext4_mb_good_group(ac, iter->bb_group, 1))) {
940 read_unlock(&sbi->s_mb_avg_fragment_size_locks[i]);
946 *group = grp->bb_group;
947 ac->ac_flags |= EXT4_MB_CR1_OPTIMIZED;
953 static inline int should_optimize_scan(struct ext4_allocation_context *ac)
955 if (unlikely(!test_opt2(ac->ac_sb, MB_OPTIMIZE_SCAN)))
957 if (ac->ac_criteria >= 2)
959 if (!ext4_test_inode_flag(ac->ac_inode, EXT4_INODE_EXTENTS))
965 * Return next linear group for allocation. If linear traversal should not be
966 * performed, this function just returns the same group
969 next_linear_group(struct ext4_allocation_context *ac, int group, int ngroups)
971 if (!should_optimize_scan(ac))
974 if (ac->ac_groups_linear_remaining) {
975 ac->ac_groups_linear_remaining--;
982 * Artificially restricted ngroups for non-extent
983 * files makes group > ngroups possible on first loop.
985 return group + 1 >= ngroups ? 0 : group + 1;
989 * ext4_mb_choose_next_group: choose next group for allocation.
991 * @ac Allocation Context
992 * @new_cr This is an output parameter. If the there is no good group
993 * available at current CR level, this field is updated to indicate
994 * the new cr level that should be used.
995 * @group This is an input / output parameter. As an input it indicates the
996 * next group that the allocator intends to use for allocation. As
997 * output, this field indicates the next group that should be used as
998 * determined by the optimization functions.
999 * @ngroups Total number of groups
1001 static void ext4_mb_choose_next_group(struct ext4_allocation_context *ac,
1002 int *new_cr, ext4_group_t *group, ext4_group_t ngroups)
1004 *new_cr = ac->ac_criteria;
1006 if (!should_optimize_scan(ac) || ac->ac_groups_linear_remaining) {
1007 *group = next_linear_group(ac, *group, ngroups);
1012 ext4_mb_choose_next_group_cr0(ac, new_cr, group, ngroups);
1013 } else if (*new_cr == 1) {
1014 ext4_mb_choose_next_group_cr1(ac, new_cr, group, ngroups);
1017 * TODO: For CR=2, we can arrange groups in an rb tree sorted by
1018 * bb_free. But until that happens, we should never come here.
1025 * Cache the order of the largest free extent we have available in this block
1029 mb_set_largest_free_order(struct super_block *sb, struct ext4_group_info *grp)
1031 struct ext4_sb_info *sbi = EXT4_SB(sb);
1034 for (i = MB_NUM_ORDERS(sb) - 1; i >= 0; i--)
1035 if (grp->bb_counters[i] > 0)
1037 /* No need to move between order lists? */
1038 if (!test_opt2(sb, MB_OPTIMIZE_SCAN) ||
1039 i == grp->bb_largest_free_order) {
1040 grp->bb_largest_free_order = i;
1044 if (grp->bb_largest_free_order >= 0) {
1045 write_lock(&sbi->s_mb_largest_free_orders_locks[
1046 grp->bb_largest_free_order]);
1047 list_del_init(&grp->bb_largest_free_order_node);
1048 write_unlock(&sbi->s_mb_largest_free_orders_locks[
1049 grp->bb_largest_free_order]);
1051 grp->bb_largest_free_order = i;
1052 if (grp->bb_largest_free_order >= 0 && grp->bb_free) {
1053 write_lock(&sbi->s_mb_largest_free_orders_locks[
1054 grp->bb_largest_free_order]);
1055 list_add_tail(&grp->bb_largest_free_order_node,
1056 &sbi->s_mb_largest_free_orders[grp->bb_largest_free_order]);
1057 write_unlock(&sbi->s_mb_largest_free_orders_locks[
1058 grp->bb_largest_free_order]);
1062 static noinline_for_stack
1063 void ext4_mb_generate_buddy(struct super_block *sb,
1064 void *buddy, void *bitmap, ext4_group_t group)
1066 struct ext4_group_info *grp = ext4_get_group_info(sb, group);
1067 struct ext4_sb_info *sbi = EXT4_SB(sb);
1068 ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb);
1069 ext4_grpblk_t i = 0;
1070 ext4_grpblk_t first;
1073 unsigned fragments = 0;
1074 unsigned long long period = get_cycles();
1076 /* initialize buddy from bitmap which is aggregation
1077 * of on-disk bitmap and preallocations */
1078 i = mb_find_next_zero_bit(bitmap, max, 0);
1079 grp->bb_first_free = i;
1083 i = mb_find_next_bit(bitmap, max, i);
1087 ext4_mb_mark_free_simple(sb, buddy, first, len, grp);
1089 grp->bb_counters[0]++;
1091 i = mb_find_next_zero_bit(bitmap, max, i);
1093 grp->bb_fragments = fragments;
1095 if (free != grp->bb_free) {
1096 ext4_grp_locked_error(sb, group, 0, 0,
1097 "block bitmap and bg descriptor "
1098 "inconsistent: %u vs %u free clusters",
1099 free, grp->bb_free);
1101 * If we intend to continue, we consider group descriptor
1102 * corrupt and update bb_free using bitmap value
1104 grp->bb_free = free;
1105 ext4_mark_group_bitmap_corrupted(sb, group,
1106 EXT4_GROUP_INFO_BBITMAP_CORRUPT);
1108 mb_set_largest_free_order(sb, grp);
1109 mb_update_avg_fragment_size(sb, grp);
1111 clear_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, &(grp->bb_state));
1113 period = get_cycles() - period;
1114 atomic_inc(&sbi->s_mb_buddies_generated);
1115 atomic64_add(period, &sbi->s_mb_generation_time);
1118 /* The buddy information is attached the buddy cache inode
1119 * for convenience. The information regarding each group
1120 * is loaded via ext4_mb_load_buddy. The information involve
1121 * block bitmap and buddy information. The information are
1122 * stored in the inode as
1125 * [ group 0 bitmap][ group 0 buddy] [group 1][ group 1]...
1128 * one block each for bitmap and buddy information.
1129 * So for each group we take up 2 blocks. A page can
1130 * contain blocks_per_page (PAGE_SIZE / blocksize) blocks.
1131 * So it can have information regarding groups_per_page which
1132 * is blocks_per_page/2
1134 * Locking note: This routine takes the block group lock of all groups
1135 * for this page; do not hold this lock when calling this routine!
1138 static int ext4_mb_init_cache(struct page *page, char *incore, gfp_t gfp)
1140 ext4_group_t ngroups;
1142 int blocks_per_page;
1143 int groups_per_page;
1146 ext4_group_t first_group, group;
1148 struct super_block *sb;
1149 struct buffer_head *bhs;
1150 struct buffer_head **bh = NULL;
1151 struct inode *inode;
1154 struct ext4_group_info *grinfo;
1156 inode = page->mapping->host;
1158 ngroups = ext4_get_groups_count(sb);
1159 blocksize = i_blocksize(inode);
1160 blocks_per_page = PAGE_SIZE / blocksize;
1162 mb_debug(sb, "init page %lu\n", page->index);
1164 groups_per_page = blocks_per_page >> 1;
1165 if (groups_per_page == 0)
1166 groups_per_page = 1;
1168 /* allocate buffer_heads to read bitmaps */
1169 if (groups_per_page > 1) {
1170 i = sizeof(struct buffer_head *) * groups_per_page;
1171 bh = kzalloc(i, gfp);
1179 first_group = page->index * blocks_per_page / 2;
1181 /* read all groups the page covers into the cache */
1182 for (i = 0, group = first_group; i < groups_per_page; i++, group++) {
1183 if (group >= ngroups)
1186 grinfo = ext4_get_group_info(sb, group);
1188 * If page is uptodate then we came here after online resize
1189 * which added some new uninitialized group info structs, so
1190 * we must skip all initialized uptodate buddies on the page,
1191 * which may be currently in use by an allocating task.
1193 if (PageUptodate(page) && !EXT4_MB_GRP_NEED_INIT(grinfo)) {
1197 bh[i] = ext4_read_block_bitmap_nowait(sb, group, false);
1198 if (IS_ERR(bh[i])) {
1199 err = PTR_ERR(bh[i]);
1203 mb_debug(sb, "read bitmap for group %u\n", group);
1206 /* wait for I/O completion */
1207 for (i = 0, group = first_group; i < groups_per_page; i++, group++) {
1212 err2 = ext4_wait_block_bitmap(sb, group, bh[i]);
1217 first_block = page->index * blocks_per_page;
1218 for (i = 0; i < blocks_per_page; i++) {
1219 group = (first_block + i) >> 1;
1220 if (group >= ngroups)
1223 if (!bh[group - first_group])
1224 /* skip initialized uptodate buddy */
1227 if (!buffer_verified(bh[group - first_group]))
1228 /* Skip faulty bitmaps */
1233 * data carry information regarding this
1234 * particular group in the format specified
1238 data = page_address(page) + (i * blocksize);
1239 bitmap = bh[group - first_group]->b_data;
1242 * We place the buddy block and bitmap block
1245 if ((first_block + i) & 1) {
1246 /* this is block of buddy */
1247 BUG_ON(incore == NULL);
1248 mb_debug(sb, "put buddy for group %u in page %lu/%x\n",
1249 group, page->index, i * blocksize);
1250 trace_ext4_mb_buddy_bitmap_load(sb, group);
1251 grinfo = ext4_get_group_info(sb, group);
1252 grinfo->bb_fragments = 0;
1253 memset(grinfo->bb_counters, 0,
1254 sizeof(*grinfo->bb_counters) *
1255 (MB_NUM_ORDERS(sb)));
1257 * incore got set to the group block bitmap below
1259 ext4_lock_group(sb, group);
1260 /* init the buddy */
1261 memset(data, 0xff, blocksize);
1262 ext4_mb_generate_buddy(sb, data, incore, group);
1263 ext4_unlock_group(sb, group);
1266 /* this is block of bitmap */
1267 BUG_ON(incore != NULL);
1268 mb_debug(sb, "put bitmap for group %u in page %lu/%x\n",
1269 group, page->index, i * blocksize);
1270 trace_ext4_mb_bitmap_load(sb, group);
1272 /* see comments in ext4_mb_put_pa() */
1273 ext4_lock_group(sb, group);
1274 memcpy(data, bitmap, blocksize);
1276 /* mark all preallocated blks used in in-core bitmap */
1277 ext4_mb_generate_from_pa(sb, data, group);
1278 ext4_mb_generate_from_freelist(sb, data, group);
1279 ext4_unlock_group(sb, group);
1281 /* set incore so that the buddy information can be
1282 * generated using this
1287 SetPageUptodate(page);
1291 for (i = 0; i < groups_per_page; i++)
1300 * Lock the buddy and bitmap pages. This make sure other parallel init_group
1301 * on the same buddy page doesn't happen whild holding the buddy page lock.
1302 * Return locked buddy and bitmap pages on e4b struct. If buddy and bitmap
1303 * are on the same page e4b->bd_buddy_page is NULL and return value is 0.
1305 static int ext4_mb_get_buddy_page_lock(struct super_block *sb,
1306 ext4_group_t group, struct ext4_buddy *e4b, gfp_t gfp)
1308 struct inode *inode = EXT4_SB(sb)->s_buddy_cache;
1309 int block, pnum, poff;
1310 int blocks_per_page;
1313 e4b->bd_buddy_page = NULL;
1314 e4b->bd_bitmap_page = NULL;
1316 blocks_per_page = PAGE_SIZE / sb->s_blocksize;
1318 * the buddy cache inode stores the block bitmap
1319 * and buddy information in consecutive blocks.
1320 * So for each group we need two blocks.
1323 pnum = block / blocks_per_page;
1324 poff = block % blocks_per_page;
1325 page = find_or_create_page(inode->i_mapping, pnum, gfp);
1328 BUG_ON(page->mapping != inode->i_mapping);
1329 e4b->bd_bitmap_page = page;
1330 e4b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize);
1332 if (blocks_per_page >= 2) {
1333 /* buddy and bitmap are on the same page */
1338 pnum = block / blocks_per_page;
1339 page = find_or_create_page(inode->i_mapping, pnum, gfp);
1342 BUG_ON(page->mapping != inode->i_mapping);
1343 e4b->bd_buddy_page = page;
1347 static void ext4_mb_put_buddy_page_lock(struct ext4_buddy *e4b)
1349 if (e4b->bd_bitmap_page) {
1350 unlock_page(e4b->bd_bitmap_page);
1351 put_page(e4b->bd_bitmap_page);
1353 if (e4b->bd_buddy_page) {
1354 unlock_page(e4b->bd_buddy_page);
1355 put_page(e4b->bd_buddy_page);
1360 * Locking note: This routine calls ext4_mb_init_cache(), which takes the
1361 * block group lock of all groups for this page; do not hold the BG lock when
1362 * calling this routine!
1364 static noinline_for_stack
1365 int ext4_mb_init_group(struct super_block *sb, ext4_group_t group, gfp_t gfp)
1368 struct ext4_group_info *this_grp;
1369 struct ext4_buddy e4b;
1374 mb_debug(sb, "init group %u\n", group);
1375 this_grp = ext4_get_group_info(sb, group);
1377 * This ensures that we don't reinit the buddy cache
1378 * page which map to the group from which we are already
1379 * allocating. If we are looking at the buddy cache we would
1380 * have taken a reference using ext4_mb_load_buddy and that
1381 * would have pinned buddy page to page cache.
1382 * The call to ext4_mb_get_buddy_page_lock will mark the
1385 ret = ext4_mb_get_buddy_page_lock(sb, group, &e4b, gfp);
1386 if (ret || !EXT4_MB_GRP_NEED_INIT(this_grp)) {
1388 * somebody initialized the group
1389 * return without doing anything
1394 page = e4b.bd_bitmap_page;
1395 ret = ext4_mb_init_cache(page, NULL, gfp);
1398 if (!PageUptodate(page)) {
1403 if (e4b.bd_buddy_page == NULL) {
1405 * If both the bitmap and buddy are in
1406 * the same page we don't need to force
1412 /* init buddy cache */
1413 page = e4b.bd_buddy_page;
1414 ret = ext4_mb_init_cache(page, e4b.bd_bitmap, gfp);
1417 if (!PageUptodate(page)) {
1422 ext4_mb_put_buddy_page_lock(&e4b);
1427 * Locking note: This routine calls ext4_mb_init_cache(), which takes the
1428 * block group lock of all groups for this page; do not hold the BG lock when
1429 * calling this routine!
1431 static noinline_for_stack int
1432 ext4_mb_load_buddy_gfp(struct super_block *sb, ext4_group_t group,
1433 struct ext4_buddy *e4b, gfp_t gfp)
1435 int blocks_per_page;
1441 struct ext4_group_info *grp;
1442 struct ext4_sb_info *sbi = EXT4_SB(sb);
1443 struct inode *inode = sbi->s_buddy_cache;
1446 mb_debug(sb, "load group %u\n", group);
1448 blocks_per_page = PAGE_SIZE / sb->s_blocksize;
1449 grp = ext4_get_group_info(sb, group);
1451 e4b->bd_blkbits = sb->s_blocksize_bits;
1454 e4b->bd_group = group;
1455 e4b->bd_buddy_page = NULL;
1456 e4b->bd_bitmap_page = NULL;
1458 if (unlikely(EXT4_MB_GRP_NEED_INIT(grp))) {
1460 * we need full data about the group
1461 * to make a good selection
1463 ret = ext4_mb_init_group(sb, group, gfp);
1469 * the buddy cache inode stores the block bitmap
1470 * and buddy information in consecutive blocks.
1471 * So for each group we need two blocks.
1474 pnum = block / blocks_per_page;
1475 poff = block % blocks_per_page;
1477 /* we could use find_or_create_page(), but it locks page
1478 * what we'd like to avoid in fast path ... */
1479 page = find_get_page_flags(inode->i_mapping, pnum, FGP_ACCESSED);
1480 if (page == NULL || !PageUptodate(page)) {
1483 * drop the page reference and try
1484 * to get the page with lock. If we
1485 * are not uptodate that implies
1486 * somebody just created the page but
1487 * is yet to initialize the same. So
1488 * wait for it to initialize.
1491 page = find_or_create_page(inode->i_mapping, pnum, gfp);
1493 BUG_ON(page->mapping != inode->i_mapping);
1494 if (!PageUptodate(page)) {
1495 ret = ext4_mb_init_cache(page, NULL, gfp);
1500 mb_cmp_bitmaps(e4b, page_address(page) +
1501 (poff * sb->s_blocksize));
1510 if (!PageUptodate(page)) {
1515 /* Pages marked accessed already */
1516 e4b->bd_bitmap_page = page;
1517 e4b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize);
1520 pnum = block / blocks_per_page;
1521 poff = block % blocks_per_page;
1523 page = find_get_page_flags(inode->i_mapping, pnum, FGP_ACCESSED);
1524 if (page == NULL || !PageUptodate(page)) {
1527 page = find_or_create_page(inode->i_mapping, pnum, gfp);
1529 BUG_ON(page->mapping != inode->i_mapping);
1530 if (!PageUptodate(page)) {
1531 ret = ext4_mb_init_cache(page, e4b->bd_bitmap,
1545 if (!PageUptodate(page)) {
1550 /* Pages marked accessed already */
1551 e4b->bd_buddy_page = page;
1552 e4b->bd_buddy = page_address(page) + (poff * sb->s_blocksize);
1559 if (e4b->bd_bitmap_page)
1560 put_page(e4b->bd_bitmap_page);
1561 if (e4b->bd_buddy_page)
1562 put_page(e4b->bd_buddy_page);
1563 e4b->bd_buddy = NULL;
1564 e4b->bd_bitmap = NULL;
1568 static int ext4_mb_load_buddy(struct super_block *sb, ext4_group_t group,
1569 struct ext4_buddy *e4b)
1571 return ext4_mb_load_buddy_gfp(sb, group, e4b, GFP_NOFS);
1574 static void ext4_mb_unload_buddy(struct ext4_buddy *e4b)
1576 if (e4b->bd_bitmap_page)
1577 put_page(e4b->bd_bitmap_page);
1578 if (e4b->bd_buddy_page)
1579 put_page(e4b->bd_buddy_page);
1583 static int mb_find_order_for_block(struct ext4_buddy *e4b, int block)
1588 BUG_ON(e4b->bd_bitmap == e4b->bd_buddy);
1589 BUG_ON(block >= (1 << (e4b->bd_blkbits + 3)));
1591 while (order <= e4b->bd_blkbits + 1) {
1592 bb = mb_find_buddy(e4b, order, &max);
1593 if (!mb_test_bit(block >> order, bb)) {
1594 /* this block is part of buddy of order 'order' */
1602 static void mb_clear_bits(void *bm, int cur, int len)
1608 if ((cur & 31) == 0 && (len - cur) >= 32) {
1609 /* fast path: clear whole word at once */
1610 addr = bm + (cur >> 3);
1615 mb_clear_bit(cur, bm);
1620 /* clear bits in given range
1621 * will return first found zero bit if any, -1 otherwise
1623 static int mb_test_and_clear_bits(void *bm, int cur, int len)
1630 if ((cur & 31) == 0 && (len - cur) >= 32) {
1631 /* fast path: clear whole word at once */
1632 addr = bm + (cur >> 3);
1633 if (*addr != (__u32)(-1) && zero_bit == -1)
1634 zero_bit = cur + mb_find_next_zero_bit(addr, 32, 0);
1639 if (!mb_test_and_clear_bit(cur, bm) && zero_bit == -1)
1647 void mb_set_bits(void *bm, int cur, int len)
1653 if ((cur & 31) == 0 && (len - cur) >= 32) {
1654 /* fast path: set whole word at once */
1655 addr = bm + (cur >> 3);
1660 mb_set_bit(cur, bm);
1665 static inline int mb_buddy_adjust_border(int* bit, void* bitmap, int side)
1667 if (mb_test_bit(*bit + side, bitmap)) {
1668 mb_clear_bit(*bit, bitmap);
1674 mb_set_bit(*bit, bitmap);
1679 static void mb_buddy_mark_free(struct ext4_buddy *e4b, int first, int last)
1683 void *buddy = mb_find_buddy(e4b, order, &max);
1688 /* Bits in range [first; last] are known to be set since
1689 * corresponding blocks were allocated. Bits in range
1690 * (first; last) will stay set because they form buddies on
1691 * upper layer. We just deal with borders if they don't
1692 * align with upper layer and then go up.
1693 * Releasing entire group is all about clearing
1694 * single bit of highest order buddy.
1698 * ---------------------------------
1700 * ---------------------------------
1701 * | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1702 * ---------------------------------
1704 * \_____________________/
1706 * Neither [1] nor [6] is aligned to above layer.
1707 * Left neighbour [0] is free, so mark it busy,
1708 * decrease bb_counters and extend range to
1710 * Right neighbour [7] is busy. It can't be coaleasced with [6], so
1711 * mark [6] free, increase bb_counters and shrink range to
1713 * Then shift range to [0; 2], go up and do the same.
1718 e4b->bd_info->bb_counters[order] += mb_buddy_adjust_border(&first, buddy, -1);
1720 e4b->bd_info->bb_counters[order] += mb_buddy_adjust_border(&last, buddy, 1);
1725 if (first == last || !(buddy2 = mb_find_buddy(e4b, order, &max))) {
1726 mb_clear_bits(buddy, first, last - first + 1);
1727 e4b->bd_info->bb_counters[order - 1] += last - first + 1;
1736 static void mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b,
1737 int first, int count)
1739 int left_is_free = 0;
1740 int right_is_free = 0;
1742 int last = first + count - 1;
1743 struct super_block *sb = e4b->bd_sb;
1745 if (WARN_ON(count == 0))
1747 BUG_ON(last >= (sb->s_blocksize << 3));
1748 assert_spin_locked(ext4_group_lock_ptr(sb, e4b->bd_group));
1749 /* Don't bother if the block group is corrupt. */
1750 if (unlikely(EXT4_MB_GRP_BBITMAP_CORRUPT(e4b->bd_info)))
1753 mb_check_buddy(e4b);
1754 mb_free_blocks_double(inode, e4b, first, count);
1756 this_cpu_inc(discard_pa_seq);
1757 e4b->bd_info->bb_free += count;
1758 if (first < e4b->bd_info->bb_first_free)
1759 e4b->bd_info->bb_first_free = first;
1761 /* access memory sequentially: check left neighbour,
1762 * clear range and then check right neighbour
1765 left_is_free = !mb_test_bit(first - 1, e4b->bd_bitmap);
1766 block = mb_test_and_clear_bits(e4b->bd_bitmap, first, count);
1767 if (last + 1 < EXT4_SB(sb)->s_mb_maxs[0])
1768 right_is_free = !mb_test_bit(last + 1, e4b->bd_bitmap);
1770 if (unlikely(block != -1)) {
1771 struct ext4_sb_info *sbi = EXT4_SB(sb);
1772 ext4_fsblk_t blocknr;
1774 blocknr = ext4_group_first_block_no(sb, e4b->bd_group);
1775 blocknr += EXT4_C2B(sbi, block);
1776 if (!(sbi->s_mount_state & EXT4_FC_REPLAY)) {
1777 ext4_grp_locked_error(sb, e4b->bd_group,
1778 inode ? inode->i_ino : 0,
1780 "freeing already freed block (bit %u); block bitmap corrupt.",
1782 ext4_mark_group_bitmap_corrupted(
1784 EXT4_GROUP_INFO_BBITMAP_CORRUPT);
1789 /* let's maintain fragments counter */
1790 if (left_is_free && right_is_free)
1791 e4b->bd_info->bb_fragments--;
1792 else if (!left_is_free && !right_is_free)
1793 e4b->bd_info->bb_fragments++;
1795 /* buddy[0] == bd_bitmap is a special case, so handle
1796 * it right away and let mb_buddy_mark_free stay free of
1797 * zero order checks.
1798 * Check if neighbours are to be coaleasced,
1799 * adjust bitmap bb_counters and borders appropriately.
1802 first += !left_is_free;
1803 e4b->bd_info->bb_counters[0] += left_is_free ? -1 : 1;
1806 last -= !right_is_free;
1807 e4b->bd_info->bb_counters[0] += right_is_free ? -1 : 1;
1811 mb_buddy_mark_free(e4b, first >> 1, last >> 1);
1814 mb_set_largest_free_order(sb, e4b->bd_info);
1815 mb_update_avg_fragment_size(sb, e4b->bd_info);
1816 mb_check_buddy(e4b);
1819 static int mb_find_extent(struct ext4_buddy *e4b, int block,
1820 int needed, struct ext4_free_extent *ex)
1826 assert_spin_locked(ext4_group_lock_ptr(e4b->bd_sb, e4b->bd_group));
1829 buddy = mb_find_buddy(e4b, 0, &max);
1830 BUG_ON(buddy == NULL);
1831 BUG_ON(block >= max);
1832 if (mb_test_bit(block, buddy)) {
1839 /* find actual order */
1840 order = mb_find_order_for_block(e4b, block);
1841 block = block >> order;
1843 ex->fe_len = 1 << order;
1844 ex->fe_start = block << order;
1845 ex->fe_group = e4b->bd_group;
1847 /* calc difference from given start */
1848 next = next - ex->fe_start;
1850 ex->fe_start += next;
1852 while (needed > ex->fe_len &&
1853 mb_find_buddy(e4b, order, &max)) {
1855 if (block + 1 >= max)
1858 next = (block + 1) * (1 << order);
1859 if (mb_test_bit(next, e4b->bd_bitmap))
1862 order = mb_find_order_for_block(e4b, next);
1864 block = next >> order;
1865 ex->fe_len += 1 << order;
1868 if (ex->fe_start + ex->fe_len > EXT4_CLUSTERS_PER_GROUP(e4b->bd_sb)) {
1869 /* Should never happen! (but apparently sometimes does?!?) */
1871 ext4_grp_locked_error(e4b->bd_sb, e4b->bd_group, 0, 0,
1872 "corruption or bug in mb_find_extent "
1873 "block=%d, order=%d needed=%d ex=%u/%d/%d@%u",
1874 block, order, needed, ex->fe_group, ex->fe_start,
1875 ex->fe_len, ex->fe_logical);
1883 static int mb_mark_used(struct ext4_buddy *e4b, struct ext4_free_extent *ex)
1889 int start = ex->fe_start;
1890 int len = ex->fe_len;
1896 BUG_ON(start + len > (e4b->bd_sb->s_blocksize << 3));
1897 BUG_ON(e4b->bd_group != ex->fe_group);
1898 assert_spin_locked(ext4_group_lock_ptr(e4b->bd_sb, e4b->bd_group));
1899 mb_check_buddy(e4b);
1900 mb_mark_used_double(e4b, start, len);
1902 this_cpu_inc(discard_pa_seq);
1903 e4b->bd_info->bb_free -= len;
1904 if (e4b->bd_info->bb_first_free == start)
1905 e4b->bd_info->bb_first_free += len;
1907 /* let's maintain fragments counter */
1909 mlen = !mb_test_bit(start - 1, e4b->bd_bitmap);
1910 if (start + len < EXT4_SB(e4b->bd_sb)->s_mb_maxs[0])
1911 max = !mb_test_bit(start + len, e4b->bd_bitmap);
1913 e4b->bd_info->bb_fragments++;
1914 else if (!mlen && !max)
1915 e4b->bd_info->bb_fragments--;
1917 /* let's maintain buddy itself */
1920 ord = mb_find_order_for_block(e4b, start);
1922 if (((start >> ord) << ord) == start && len >= (1 << ord)) {
1923 /* the whole chunk may be allocated at once! */
1926 buddy = mb_find_buddy(e4b, ord, &max);
1929 BUG_ON((start >> ord) >= max);
1930 mb_set_bit(start >> ord, buddy);
1931 e4b->bd_info->bb_counters[ord]--;
1938 /* store for history */
1940 ret = len | (ord << 16);
1942 /* we have to split large buddy */
1944 buddy = mb_find_buddy(e4b, ord, &max);
1945 mb_set_bit(start >> ord, buddy);
1946 e4b->bd_info->bb_counters[ord]--;
1949 cur = (start >> ord) & ~1U;
1950 buddy = mb_find_buddy(e4b, ord, &max);
1951 mb_clear_bit(cur, buddy);
1952 mb_clear_bit(cur + 1, buddy);
1953 e4b->bd_info->bb_counters[ord]++;
1954 e4b->bd_info->bb_counters[ord]++;
1957 mb_set_largest_free_order(e4b->bd_sb, e4b->bd_info);
1959 mb_update_avg_fragment_size(e4b->bd_sb, e4b->bd_info);
1960 mb_set_bits(e4b->bd_bitmap, ex->fe_start, len0);
1961 mb_check_buddy(e4b);
1967 * Must be called under group lock!
1969 static void ext4_mb_use_best_found(struct ext4_allocation_context *ac,
1970 struct ext4_buddy *e4b)
1972 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
1975 BUG_ON(ac->ac_b_ex.fe_group != e4b->bd_group);
1976 BUG_ON(ac->ac_status == AC_STATUS_FOUND);
1978 ac->ac_b_ex.fe_len = min(ac->ac_b_ex.fe_len, ac->ac_g_ex.fe_len);
1979 ac->ac_b_ex.fe_logical = ac->ac_g_ex.fe_logical;
1980 ret = mb_mark_used(e4b, &ac->ac_b_ex);
1982 /* preallocation can change ac_b_ex, thus we store actually
1983 * allocated blocks for history */
1984 ac->ac_f_ex = ac->ac_b_ex;
1986 ac->ac_status = AC_STATUS_FOUND;
1987 ac->ac_tail = ret & 0xffff;
1988 ac->ac_buddy = ret >> 16;
1991 * take the page reference. We want the page to be pinned
1992 * so that we don't get a ext4_mb_init_cache_call for this
1993 * group until we update the bitmap. That would mean we
1994 * double allocate blocks. The reference is dropped
1995 * in ext4_mb_release_context
1997 ac->ac_bitmap_page = e4b->bd_bitmap_page;
1998 get_page(ac->ac_bitmap_page);
1999 ac->ac_buddy_page = e4b->bd_buddy_page;
2000 get_page(ac->ac_buddy_page);
2001 /* store last allocated for subsequent stream allocation */
2002 if (ac->ac_flags & EXT4_MB_STREAM_ALLOC) {
2003 spin_lock(&sbi->s_md_lock);
2004 sbi->s_mb_last_group = ac->ac_f_ex.fe_group;
2005 sbi->s_mb_last_start = ac->ac_f_ex.fe_start;
2006 spin_unlock(&sbi->s_md_lock);
2009 * As we've just preallocated more space than
2010 * user requested originally, we store allocated
2011 * space in a special descriptor.
2013 if (ac->ac_o_ex.fe_len < ac->ac_b_ex.fe_len)
2014 ext4_mb_new_preallocation(ac);
2018 static void ext4_mb_check_limits(struct ext4_allocation_context *ac,
2019 struct ext4_buddy *e4b,
2022 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
2023 struct ext4_free_extent *bex = &ac->ac_b_ex;
2024 struct ext4_free_extent *gex = &ac->ac_g_ex;
2025 struct ext4_free_extent ex;
2028 if (ac->ac_status == AC_STATUS_FOUND)
2031 * We don't want to scan for a whole year
2033 if (ac->ac_found > sbi->s_mb_max_to_scan &&
2034 !(ac->ac_flags & EXT4_MB_HINT_FIRST)) {
2035 ac->ac_status = AC_STATUS_BREAK;
2040 * Haven't found good chunk so far, let's continue
2042 if (bex->fe_len < gex->fe_len)
2045 if ((finish_group || ac->ac_found > sbi->s_mb_min_to_scan)
2046 && bex->fe_group == e4b->bd_group) {
2047 /* recheck chunk's availability - we don't know
2048 * when it was found (within this lock-unlock
2050 max = mb_find_extent(e4b, bex->fe_start, gex->fe_len, &ex);
2051 if (max >= gex->fe_len) {
2052 ext4_mb_use_best_found(ac, e4b);
2059 * The routine checks whether found extent is good enough. If it is,
2060 * then the extent gets marked used and flag is set to the context
2061 * to stop scanning. Otherwise, the extent is compared with the
2062 * previous found extent and if new one is better, then it's stored
2063 * in the context. Later, the best found extent will be used, if
2064 * mballoc can't find good enough extent.
2066 * FIXME: real allocation policy is to be designed yet!
2068 static void ext4_mb_measure_extent(struct ext4_allocation_context *ac,
2069 struct ext4_free_extent *ex,
2070 struct ext4_buddy *e4b)
2072 struct ext4_free_extent *bex = &ac->ac_b_ex;
2073 struct ext4_free_extent *gex = &ac->ac_g_ex;
2075 BUG_ON(ex->fe_len <= 0);
2076 BUG_ON(ex->fe_len > EXT4_CLUSTERS_PER_GROUP(ac->ac_sb));
2077 BUG_ON(ex->fe_start >= EXT4_CLUSTERS_PER_GROUP(ac->ac_sb));
2078 BUG_ON(ac->ac_status != AC_STATUS_CONTINUE);
2083 * The special case - take what you catch first
2085 if (unlikely(ac->ac_flags & EXT4_MB_HINT_FIRST)) {
2087 ext4_mb_use_best_found(ac, e4b);
2092 * Let's check whether the chuck is good enough
2094 if (ex->fe_len == gex->fe_len) {
2096 ext4_mb_use_best_found(ac, e4b);
2101 * If this is first found extent, just store it in the context
2103 if (bex->fe_len == 0) {
2109 * If new found extent is better, store it in the context
2111 if (bex->fe_len < gex->fe_len) {
2112 /* if the request isn't satisfied, any found extent
2113 * larger than previous best one is better */
2114 if (ex->fe_len > bex->fe_len)
2116 } else if (ex->fe_len > gex->fe_len) {
2117 /* if the request is satisfied, then we try to find
2118 * an extent that still satisfy the request, but is
2119 * smaller than previous one */
2120 if (ex->fe_len < bex->fe_len)
2124 ext4_mb_check_limits(ac, e4b, 0);
2127 static noinline_for_stack
2128 int ext4_mb_try_best_found(struct ext4_allocation_context *ac,
2129 struct ext4_buddy *e4b)
2131 struct ext4_free_extent ex = ac->ac_b_ex;
2132 ext4_group_t group = ex.fe_group;
2136 BUG_ON(ex.fe_len <= 0);
2137 err = ext4_mb_load_buddy(ac->ac_sb, group, e4b);
2141 ext4_lock_group(ac->ac_sb, group);
2142 max = mb_find_extent(e4b, ex.fe_start, ex.fe_len, &ex);
2146 ext4_mb_use_best_found(ac, e4b);
2149 ext4_unlock_group(ac->ac_sb, group);
2150 ext4_mb_unload_buddy(e4b);
2155 static noinline_for_stack
2156 int ext4_mb_find_by_goal(struct ext4_allocation_context *ac,
2157 struct ext4_buddy *e4b)
2159 ext4_group_t group = ac->ac_g_ex.fe_group;
2162 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
2163 struct ext4_group_info *grp = ext4_get_group_info(ac->ac_sb, group);
2164 struct ext4_free_extent ex;
2166 if (!(ac->ac_flags & EXT4_MB_HINT_TRY_GOAL))
2168 if (grp->bb_free == 0)
2171 err = ext4_mb_load_buddy(ac->ac_sb, group, e4b);
2175 if (unlikely(EXT4_MB_GRP_BBITMAP_CORRUPT(e4b->bd_info))) {
2176 ext4_mb_unload_buddy(e4b);
2180 ext4_lock_group(ac->ac_sb, group);
2181 max = mb_find_extent(e4b, ac->ac_g_ex.fe_start,
2182 ac->ac_g_ex.fe_len, &ex);
2183 ex.fe_logical = 0xDEADFA11; /* debug value */
2185 if (max >= ac->ac_g_ex.fe_len && ac->ac_g_ex.fe_len == sbi->s_stripe) {
2188 start = ext4_group_first_block_no(ac->ac_sb, e4b->bd_group) +
2190 /* use do_div to get remainder (would be 64-bit modulo) */
2191 if (do_div(start, sbi->s_stripe) == 0) {
2194 ext4_mb_use_best_found(ac, e4b);
2196 } else if (max >= ac->ac_g_ex.fe_len) {
2197 BUG_ON(ex.fe_len <= 0);
2198 BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group);
2199 BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start);
2202 ext4_mb_use_best_found(ac, e4b);
2203 } else if (max > 0 && (ac->ac_flags & EXT4_MB_HINT_MERGE)) {
2204 /* Sometimes, caller may want to merge even small
2205 * number of blocks to an existing extent */
2206 BUG_ON(ex.fe_len <= 0);
2207 BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group);
2208 BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start);
2211 ext4_mb_use_best_found(ac, e4b);
2213 ext4_unlock_group(ac->ac_sb, group);
2214 ext4_mb_unload_buddy(e4b);
2220 * The routine scans buddy structures (not bitmap!) from given order
2221 * to max order and tries to find big enough chunk to satisfy the req
2223 static noinline_for_stack
2224 void ext4_mb_simple_scan_group(struct ext4_allocation_context *ac,
2225 struct ext4_buddy *e4b)
2227 struct super_block *sb = ac->ac_sb;
2228 struct ext4_group_info *grp = e4b->bd_info;
2234 BUG_ON(ac->ac_2order <= 0);
2235 for (i = ac->ac_2order; i < MB_NUM_ORDERS(sb); i++) {
2236 if (grp->bb_counters[i] == 0)
2239 buddy = mb_find_buddy(e4b, i, &max);
2240 BUG_ON(buddy == NULL);
2242 k = mb_find_next_zero_bit(buddy, max, 0);
2244 ext4_grp_locked_error(ac->ac_sb, e4b->bd_group, 0, 0,
2245 "%d free clusters of order %d. But found 0",
2246 grp->bb_counters[i], i);
2247 ext4_mark_group_bitmap_corrupted(ac->ac_sb,
2249 EXT4_GROUP_INFO_BBITMAP_CORRUPT);
2254 ac->ac_b_ex.fe_len = 1 << i;
2255 ac->ac_b_ex.fe_start = k << i;
2256 ac->ac_b_ex.fe_group = e4b->bd_group;
2258 ext4_mb_use_best_found(ac, e4b);
2260 BUG_ON(ac->ac_f_ex.fe_len != ac->ac_g_ex.fe_len);
2262 if (EXT4_SB(sb)->s_mb_stats)
2263 atomic_inc(&EXT4_SB(sb)->s_bal_2orders);
2270 * The routine scans the group and measures all found extents.
2271 * In order to optimize scanning, caller must pass number of
2272 * free blocks in the group, so the routine can know upper limit.
2274 static noinline_for_stack
2275 void ext4_mb_complex_scan_group(struct ext4_allocation_context *ac,
2276 struct ext4_buddy *e4b)
2278 struct super_block *sb = ac->ac_sb;
2279 void *bitmap = e4b->bd_bitmap;
2280 struct ext4_free_extent ex;
2284 free = e4b->bd_info->bb_free;
2285 if (WARN_ON(free <= 0))
2288 i = e4b->bd_info->bb_first_free;
2290 while (free && ac->ac_status == AC_STATUS_CONTINUE) {
2291 i = mb_find_next_zero_bit(bitmap,
2292 EXT4_CLUSTERS_PER_GROUP(sb), i);
2293 if (i >= EXT4_CLUSTERS_PER_GROUP(sb)) {
2295 * IF we have corrupt bitmap, we won't find any
2296 * free blocks even though group info says we
2299 ext4_grp_locked_error(sb, e4b->bd_group, 0, 0,
2300 "%d free clusters as per "
2301 "group info. But bitmap says 0",
2303 ext4_mark_group_bitmap_corrupted(sb, e4b->bd_group,
2304 EXT4_GROUP_INFO_BBITMAP_CORRUPT);
2308 mb_find_extent(e4b, i, ac->ac_g_ex.fe_len, &ex);
2309 if (WARN_ON(ex.fe_len <= 0))
2311 if (free < ex.fe_len) {
2312 ext4_grp_locked_error(sb, e4b->bd_group, 0, 0,
2313 "%d free clusters as per "
2314 "group info. But got %d blocks",
2316 ext4_mark_group_bitmap_corrupted(sb, e4b->bd_group,
2317 EXT4_GROUP_INFO_BBITMAP_CORRUPT);
2319 * The number of free blocks differs. This mostly
2320 * indicate that the bitmap is corrupt. So exit
2321 * without claiming the space.
2325 ex.fe_logical = 0xDEADC0DE; /* debug value */
2326 ext4_mb_measure_extent(ac, &ex, e4b);
2332 ext4_mb_check_limits(ac, e4b, 1);
2336 * This is a special case for storages like raid5
2337 * we try to find stripe-aligned chunks for stripe-size-multiple requests
2339 static noinline_for_stack
2340 void ext4_mb_scan_aligned(struct ext4_allocation_context *ac,
2341 struct ext4_buddy *e4b)
2343 struct super_block *sb = ac->ac_sb;
2344 struct ext4_sb_info *sbi = EXT4_SB(sb);
2345 void *bitmap = e4b->bd_bitmap;
2346 struct ext4_free_extent ex;
2347 ext4_fsblk_t first_group_block;
2352 BUG_ON(sbi->s_stripe == 0);
2354 /* find first stripe-aligned block in group */
2355 first_group_block = ext4_group_first_block_no(sb, e4b->bd_group);
2357 a = first_group_block + sbi->s_stripe - 1;
2358 do_div(a, sbi->s_stripe);
2359 i = (a * sbi->s_stripe) - first_group_block;
2361 while (i < EXT4_CLUSTERS_PER_GROUP(sb)) {
2362 if (!mb_test_bit(i, bitmap)) {
2363 max = mb_find_extent(e4b, i, sbi->s_stripe, &ex);
2364 if (max >= sbi->s_stripe) {
2366 ex.fe_logical = 0xDEADF00D; /* debug value */
2368 ext4_mb_use_best_found(ac, e4b);
2377 * This is also called BEFORE we load the buddy bitmap.
2378 * Returns either 1 or 0 indicating that the group is either suitable
2379 * for the allocation or not.
2381 static bool ext4_mb_good_group(struct ext4_allocation_context *ac,
2382 ext4_group_t group, int cr)
2384 ext4_grpblk_t free, fragments;
2385 int flex_size = ext4_flex_bg_size(EXT4_SB(ac->ac_sb));
2386 struct ext4_group_info *grp = ext4_get_group_info(ac->ac_sb, group);
2388 BUG_ON(cr < 0 || cr >= 4);
2390 if (unlikely(EXT4_MB_GRP_BBITMAP_CORRUPT(grp)))
2393 free = grp->bb_free;
2397 fragments = grp->bb_fragments;
2403 BUG_ON(ac->ac_2order == 0);
2405 /* Avoid using the first bg of a flexgroup for data files */
2406 if ((ac->ac_flags & EXT4_MB_HINT_DATA) &&
2407 (flex_size >= EXT4_FLEX_SIZE_DIR_ALLOC_SCHEME) &&
2408 ((group % flex_size) == 0))
2411 if (free < ac->ac_g_ex.fe_len)
2414 if (ac->ac_2order >= MB_NUM_ORDERS(ac->ac_sb))
2417 if (grp->bb_largest_free_order < ac->ac_2order)
2422 if ((free / fragments) >= ac->ac_g_ex.fe_len)
2426 if (free >= ac->ac_g_ex.fe_len)
2439 * This could return negative error code if something goes wrong
2440 * during ext4_mb_init_group(). This should not be called with
2441 * ext4_lock_group() held.
2443 * Note: because we are conditionally operating with the group lock in
2444 * the EXT4_MB_STRICT_CHECK case, we need to fake out sparse in this
2445 * function using __acquire and __release. This means we need to be
2446 * super careful before messing with the error path handling via "goto
2449 static int ext4_mb_good_group_nolock(struct ext4_allocation_context *ac,
2450 ext4_group_t group, int cr)
2452 struct ext4_group_info *grp = ext4_get_group_info(ac->ac_sb, group);
2453 struct super_block *sb = ac->ac_sb;
2454 struct ext4_sb_info *sbi = EXT4_SB(sb);
2455 bool should_lock = ac->ac_flags & EXT4_MB_STRICT_CHECK;
2459 if (sbi->s_mb_stats)
2460 atomic64_inc(&sbi->s_bal_cX_groups_considered[ac->ac_criteria]);
2462 ext4_lock_group(sb, group);
2463 __release(ext4_group_lock_ptr(sb, group));
2465 free = grp->bb_free;
2468 if (cr <= 2 && free < ac->ac_g_ex.fe_len)
2470 if (unlikely(EXT4_MB_GRP_BBITMAP_CORRUPT(grp)))
2473 __acquire(ext4_group_lock_ptr(sb, group));
2474 ext4_unlock_group(sb, group);
2477 /* We only do this if the grp has never been initialized */
2478 if (unlikely(EXT4_MB_GRP_NEED_INIT(grp))) {
2479 struct ext4_group_desc *gdp =
2480 ext4_get_group_desc(sb, group, NULL);
2483 /* cr=0/1 is a very optimistic search to find large
2484 * good chunks almost for free. If buddy data is not
2485 * ready, then this optimization makes no sense. But
2486 * we never skip the first block group in a flex_bg,
2487 * since this gets used for metadata block allocation,
2488 * and we want to make sure we locate metadata blocks
2489 * in the first block group in the flex_bg if possible.
2492 (!sbi->s_log_groups_per_flex ||
2493 ((group & ((1 << sbi->s_log_groups_per_flex) - 1)) != 0)) &&
2494 !(ext4_has_group_desc_csum(sb) &&
2495 (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT))))
2497 ret = ext4_mb_init_group(sb, group, GFP_NOFS);
2503 ext4_lock_group(sb, group);
2504 __release(ext4_group_lock_ptr(sb, group));
2506 ret = ext4_mb_good_group(ac, group, cr);
2509 __acquire(ext4_group_lock_ptr(sb, group));
2510 ext4_unlock_group(sb, group);
2516 * Start prefetching @nr block bitmaps starting at @group.
2517 * Return the next group which needs to be prefetched.
2519 ext4_group_t ext4_mb_prefetch(struct super_block *sb, ext4_group_t group,
2520 unsigned int nr, int *cnt)
2522 ext4_group_t ngroups = ext4_get_groups_count(sb);
2523 struct buffer_head *bh;
2524 struct blk_plug plug;
2526 blk_start_plug(&plug);
2528 struct ext4_group_desc *gdp = ext4_get_group_desc(sb, group,
2530 struct ext4_group_info *grp = ext4_get_group_info(sb, group);
2533 * Prefetch block groups with free blocks; but don't
2534 * bother if it is marked uninitialized on disk, since
2535 * it won't require I/O to read. Also only try to
2536 * prefetch once, so we avoid getblk() call, which can
2539 if (!EXT4_MB_GRP_TEST_AND_SET_READ(grp) &&
2540 EXT4_MB_GRP_NEED_INIT(grp) &&
2541 ext4_free_group_clusters(sb, gdp) > 0 &&
2542 !(ext4_has_group_desc_csum(sb) &&
2543 (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)))) {
2544 bh = ext4_read_block_bitmap_nowait(sb, group, true);
2545 if (bh && !IS_ERR(bh)) {
2546 if (!buffer_uptodate(bh) && cnt)
2551 if (++group >= ngroups)
2554 blk_finish_plug(&plug);
2559 * Prefetching reads the block bitmap into the buffer cache; but we
2560 * need to make sure that the buddy bitmap in the page cache has been
2561 * initialized. Note that ext4_mb_init_group() will block if the I/O
2562 * is not yet completed, or indeed if it was not initiated by
2563 * ext4_mb_prefetch did not start the I/O.
2565 * TODO: We should actually kick off the buddy bitmap setup in a work
2566 * queue when the buffer I/O is completed, so that we don't block
2567 * waiting for the block allocation bitmap read to finish when
2568 * ext4_mb_prefetch_fini is called from ext4_mb_regular_allocator().
2570 void ext4_mb_prefetch_fini(struct super_block *sb, ext4_group_t group,
2574 struct ext4_group_desc *gdp = ext4_get_group_desc(sb, group,
2576 struct ext4_group_info *grp = ext4_get_group_info(sb, group);
2579 group = ext4_get_groups_count(sb);
2581 grp = ext4_get_group_info(sb, group);
2583 if (EXT4_MB_GRP_NEED_INIT(grp) &&
2584 ext4_free_group_clusters(sb, gdp) > 0 &&
2585 !(ext4_has_group_desc_csum(sb) &&
2586 (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)))) {
2587 if (ext4_mb_init_group(sb, group, GFP_NOFS))
2593 static noinline_for_stack int
2594 ext4_mb_regular_allocator(struct ext4_allocation_context *ac)
2596 ext4_group_t prefetch_grp = 0, ngroups, group, i;
2597 int cr = -1, new_cr;
2598 int err = 0, first_err = 0;
2599 unsigned int nr = 0, prefetch_ios = 0;
2600 struct ext4_sb_info *sbi;
2601 struct super_block *sb;
2602 struct ext4_buddy e4b;
2607 ngroups = ext4_get_groups_count(sb);
2608 /* non-extent files are limited to low blocks/groups */
2609 if (!(ext4_test_inode_flag(ac->ac_inode, EXT4_INODE_EXTENTS)))
2610 ngroups = sbi->s_blockfile_groups;
2612 BUG_ON(ac->ac_status == AC_STATUS_FOUND);
2614 /* first, try the goal */
2615 err = ext4_mb_find_by_goal(ac, &e4b);
2616 if (err || ac->ac_status == AC_STATUS_FOUND)
2619 if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY))
2623 * ac->ac_2order is set only if the fe_len is a power of 2
2624 * if ac->ac_2order is set we also set criteria to 0 so that we
2625 * try exact allocation using buddy.
2627 i = fls(ac->ac_g_ex.fe_len);
2630 * We search using buddy data only if the order of the request
2631 * is greater than equal to the sbi_s_mb_order2_reqs
2632 * You can tune it via /sys/fs/ext4/<partition>/mb_order2_req
2633 * We also support searching for power-of-two requests only for
2634 * requests upto maximum buddy size we have constructed.
2636 if (i >= sbi->s_mb_order2_reqs && i <= MB_NUM_ORDERS(sb)) {
2638 * This should tell if fe_len is exactly power of 2
2640 if ((ac->ac_g_ex.fe_len & (~(1 << (i - 1)))) == 0)
2641 ac->ac_2order = array_index_nospec(i - 1,
2645 /* if stream allocation is enabled, use global goal */
2646 if (ac->ac_flags & EXT4_MB_STREAM_ALLOC) {
2647 /* TBD: may be hot point */
2648 spin_lock(&sbi->s_md_lock);
2649 ac->ac_g_ex.fe_group = sbi->s_mb_last_group;
2650 ac->ac_g_ex.fe_start = sbi->s_mb_last_start;
2651 spin_unlock(&sbi->s_md_lock);
2654 /* Let's just scan groups to find more-less suitable blocks */
2655 cr = ac->ac_2order ? 0 : 1;
2657 * cr == 0 try to get exact allocation,
2658 * cr == 3 try to get anything
2661 for (; cr < 4 && ac->ac_status == AC_STATUS_CONTINUE; cr++) {
2662 ac->ac_criteria = cr;
2664 * searching for the right group start
2665 * from the goal value specified
2667 group = ac->ac_g_ex.fe_group;
2668 ac->ac_groups_linear_remaining = sbi->s_mb_max_linear_groups;
2669 prefetch_grp = group;
2671 for (i = 0, new_cr = cr; i < ngroups; i++,
2672 ext4_mb_choose_next_group(ac, &new_cr, &group, ngroups)) {
2682 * Batch reads of the block allocation bitmaps
2683 * to get multiple READs in flight; limit
2684 * prefetching at cr=0/1, otherwise mballoc can
2685 * spend a lot of time loading imperfect groups
2687 if ((prefetch_grp == group) &&
2689 prefetch_ios < sbi->s_mb_prefetch_limit)) {
2690 unsigned int curr_ios = prefetch_ios;
2692 nr = sbi->s_mb_prefetch;
2693 if (ext4_has_feature_flex_bg(sb)) {
2694 nr = 1 << sbi->s_log_groups_per_flex;
2695 nr -= group & (nr - 1);
2696 nr = min(nr, sbi->s_mb_prefetch);
2698 prefetch_grp = ext4_mb_prefetch(sb, group,
2700 if (prefetch_ios == curr_ios)
2704 /* This now checks without needing the buddy page */
2705 ret = ext4_mb_good_group_nolock(ac, group, cr);
2712 err = ext4_mb_load_buddy(sb, group, &e4b);
2716 ext4_lock_group(sb, group);
2719 * We need to check again after locking the
2722 ret = ext4_mb_good_group(ac, group, cr);
2724 ext4_unlock_group(sb, group);
2725 ext4_mb_unload_buddy(&e4b);
2729 ac->ac_groups_scanned++;
2731 ext4_mb_simple_scan_group(ac, &e4b);
2732 else if (cr == 1 && sbi->s_stripe &&
2733 !(ac->ac_g_ex.fe_len % sbi->s_stripe))
2734 ext4_mb_scan_aligned(ac, &e4b);
2736 ext4_mb_complex_scan_group(ac, &e4b);
2738 ext4_unlock_group(sb, group);
2739 ext4_mb_unload_buddy(&e4b);
2741 if (ac->ac_status != AC_STATUS_CONTINUE)
2744 /* Processed all groups and haven't found blocks */
2745 if (sbi->s_mb_stats && i == ngroups)
2746 atomic64_inc(&sbi->s_bal_cX_failed[cr]);
2749 if (ac->ac_b_ex.fe_len > 0 && ac->ac_status != AC_STATUS_FOUND &&
2750 !(ac->ac_flags & EXT4_MB_HINT_FIRST)) {
2752 * We've been searching too long. Let's try to allocate
2753 * the best chunk we've found so far
2755 ext4_mb_try_best_found(ac, &e4b);
2756 if (ac->ac_status != AC_STATUS_FOUND) {
2758 * Someone more lucky has already allocated it.
2759 * The only thing we can do is just take first
2762 lost = atomic_inc_return(&sbi->s_mb_lost_chunks);
2763 mb_debug(sb, "lost chunk, group: %u, start: %d, len: %d, lost: %d\n",
2764 ac->ac_b_ex.fe_group, ac->ac_b_ex.fe_start,
2765 ac->ac_b_ex.fe_len, lost);
2767 ac->ac_b_ex.fe_group = 0;
2768 ac->ac_b_ex.fe_start = 0;
2769 ac->ac_b_ex.fe_len = 0;
2770 ac->ac_status = AC_STATUS_CONTINUE;
2771 ac->ac_flags |= EXT4_MB_HINT_FIRST;
2777 if (sbi->s_mb_stats && ac->ac_status == AC_STATUS_FOUND)
2778 atomic64_inc(&sbi->s_bal_cX_hits[ac->ac_criteria]);
2780 if (!err && ac->ac_status != AC_STATUS_FOUND && first_err)
2783 mb_debug(sb, "Best len %d, origin len %d, ac_status %u, ac_flags 0x%x, cr %d ret %d\n",
2784 ac->ac_b_ex.fe_len, ac->ac_o_ex.fe_len, ac->ac_status,
2785 ac->ac_flags, cr, err);
2788 ext4_mb_prefetch_fini(sb, prefetch_grp, nr);
2793 static void *ext4_mb_seq_groups_start(struct seq_file *seq, loff_t *pos)
2795 struct super_block *sb = pde_data(file_inode(seq->file));
2798 if (*pos < 0 || *pos >= ext4_get_groups_count(sb))
2801 return (void *) ((unsigned long) group);
2804 static void *ext4_mb_seq_groups_next(struct seq_file *seq, void *v, loff_t *pos)
2806 struct super_block *sb = pde_data(file_inode(seq->file));
2810 if (*pos < 0 || *pos >= ext4_get_groups_count(sb))
2813 return (void *) ((unsigned long) group);
2816 static int ext4_mb_seq_groups_show(struct seq_file *seq, void *v)
2818 struct super_block *sb = pde_data(file_inode(seq->file));
2819 ext4_group_t group = (ext4_group_t) ((unsigned long) v);
2821 int err, buddy_loaded = 0;
2822 struct ext4_buddy e4b;
2823 struct ext4_group_info *grinfo;
2824 unsigned char blocksize_bits = min_t(unsigned char,
2825 sb->s_blocksize_bits,
2826 EXT4_MAX_BLOCK_LOG_SIZE);
2828 struct ext4_group_info info;
2829 ext4_grpblk_t counters[EXT4_MAX_BLOCK_LOG_SIZE + 2];
2834 seq_puts(seq, "#group: free frags first ["
2835 " 2^0 2^1 2^2 2^3 2^4 2^5 2^6 "
2836 " 2^7 2^8 2^9 2^10 2^11 2^12 2^13 ]\n");
2838 i = (blocksize_bits + 2) * sizeof(sg.info.bb_counters[0]) +
2839 sizeof(struct ext4_group_info);
2841 grinfo = ext4_get_group_info(sb, group);
2842 /* Load the group info in memory only if not already loaded. */
2843 if (unlikely(EXT4_MB_GRP_NEED_INIT(grinfo))) {
2844 err = ext4_mb_load_buddy(sb, group, &e4b);
2846 seq_printf(seq, "#%-5u: I/O error\n", group);
2852 memcpy(&sg, ext4_get_group_info(sb, group), i);
2855 ext4_mb_unload_buddy(&e4b);
2857 seq_printf(seq, "#%-5u: %-5u %-5u %-5u [", group, sg.info.bb_free,
2858 sg.info.bb_fragments, sg.info.bb_first_free);
2859 for (i = 0; i <= 13; i++)
2860 seq_printf(seq, " %-5u", i <= blocksize_bits + 1 ?
2861 sg.info.bb_counters[i] : 0);
2862 seq_puts(seq, " ]\n");
2867 static void ext4_mb_seq_groups_stop(struct seq_file *seq, void *v)
2871 const struct seq_operations ext4_mb_seq_groups_ops = {
2872 .start = ext4_mb_seq_groups_start,
2873 .next = ext4_mb_seq_groups_next,
2874 .stop = ext4_mb_seq_groups_stop,
2875 .show = ext4_mb_seq_groups_show,
2878 int ext4_seq_mb_stats_show(struct seq_file *seq, void *offset)
2880 struct super_block *sb = seq->private;
2881 struct ext4_sb_info *sbi = EXT4_SB(sb);
2883 seq_puts(seq, "mballoc:\n");
2884 if (!sbi->s_mb_stats) {
2885 seq_puts(seq, "\tmb stats collection turned off.\n");
2886 seq_puts(seq, "\tTo enable, please write \"1\" to sysfs file mb_stats.\n");
2889 seq_printf(seq, "\treqs: %u\n", atomic_read(&sbi->s_bal_reqs));
2890 seq_printf(seq, "\tsuccess: %u\n", atomic_read(&sbi->s_bal_success));
2892 seq_printf(seq, "\tgroups_scanned: %u\n", atomic_read(&sbi->s_bal_groups_scanned));
2894 seq_puts(seq, "\tcr0_stats:\n");
2895 seq_printf(seq, "\t\thits: %llu\n", atomic64_read(&sbi->s_bal_cX_hits[0]));
2896 seq_printf(seq, "\t\tgroups_considered: %llu\n",
2897 atomic64_read(&sbi->s_bal_cX_groups_considered[0]));
2898 seq_printf(seq, "\t\tuseless_loops: %llu\n",
2899 atomic64_read(&sbi->s_bal_cX_failed[0]));
2900 seq_printf(seq, "\t\tbad_suggestions: %u\n",
2901 atomic_read(&sbi->s_bal_cr0_bad_suggestions));
2903 seq_puts(seq, "\tcr1_stats:\n");
2904 seq_printf(seq, "\t\thits: %llu\n", atomic64_read(&sbi->s_bal_cX_hits[1]));
2905 seq_printf(seq, "\t\tgroups_considered: %llu\n",
2906 atomic64_read(&sbi->s_bal_cX_groups_considered[1]));
2907 seq_printf(seq, "\t\tuseless_loops: %llu\n",
2908 atomic64_read(&sbi->s_bal_cX_failed[1]));
2909 seq_printf(seq, "\t\tbad_suggestions: %u\n",
2910 atomic_read(&sbi->s_bal_cr1_bad_suggestions));
2912 seq_puts(seq, "\tcr2_stats:\n");
2913 seq_printf(seq, "\t\thits: %llu\n", atomic64_read(&sbi->s_bal_cX_hits[2]));
2914 seq_printf(seq, "\t\tgroups_considered: %llu\n",
2915 atomic64_read(&sbi->s_bal_cX_groups_considered[2]));
2916 seq_printf(seq, "\t\tuseless_loops: %llu\n",
2917 atomic64_read(&sbi->s_bal_cX_failed[2]));
2919 seq_puts(seq, "\tcr3_stats:\n");
2920 seq_printf(seq, "\t\thits: %llu\n", atomic64_read(&sbi->s_bal_cX_hits[3]));
2921 seq_printf(seq, "\t\tgroups_considered: %llu\n",
2922 atomic64_read(&sbi->s_bal_cX_groups_considered[3]));
2923 seq_printf(seq, "\t\tuseless_loops: %llu\n",
2924 atomic64_read(&sbi->s_bal_cX_failed[3]));
2925 seq_printf(seq, "\textents_scanned: %u\n", atomic_read(&sbi->s_bal_ex_scanned));
2926 seq_printf(seq, "\t\tgoal_hits: %u\n", atomic_read(&sbi->s_bal_goals));
2927 seq_printf(seq, "\t\t2^n_hits: %u\n", atomic_read(&sbi->s_bal_2orders));
2928 seq_printf(seq, "\t\tbreaks: %u\n", atomic_read(&sbi->s_bal_breaks));
2929 seq_printf(seq, "\t\tlost: %u\n", atomic_read(&sbi->s_mb_lost_chunks));
2931 seq_printf(seq, "\tbuddies_generated: %u/%u\n",
2932 atomic_read(&sbi->s_mb_buddies_generated),
2933 ext4_get_groups_count(sb));
2934 seq_printf(seq, "\tbuddies_time_used: %llu\n",
2935 atomic64_read(&sbi->s_mb_generation_time));
2936 seq_printf(seq, "\tpreallocated: %u\n",
2937 atomic_read(&sbi->s_mb_preallocated));
2938 seq_printf(seq, "\tdiscarded: %u\n",
2939 atomic_read(&sbi->s_mb_discarded));
2943 static void *ext4_mb_seq_structs_summary_start(struct seq_file *seq, loff_t *pos)
2944 __acquires(&EXT4_SB(sb)->s_mb_rb_lock)
2946 struct super_block *sb = pde_data(file_inode(seq->file));
2947 unsigned long position;
2949 if (*pos < 0 || *pos >= 2*MB_NUM_ORDERS(sb))
2951 position = *pos + 1;
2952 return (void *) ((unsigned long) position);
2955 static void *ext4_mb_seq_structs_summary_next(struct seq_file *seq, void *v, loff_t *pos)
2957 struct super_block *sb = pde_data(file_inode(seq->file));
2958 unsigned long position;
2961 if (*pos < 0 || *pos >= 2*MB_NUM_ORDERS(sb))
2963 position = *pos + 1;
2964 return (void *) ((unsigned long) position);
2967 static int ext4_mb_seq_structs_summary_show(struct seq_file *seq, void *v)
2969 struct super_block *sb = pde_data(file_inode(seq->file));
2970 struct ext4_sb_info *sbi = EXT4_SB(sb);
2971 unsigned long position = ((unsigned long) v);
2972 struct ext4_group_info *grp;
2976 if (position >= MB_NUM_ORDERS(sb)) {
2977 position -= MB_NUM_ORDERS(sb);
2979 seq_puts(seq, "avg_fragment_size_lists:\n");
2982 read_lock(&sbi->s_mb_avg_fragment_size_locks[position]);
2983 list_for_each_entry(grp, &sbi->s_mb_avg_fragment_size[position],
2984 bb_avg_fragment_size_node)
2986 read_unlock(&sbi->s_mb_avg_fragment_size_locks[position]);
2987 seq_printf(seq, "\tlist_order_%u_groups: %u\n",
2988 (unsigned int)position, count);
2992 if (position == 0) {
2993 seq_printf(seq, "optimize_scan: %d\n",
2994 test_opt2(sb, MB_OPTIMIZE_SCAN) ? 1 : 0);
2995 seq_puts(seq, "max_free_order_lists:\n");
2998 read_lock(&sbi->s_mb_largest_free_orders_locks[position]);
2999 list_for_each_entry(grp, &sbi->s_mb_largest_free_orders[position],
3000 bb_largest_free_order_node)
3002 read_unlock(&sbi->s_mb_largest_free_orders_locks[position]);
3003 seq_printf(seq, "\tlist_order_%u_groups: %u\n",
3004 (unsigned int)position, count);
3009 static void ext4_mb_seq_structs_summary_stop(struct seq_file *seq, void *v)
3013 const struct seq_operations ext4_mb_seq_structs_summary_ops = {
3014 .start = ext4_mb_seq_structs_summary_start,
3015 .next = ext4_mb_seq_structs_summary_next,
3016 .stop = ext4_mb_seq_structs_summary_stop,
3017 .show = ext4_mb_seq_structs_summary_show,
3020 static struct kmem_cache *get_groupinfo_cache(int blocksize_bits)
3022 int cache_index = blocksize_bits - EXT4_MIN_BLOCK_LOG_SIZE;
3023 struct kmem_cache *cachep = ext4_groupinfo_caches[cache_index];
3030 * Allocate the top-level s_group_info array for the specified number
3033 int ext4_mb_alloc_groupinfo(struct super_block *sb, ext4_group_t ngroups)
3035 struct ext4_sb_info *sbi = EXT4_SB(sb);
3037 struct ext4_group_info ***old_groupinfo, ***new_groupinfo;
3039 size = (ngroups + EXT4_DESC_PER_BLOCK(sb) - 1) >>
3040 EXT4_DESC_PER_BLOCK_BITS(sb);
3041 if (size <= sbi->s_group_info_size)
3044 size = roundup_pow_of_two(sizeof(*sbi->s_group_info) * size);
3045 new_groupinfo = kvzalloc(size, GFP_KERNEL);
3046 if (!new_groupinfo) {
3047 ext4_msg(sb, KERN_ERR, "can't allocate buddy meta group");
3051 old_groupinfo = rcu_dereference(sbi->s_group_info);
3053 memcpy(new_groupinfo, old_groupinfo,
3054 sbi->s_group_info_size * sizeof(*sbi->s_group_info));
3056 rcu_assign_pointer(sbi->s_group_info, new_groupinfo);
3057 sbi->s_group_info_size = size / sizeof(*sbi->s_group_info);
3059 ext4_kvfree_array_rcu(old_groupinfo);
3060 ext4_debug("allocated s_groupinfo array for %d meta_bg's\n",
3061 sbi->s_group_info_size);
3065 /* Create and initialize ext4_group_info data for the given group. */
3066 int ext4_mb_add_groupinfo(struct super_block *sb, ext4_group_t group,
3067 struct ext4_group_desc *desc)
3071 int idx = group >> EXT4_DESC_PER_BLOCK_BITS(sb);
3072 struct ext4_sb_info *sbi = EXT4_SB(sb);
3073 struct ext4_group_info **meta_group_info;
3074 struct kmem_cache *cachep = get_groupinfo_cache(sb->s_blocksize_bits);
3077 * First check if this group is the first of a reserved block.
3078 * If it's true, we have to allocate a new table of pointers
3079 * to ext4_group_info structures
3081 if (group % EXT4_DESC_PER_BLOCK(sb) == 0) {
3082 metalen = sizeof(*meta_group_info) <<
3083 EXT4_DESC_PER_BLOCK_BITS(sb);
3084 meta_group_info = kmalloc(metalen, GFP_NOFS);
3085 if (meta_group_info == NULL) {
3086 ext4_msg(sb, KERN_ERR, "can't allocate mem "
3087 "for a buddy group");
3088 goto exit_meta_group_info;
3091 rcu_dereference(sbi->s_group_info)[idx] = meta_group_info;
3095 meta_group_info = sbi_array_rcu_deref(sbi, s_group_info, idx);
3096 i = group & (EXT4_DESC_PER_BLOCK(sb) - 1);
3098 meta_group_info[i] = kmem_cache_zalloc(cachep, GFP_NOFS);
3099 if (meta_group_info[i] == NULL) {
3100 ext4_msg(sb, KERN_ERR, "can't allocate buddy mem");
3101 goto exit_group_info;
3103 set_bit(EXT4_GROUP_INFO_NEED_INIT_BIT,
3104 &(meta_group_info[i]->bb_state));
3107 * initialize bb_free to be able to skip
3108 * empty groups without initialization
3110 if (ext4_has_group_desc_csum(sb) &&
3111 (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT))) {
3112 meta_group_info[i]->bb_free =
3113 ext4_free_clusters_after_init(sb, group, desc);
3115 meta_group_info[i]->bb_free =
3116 ext4_free_group_clusters(sb, desc);
3119 INIT_LIST_HEAD(&meta_group_info[i]->bb_prealloc_list);
3120 init_rwsem(&meta_group_info[i]->alloc_sem);
3121 meta_group_info[i]->bb_free_root = RB_ROOT;
3122 INIT_LIST_HEAD(&meta_group_info[i]->bb_largest_free_order_node);
3123 INIT_LIST_HEAD(&meta_group_info[i]->bb_avg_fragment_size_node);
3124 meta_group_info[i]->bb_largest_free_order = -1; /* uninit */
3125 meta_group_info[i]->bb_avg_fragment_size_order = -1; /* uninit */
3126 meta_group_info[i]->bb_group = group;
3128 mb_group_bb_bitmap_alloc(sb, meta_group_info[i], group);
3132 /* If a meta_group_info table has been allocated, release it now */
3133 if (group % EXT4_DESC_PER_BLOCK(sb) == 0) {
3134 struct ext4_group_info ***group_info;
3137 group_info = rcu_dereference(sbi->s_group_info);
3138 kfree(group_info[idx]);
3139 group_info[idx] = NULL;
3142 exit_meta_group_info:
3144 } /* ext4_mb_add_groupinfo */
3146 static int ext4_mb_init_backend(struct super_block *sb)
3148 ext4_group_t ngroups = ext4_get_groups_count(sb);
3150 struct ext4_sb_info *sbi = EXT4_SB(sb);
3152 struct ext4_group_desc *desc;
3153 struct ext4_group_info ***group_info;
3154 struct kmem_cache *cachep;
3156 err = ext4_mb_alloc_groupinfo(sb, ngroups);
3160 sbi->s_buddy_cache = new_inode(sb);
3161 if (sbi->s_buddy_cache == NULL) {
3162 ext4_msg(sb, KERN_ERR, "can't get new inode");
3165 /* To avoid potentially colliding with an valid on-disk inode number,
3166 * use EXT4_BAD_INO for the buddy cache inode number. This inode is
3167 * not in the inode hash, so it should never be found by iget(), but
3168 * this will avoid confusion if it ever shows up during debugging. */
3169 sbi->s_buddy_cache->i_ino = EXT4_BAD_INO;
3170 EXT4_I(sbi->s_buddy_cache)->i_disksize = 0;
3171 for (i = 0; i < ngroups; i++) {
3173 desc = ext4_get_group_desc(sb, i, NULL);
3175 ext4_msg(sb, KERN_ERR, "can't read descriptor %u", i);
3178 if (ext4_mb_add_groupinfo(sb, i, desc) != 0)
3182 if (ext4_has_feature_flex_bg(sb)) {
3183 /* a single flex group is supposed to be read by a single IO.
3184 * 2 ^ s_log_groups_per_flex != UINT_MAX as s_mb_prefetch is
3185 * unsigned integer, so the maximum shift is 32.
3187 if (sbi->s_es->s_log_groups_per_flex >= 32) {
3188 ext4_msg(sb, KERN_ERR, "too many log groups per flexible block group");
3191 sbi->s_mb_prefetch = min_t(uint, 1 << sbi->s_es->s_log_groups_per_flex,
3192 BLK_MAX_SEGMENT_SIZE >> (sb->s_blocksize_bits - 9));
3193 sbi->s_mb_prefetch *= 8; /* 8 prefetch IOs in flight at most */
3195 sbi->s_mb_prefetch = 32;
3197 if (sbi->s_mb_prefetch > ext4_get_groups_count(sb))
3198 sbi->s_mb_prefetch = ext4_get_groups_count(sb);
3199 /* now many real IOs to prefetch within a single allocation at cr=0
3200 * given cr=0 is an CPU-related optimization we shouldn't try to
3201 * load too many groups, at some point we should start to use what
3202 * we've got in memory.
3203 * with an average random access time 5ms, it'd take a second to get
3204 * 200 groups (* N with flex_bg), so let's make this limit 4
3206 sbi->s_mb_prefetch_limit = sbi->s_mb_prefetch * 4;
3207 if (sbi->s_mb_prefetch_limit > ext4_get_groups_count(sb))
3208 sbi->s_mb_prefetch_limit = ext4_get_groups_count(sb);
3213 cachep = get_groupinfo_cache(sb->s_blocksize_bits);
3215 kmem_cache_free(cachep, ext4_get_group_info(sb, i));
3216 i = sbi->s_group_info_size;
3218 group_info = rcu_dereference(sbi->s_group_info);
3220 kfree(group_info[i]);
3222 iput(sbi->s_buddy_cache);
3225 kvfree(rcu_dereference(sbi->s_group_info));
3230 static void ext4_groupinfo_destroy_slabs(void)
3234 for (i = 0; i < NR_GRPINFO_CACHES; i++) {
3235 kmem_cache_destroy(ext4_groupinfo_caches[i]);
3236 ext4_groupinfo_caches[i] = NULL;
3240 static int ext4_groupinfo_create_slab(size_t size)
3242 static DEFINE_MUTEX(ext4_grpinfo_slab_create_mutex);
3244 int blocksize_bits = order_base_2(size);
3245 int cache_index = blocksize_bits - EXT4_MIN_BLOCK_LOG_SIZE;
3246 struct kmem_cache *cachep;
3248 if (cache_index >= NR_GRPINFO_CACHES)
3251 if (unlikely(cache_index < 0))
3254 mutex_lock(&ext4_grpinfo_slab_create_mutex);
3255 if (ext4_groupinfo_caches[cache_index]) {
3256 mutex_unlock(&ext4_grpinfo_slab_create_mutex);
3257 return 0; /* Already created */
3260 slab_size = offsetof(struct ext4_group_info,
3261 bb_counters[blocksize_bits + 2]);
3263 cachep = kmem_cache_create(ext4_groupinfo_slab_names[cache_index],
3264 slab_size, 0, SLAB_RECLAIM_ACCOUNT,
3267 ext4_groupinfo_caches[cache_index] = cachep;
3269 mutex_unlock(&ext4_grpinfo_slab_create_mutex);
3272 "EXT4-fs: no memory for groupinfo slab cache\n");
3279 static void ext4_discard_work(struct work_struct *work)
3281 struct ext4_sb_info *sbi = container_of(work,
3282 struct ext4_sb_info, s_discard_work);
3283 struct super_block *sb = sbi->s_sb;
3284 struct ext4_free_data *fd, *nfd;
3285 struct ext4_buddy e4b;
3286 struct list_head discard_list;
3287 ext4_group_t grp, load_grp;
3290 INIT_LIST_HEAD(&discard_list);
3291 spin_lock(&sbi->s_md_lock);
3292 list_splice_init(&sbi->s_discard_list, &discard_list);
3293 spin_unlock(&sbi->s_md_lock);
3295 load_grp = UINT_MAX;
3296 list_for_each_entry_safe(fd, nfd, &discard_list, efd_list) {
3298 * If filesystem is umounting or no memory or suffering
3299 * from no space, give up the discard
3301 if ((sb->s_flags & SB_ACTIVE) && !err &&
3302 !atomic_read(&sbi->s_retry_alloc_pending)) {
3303 grp = fd->efd_group;
3304 if (grp != load_grp) {
3305 if (load_grp != UINT_MAX)
3306 ext4_mb_unload_buddy(&e4b);
3308 err = ext4_mb_load_buddy(sb, grp, &e4b);
3310 kmem_cache_free(ext4_free_data_cachep, fd);
3311 load_grp = UINT_MAX;
3318 ext4_lock_group(sb, grp);
3319 ext4_try_to_trim_range(sb, &e4b, fd->efd_start_cluster,
3320 fd->efd_start_cluster + fd->efd_count - 1, 1);
3321 ext4_unlock_group(sb, grp);
3323 kmem_cache_free(ext4_free_data_cachep, fd);
3326 if (load_grp != UINT_MAX)
3327 ext4_mb_unload_buddy(&e4b);
3330 int ext4_mb_init(struct super_block *sb)
3332 struct ext4_sb_info *sbi = EXT4_SB(sb);
3334 unsigned offset, offset_incr;
3338 i = MB_NUM_ORDERS(sb) * sizeof(*sbi->s_mb_offsets);
3340 sbi->s_mb_offsets = kmalloc(i, GFP_KERNEL);
3341 if (sbi->s_mb_offsets == NULL) {
3346 i = MB_NUM_ORDERS(sb) * sizeof(*sbi->s_mb_maxs);
3347 sbi->s_mb_maxs = kmalloc(i, GFP_KERNEL);
3348 if (sbi->s_mb_maxs == NULL) {
3353 ret = ext4_groupinfo_create_slab(sb->s_blocksize);
3357 /* order 0 is regular bitmap */
3358 sbi->s_mb_maxs[0] = sb->s_blocksize << 3;
3359 sbi->s_mb_offsets[0] = 0;
3363 offset_incr = 1 << (sb->s_blocksize_bits - 1);
3364 max = sb->s_blocksize << 2;
3366 sbi->s_mb_offsets[i] = offset;
3367 sbi->s_mb_maxs[i] = max;
3368 offset += offset_incr;
3369 offset_incr = offset_incr >> 1;
3372 } while (i < MB_NUM_ORDERS(sb));
3374 sbi->s_mb_avg_fragment_size =
3375 kmalloc_array(MB_NUM_ORDERS(sb), sizeof(struct list_head),
3377 if (!sbi->s_mb_avg_fragment_size) {
3381 sbi->s_mb_avg_fragment_size_locks =
3382 kmalloc_array(MB_NUM_ORDERS(sb), sizeof(rwlock_t),
3384 if (!sbi->s_mb_avg_fragment_size_locks) {
3388 for (i = 0; i < MB_NUM_ORDERS(sb); i++) {
3389 INIT_LIST_HEAD(&sbi->s_mb_avg_fragment_size[i]);
3390 rwlock_init(&sbi->s_mb_avg_fragment_size_locks[i]);
3392 sbi->s_mb_largest_free_orders =
3393 kmalloc_array(MB_NUM_ORDERS(sb), sizeof(struct list_head),
3395 if (!sbi->s_mb_largest_free_orders) {
3399 sbi->s_mb_largest_free_orders_locks =
3400 kmalloc_array(MB_NUM_ORDERS(sb), sizeof(rwlock_t),
3402 if (!sbi->s_mb_largest_free_orders_locks) {
3406 for (i = 0; i < MB_NUM_ORDERS(sb); i++) {
3407 INIT_LIST_HEAD(&sbi->s_mb_largest_free_orders[i]);
3408 rwlock_init(&sbi->s_mb_largest_free_orders_locks[i]);
3411 spin_lock_init(&sbi->s_md_lock);
3412 sbi->s_mb_free_pending = 0;
3413 INIT_LIST_HEAD(&sbi->s_freed_data_list);
3414 INIT_LIST_HEAD(&sbi->s_discard_list);
3415 INIT_WORK(&sbi->s_discard_work, ext4_discard_work);
3416 atomic_set(&sbi->s_retry_alloc_pending, 0);
3418 sbi->s_mb_max_to_scan = MB_DEFAULT_MAX_TO_SCAN;
3419 sbi->s_mb_min_to_scan = MB_DEFAULT_MIN_TO_SCAN;
3420 sbi->s_mb_stats = MB_DEFAULT_STATS;
3421 sbi->s_mb_stream_request = MB_DEFAULT_STREAM_THRESHOLD;
3422 sbi->s_mb_order2_reqs = MB_DEFAULT_ORDER2_REQS;
3423 sbi->s_mb_max_inode_prealloc = MB_DEFAULT_MAX_INODE_PREALLOC;
3425 * The default group preallocation is 512, which for 4k block
3426 * sizes translates to 2 megabytes. However for bigalloc file
3427 * systems, this is probably too big (i.e, if the cluster size
3428 * is 1 megabyte, then group preallocation size becomes half a
3429 * gigabyte!). As a default, we will keep a two megabyte
3430 * group pralloc size for cluster sizes up to 64k, and after
3431 * that, we will force a minimum group preallocation size of
3432 * 32 clusters. This translates to 8 megs when the cluster
3433 * size is 256k, and 32 megs when the cluster size is 1 meg,
3434 * which seems reasonable as a default.
3436 sbi->s_mb_group_prealloc = max(MB_DEFAULT_GROUP_PREALLOC >>
3437 sbi->s_cluster_bits, 32);
3439 * If there is a s_stripe > 1, then we set the s_mb_group_prealloc
3440 * to the lowest multiple of s_stripe which is bigger than
3441 * the s_mb_group_prealloc as determined above. We want
3442 * the preallocation size to be an exact multiple of the
3443 * RAID stripe size so that preallocations don't fragment
3446 if (sbi->s_stripe > 1) {
3447 sbi->s_mb_group_prealloc = roundup(
3448 sbi->s_mb_group_prealloc, sbi->s_stripe);
3451 sbi->s_locality_groups = alloc_percpu(struct ext4_locality_group);
3452 if (sbi->s_locality_groups == NULL) {
3456 for_each_possible_cpu(i) {
3457 struct ext4_locality_group *lg;
3458 lg = per_cpu_ptr(sbi->s_locality_groups, i);
3459 mutex_init(&lg->lg_mutex);
3460 for (j = 0; j < PREALLOC_TB_SIZE; j++)
3461 INIT_LIST_HEAD(&lg->lg_prealloc_list[j]);
3462 spin_lock_init(&lg->lg_prealloc_lock);
3465 if (bdev_nonrot(sb->s_bdev))
3466 sbi->s_mb_max_linear_groups = 0;
3468 sbi->s_mb_max_linear_groups = MB_DEFAULT_LINEAR_LIMIT;
3469 /* init file for buddy data */
3470 ret = ext4_mb_init_backend(sb);
3472 goto out_free_locality_groups;
3476 out_free_locality_groups:
3477 free_percpu(sbi->s_locality_groups);
3478 sbi->s_locality_groups = NULL;
3480 kfree(sbi->s_mb_avg_fragment_size);
3481 kfree(sbi->s_mb_avg_fragment_size_locks);
3482 kfree(sbi->s_mb_largest_free_orders);
3483 kfree(sbi->s_mb_largest_free_orders_locks);
3484 kfree(sbi->s_mb_offsets);
3485 sbi->s_mb_offsets = NULL;
3486 kfree(sbi->s_mb_maxs);
3487 sbi->s_mb_maxs = NULL;
3491 /* need to called with the ext4 group lock held */
3492 static int ext4_mb_cleanup_pa(struct ext4_group_info *grp)
3494 struct ext4_prealloc_space *pa;
3495 struct list_head *cur, *tmp;
3498 list_for_each_safe(cur, tmp, &grp->bb_prealloc_list) {
3499 pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list);
3500 list_del(&pa->pa_group_list);
3502 kmem_cache_free(ext4_pspace_cachep, pa);
3507 int ext4_mb_release(struct super_block *sb)
3509 ext4_group_t ngroups = ext4_get_groups_count(sb);
3511 int num_meta_group_infos;
3512 struct ext4_group_info *grinfo, ***group_info;
3513 struct ext4_sb_info *sbi = EXT4_SB(sb);
3514 struct kmem_cache *cachep = get_groupinfo_cache(sb->s_blocksize_bits);
3517 if (test_opt(sb, DISCARD)) {
3519 * wait the discard work to drain all of ext4_free_data
3521 flush_work(&sbi->s_discard_work);
3522 WARN_ON_ONCE(!list_empty(&sbi->s_discard_list));
3525 if (sbi->s_group_info) {
3526 for (i = 0; i < ngroups; i++) {
3528 grinfo = ext4_get_group_info(sb, i);
3529 mb_group_bb_bitmap_free(grinfo);
3530 ext4_lock_group(sb, i);
3531 count = ext4_mb_cleanup_pa(grinfo);
3533 mb_debug(sb, "mballoc: %d PAs left\n",
3535 ext4_unlock_group(sb, i);
3536 kmem_cache_free(cachep, grinfo);
3538 num_meta_group_infos = (ngroups +
3539 EXT4_DESC_PER_BLOCK(sb) - 1) >>
3540 EXT4_DESC_PER_BLOCK_BITS(sb);
3542 group_info = rcu_dereference(sbi->s_group_info);
3543 for (i = 0; i < num_meta_group_infos; i++)
3544 kfree(group_info[i]);
3548 kfree(sbi->s_mb_avg_fragment_size);
3549 kfree(sbi->s_mb_avg_fragment_size_locks);
3550 kfree(sbi->s_mb_largest_free_orders);
3551 kfree(sbi->s_mb_largest_free_orders_locks);
3552 kfree(sbi->s_mb_offsets);
3553 kfree(sbi->s_mb_maxs);
3554 iput(sbi->s_buddy_cache);
3555 if (sbi->s_mb_stats) {
3556 ext4_msg(sb, KERN_INFO,
3557 "mballoc: %u blocks %u reqs (%u success)",
3558 atomic_read(&sbi->s_bal_allocated),
3559 atomic_read(&sbi->s_bal_reqs),
3560 atomic_read(&sbi->s_bal_success));
3561 ext4_msg(sb, KERN_INFO,
3562 "mballoc: %u extents scanned, %u groups scanned, %u goal hits, "
3563 "%u 2^N hits, %u breaks, %u lost",
3564 atomic_read(&sbi->s_bal_ex_scanned),
3565 atomic_read(&sbi->s_bal_groups_scanned),
3566 atomic_read(&sbi->s_bal_goals),
3567 atomic_read(&sbi->s_bal_2orders),
3568 atomic_read(&sbi->s_bal_breaks),
3569 atomic_read(&sbi->s_mb_lost_chunks));
3570 ext4_msg(sb, KERN_INFO,
3571 "mballoc: %u generated and it took %llu",
3572 atomic_read(&sbi->s_mb_buddies_generated),
3573 atomic64_read(&sbi->s_mb_generation_time));
3574 ext4_msg(sb, KERN_INFO,
3575 "mballoc: %u preallocated, %u discarded",
3576 atomic_read(&sbi->s_mb_preallocated),
3577 atomic_read(&sbi->s_mb_discarded));
3580 free_percpu(sbi->s_locality_groups);
3585 static inline int ext4_issue_discard(struct super_block *sb,
3586 ext4_group_t block_group, ext4_grpblk_t cluster, int count,
3589 ext4_fsblk_t discard_block;
3591 discard_block = (EXT4_C2B(EXT4_SB(sb), cluster) +
3592 ext4_group_first_block_no(sb, block_group));
3593 count = EXT4_C2B(EXT4_SB(sb), count);
3594 trace_ext4_discard_blocks(sb,
3595 (unsigned long long) discard_block, count);
3597 return __blkdev_issue_discard(sb->s_bdev,
3598 (sector_t)discard_block << (sb->s_blocksize_bits - 9),
3599 (sector_t)count << (sb->s_blocksize_bits - 9),
3602 return sb_issue_discard(sb, discard_block, count, GFP_NOFS, 0);
3605 static void ext4_free_data_in_buddy(struct super_block *sb,
3606 struct ext4_free_data *entry)
3608 struct ext4_buddy e4b;
3609 struct ext4_group_info *db;
3610 int err, count = 0, count2 = 0;
3612 mb_debug(sb, "gonna free %u blocks in group %u (0x%p):",
3613 entry->efd_count, entry->efd_group, entry);
3615 err = ext4_mb_load_buddy(sb, entry->efd_group, &e4b);
3616 /* we expect to find existing buddy because it's pinned */
3619 spin_lock(&EXT4_SB(sb)->s_md_lock);
3620 EXT4_SB(sb)->s_mb_free_pending -= entry->efd_count;
3621 spin_unlock(&EXT4_SB(sb)->s_md_lock);
3624 /* there are blocks to put in buddy to make them really free */
3625 count += entry->efd_count;
3627 ext4_lock_group(sb, entry->efd_group);
3628 /* Take it out of per group rb tree */
3629 rb_erase(&entry->efd_node, &(db->bb_free_root));
3630 mb_free_blocks(NULL, &e4b, entry->efd_start_cluster, entry->efd_count);
3633 * Clear the trimmed flag for the group so that the next
3634 * ext4_trim_fs can trim it.
3635 * If the volume is mounted with -o discard, online discard
3636 * is supported and the free blocks will be trimmed online.
3638 if (!test_opt(sb, DISCARD))
3639 EXT4_MB_GRP_CLEAR_TRIMMED(db);
3641 if (!db->bb_free_root.rb_node) {
3642 /* No more items in the per group rb tree
3643 * balance refcounts from ext4_mb_free_metadata()
3645 put_page(e4b.bd_buddy_page);
3646 put_page(e4b.bd_bitmap_page);
3648 ext4_unlock_group(sb, entry->efd_group);
3649 ext4_mb_unload_buddy(&e4b);
3651 mb_debug(sb, "freed %d blocks in %d structures\n", count,
3656 * This function is called by the jbd2 layer once the commit has finished,
3657 * so we know we can free the blocks that were released with that commit.
3659 void ext4_process_freed_data(struct super_block *sb, tid_t commit_tid)
3661 struct ext4_sb_info *sbi = EXT4_SB(sb);
3662 struct ext4_free_data *entry, *tmp;
3663 struct list_head freed_data_list;
3664 struct list_head *cut_pos = NULL;
3667 INIT_LIST_HEAD(&freed_data_list);
3669 spin_lock(&sbi->s_md_lock);
3670 list_for_each_entry(entry, &sbi->s_freed_data_list, efd_list) {
3671 if (entry->efd_tid != commit_tid)
3673 cut_pos = &entry->efd_list;
3676 list_cut_position(&freed_data_list, &sbi->s_freed_data_list,
3678 spin_unlock(&sbi->s_md_lock);
3680 list_for_each_entry(entry, &freed_data_list, efd_list)
3681 ext4_free_data_in_buddy(sb, entry);
3683 if (test_opt(sb, DISCARD)) {
3684 spin_lock(&sbi->s_md_lock);
3685 wake = list_empty(&sbi->s_discard_list);
3686 list_splice_tail(&freed_data_list, &sbi->s_discard_list);
3687 spin_unlock(&sbi->s_md_lock);
3689 queue_work(system_unbound_wq, &sbi->s_discard_work);
3691 list_for_each_entry_safe(entry, tmp, &freed_data_list, efd_list)
3692 kmem_cache_free(ext4_free_data_cachep, entry);
3696 int __init ext4_init_mballoc(void)
3698 ext4_pspace_cachep = KMEM_CACHE(ext4_prealloc_space,
3699 SLAB_RECLAIM_ACCOUNT);
3700 if (ext4_pspace_cachep == NULL)
3703 ext4_ac_cachep = KMEM_CACHE(ext4_allocation_context,
3704 SLAB_RECLAIM_ACCOUNT);
3705 if (ext4_ac_cachep == NULL)
3708 ext4_free_data_cachep = KMEM_CACHE(ext4_free_data,
3709 SLAB_RECLAIM_ACCOUNT);
3710 if (ext4_free_data_cachep == NULL)
3716 kmem_cache_destroy(ext4_ac_cachep);
3718 kmem_cache_destroy(ext4_pspace_cachep);
3723 void ext4_exit_mballoc(void)
3726 * Wait for completion of call_rcu()'s on ext4_pspace_cachep
3727 * before destroying the slab cache.
3730 kmem_cache_destroy(ext4_pspace_cachep);
3731 kmem_cache_destroy(ext4_ac_cachep);
3732 kmem_cache_destroy(ext4_free_data_cachep);
3733 ext4_groupinfo_destroy_slabs();
3738 * Check quota and mark chosen space (ac->ac_b_ex) non-free in bitmaps
3739 * Returns 0 if success or error code
3741 static noinline_for_stack int
3742 ext4_mb_mark_diskspace_used(struct ext4_allocation_context *ac,
3743 handle_t *handle, unsigned int reserv_clstrs)
3745 struct buffer_head *bitmap_bh = NULL;
3746 struct ext4_group_desc *gdp;
3747 struct buffer_head *gdp_bh;
3748 struct ext4_sb_info *sbi;
3749 struct super_block *sb;
3753 BUG_ON(ac->ac_status != AC_STATUS_FOUND);
3754 BUG_ON(ac->ac_b_ex.fe_len <= 0);
3759 bitmap_bh = ext4_read_block_bitmap(sb, ac->ac_b_ex.fe_group);
3760 if (IS_ERR(bitmap_bh)) {
3761 err = PTR_ERR(bitmap_bh);
3766 BUFFER_TRACE(bitmap_bh, "getting write access");
3767 err = ext4_journal_get_write_access(handle, sb, bitmap_bh,
3773 gdp = ext4_get_group_desc(sb, ac->ac_b_ex.fe_group, &gdp_bh);
3777 ext4_debug("using block group %u(%d)\n", ac->ac_b_ex.fe_group,
3778 ext4_free_group_clusters(sb, gdp));
3780 BUFFER_TRACE(gdp_bh, "get_write_access");
3781 err = ext4_journal_get_write_access(handle, sb, gdp_bh, EXT4_JTR_NONE);
3785 block = ext4_grp_offs_to_block(sb, &ac->ac_b_ex);
3787 len = EXT4_C2B(sbi, ac->ac_b_ex.fe_len);
3788 if (!ext4_inode_block_valid(ac->ac_inode, block, len)) {
3789 ext4_error(sb, "Allocating blocks %llu-%llu which overlap "
3790 "fs metadata", block, block+len);
3791 /* File system mounted not to panic on error
3792 * Fix the bitmap and return EFSCORRUPTED
3793 * We leak some of the blocks here.
3795 ext4_lock_group(sb, ac->ac_b_ex.fe_group);
3796 mb_set_bits(bitmap_bh->b_data, ac->ac_b_ex.fe_start,
3797 ac->ac_b_ex.fe_len);
3798 ext4_unlock_group(sb, ac->ac_b_ex.fe_group);
3799 err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh);
3801 err = -EFSCORRUPTED;
3805 ext4_lock_group(sb, ac->ac_b_ex.fe_group);
3806 #ifdef AGGRESSIVE_CHECK
3809 for (i = 0; i < ac->ac_b_ex.fe_len; i++) {
3810 BUG_ON(mb_test_bit(ac->ac_b_ex.fe_start + i,
3811 bitmap_bh->b_data));
3815 mb_set_bits(bitmap_bh->b_data, ac->ac_b_ex.fe_start,
3816 ac->ac_b_ex.fe_len);
3817 if (ext4_has_group_desc_csum(sb) &&
3818 (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT))) {
3819 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT);
3820 ext4_free_group_clusters_set(sb, gdp,
3821 ext4_free_clusters_after_init(sb,
3822 ac->ac_b_ex.fe_group, gdp));
3824 len = ext4_free_group_clusters(sb, gdp) - ac->ac_b_ex.fe_len;
3825 ext4_free_group_clusters_set(sb, gdp, len);
3826 ext4_block_bitmap_csum_set(sb, ac->ac_b_ex.fe_group, gdp, bitmap_bh);
3827 ext4_group_desc_csum_set(sb, ac->ac_b_ex.fe_group, gdp);
3829 ext4_unlock_group(sb, ac->ac_b_ex.fe_group);
3830 percpu_counter_sub(&sbi->s_freeclusters_counter, ac->ac_b_ex.fe_len);
3832 * Now reduce the dirty block count also. Should not go negative
3834 if (!(ac->ac_flags & EXT4_MB_DELALLOC_RESERVED))
3835 /* release all the reserved blocks if non delalloc */
3836 percpu_counter_sub(&sbi->s_dirtyclusters_counter,
3839 if (sbi->s_log_groups_per_flex) {
3840 ext4_group_t flex_group = ext4_flex_group(sbi,
3841 ac->ac_b_ex.fe_group);
3842 atomic64_sub(ac->ac_b_ex.fe_len,
3843 &sbi_array_rcu_deref(sbi, s_flex_groups,
3844 flex_group)->free_clusters);
3847 err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh);
3850 err = ext4_handle_dirty_metadata(handle, NULL, gdp_bh);
3858 * Idempotent helper for Ext4 fast commit replay path to set the state of
3859 * blocks in bitmaps and update counters.
3861 void ext4_mb_mark_bb(struct super_block *sb, ext4_fsblk_t block,
3864 struct buffer_head *bitmap_bh = NULL;
3865 struct ext4_group_desc *gdp;
3866 struct buffer_head *gdp_bh;
3867 struct ext4_sb_info *sbi = EXT4_SB(sb);
3869 ext4_grpblk_t blkoff;
3872 unsigned int clen, clen_changed, thisgrp_len;
3875 ext4_get_group_no_and_offset(sb, block, &group, &blkoff);
3878 * Check to see if we are freeing blocks across a group
3880 * In case of flex_bg, this can happen that (block, len) may
3881 * span across more than one group. In that case we need to
3882 * get the corresponding group metadata to work with.
3883 * For this we have goto again loop.
3885 thisgrp_len = min_t(unsigned int, (unsigned int)len,
3886 EXT4_BLOCKS_PER_GROUP(sb) - EXT4_C2B(sbi, blkoff));
3887 clen = EXT4_NUM_B2C(sbi, thisgrp_len);
3889 if (!ext4_sb_block_valid(sb, NULL, block, thisgrp_len)) {
3890 ext4_error(sb, "Marking blocks in system zone - "
3891 "Block = %llu, len = %u",
3892 block, thisgrp_len);
3897 bitmap_bh = ext4_read_block_bitmap(sb, group);
3898 if (IS_ERR(bitmap_bh)) {
3899 err = PTR_ERR(bitmap_bh);
3905 gdp = ext4_get_group_desc(sb, group, &gdp_bh);
3909 ext4_lock_group(sb, group);
3911 for (i = 0; i < clen; i++)
3912 if (!mb_test_bit(blkoff + i, bitmap_bh->b_data) ==
3916 clen_changed = clen - already;
3918 mb_set_bits(bitmap_bh->b_data, blkoff, clen);
3920 mb_clear_bits(bitmap_bh->b_data, blkoff, clen);
3921 if (ext4_has_group_desc_csum(sb) &&
3922 (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT))) {
3923 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT);
3924 ext4_free_group_clusters_set(sb, gdp,
3925 ext4_free_clusters_after_init(sb, group, gdp));
3928 clen = ext4_free_group_clusters(sb, gdp) - clen_changed;
3930 clen = ext4_free_group_clusters(sb, gdp) + clen_changed;
3932 ext4_free_group_clusters_set(sb, gdp, clen);
3933 ext4_block_bitmap_csum_set(sb, group, gdp, bitmap_bh);
3934 ext4_group_desc_csum_set(sb, group, gdp);
3936 ext4_unlock_group(sb, group);
3938 if (sbi->s_log_groups_per_flex) {
3939 ext4_group_t flex_group = ext4_flex_group(sbi, group);
3940 struct flex_groups *fg = sbi_array_rcu_deref(sbi,
3941 s_flex_groups, flex_group);
3944 atomic64_sub(clen_changed, &fg->free_clusters);
3946 atomic64_add(clen_changed, &fg->free_clusters);
3950 err = ext4_handle_dirty_metadata(NULL, NULL, bitmap_bh);
3953 sync_dirty_buffer(bitmap_bh);
3954 err = ext4_handle_dirty_metadata(NULL, NULL, gdp_bh);
3955 sync_dirty_buffer(gdp_bh);
3959 block += thisgrp_len;
3970 * here we normalize request for locality group
3971 * Group request are normalized to s_mb_group_prealloc, which goes to
3972 * s_strip if we set the same via mount option.
3973 * s_mb_group_prealloc can be configured via
3974 * /sys/fs/ext4/<partition>/mb_group_prealloc
3976 * XXX: should we try to preallocate more than the group has now?
3978 static void ext4_mb_normalize_group_request(struct ext4_allocation_context *ac)
3980 struct super_block *sb = ac->ac_sb;
3981 struct ext4_locality_group *lg = ac->ac_lg;
3984 ac->ac_g_ex.fe_len = EXT4_SB(sb)->s_mb_group_prealloc;
3985 mb_debug(sb, "goal %u blocks for locality group\n", ac->ac_g_ex.fe_len);
3989 * Normalization means making request better in terms of
3990 * size and alignment
3992 static noinline_for_stack void
3993 ext4_mb_normalize_request(struct ext4_allocation_context *ac,
3994 struct ext4_allocation_request *ar)
3996 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
3999 loff_t size, start_off;
4000 loff_t orig_size __maybe_unused;
4002 struct ext4_inode_info *ei = EXT4_I(ac->ac_inode);
4003 struct ext4_prealloc_space *pa;
4005 /* do normalize only data requests, metadata requests
4006 do not need preallocation */
4007 if (!(ac->ac_flags & EXT4_MB_HINT_DATA))
4010 /* sometime caller may want exact blocks */
4011 if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY))
4014 /* caller may indicate that preallocation isn't
4015 * required (it's a tail, for example) */
4016 if (ac->ac_flags & EXT4_MB_HINT_NOPREALLOC)
4019 if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) {
4020 ext4_mb_normalize_group_request(ac);
4024 bsbits = ac->ac_sb->s_blocksize_bits;
4026 /* first, let's learn actual file size
4027 * given current request is allocated */
4028 size = ac->ac_o_ex.fe_logical + EXT4_C2B(sbi, ac->ac_o_ex.fe_len);
4029 size = size << bsbits;
4030 if (size < i_size_read(ac->ac_inode))
4031 size = i_size_read(ac->ac_inode);
4034 /* max size of free chunks */
4037 #define NRL_CHECK_SIZE(req, size, max, chunk_size) \
4038 (req <= (size) || max <= (chunk_size))
4040 /* first, try to predict filesize */
4041 /* XXX: should this table be tunable? */
4043 if (size <= 16 * 1024) {
4045 } else if (size <= 32 * 1024) {
4047 } else if (size <= 64 * 1024) {
4049 } else if (size <= 128 * 1024) {
4051 } else if (size <= 256 * 1024) {
4053 } else if (size <= 512 * 1024) {
4055 } else if (size <= 1024 * 1024) {
4057 } else if (NRL_CHECK_SIZE(size, 4 * 1024 * 1024, max, 2 * 1024)) {
4058 start_off = ((loff_t)ac->ac_o_ex.fe_logical >>
4059 (21 - bsbits)) << 21;
4060 size = 2 * 1024 * 1024;
4061 } else if (NRL_CHECK_SIZE(size, 8 * 1024 * 1024, max, 4 * 1024)) {
4062 start_off = ((loff_t)ac->ac_o_ex.fe_logical >>
4063 (22 - bsbits)) << 22;
4064 size = 4 * 1024 * 1024;
4065 } else if (NRL_CHECK_SIZE(ac->ac_o_ex.fe_len,
4066 (8<<20)>>bsbits, max, 8 * 1024)) {
4067 start_off = ((loff_t)ac->ac_o_ex.fe_logical >>
4068 (23 - bsbits)) << 23;
4069 size = 8 * 1024 * 1024;
4071 start_off = (loff_t) ac->ac_o_ex.fe_logical << bsbits;
4072 size = (loff_t) EXT4_C2B(EXT4_SB(ac->ac_sb),
4073 ac->ac_o_ex.fe_len) << bsbits;
4075 size = size >> bsbits;
4076 start = start_off >> bsbits;
4079 * For tiny groups (smaller than 8MB) the chosen allocation
4080 * alignment may be larger than group size. Make sure the
4081 * alignment does not move allocation to a different group which
4082 * makes mballoc fail assertions later.
4084 start = max(start, rounddown(ac->ac_o_ex.fe_logical,
4085 (ext4_lblk_t)EXT4_BLOCKS_PER_GROUP(ac->ac_sb)));
4087 /* don't cover already allocated blocks in selected range */
4088 if (ar->pleft && start <= ar->lleft) {
4089 size -= ar->lleft + 1 - start;
4090 start = ar->lleft + 1;
4092 if (ar->pright && start + size - 1 >= ar->lright)
4093 size -= start + size - ar->lright;
4096 * Trim allocation request for filesystems with artificially small
4099 if (size > EXT4_BLOCKS_PER_GROUP(ac->ac_sb))
4100 size = EXT4_BLOCKS_PER_GROUP(ac->ac_sb);
4104 /* check we don't cross already preallocated blocks */
4106 list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) {
4111 spin_lock(&pa->pa_lock);
4112 if (pa->pa_deleted) {
4113 spin_unlock(&pa->pa_lock);
4117 pa_end = pa->pa_lstart + EXT4_C2B(EXT4_SB(ac->ac_sb),
4120 /* PA must not overlap original request */
4121 BUG_ON(!(ac->ac_o_ex.fe_logical >= pa_end ||
4122 ac->ac_o_ex.fe_logical < pa->pa_lstart));
4124 /* skip PAs this normalized request doesn't overlap with */
4125 if (pa->pa_lstart >= end || pa_end <= start) {
4126 spin_unlock(&pa->pa_lock);
4129 BUG_ON(pa->pa_lstart <= start && pa_end >= end);
4131 /* adjust start or end to be adjacent to this pa */
4132 if (pa_end <= ac->ac_o_ex.fe_logical) {
4133 BUG_ON(pa_end < start);
4135 } else if (pa->pa_lstart > ac->ac_o_ex.fe_logical) {
4136 BUG_ON(pa->pa_lstart > end);
4137 end = pa->pa_lstart;
4139 spin_unlock(&pa->pa_lock);
4144 /* XXX: extra loop to check we really don't overlap preallocations */
4146 list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) {
4149 spin_lock(&pa->pa_lock);
4150 if (pa->pa_deleted == 0) {
4151 pa_end = pa->pa_lstart + EXT4_C2B(EXT4_SB(ac->ac_sb),
4153 BUG_ON(!(start >= pa_end || end <= pa->pa_lstart));
4155 spin_unlock(&pa->pa_lock);
4160 * In this function "start" and "size" are normalized for better
4161 * alignment and length such that we could preallocate more blocks.
4162 * This normalization is done such that original request of
4163 * ac->ac_o_ex.fe_logical & fe_len should always lie within "start" and
4164 * "size" boundaries.
4165 * (Note fe_len can be relaxed since FS block allocation API does not
4166 * provide gurantee on number of contiguous blocks allocation since that
4167 * depends upon free space left, etc).
4168 * In case of inode pa, later we use the allocated blocks
4169 * [pa_start + fe_logical - pa_lstart, fe_len/size] from the preallocated
4170 * range of goal/best blocks [start, size] to put it at the
4171 * ac_o_ex.fe_logical extent of this inode.
4172 * (See ext4_mb_use_inode_pa() for more details)
4174 if (start + size <= ac->ac_o_ex.fe_logical ||
4175 start > ac->ac_o_ex.fe_logical) {
4176 ext4_msg(ac->ac_sb, KERN_ERR,
4177 "start %lu, size %lu, fe_logical %lu",
4178 (unsigned long) start, (unsigned long) size,
4179 (unsigned long) ac->ac_o_ex.fe_logical);
4182 BUG_ON(size <= 0 || size > EXT4_BLOCKS_PER_GROUP(ac->ac_sb));
4184 /* now prepare goal request */
4186 /* XXX: is it better to align blocks WRT to logical
4187 * placement or satisfy big request as is */
4188 ac->ac_g_ex.fe_logical = start;
4189 ac->ac_g_ex.fe_len = EXT4_NUM_B2C(sbi, size);
4191 /* define goal start in order to merge */
4192 if (ar->pright && (ar->lright == (start + size))) {
4193 /* merge to the right */
4194 ext4_get_group_no_and_offset(ac->ac_sb, ar->pright - size,
4195 &ac->ac_f_ex.fe_group,
4196 &ac->ac_f_ex.fe_start);
4197 ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL;
4199 if (ar->pleft && (ar->lleft + 1 == start)) {
4200 /* merge to the left */
4201 ext4_get_group_no_and_offset(ac->ac_sb, ar->pleft + 1,
4202 &ac->ac_f_ex.fe_group,
4203 &ac->ac_f_ex.fe_start);
4204 ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL;
4207 mb_debug(ac->ac_sb, "goal: %lld(was %lld) blocks at %u\n", size,
4211 static void ext4_mb_collect_stats(struct ext4_allocation_context *ac)
4213 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
4215 if (sbi->s_mb_stats && ac->ac_g_ex.fe_len >= 1) {
4216 atomic_inc(&sbi->s_bal_reqs);
4217 atomic_add(ac->ac_b_ex.fe_len, &sbi->s_bal_allocated);
4218 if (ac->ac_b_ex.fe_len >= ac->ac_o_ex.fe_len)
4219 atomic_inc(&sbi->s_bal_success);
4220 atomic_add(ac->ac_found, &sbi->s_bal_ex_scanned);
4221 atomic_add(ac->ac_groups_scanned, &sbi->s_bal_groups_scanned);
4222 if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start &&
4223 ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group)
4224 atomic_inc(&sbi->s_bal_goals);
4225 if (ac->ac_found > sbi->s_mb_max_to_scan)
4226 atomic_inc(&sbi->s_bal_breaks);
4229 if (ac->ac_op == EXT4_MB_HISTORY_ALLOC)
4230 trace_ext4_mballoc_alloc(ac);
4232 trace_ext4_mballoc_prealloc(ac);
4236 * Called on failure; free up any blocks from the inode PA for this
4237 * context. We don't need this for MB_GROUP_PA because we only change
4238 * pa_free in ext4_mb_release_context(), but on failure, we've already
4239 * zeroed out ac->ac_b_ex.fe_len, so group_pa->pa_free is not changed.
4241 static void ext4_discard_allocated_blocks(struct ext4_allocation_context *ac)
4243 struct ext4_prealloc_space *pa = ac->ac_pa;
4244 struct ext4_buddy e4b;
4248 if (ac->ac_f_ex.fe_len == 0)
4250 err = ext4_mb_load_buddy(ac->ac_sb, ac->ac_f_ex.fe_group, &e4b);
4253 * This should never happen since we pin the
4254 * pages in the ext4_allocation_context so
4255 * ext4_mb_load_buddy() should never fail.
4257 WARN(1, "mb_load_buddy failed (%d)", err);
4260 ext4_lock_group(ac->ac_sb, ac->ac_f_ex.fe_group);
4261 mb_free_blocks(ac->ac_inode, &e4b, ac->ac_f_ex.fe_start,
4262 ac->ac_f_ex.fe_len);
4263 ext4_unlock_group(ac->ac_sb, ac->ac_f_ex.fe_group);
4264 ext4_mb_unload_buddy(&e4b);
4267 if (pa->pa_type == MB_INODE_PA)
4268 pa->pa_free += ac->ac_b_ex.fe_len;
4272 * use blocks preallocated to inode
4274 static void ext4_mb_use_inode_pa(struct ext4_allocation_context *ac,
4275 struct ext4_prealloc_space *pa)
4277 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
4282 /* found preallocated blocks, use them */
4283 start = pa->pa_pstart + (ac->ac_o_ex.fe_logical - pa->pa_lstart);
4284 end = min(pa->pa_pstart + EXT4_C2B(sbi, pa->pa_len),
4285 start + EXT4_C2B(sbi, ac->ac_o_ex.fe_len));
4286 len = EXT4_NUM_B2C(sbi, end - start);
4287 ext4_get_group_no_and_offset(ac->ac_sb, start, &ac->ac_b_ex.fe_group,
4288 &ac->ac_b_ex.fe_start);
4289 ac->ac_b_ex.fe_len = len;
4290 ac->ac_status = AC_STATUS_FOUND;
4293 BUG_ON(start < pa->pa_pstart);
4294 BUG_ON(end > pa->pa_pstart + EXT4_C2B(sbi, pa->pa_len));
4295 BUG_ON(pa->pa_free < len);
4298 mb_debug(ac->ac_sb, "use %llu/%d from inode pa %p\n", start, len, pa);
4302 * use blocks preallocated to locality group
4304 static void ext4_mb_use_group_pa(struct ext4_allocation_context *ac,
4305 struct ext4_prealloc_space *pa)
4307 unsigned int len = ac->ac_o_ex.fe_len;
4309 ext4_get_group_no_and_offset(ac->ac_sb, pa->pa_pstart,
4310 &ac->ac_b_ex.fe_group,
4311 &ac->ac_b_ex.fe_start);
4312 ac->ac_b_ex.fe_len = len;
4313 ac->ac_status = AC_STATUS_FOUND;
4316 /* we don't correct pa_pstart or pa_plen here to avoid
4317 * possible race when the group is being loaded concurrently
4318 * instead we correct pa later, after blocks are marked
4319 * in on-disk bitmap -- see ext4_mb_release_context()
4320 * Other CPUs are prevented from allocating from this pa by lg_mutex
4322 mb_debug(ac->ac_sb, "use %u/%u from group pa %p\n",
4323 pa->pa_lstart-len, len, pa);
4327 * Return the prealloc space that have minimal distance
4328 * from the goal block. @cpa is the prealloc
4329 * space that is having currently known minimal distance
4330 * from the goal block.
4332 static struct ext4_prealloc_space *
4333 ext4_mb_check_group_pa(ext4_fsblk_t goal_block,
4334 struct ext4_prealloc_space *pa,
4335 struct ext4_prealloc_space *cpa)
4337 ext4_fsblk_t cur_distance, new_distance;
4340 atomic_inc(&pa->pa_count);
4343 cur_distance = abs(goal_block - cpa->pa_pstart);
4344 new_distance = abs(goal_block - pa->pa_pstart);
4346 if (cur_distance <= new_distance)
4349 /* drop the previous reference */
4350 atomic_dec(&cpa->pa_count);
4351 atomic_inc(&pa->pa_count);
4356 * search goal blocks in preallocated space
4358 static noinline_for_stack bool
4359 ext4_mb_use_preallocated(struct ext4_allocation_context *ac)
4361 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
4363 struct ext4_inode_info *ei = EXT4_I(ac->ac_inode);
4364 struct ext4_locality_group *lg;
4365 struct ext4_prealloc_space *pa, *cpa = NULL;
4366 ext4_fsblk_t goal_block;
4368 /* only data can be preallocated */
4369 if (!(ac->ac_flags & EXT4_MB_HINT_DATA))
4372 /* first, try per-file preallocation */
4374 list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) {
4376 /* all fields in this condition don't change,
4377 * so we can skip locking for them */
4378 if (ac->ac_o_ex.fe_logical < pa->pa_lstart ||
4379 ac->ac_o_ex.fe_logical >= (pa->pa_lstart +
4380 EXT4_C2B(sbi, pa->pa_len)))
4383 /* non-extent files can't have physical blocks past 2^32 */
4384 if (!(ext4_test_inode_flag(ac->ac_inode, EXT4_INODE_EXTENTS)) &&
4385 (pa->pa_pstart + EXT4_C2B(sbi, pa->pa_len) >
4386 EXT4_MAX_BLOCK_FILE_PHYS))
4389 /* found preallocated blocks, use them */
4390 spin_lock(&pa->pa_lock);
4391 if (pa->pa_deleted == 0 && pa->pa_free) {
4392 atomic_inc(&pa->pa_count);
4393 ext4_mb_use_inode_pa(ac, pa);
4394 spin_unlock(&pa->pa_lock);
4395 ac->ac_criteria = 10;
4399 spin_unlock(&pa->pa_lock);
4403 /* can we use group allocation? */
4404 if (!(ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC))
4407 /* inode may have no locality group for some reason */
4411 order = fls(ac->ac_o_ex.fe_len) - 1;
4412 if (order > PREALLOC_TB_SIZE - 1)
4413 /* The max size of hash table is PREALLOC_TB_SIZE */
4414 order = PREALLOC_TB_SIZE - 1;
4416 goal_block = ext4_grp_offs_to_block(ac->ac_sb, &ac->ac_g_ex);
4418 * search for the prealloc space that is having
4419 * minimal distance from the goal block.
4421 for (i = order; i < PREALLOC_TB_SIZE; i++) {
4423 list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[i],
4425 spin_lock(&pa->pa_lock);
4426 if (pa->pa_deleted == 0 &&
4427 pa->pa_free >= ac->ac_o_ex.fe_len) {
4429 cpa = ext4_mb_check_group_pa(goal_block,
4432 spin_unlock(&pa->pa_lock);
4437 ext4_mb_use_group_pa(ac, cpa);
4438 ac->ac_criteria = 20;
4445 * the function goes through all block freed in the group
4446 * but not yet committed and marks them used in in-core bitmap.
4447 * buddy must be generated from this bitmap
4448 * Need to be called with the ext4 group lock held
4450 static void ext4_mb_generate_from_freelist(struct super_block *sb, void *bitmap,
4454 struct ext4_group_info *grp;
4455 struct ext4_free_data *entry;
4457 grp = ext4_get_group_info(sb, group);
4458 n = rb_first(&(grp->bb_free_root));
4461 entry = rb_entry(n, struct ext4_free_data, efd_node);
4462 mb_set_bits(bitmap, entry->efd_start_cluster, entry->efd_count);
4469 * the function goes through all preallocation in this group and marks them
4470 * used in in-core bitmap. buddy must be generated from this bitmap
4471 * Need to be called with ext4 group lock held
4473 static noinline_for_stack
4474 void ext4_mb_generate_from_pa(struct super_block *sb, void *bitmap,
4477 struct ext4_group_info *grp = ext4_get_group_info(sb, group);
4478 struct ext4_prealloc_space *pa;
4479 struct list_head *cur;
4480 ext4_group_t groupnr;
4481 ext4_grpblk_t start;
4482 int preallocated = 0;
4485 /* all form of preallocation discards first load group,
4486 * so the only competing code is preallocation use.
4487 * we don't need any locking here
4488 * notice we do NOT ignore preallocations with pa_deleted
4489 * otherwise we could leave used blocks available for
4490 * allocation in buddy when concurrent ext4_mb_put_pa()
4491 * is dropping preallocation
4493 list_for_each(cur, &grp->bb_prealloc_list) {
4494 pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list);
4495 spin_lock(&pa->pa_lock);
4496 ext4_get_group_no_and_offset(sb, pa->pa_pstart,
4499 spin_unlock(&pa->pa_lock);
4500 if (unlikely(len == 0))
4502 BUG_ON(groupnr != group);
4503 mb_set_bits(bitmap, start, len);
4504 preallocated += len;
4506 mb_debug(sb, "preallocated %d for group %u\n", preallocated, group);
4509 static void ext4_mb_mark_pa_deleted(struct super_block *sb,
4510 struct ext4_prealloc_space *pa)
4512 struct ext4_inode_info *ei;
4514 if (pa->pa_deleted) {
4515 ext4_warning(sb, "deleted pa, type:%d, pblk:%llu, lblk:%u, len:%d\n",
4516 pa->pa_type, pa->pa_pstart, pa->pa_lstart,
4523 if (pa->pa_type == MB_INODE_PA) {
4524 ei = EXT4_I(pa->pa_inode);
4525 atomic_dec(&ei->i_prealloc_active);
4529 static void ext4_mb_pa_callback(struct rcu_head *head)
4531 struct ext4_prealloc_space *pa;
4532 pa = container_of(head, struct ext4_prealloc_space, u.pa_rcu);
4534 BUG_ON(atomic_read(&pa->pa_count));
4535 BUG_ON(pa->pa_deleted == 0);
4536 kmem_cache_free(ext4_pspace_cachep, pa);
4540 * drops a reference to preallocated space descriptor
4541 * if this was the last reference and the space is consumed
4543 static void ext4_mb_put_pa(struct ext4_allocation_context *ac,
4544 struct super_block *sb, struct ext4_prealloc_space *pa)
4547 ext4_fsblk_t grp_blk;
4549 /* in this short window concurrent discard can set pa_deleted */
4550 spin_lock(&pa->pa_lock);
4551 if (!atomic_dec_and_test(&pa->pa_count) || pa->pa_free != 0) {
4552 spin_unlock(&pa->pa_lock);
4556 if (pa->pa_deleted == 1) {
4557 spin_unlock(&pa->pa_lock);
4561 ext4_mb_mark_pa_deleted(sb, pa);
4562 spin_unlock(&pa->pa_lock);
4564 grp_blk = pa->pa_pstart;
4566 * If doing group-based preallocation, pa_pstart may be in the
4567 * next group when pa is used up
4569 if (pa->pa_type == MB_GROUP_PA)
4572 grp = ext4_get_group_number(sb, grp_blk);
4577 * P1 (buddy init) P2 (regular allocation)
4578 * find block B in PA
4579 * copy on-disk bitmap to buddy
4580 * mark B in on-disk bitmap
4581 * drop PA from group
4582 * mark all PAs in buddy
4584 * thus, P1 initializes buddy with B available. to prevent this
4585 * we make "copy" and "mark all PAs" atomic and serialize "drop PA"
4588 ext4_lock_group(sb, grp);
4589 list_del(&pa->pa_group_list);
4590 ext4_unlock_group(sb, grp);
4592 spin_lock(pa->pa_obj_lock);
4593 list_del_rcu(&pa->pa_inode_list);
4594 spin_unlock(pa->pa_obj_lock);
4596 call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback);
4600 * creates new preallocated space for given inode
4602 static noinline_for_stack void
4603 ext4_mb_new_inode_pa(struct ext4_allocation_context *ac)
4605 struct super_block *sb = ac->ac_sb;
4606 struct ext4_sb_info *sbi = EXT4_SB(sb);
4607 struct ext4_prealloc_space *pa;
4608 struct ext4_group_info *grp;
4609 struct ext4_inode_info *ei;
4611 /* preallocate only when found space is larger then requested */
4612 BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len);
4613 BUG_ON(ac->ac_status != AC_STATUS_FOUND);
4614 BUG_ON(!S_ISREG(ac->ac_inode->i_mode));
4615 BUG_ON(ac->ac_pa == NULL);
4619 if (ac->ac_b_ex.fe_len < ac->ac_g_ex.fe_len) {
4625 /* we can't allocate as much as normalizer wants.
4626 * so, found space must get proper lstart
4627 * to cover original request */
4628 BUG_ON(ac->ac_g_ex.fe_logical > ac->ac_o_ex.fe_logical);
4629 BUG_ON(ac->ac_g_ex.fe_len < ac->ac_o_ex.fe_len);
4631 /* we're limited by original request in that
4632 * logical block must be covered any way
4633 * winl is window we can move our chunk within */
4634 winl = ac->ac_o_ex.fe_logical - ac->ac_g_ex.fe_logical;
4636 /* also, we should cover whole original request */
4637 wins = EXT4_C2B(sbi, ac->ac_b_ex.fe_len - ac->ac_o_ex.fe_len);
4639 /* the smallest one defines real window */
4640 win = min(winl, wins);
4642 offs = ac->ac_o_ex.fe_logical %
4643 EXT4_C2B(sbi, ac->ac_b_ex.fe_len);
4644 if (offs && offs < win)
4647 ac->ac_b_ex.fe_logical = ac->ac_o_ex.fe_logical -
4648 EXT4_NUM_B2C(sbi, win);
4649 BUG_ON(ac->ac_o_ex.fe_logical < ac->ac_b_ex.fe_logical);
4650 BUG_ON(ac->ac_o_ex.fe_len > ac->ac_b_ex.fe_len);
4653 /* preallocation can change ac_b_ex, thus we store actually
4654 * allocated blocks for history */
4655 ac->ac_f_ex = ac->ac_b_ex;
4657 pa->pa_lstart = ac->ac_b_ex.fe_logical;
4658 pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex);
4659 pa->pa_len = ac->ac_b_ex.fe_len;
4660 pa->pa_free = pa->pa_len;
4661 spin_lock_init(&pa->pa_lock);
4662 INIT_LIST_HEAD(&pa->pa_inode_list);
4663 INIT_LIST_HEAD(&pa->pa_group_list);
4665 pa->pa_type = MB_INODE_PA;
4667 mb_debug(sb, "new inode pa %p: %llu/%d for %u\n", pa, pa->pa_pstart,
4668 pa->pa_len, pa->pa_lstart);
4669 trace_ext4_mb_new_inode_pa(ac, pa);
4671 ext4_mb_use_inode_pa(ac, pa);
4672 atomic_add(pa->pa_free, &sbi->s_mb_preallocated);
4674 ei = EXT4_I(ac->ac_inode);
4675 grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group);
4677 pa->pa_obj_lock = &ei->i_prealloc_lock;
4678 pa->pa_inode = ac->ac_inode;
4680 list_add(&pa->pa_group_list, &grp->bb_prealloc_list);
4682 spin_lock(pa->pa_obj_lock);
4683 list_add_rcu(&pa->pa_inode_list, &ei->i_prealloc_list);
4684 spin_unlock(pa->pa_obj_lock);
4685 atomic_inc(&ei->i_prealloc_active);
4689 * creates new preallocated space for locality group inodes belongs to
4691 static noinline_for_stack void
4692 ext4_mb_new_group_pa(struct ext4_allocation_context *ac)
4694 struct super_block *sb = ac->ac_sb;
4695 struct ext4_locality_group *lg;
4696 struct ext4_prealloc_space *pa;
4697 struct ext4_group_info *grp;
4699 /* preallocate only when found space is larger then requested */
4700 BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len);
4701 BUG_ON(ac->ac_status != AC_STATUS_FOUND);
4702 BUG_ON(!S_ISREG(ac->ac_inode->i_mode));
4703 BUG_ON(ac->ac_pa == NULL);
4707 /* preallocation can change ac_b_ex, thus we store actually
4708 * allocated blocks for history */
4709 ac->ac_f_ex = ac->ac_b_ex;
4711 pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex);
4712 pa->pa_lstart = pa->pa_pstart;
4713 pa->pa_len = ac->ac_b_ex.fe_len;
4714 pa->pa_free = pa->pa_len;
4715 spin_lock_init(&pa->pa_lock);
4716 INIT_LIST_HEAD(&pa->pa_inode_list);
4717 INIT_LIST_HEAD(&pa->pa_group_list);
4719 pa->pa_type = MB_GROUP_PA;
4721 mb_debug(sb, "new group pa %p: %llu/%d for %u\n", pa, pa->pa_pstart,
4722 pa->pa_len, pa->pa_lstart);
4723 trace_ext4_mb_new_group_pa(ac, pa);
4725 ext4_mb_use_group_pa(ac, pa);
4726 atomic_add(pa->pa_free, &EXT4_SB(sb)->s_mb_preallocated);
4728 grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group);
4732 pa->pa_obj_lock = &lg->lg_prealloc_lock;
4733 pa->pa_inode = NULL;
4735 list_add(&pa->pa_group_list, &grp->bb_prealloc_list);
4738 * We will later add the new pa to the right bucket
4739 * after updating the pa_free in ext4_mb_release_context
4743 static void ext4_mb_new_preallocation(struct ext4_allocation_context *ac)
4745 if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC)
4746 ext4_mb_new_group_pa(ac);
4748 ext4_mb_new_inode_pa(ac);
4752 * finds all unused blocks in on-disk bitmap, frees them in
4753 * in-core bitmap and buddy.
4754 * @pa must be unlinked from inode and group lists, so that
4755 * nobody else can find/use it.
4756 * the caller MUST hold group/inode locks.
4757 * TODO: optimize the case when there are no in-core structures yet
4759 static noinline_for_stack int
4760 ext4_mb_release_inode_pa(struct ext4_buddy *e4b, struct buffer_head *bitmap_bh,
4761 struct ext4_prealloc_space *pa)
4763 struct super_block *sb = e4b->bd_sb;
4764 struct ext4_sb_info *sbi = EXT4_SB(sb);
4769 unsigned long long grp_blk_start;
4772 BUG_ON(pa->pa_deleted == 0);
4773 ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit);
4774 grp_blk_start = pa->pa_pstart - EXT4_C2B(sbi, bit);
4775 BUG_ON(group != e4b->bd_group && pa->pa_len != 0);
4776 end = bit + pa->pa_len;
4779 bit = mb_find_next_zero_bit(bitmap_bh->b_data, end, bit);
4782 next = mb_find_next_bit(bitmap_bh->b_data, end, bit);
4783 mb_debug(sb, "free preallocated %u/%u in group %u\n",
4784 (unsigned) ext4_group_first_block_no(sb, group) + bit,
4785 (unsigned) next - bit, (unsigned) group);
4788 trace_ext4_mballoc_discard(sb, NULL, group, bit, next - bit);
4789 trace_ext4_mb_release_inode_pa(pa, (grp_blk_start +
4790 EXT4_C2B(sbi, bit)),
4792 mb_free_blocks(pa->pa_inode, e4b, bit, next - bit);
4795 if (free != pa->pa_free) {
4796 ext4_msg(e4b->bd_sb, KERN_CRIT,
4797 "pa %p: logic %lu, phys. %lu, len %d",
4798 pa, (unsigned long) pa->pa_lstart,
4799 (unsigned long) pa->pa_pstart,
4801 ext4_grp_locked_error(sb, group, 0, 0, "free %u, pa_free %u",
4804 * pa is already deleted so we use the value obtained
4805 * from the bitmap and continue.
4808 atomic_add(free, &sbi->s_mb_discarded);
4813 static noinline_for_stack int
4814 ext4_mb_release_group_pa(struct ext4_buddy *e4b,
4815 struct ext4_prealloc_space *pa)
4817 struct super_block *sb = e4b->bd_sb;
4821 trace_ext4_mb_release_group_pa(sb, pa);
4822 BUG_ON(pa->pa_deleted == 0);
4823 ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit);
4824 BUG_ON(group != e4b->bd_group && pa->pa_len != 0);
4825 mb_free_blocks(pa->pa_inode, e4b, bit, pa->pa_len);
4826 atomic_add(pa->pa_len, &EXT4_SB(sb)->s_mb_discarded);
4827 trace_ext4_mballoc_discard(sb, NULL, group, bit, pa->pa_len);
4833 * releases all preallocations in given group
4835 * first, we need to decide discard policy:
4836 * - when do we discard
4838 * - how many do we discard
4839 * 1) how many requested
4841 static noinline_for_stack int
4842 ext4_mb_discard_group_preallocations(struct super_block *sb,
4843 ext4_group_t group, int *busy)
4845 struct ext4_group_info *grp = ext4_get_group_info(sb, group);
4846 struct buffer_head *bitmap_bh = NULL;
4847 struct ext4_prealloc_space *pa, *tmp;
4848 struct list_head list;
4849 struct ext4_buddy e4b;
4853 mb_debug(sb, "discard preallocation for group %u\n", group);
4854 if (list_empty(&grp->bb_prealloc_list))
4857 bitmap_bh = ext4_read_block_bitmap(sb, group);
4858 if (IS_ERR(bitmap_bh)) {
4859 err = PTR_ERR(bitmap_bh);
4860 ext4_error_err(sb, -err,
4861 "Error %d reading block bitmap for %u",
4866 err = ext4_mb_load_buddy(sb, group, &e4b);
4868 ext4_warning(sb, "Error %d loading buddy information for %u",
4874 INIT_LIST_HEAD(&list);
4875 ext4_lock_group(sb, group);
4876 list_for_each_entry_safe(pa, tmp,
4877 &grp->bb_prealloc_list, pa_group_list) {
4878 spin_lock(&pa->pa_lock);
4879 if (atomic_read(&pa->pa_count)) {
4880 spin_unlock(&pa->pa_lock);
4884 if (pa->pa_deleted) {
4885 spin_unlock(&pa->pa_lock);
4889 /* seems this one can be freed ... */
4890 ext4_mb_mark_pa_deleted(sb, pa);
4893 this_cpu_inc(discard_pa_seq);
4895 /* we can trust pa_free ... */
4896 free += pa->pa_free;
4898 spin_unlock(&pa->pa_lock);
4900 list_del(&pa->pa_group_list);
4901 list_add(&pa->u.pa_tmp_list, &list);
4904 /* now free all selected PAs */
4905 list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) {
4907 /* remove from object (inode or locality group) */
4908 spin_lock(pa->pa_obj_lock);
4909 list_del_rcu(&pa->pa_inode_list);
4910 spin_unlock(pa->pa_obj_lock);
4912 if (pa->pa_type == MB_GROUP_PA)
4913 ext4_mb_release_group_pa(&e4b, pa);
4915 ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa);
4917 list_del(&pa->u.pa_tmp_list);
4918 call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback);
4921 ext4_unlock_group(sb, group);
4922 ext4_mb_unload_buddy(&e4b);
4925 mb_debug(sb, "discarded (%d) blocks preallocated for group %u bb_free (%d)\n",
4926 free, group, grp->bb_free);
4931 * releases all non-used preallocated blocks for given inode
4933 * It's important to discard preallocations under i_data_sem
4934 * We don't want another block to be served from the prealloc
4935 * space when we are discarding the inode prealloc space.
4937 * FIXME!! Make sure it is valid at all the call sites
4939 void ext4_discard_preallocations(struct inode *inode, unsigned int needed)
4941 struct ext4_inode_info *ei = EXT4_I(inode);
4942 struct super_block *sb = inode->i_sb;
4943 struct buffer_head *bitmap_bh = NULL;
4944 struct ext4_prealloc_space *pa, *tmp;
4945 ext4_group_t group = 0;
4946 struct list_head list;
4947 struct ext4_buddy e4b;
4950 if (!S_ISREG(inode->i_mode)) {
4951 /*BUG_ON(!list_empty(&ei->i_prealloc_list));*/
4955 if (EXT4_SB(sb)->s_mount_state & EXT4_FC_REPLAY)
4958 mb_debug(sb, "discard preallocation for inode %lu\n",
4960 trace_ext4_discard_preallocations(inode,
4961 atomic_read(&ei->i_prealloc_active), needed);
4963 INIT_LIST_HEAD(&list);
4969 /* first, collect all pa's in the inode */
4970 spin_lock(&ei->i_prealloc_lock);
4971 while (!list_empty(&ei->i_prealloc_list) && needed) {
4972 pa = list_entry(ei->i_prealloc_list.prev,
4973 struct ext4_prealloc_space, pa_inode_list);
4974 BUG_ON(pa->pa_obj_lock != &ei->i_prealloc_lock);
4975 spin_lock(&pa->pa_lock);
4976 if (atomic_read(&pa->pa_count)) {
4977 /* this shouldn't happen often - nobody should
4978 * use preallocation while we're discarding it */
4979 spin_unlock(&pa->pa_lock);
4980 spin_unlock(&ei->i_prealloc_lock);
4981 ext4_msg(sb, KERN_ERR,
4982 "uh-oh! used pa while discarding");
4984 schedule_timeout_uninterruptible(HZ);
4988 if (pa->pa_deleted == 0) {
4989 ext4_mb_mark_pa_deleted(sb, pa);
4990 spin_unlock(&pa->pa_lock);
4991 list_del_rcu(&pa->pa_inode_list);
4992 list_add(&pa->u.pa_tmp_list, &list);
4997 /* someone is deleting pa right now */
4998 spin_unlock(&pa->pa_lock);
4999 spin_unlock(&ei->i_prealloc_lock);
5001 /* we have to wait here because pa_deleted
5002 * doesn't mean pa is already unlinked from
5003 * the list. as we might be called from
5004 * ->clear_inode() the inode will get freed
5005 * and concurrent thread which is unlinking
5006 * pa from inode's list may access already
5007 * freed memory, bad-bad-bad */
5009 /* XXX: if this happens too often, we can
5010 * add a flag to force wait only in case
5011 * of ->clear_inode(), but not in case of
5012 * regular truncate */
5013 schedule_timeout_uninterruptible(HZ);
5016 spin_unlock(&ei->i_prealloc_lock);
5018 list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) {
5019 BUG_ON(pa->pa_type != MB_INODE_PA);
5020 group = ext4_get_group_number(sb, pa->pa_pstart);
5022 err = ext4_mb_load_buddy_gfp(sb, group, &e4b,
5023 GFP_NOFS|__GFP_NOFAIL);
5025 ext4_error_err(sb, -err, "Error %d loading buddy information for %u",
5030 bitmap_bh = ext4_read_block_bitmap(sb, group);
5031 if (IS_ERR(bitmap_bh)) {
5032 err = PTR_ERR(bitmap_bh);
5033 ext4_error_err(sb, -err, "Error %d reading block bitmap for %u",
5035 ext4_mb_unload_buddy(&e4b);
5039 ext4_lock_group(sb, group);
5040 list_del(&pa->pa_group_list);
5041 ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa);
5042 ext4_unlock_group(sb, group);
5044 ext4_mb_unload_buddy(&e4b);
5047 list_del(&pa->u.pa_tmp_list);
5048 call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback);
5052 static int ext4_mb_pa_alloc(struct ext4_allocation_context *ac)
5054 struct ext4_prealloc_space *pa;
5056 BUG_ON(ext4_pspace_cachep == NULL);
5057 pa = kmem_cache_zalloc(ext4_pspace_cachep, GFP_NOFS);
5060 atomic_set(&pa->pa_count, 1);
5065 static void ext4_mb_pa_free(struct ext4_allocation_context *ac)
5067 struct ext4_prealloc_space *pa = ac->ac_pa;
5071 WARN_ON(!atomic_dec_and_test(&pa->pa_count));
5072 kmem_cache_free(ext4_pspace_cachep, pa);
5075 #ifdef CONFIG_EXT4_DEBUG
5076 static inline void ext4_mb_show_pa(struct super_block *sb)
5078 ext4_group_t i, ngroups;
5080 if (ext4_test_mount_flag(sb, EXT4_MF_FS_ABORTED))
5083 ngroups = ext4_get_groups_count(sb);
5084 mb_debug(sb, "groups: ");
5085 for (i = 0; i < ngroups; i++) {
5086 struct ext4_group_info *grp = ext4_get_group_info(sb, i);
5087 struct ext4_prealloc_space *pa;
5088 ext4_grpblk_t start;
5089 struct list_head *cur;
5090 ext4_lock_group(sb, i);
5091 list_for_each(cur, &grp->bb_prealloc_list) {
5092 pa = list_entry(cur, struct ext4_prealloc_space,
5094 spin_lock(&pa->pa_lock);
5095 ext4_get_group_no_and_offset(sb, pa->pa_pstart,
5097 spin_unlock(&pa->pa_lock);
5098 mb_debug(sb, "PA:%u:%d:%d\n", i, start,
5101 ext4_unlock_group(sb, i);
5102 mb_debug(sb, "%u: %d/%d\n", i, grp->bb_free,
5107 static void ext4_mb_show_ac(struct ext4_allocation_context *ac)
5109 struct super_block *sb = ac->ac_sb;
5111 if (ext4_test_mount_flag(sb, EXT4_MF_FS_ABORTED))
5114 mb_debug(sb, "Can't allocate:"
5115 " Allocation context details:");
5116 mb_debug(sb, "status %u flags 0x%x",
5117 ac->ac_status, ac->ac_flags);
5118 mb_debug(sb, "orig %lu/%lu/%lu@%lu, "
5119 "goal %lu/%lu/%lu@%lu, "
5120 "best %lu/%lu/%lu@%lu cr %d",
5121 (unsigned long)ac->ac_o_ex.fe_group,
5122 (unsigned long)ac->ac_o_ex.fe_start,
5123 (unsigned long)ac->ac_o_ex.fe_len,
5124 (unsigned long)ac->ac_o_ex.fe_logical,
5125 (unsigned long)ac->ac_g_ex.fe_group,
5126 (unsigned long)ac->ac_g_ex.fe_start,
5127 (unsigned long)ac->ac_g_ex.fe_len,
5128 (unsigned long)ac->ac_g_ex.fe_logical,
5129 (unsigned long)ac->ac_b_ex.fe_group,
5130 (unsigned long)ac->ac_b_ex.fe_start,
5131 (unsigned long)ac->ac_b_ex.fe_len,
5132 (unsigned long)ac->ac_b_ex.fe_logical,
5133 (int)ac->ac_criteria);
5134 mb_debug(sb, "%u found", ac->ac_found);
5135 ext4_mb_show_pa(sb);
5138 static inline void ext4_mb_show_pa(struct super_block *sb)
5142 static inline void ext4_mb_show_ac(struct ext4_allocation_context *ac)
5144 ext4_mb_show_pa(ac->ac_sb);
5150 * We use locality group preallocation for small size file. The size of the
5151 * file is determined by the current size or the resulting size after
5152 * allocation which ever is larger
5154 * One can tune this size via /sys/fs/ext4/<partition>/mb_stream_req
5156 static void ext4_mb_group_or_file(struct ext4_allocation_context *ac)
5158 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
5159 int bsbits = ac->ac_sb->s_blocksize_bits;
5161 bool inode_pa_eligible, group_pa_eligible;
5163 if (!(ac->ac_flags & EXT4_MB_HINT_DATA))
5166 if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY))
5169 group_pa_eligible = sbi->s_mb_group_prealloc > 0;
5170 inode_pa_eligible = true;
5171 size = ac->ac_o_ex.fe_logical + EXT4_C2B(sbi, ac->ac_o_ex.fe_len);
5172 isize = (i_size_read(ac->ac_inode) + ac->ac_sb->s_blocksize - 1)
5175 /* No point in using inode preallocation for closed files */
5176 if ((size == isize) && !ext4_fs_is_busy(sbi) &&
5177 !inode_is_open_for_write(ac->ac_inode))
5178 inode_pa_eligible = false;
5180 size = max(size, isize);
5181 /* Don't use group allocation for large files */
5182 if (size > sbi->s_mb_stream_request)
5183 group_pa_eligible = false;
5185 if (!group_pa_eligible) {
5186 if (inode_pa_eligible)
5187 ac->ac_flags |= EXT4_MB_STREAM_ALLOC;
5189 ac->ac_flags |= EXT4_MB_HINT_NOPREALLOC;
5193 BUG_ON(ac->ac_lg != NULL);
5195 * locality group prealloc space are per cpu. The reason for having
5196 * per cpu locality group is to reduce the contention between block
5197 * request from multiple CPUs.
5199 ac->ac_lg = raw_cpu_ptr(sbi->s_locality_groups);
5201 /* we're going to use group allocation */
5202 ac->ac_flags |= EXT4_MB_HINT_GROUP_ALLOC;
5204 /* serialize all allocations in the group */
5205 mutex_lock(&ac->ac_lg->lg_mutex);
5208 static noinline_for_stack int
5209 ext4_mb_initialize_context(struct ext4_allocation_context *ac,
5210 struct ext4_allocation_request *ar)
5212 struct super_block *sb = ar->inode->i_sb;
5213 struct ext4_sb_info *sbi = EXT4_SB(sb);
5214 struct ext4_super_block *es = sbi->s_es;
5218 ext4_grpblk_t block;
5220 /* we can't allocate > group size */
5223 /* just a dirty hack to filter too big requests */
5224 if (len >= EXT4_CLUSTERS_PER_GROUP(sb))
5225 len = EXT4_CLUSTERS_PER_GROUP(sb);
5227 /* start searching from the goal */
5229 if (goal < le32_to_cpu(es->s_first_data_block) ||
5230 goal >= ext4_blocks_count(es))
5231 goal = le32_to_cpu(es->s_first_data_block);
5232 ext4_get_group_no_and_offset(sb, goal, &group, &block);
5234 /* set up allocation goals */
5235 ac->ac_b_ex.fe_logical = EXT4_LBLK_CMASK(sbi, ar->logical);
5236 ac->ac_status = AC_STATUS_CONTINUE;
5238 ac->ac_inode = ar->inode;
5239 ac->ac_o_ex.fe_logical = ac->ac_b_ex.fe_logical;
5240 ac->ac_o_ex.fe_group = group;
5241 ac->ac_o_ex.fe_start = block;
5242 ac->ac_o_ex.fe_len = len;
5243 ac->ac_g_ex = ac->ac_o_ex;
5244 ac->ac_flags = ar->flags;
5246 /* we have to define context: we'll work with a file or
5247 * locality group. this is a policy, actually */
5248 ext4_mb_group_or_file(ac);
5250 mb_debug(sb, "init ac: %u blocks @ %u, goal %u, flags 0x%x, 2^%d, "
5251 "left: %u/%u, right %u/%u to %swritable\n",
5252 (unsigned) ar->len, (unsigned) ar->logical,
5253 (unsigned) ar->goal, ac->ac_flags, ac->ac_2order,
5254 (unsigned) ar->lleft, (unsigned) ar->pleft,
5255 (unsigned) ar->lright, (unsigned) ar->pright,
5256 inode_is_open_for_write(ar->inode) ? "" : "non-");
5261 static noinline_for_stack void
5262 ext4_mb_discard_lg_preallocations(struct super_block *sb,
5263 struct ext4_locality_group *lg,
5264 int order, int total_entries)
5266 ext4_group_t group = 0;
5267 struct ext4_buddy e4b;
5268 struct list_head discard_list;
5269 struct ext4_prealloc_space *pa, *tmp;
5271 mb_debug(sb, "discard locality group preallocation\n");
5273 INIT_LIST_HEAD(&discard_list);
5275 spin_lock(&lg->lg_prealloc_lock);
5276 list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[order],
5278 lockdep_is_held(&lg->lg_prealloc_lock)) {
5279 spin_lock(&pa->pa_lock);
5280 if (atomic_read(&pa->pa_count)) {
5282 * This is the pa that we just used
5283 * for block allocation. So don't
5286 spin_unlock(&pa->pa_lock);
5289 if (pa->pa_deleted) {
5290 spin_unlock(&pa->pa_lock);
5293 /* only lg prealloc space */
5294 BUG_ON(pa->pa_type != MB_GROUP_PA);
5296 /* seems this one can be freed ... */
5297 ext4_mb_mark_pa_deleted(sb, pa);
5298 spin_unlock(&pa->pa_lock);
5300 list_del_rcu(&pa->pa_inode_list);
5301 list_add(&pa->u.pa_tmp_list, &discard_list);
5304 if (total_entries <= 5) {
5306 * we want to keep only 5 entries
5307 * allowing it to grow to 8. This
5308 * mak sure we don't call discard
5309 * soon for this list.
5314 spin_unlock(&lg->lg_prealloc_lock);
5316 list_for_each_entry_safe(pa, tmp, &discard_list, u.pa_tmp_list) {
5319 group = ext4_get_group_number(sb, pa->pa_pstart);
5320 err = ext4_mb_load_buddy_gfp(sb, group, &e4b,
5321 GFP_NOFS|__GFP_NOFAIL);
5323 ext4_error_err(sb, -err, "Error %d loading buddy information for %u",
5327 ext4_lock_group(sb, group);
5328 list_del(&pa->pa_group_list);
5329 ext4_mb_release_group_pa(&e4b, pa);
5330 ext4_unlock_group(sb, group);
5332 ext4_mb_unload_buddy(&e4b);
5333 list_del(&pa->u.pa_tmp_list);
5334 call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback);
5339 * We have incremented pa_count. So it cannot be freed at this
5340 * point. Also we hold lg_mutex. So no parallel allocation is
5341 * possible from this lg. That means pa_free cannot be updated.
5343 * A parallel ext4_mb_discard_group_preallocations is possible.
5344 * which can cause the lg_prealloc_list to be updated.
5347 static void ext4_mb_add_n_trim(struct ext4_allocation_context *ac)
5349 int order, added = 0, lg_prealloc_count = 1;
5350 struct super_block *sb = ac->ac_sb;
5351 struct ext4_locality_group *lg = ac->ac_lg;
5352 struct ext4_prealloc_space *tmp_pa, *pa = ac->ac_pa;
5354 order = fls(pa->pa_free) - 1;
5355 if (order > PREALLOC_TB_SIZE - 1)
5356 /* The max size of hash table is PREALLOC_TB_SIZE */
5357 order = PREALLOC_TB_SIZE - 1;
5358 /* Add the prealloc space to lg */
5359 spin_lock(&lg->lg_prealloc_lock);
5360 list_for_each_entry_rcu(tmp_pa, &lg->lg_prealloc_list[order],
5362 lockdep_is_held(&lg->lg_prealloc_lock)) {
5363 spin_lock(&tmp_pa->pa_lock);
5364 if (tmp_pa->pa_deleted) {
5365 spin_unlock(&tmp_pa->pa_lock);
5368 if (!added && pa->pa_free < tmp_pa->pa_free) {
5369 /* Add to the tail of the previous entry */
5370 list_add_tail_rcu(&pa->pa_inode_list,
5371 &tmp_pa->pa_inode_list);
5374 * we want to count the total
5375 * number of entries in the list
5378 spin_unlock(&tmp_pa->pa_lock);
5379 lg_prealloc_count++;
5382 list_add_tail_rcu(&pa->pa_inode_list,
5383 &lg->lg_prealloc_list[order]);
5384 spin_unlock(&lg->lg_prealloc_lock);
5386 /* Now trim the list to be not more than 8 elements */
5387 if (lg_prealloc_count > 8) {
5388 ext4_mb_discard_lg_preallocations(sb, lg,
5389 order, lg_prealloc_count);
5396 * if per-inode prealloc list is too long, trim some PA
5398 static void ext4_mb_trim_inode_pa(struct inode *inode)
5400 struct ext4_inode_info *ei = EXT4_I(inode);
5401 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
5404 count = atomic_read(&ei->i_prealloc_active);
5405 delta = (sbi->s_mb_max_inode_prealloc >> 2) + 1;
5406 if (count > sbi->s_mb_max_inode_prealloc + delta) {
5407 count -= sbi->s_mb_max_inode_prealloc;
5408 ext4_discard_preallocations(inode, count);
5413 * release all resource we used in allocation
5415 static int ext4_mb_release_context(struct ext4_allocation_context *ac)
5417 struct inode *inode = ac->ac_inode;
5418 struct ext4_inode_info *ei = EXT4_I(inode);
5419 struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb);
5420 struct ext4_prealloc_space *pa = ac->ac_pa;
5422 if (pa->pa_type == MB_GROUP_PA) {
5423 /* see comment in ext4_mb_use_group_pa() */
5424 spin_lock(&pa->pa_lock);
5425 pa->pa_pstart += EXT4_C2B(sbi, ac->ac_b_ex.fe_len);
5426 pa->pa_lstart += EXT4_C2B(sbi, ac->ac_b_ex.fe_len);
5427 pa->pa_free -= ac->ac_b_ex.fe_len;
5428 pa->pa_len -= ac->ac_b_ex.fe_len;
5429 spin_unlock(&pa->pa_lock);
5432 * We want to add the pa to the right bucket.
5433 * Remove it from the list and while adding
5434 * make sure the list to which we are adding
5437 if (likely(pa->pa_free)) {
5438 spin_lock(pa->pa_obj_lock);
5439 list_del_rcu(&pa->pa_inode_list);
5440 spin_unlock(pa->pa_obj_lock);
5441 ext4_mb_add_n_trim(ac);
5445 if (pa->pa_type == MB_INODE_PA) {
5447 * treat per-inode prealloc list as a lru list, then try
5448 * to trim the least recently used PA.
5450 spin_lock(pa->pa_obj_lock);
5451 list_move(&pa->pa_inode_list, &ei->i_prealloc_list);
5452 spin_unlock(pa->pa_obj_lock);
5455 ext4_mb_put_pa(ac, ac->ac_sb, pa);
5457 if (ac->ac_bitmap_page)
5458 put_page(ac->ac_bitmap_page);
5459 if (ac->ac_buddy_page)
5460 put_page(ac->ac_buddy_page);
5461 if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC)
5462 mutex_unlock(&ac->ac_lg->lg_mutex);
5463 ext4_mb_collect_stats(ac);
5464 ext4_mb_trim_inode_pa(inode);
5468 static int ext4_mb_discard_preallocations(struct super_block *sb, int needed)
5470 ext4_group_t i, ngroups = ext4_get_groups_count(sb);
5472 int freed = 0, busy = 0;
5475 trace_ext4_mb_discard_preallocations(sb, needed);
5478 needed = EXT4_CLUSTERS_PER_GROUP(sb) + 1;
5480 for (i = 0; i < ngroups && needed > 0; i++) {
5481 ret = ext4_mb_discard_group_preallocations(sb, i, &busy);
5487 if (needed > 0 && busy && ++retry < 3) {
5495 static bool ext4_mb_discard_preallocations_should_retry(struct super_block *sb,
5496 struct ext4_allocation_context *ac, u64 *seq)
5502 freed = ext4_mb_discard_preallocations(sb, ac->ac_o_ex.fe_len);
5507 seq_retry = ext4_get_discard_pa_seq_sum();
5508 if (!(ac->ac_flags & EXT4_MB_STRICT_CHECK) || seq_retry != *seq) {
5509 ac->ac_flags |= EXT4_MB_STRICT_CHECK;
5515 mb_debug(sb, "freed %d, retry ? %s\n", freed, ret ? "yes" : "no");
5519 static ext4_fsblk_t ext4_mb_new_blocks_simple(handle_t *handle,
5520 struct ext4_allocation_request *ar, int *errp);
5523 * Main entry point into mballoc to allocate blocks
5524 * it tries to use preallocation first, then falls back
5525 * to usual allocation
5527 ext4_fsblk_t ext4_mb_new_blocks(handle_t *handle,
5528 struct ext4_allocation_request *ar, int *errp)
5530 struct ext4_allocation_context *ac = NULL;
5531 struct ext4_sb_info *sbi;
5532 struct super_block *sb;
5533 ext4_fsblk_t block = 0;
5534 unsigned int inquota = 0;
5535 unsigned int reserv_clstrs = 0;
5539 sb = ar->inode->i_sb;
5542 trace_ext4_request_blocks(ar);
5543 if (sbi->s_mount_state & EXT4_FC_REPLAY)
5544 return ext4_mb_new_blocks_simple(handle, ar, errp);
5546 /* Allow to use superuser reservation for quota file */
5547 if (ext4_is_quota_file(ar->inode))
5548 ar->flags |= EXT4_MB_USE_ROOT_BLOCKS;
5550 if ((ar->flags & EXT4_MB_DELALLOC_RESERVED) == 0) {
5551 /* Without delayed allocation we need to verify
5552 * there is enough free blocks to do block allocation
5553 * and verify allocation doesn't exceed the quota limits.
5556 ext4_claim_free_clusters(sbi, ar->len, ar->flags)) {
5558 /* let others to free the space */
5560 ar->len = ar->len >> 1;
5563 ext4_mb_show_pa(sb);
5567 reserv_clstrs = ar->len;
5568 if (ar->flags & EXT4_MB_USE_ROOT_BLOCKS) {
5569 dquot_alloc_block_nofail(ar->inode,
5570 EXT4_C2B(sbi, ar->len));
5573 dquot_alloc_block(ar->inode,
5574 EXT4_C2B(sbi, ar->len))) {
5576 ar->flags |= EXT4_MB_HINT_NOPREALLOC;
5587 ac = kmem_cache_zalloc(ext4_ac_cachep, GFP_NOFS);
5594 *errp = ext4_mb_initialize_context(ac, ar);
5600 ac->ac_op = EXT4_MB_HISTORY_PREALLOC;
5601 seq = this_cpu_read(discard_pa_seq);
5602 if (!ext4_mb_use_preallocated(ac)) {
5603 ac->ac_op = EXT4_MB_HISTORY_ALLOC;
5604 ext4_mb_normalize_request(ac, ar);
5606 *errp = ext4_mb_pa_alloc(ac);
5610 /* allocate space in core */
5611 *errp = ext4_mb_regular_allocator(ac);
5613 * pa allocated above is added to grp->bb_prealloc_list only
5614 * when we were able to allocate some block i.e. when
5615 * ac->ac_status == AC_STATUS_FOUND.
5616 * And error from above mean ac->ac_status != AC_STATUS_FOUND
5617 * So we have to free this pa here itself.
5620 ext4_mb_pa_free(ac);
5621 ext4_discard_allocated_blocks(ac);
5624 if (ac->ac_status == AC_STATUS_FOUND &&
5625 ac->ac_o_ex.fe_len >= ac->ac_f_ex.fe_len)
5626 ext4_mb_pa_free(ac);
5628 if (likely(ac->ac_status == AC_STATUS_FOUND)) {
5629 *errp = ext4_mb_mark_diskspace_used(ac, handle, reserv_clstrs);
5631 ext4_discard_allocated_blocks(ac);
5634 block = ext4_grp_offs_to_block(sb, &ac->ac_b_ex);
5635 ar->len = ac->ac_b_ex.fe_len;
5638 if (ext4_mb_discard_preallocations_should_retry(sb, ac, &seq))
5641 * If block allocation fails then the pa allocated above
5642 * needs to be freed here itself.
5644 ext4_mb_pa_free(ac);
5650 ac->ac_b_ex.fe_len = 0;
5652 ext4_mb_show_ac(ac);
5654 ext4_mb_release_context(ac);
5657 kmem_cache_free(ext4_ac_cachep, ac);
5658 if (inquota && ar->len < inquota)
5659 dquot_free_block(ar->inode, EXT4_C2B(sbi, inquota - ar->len));
5661 if ((ar->flags & EXT4_MB_DELALLOC_RESERVED) == 0)
5662 /* release all the reserved blocks if non delalloc */
5663 percpu_counter_sub(&sbi->s_dirtyclusters_counter,
5667 trace_ext4_allocate_blocks(ar, (unsigned long long)block);
5673 * We can merge two free data extents only if the physical blocks
5674 * are contiguous, AND the extents were freed by the same transaction,
5675 * AND the blocks are associated with the same group.
5677 static void ext4_try_merge_freed_extent(struct ext4_sb_info *sbi,
5678 struct ext4_free_data *entry,
5679 struct ext4_free_data *new_entry,
5680 struct rb_root *entry_rb_root)
5682 if ((entry->efd_tid != new_entry->efd_tid) ||
5683 (entry->efd_group != new_entry->efd_group))
5685 if (entry->efd_start_cluster + entry->efd_count ==
5686 new_entry->efd_start_cluster) {
5687 new_entry->efd_start_cluster = entry->efd_start_cluster;
5688 new_entry->efd_count += entry->efd_count;
5689 } else if (new_entry->efd_start_cluster + new_entry->efd_count ==
5690 entry->efd_start_cluster) {
5691 new_entry->efd_count += entry->efd_count;
5694 spin_lock(&sbi->s_md_lock);
5695 list_del(&entry->efd_list);
5696 spin_unlock(&sbi->s_md_lock);
5697 rb_erase(&entry->efd_node, entry_rb_root);
5698 kmem_cache_free(ext4_free_data_cachep, entry);
5701 static noinline_for_stack int
5702 ext4_mb_free_metadata(handle_t *handle, struct ext4_buddy *e4b,
5703 struct ext4_free_data *new_entry)
5705 ext4_group_t group = e4b->bd_group;
5706 ext4_grpblk_t cluster;
5707 ext4_grpblk_t clusters = new_entry->efd_count;
5708 struct ext4_free_data *entry;
5709 struct ext4_group_info *db = e4b->bd_info;
5710 struct super_block *sb = e4b->bd_sb;
5711 struct ext4_sb_info *sbi = EXT4_SB(sb);
5712 struct rb_node **n = &db->bb_free_root.rb_node, *node;
5713 struct rb_node *parent = NULL, *new_node;
5715 BUG_ON(!ext4_handle_valid(handle));
5716 BUG_ON(e4b->bd_bitmap_page == NULL);
5717 BUG_ON(e4b->bd_buddy_page == NULL);
5719 new_node = &new_entry->efd_node;
5720 cluster = new_entry->efd_start_cluster;
5723 /* first free block exent. We need to
5724 protect buddy cache from being freed,
5725 * otherwise we'll refresh it from
5726 * on-disk bitmap and lose not-yet-available
5728 get_page(e4b->bd_buddy_page);
5729 get_page(e4b->bd_bitmap_page);
5733 entry = rb_entry(parent, struct ext4_free_data, efd_node);
5734 if (cluster < entry->efd_start_cluster)
5736 else if (cluster >= (entry->efd_start_cluster + entry->efd_count))
5737 n = &(*n)->rb_right;
5739 ext4_grp_locked_error(sb, group, 0,
5740 ext4_group_first_block_no(sb, group) +
5741 EXT4_C2B(sbi, cluster),
5742 "Block already on to-be-freed list");
5743 kmem_cache_free(ext4_free_data_cachep, new_entry);
5748 rb_link_node(new_node, parent, n);
5749 rb_insert_color(new_node, &db->bb_free_root);
5751 /* Now try to see the extent can be merged to left and right */
5752 node = rb_prev(new_node);
5754 entry = rb_entry(node, struct ext4_free_data, efd_node);
5755 ext4_try_merge_freed_extent(sbi, entry, new_entry,
5756 &(db->bb_free_root));
5759 node = rb_next(new_node);
5761 entry = rb_entry(node, struct ext4_free_data, efd_node);
5762 ext4_try_merge_freed_extent(sbi, entry, new_entry,
5763 &(db->bb_free_root));
5766 spin_lock(&sbi->s_md_lock);
5767 list_add_tail(&new_entry->efd_list, &sbi->s_freed_data_list);
5768 sbi->s_mb_free_pending += clusters;
5769 spin_unlock(&sbi->s_md_lock);
5774 * Simple allocator for Ext4 fast commit replay path. It searches for blocks
5775 * linearly starting at the goal block and also excludes the blocks which
5776 * are going to be in use after fast commit replay.
5778 static ext4_fsblk_t ext4_mb_new_blocks_simple(handle_t *handle,
5779 struct ext4_allocation_request *ar, int *errp)
5781 struct buffer_head *bitmap_bh;
5782 struct super_block *sb = ar->inode->i_sb;
5784 ext4_grpblk_t blkoff;
5785 ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb);
5786 ext4_grpblk_t i = 0;
5787 ext4_fsblk_t goal, block;
5788 struct ext4_super_block *es = EXT4_SB(sb)->s_es;
5791 if (goal < le32_to_cpu(es->s_first_data_block) ||
5792 goal >= ext4_blocks_count(es))
5793 goal = le32_to_cpu(es->s_first_data_block);
5796 ext4_get_group_no_and_offset(sb, goal, &group, &blkoff);
5797 for (; group < ext4_get_groups_count(sb); group++) {
5798 bitmap_bh = ext4_read_block_bitmap(sb, group);
5799 if (IS_ERR(bitmap_bh)) {
5800 *errp = PTR_ERR(bitmap_bh);
5801 pr_warn("Failed to read block bitmap\n");
5805 ext4_get_group_no_and_offset(sb,
5806 max(ext4_group_first_block_no(sb, group), goal),
5809 i = mb_find_next_zero_bit(bitmap_bh->b_data, max,
5813 if (ext4_fc_replay_check_excluded(sb,
5814 ext4_group_first_block_no(sb, group) + i)) {
5824 if (group >= ext4_get_groups_count(sb) || i >= max) {
5829 block = ext4_group_first_block_no(sb, group) + i;
5830 ext4_mb_mark_bb(sb, block, 1, 1);
5836 static void ext4_free_blocks_simple(struct inode *inode, ext4_fsblk_t block,
5837 unsigned long count)
5839 struct buffer_head *bitmap_bh;
5840 struct super_block *sb = inode->i_sb;
5841 struct ext4_group_desc *gdp;
5842 struct buffer_head *gdp_bh;
5844 ext4_grpblk_t blkoff;
5845 int already_freed = 0, err, i;
5847 ext4_get_group_no_and_offset(sb, block, &group, &blkoff);
5848 bitmap_bh = ext4_read_block_bitmap(sb, group);
5849 if (IS_ERR(bitmap_bh)) {
5850 err = PTR_ERR(bitmap_bh);
5851 pr_warn("Failed to read block bitmap\n");
5854 gdp = ext4_get_group_desc(sb, group, &gdp_bh);
5858 for (i = 0; i < count; i++) {
5859 if (!mb_test_bit(blkoff + i, bitmap_bh->b_data))
5862 mb_clear_bits(bitmap_bh->b_data, blkoff, count);
5863 err = ext4_handle_dirty_metadata(NULL, NULL, bitmap_bh);
5866 ext4_free_group_clusters_set(
5867 sb, gdp, ext4_free_group_clusters(sb, gdp) +
5868 count - already_freed);
5869 ext4_block_bitmap_csum_set(sb, group, gdp, bitmap_bh);
5870 ext4_group_desc_csum_set(sb, group, gdp);
5871 ext4_handle_dirty_metadata(NULL, NULL, gdp_bh);
5872 sync_dirty_buffer(bitmap_bh);
5873 sync_dirty_buffer(gdp_bh);
5878 * ext4_mb_clear_bb() -- helper function for freeing blocks.
5879 * Used by ext4_free_blocks()
5880 * @handle: handle for this transaction
5882 * @block: starting physical block to be freed
5883 * @count: number of blocks to be freed
5884 * @flags: flags used by ext4_free_blocks
5886 static void ext4_mb_clear_bb(handle_t *handle, struct inode *inode,
5887 ext4_fsblk_t block, unsigned long count,
5890 struct buffer_head *bitmap_bh = NULL;
5891 struct super_block *sb = inode->i_sb;
5892 struct ext4_group_desc *gdp;
5893 unsigned int overflow;
5895 struct buffer_head *gd_bh;
5896 ext4_group_t block_group;
5897 struct ext4_sb_info *sbi;
5898 struct ext4_buddy e4b;
5899 unsigned int count_clusters;
5905 if (!(flags & EXT4_FREE_BLOCKS_VALIDATED) &&
5906 !ext4_inode_block_valid(inode, block, count)) {
5907 ext4_error(sb, "Freeing blocks in system zone - "
5908 "Block = %llu, count = %lu", block, count);
5909 /* err = 0. ext4_std_error should be a no op */
5912 flags |= EXT4_FREE_BLOCKS_VALIDATED;
5916 ext4_get_group_no_and_offset(sb, block, &block_group, &bit);
5918 if (unlikely(EXT4_MB_GRP_BBITMAP_CORRUPT(
5919 ext4_get_group_info(sb, block_group))))
5923 * Check to see if we are freeing blocks across a group
5926 if (EXT4_C2B(sbi, bit) + count > EXT4_BLOCKS_PER_GROUP(sb)) {
5927 overflow = EXT4_C2B(sbi, bit) + count -
5928 EXT4_BLOCKS_PER_GROUP(sb);
5930 /* The range changed so it's no longer validated */
5931 flags &= ~EXT4_FREE_BLOCKS_VALIDATED;
5933 count_clusters = EXT4_NUM_B2C(sbi, count);
5934 bitmap_bh = ext4_read_block_bitmap(sb, block_group);
5935 if (IS_ERR(bitmap_bh)) {
5936 err = PTR_ERR(bitmap_bh);
5940 gdp = ext4_get_group_desc(sb, block_group, &gd_bh);
5946 if (!(flags & EXT4_FREE_BLOCKS_VALIDATED) &&
5947 !ext4_inode_block_valid(inode, block, count)) {
5948 ext4_error(sb, "Freeing blocks in system zone - "
5949 "Block = %llu, count = %lu", block, count);
5950 /* err = 0. ext4_std_error should be a no op */
5954 BUFFER_TRACE(bitmap_bh, "getting write access");
5955 err = ext4_journal_get_write_access(handle, sb, bitmap_bh,
5961 * We are about to modify some metadata. Call the journal APIs
5962 * to unshare ->b_data if a currently-committing transaction is
5965 BUFFER_TRACE(gd_bh, "get_write_access");
5966 err = ext4_journal_get_write_access(handle, sb, gd_bh, EXT4_JTR_NONE);
5969 #ifdef AGGRESSIVE_CHECK
5972 for (i = 0; i < count_clusters; i++)
5973 BUG_ON(!mb_test_bit(bit + i, bitmap_bh->b_data));
5976 trace_ext4_mballoc_free(sb, inode, block_group, bit, count_clusters);
5978 /* __GFP_NOFAIL: retry infinitely, ignore TIF_MEMDIE and memcg limit. */
5979 err = ext4_mb_load_buddy_gfp(sb, block_group, &e4b,
5980 GFP_NOFS|__GFP_NOFAIL);
5985 * We need to make sure we don't reuse the freed block until after the
5986 * transaction is committed. We make an exception if the inode is to be
5987 * written in writeback mode since writeback mode has weak data
5988 * consistency guarantees.
5990 if (ext4_handle_valid(handle) &&
5991 ((flags & EXT4_FREE_BLOCKS_METADATA) ||
5992 !ext4_should_writeback_data(inode))) {
5993 struct ext4_free_data *new_entry;
5995 * We use __GFP_NOFAIL because ext4_free_blocks() is not allowed
5998 new_entry = kmem_cache_alloc(ext4_free_data_cachep,
5999 GFP_NOFS|__GFP_NOFAIL);
6000 new_entry->efd_start_cluster = bit;
6001 new_entry->efd_group = block_group;
6002 new_entry->efd_count = count_clusters;
6003 new_entry->efd_tid = handle->h_transaction->t_tid;
6005 ext4_lock_group(sb, block_group);
6006 mb_clear_bits(bitmap_bh->b_data, bit, count_clusters);
6007 ext4_mb_free_metadata(handle, &e4b, new_entry);
6009 /* need to update group_info->bb_free and bitmap
6010 * with group lock held. generate_buddy look at
6011 * them with group lock_held
6013 if (test_opt(sb, DISCARD)) {
6014 err = ext4_issue_discard(sb, block_group, bit, count,
6016 if (err && err != -EOPNOTSUPP)
6017 ext4_msg(sb, KERN_WARNING, "discard request in"
6018 " group:%u block:%d count:%lu failed"
6019 " with %d", block_group, bit, count,
6022 EXT4_MB_GRP_CLEAR_TRIMMED(e4b.bd_info);
6024 ext4_lock_group(sb, block_group);
6025 mb_clear_bits(bitmap_bh->b_data, bit, count_clusters);
6026 mb_free_blocks(inode, &e4b, bit, count_clusters);
6029 ret = ext4_free_group_clusters(sb, gdp) + count_clusters;
6030 ext4_free_group_clusters_set(sb, gdp, ret);
6031 ext4_block_bitmap_csum_set(sb, block_group, gdp, bitmap_bh);
6032 ext4_group_desc_csum_set(sb, block_group, gdp);
6033 ext4_unlock_group(sb, block_group);
6035 if (sbi->s_log_groups_per_flex) {
6036 ext4_group_t flex_group = ext4_flex_group(sbi, block_group);
6037 atomic64_add(count_clusters,
6038 &sbi_array_rcu_deref(sbi, s_flex_groups,
6039 flex_group)->free_clusters);
6043 * on a bigalloc file system, defer the s_freeclusters_counter
6044 * update to the caller (ext4_remove_space and friends) so they
6045 * can determine if a cluster freed here should be rereserved
6047 if (!(flags & EXT4_FREE_BLOCKS_RERESERVE_CLUSTER)) {
6048 if (!(flags & EXT4_FREE_BLOCKS_NO_QUOT_UPDATE))
6049 dquot_free_block(inode, EXT4_C2B(sbi, count_clusters));
6050 percpu_counter_add(&sbi->s_freeclusters_counter,
6054 ext4_mb_unload_buddy(&e4b);
6056 /* We dirtied the bitmap block */
6057 BUFFER_TRACE(bitmap_bh, "dirtied bitmap block");
6058 err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh);
6060 /* And the group descriptor block */
6061 BUFFER_TRACE(gd_bh, "dirtied group descriptor block");
6062 ret = ext4_handle_dirty_metadata(handle, NULL, gd_bh);
6066 if (overflow && !err) {
6070 /* The range changed so it's no longer validated */
6071 flags &= ~EXT4_FREE_BLOCKS_VALIDATED;
6076 ext4_std_error(sb, err);
6081 * ext4_free_blocks() -- Free given blocks and update quota
6082 * @handle: handle for this transaction
6084 * @bh: optional buffer of the block to be freed
6085 * @block: starting physical block to be freed
6086 * @count: number of blocks to be freed
6087 * @flags: flags used by ext4_free_blocks
6089 void ext4_free_blocks(handle_t *handle, struct inode *inode,
6090 struct buffer_head *bh, ext4_fsblk_t block,
6091 unsigned long count, int flags)
6093 struct super_block *sb = inode->i_sb;
6094 unsigned int overflow;
6095 struct ext4_sb_info *sbi;
6099 if (sbi->s_mount_state & EXT4_FC_REPLAY) {
6100 ext4_free_blocks_simple(inode, block, count);
6107 BUG_ON(block != bh->b_blocknr);
6109 block = bh->b_blocknr;
6112 if (!(flags & EXT4_FREE_BLOCKS_VALIDATED) &&
6113 !ext4_inode_block_valid(inode, block, count)) {
6114 ext4_error(sb, "Freeing blocks not in datazone - "
6115 "block = %llu, count = %lu", block, count);
6118 flags |= EXT4_FREE_BLOCKS_VALIDATED;
6120 ext4_debug("freeing block %llu\n", block);
6121 trace_ext4_free_blocks(inode, block, count, flags);
6123 if (bh && (flags & EXT4_FREE_BLOCKS_FORGET)) {
6126 ext4_forget(handle, flags & EXT4_FREE_BLOCKS_METADATA,
6131 * If the extent to be freed does not begin on a cluster
6132 * boundary, we need to deal with partial clusters at the
6133 * beginning and end of the extent. Normally we will free
6134 * blocks at the beginning or the end unless we are explicitly
6135 * requested to avoid doing so.
6137 overflow = EXT4_PBLK_COFF(sbi, block);
6139 if (flags & EXT4_FREE_BLOCKS_NOFREE_FIRST_CLUSTER) {
6140 overflow = sbi->s_cluster_ratio - overflow;
6142 if (count > overflow)
6150 /* The range changed so it's no longer validated */
6151 flags &= ~EXT4_FREE_BLOCKS_VALIDATED;
6153 overflow = EXT4_LBLK_COFF(sbi, count);
6155 if (flags & EXT4_FREE_BLOCKS_NOFREE_LAST_CLUSTER) {
6156 if (count > overflow)
6161 count += sbi->s_cluster_ratio - overflow;
6162 /* The range changed so it's no longer validated */
6163 flags &= ~EXT4_FREE_BLOCKS_VALIDATED;
6166 if (!bh && (flags & EXT4_FREE_BLOCKS_FORGET)) {
6168 int is_metadata = flags & EXT4_FREE_BLOCKS_METADATA;
6170 for (i = 0; i < count; i++) {
6173 bh = sb_find_get_block(inode->i_sb, block + i);
6174 ext4_forget(handle, is_metadata, inode, bh, block + i);
6178 ext4_mb_clear_bb(handle, inode, block, count, flags);
6183 * ext4_group_add_blocks() -- Add given blocks to an existing group
6184 * @handle: handle to this transaction
6186 * @block: start physical block to add to the block group
6187 * @count: number of blocks to free
6189 * This marks the blocks as free in the bitmap and buddy.
6191 int ext4_group_add_blocks(handle_t *handle, struct super_block *sb,
6192 ext4_fsblk_t block, unsigned long count)
6194 struct buffer_head *bitmap_bh = NULL;
6195 struct buffer_head *gd_bh;
6196 ext4_group_t block_group;
6199 struct ext4_group_desc *desc;
6200 struct ext4_sb_info *sbi = EXT4_SB(sb);
6201 struct ext4_buddy e4b;
6202 int err = 0, ret, free_clusters_count;
6203 ext4_grpblk_t clusters_freed;
6204 ext4_fsblk_t first_cluster = EXT4_B2C(sbi, block);
6205 ext4_fsblk_t last_cluster = EXT4_B2C(sbi, block + count - 1);
6206 unsigned long cluster_count = last_cluster - first_cluster + 1;
6208 ext4_debug("Adding block(s) %llu-%llu\n", block, block + count - 1);
6213 ext4_get_group_no_and_offset(sb, block, &block_group, &bit);
6215 * Check to see if we are freeing blocks across a group
6218 if (bit + cluster_count > EXT4_CLUSTERS_PER_GROUP(sb)) {
6219 ext4_warning(sb, "too many blocks added to group %u",
6225 bitmap_bh = ext4_read_block_bitmap(sb, block_group);
6226 if (IS_ERR(bitmap_bh)) {
6227 err = PTR_ERR(bitmap_bh);
6232 desc = ext4_get_group_desc(sb, block_group, &gd_bh);
6238 if (!ext4_sb_block_valid(sb, NULL, block, count)) {
6239 ext4_error(sb, "Adding blocks in system zones - "
6240 "Block = %llu, count = %lu",
6246 BUFFER_TRACE(bitmap_bh, "getting write access");
6247 err = ext4_journal_get_write_access(handle, sb, bitmap_bh,
6253 * We are about to modify some metadata. Call the journal APIs
6254 * to unshare ->b_data if a currently-committing transaction is
6257 BUFFER_TRACE(gd_bh, "get_write_access");
6258 err = ext4_journal_get_write_access(handle, sb, gd_bh, EXT4_JTR_NONE);
6262 for (i = 0, clusters_freed = 0; i < cluster_count; i++) {
6263 BUFFER_TRACE(bitmap_bh, "clear bit");
6264 if (!mb_test_bit(bit + i, bitmap_bh->b_data)) {
6265 ext4_error(sb, "bit already cleared for block %llu",
6266 (ext4_fsblk_t)(block + i));
6267 BUFFER_TRACE(bitmap_bh, "bit already cleared");
6273 err = ext4_mb_load_buddy(sb, block_group, &e4b);
6278 * need to update group_info->bb_free and bitmap
6279 * with group lock held. generate_buddy look at
6280 * them with group lock_held
6282 ext4_lock_group(sb, block_group);
6283 mb_clear_bits(bitmap_bh->b_data, bit, cluster_count);
6284 mb_free_blocks(NULL, &e4b, bit, cluster_count);
6285 free_clusters_count = clusters_freed +
6286 ext4_free_group_clusters(sb, desc);
6287 ext4_free_group_clusters_set(sb, desc, free_clusters_count);
6288 ext4_block_bitmap_csum_set(sb, block_group, desc, bitmap_bh);
6289 ext4_group_desc_csum_set(sb, block_group, desc);
6290 ext4_unlock_group(sb, block_group);
6291 percpu_counter_add(&sbi->s_freeclusters_counter,
6294 if (sbi->s_log_groups_per_flex) {
6295 ext4_group_t flex_group = ext4_flex_group(sbi, block_group);
6296 atomic64_add(clusters_freed,
6297 &sbi_array_rcu_deref(sbi, s_flex_groups,
6298 flex_group)->free_clusters);
6301 ext4_mb_unload_buddy(&e4b);
6303 /* We dirtied the bitmap block */
6304 BUFFER_TRACE(bitmap_bh, "dirtied bitmap block");
6305 err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh);
6307 /* And the group descriptor block */
6308 BUFFER_TRACE(gd_bh, "dirtied group descriptor block");
6309 ret = ext4_handle_dirty_metadata(handle, NULL, gd_bh);
6315 ext4_std_error(sb, err);
6320 * ext4_trim_extent -- function to TRIM one single free extent in the group
6321 * @sb: super block for the file system
6322 * @start: starting block of the free extent in the alloc. group
6323 * @count: number of blocks to TRIM
6324 * @e4b: ext4 buddy for the group
6326 * Trim "count" blocks starting at "start" in the "group". To assure that no
6327 * one will allocate those blocks, mark it as used in buddy bitmap. This must
6328 * be called with under the group lock.
6330 static int ext4_trim_extent(struct super_block *sb,
6331 int start, int count, struct ext4_buddy *e4b)
6335 struct ext4_free_extent ex;
6336 ext4_group_t group = e4b->bd_group;
6339 trace_ext4_trim_extent(sb, group, start, count);
6341 assert_spin_locked(ext4_group_lock_ptr(sb, group));
6343 ex.fe_start = start;
6344 ex.fe_group = group;
6348 * Mark blocks used, so no one can reuse them while
6351 mb_mark_used(e4b, &ex);
6352 ext4_unlock_group(sb, group);
6353 ret = ext4_issue_discard(sb, group, start, count, NULL);
6354 ext4_lock_group(sb, group);
6355 mb_free_blocks(NULL, e4b, start, ex.fe_len);
6359 static int ext4_try_to_trim_range(struct super_block *sb,
6360 struct ext4_buddy *e4b, ext4_grpblk_t start,
6361 ext4_grpblk_t max, ext4_grpblk_t minblocks)
6362 __acquires(ext4_group_lock_ptr(sb, e4b->bd_group))
6363 __releases(ext4_group_lock_ptr(sb, e4b->bd_group))
6365 ext4_grpblk_t next, count, free_count;
6368 bitmap = e4b->bd_bitmap;
6369 start = (e4b->bd_info->bb_first_free > start) ?
6370 e4b->bd_info->bb_first_free : start;
6374 while (start <= max) {
6375 start = mb_find_next_zero_bit(bitmap, max + 1, start);
6378 next = mb_find_next_bit(bitmap, max + 1, start);
6380 if ((next - start) >= minblocks) {
6381 int ret = ext4_trim_extent(sb, start, next - start, e4b);
6383 if (ret && ret != -EOPNOTSUPP)
6385 count += next - start;
6387 free_count += next - start;
6390 if (fatal_signal_pending(current)) {
6391 count = -ERESTARTSYS;
6395 if (need_resched()) {
6396 ext4_unlock_group(sb, e4b->bd_group);
6398 ext4_lock_group(sb, e4b->bd_group);
6401 if ((e4b->bd_info->bb_free - free_count) < minblocks)
6409 * ext4_trim_all_free -- function to trim all free space in alloc. group
6410 * @sb: super block for file system
6411 * @group: group to be trimmed
6412 * @start: first group block to examine
6413 * @max: last group block to examine
6414 * @minblocks: minimum extent block count
6415 * @set_trimmed: set the trimmed flag if at least one block is trimmed
6417 * ext4_trim_all_free walks through group's block bitmap searching for free
6418 * extents. When the free extent is found, mark it as used in group buddy
6419 * bitmap. Then issue a TRIM command on this extent and free the extent in
6420 * the group buddy bitmap.
6422 static ext4_grpblk_t
6423 ext4_trim_all_free(struct super_block *sb, ext4_group_t group,
6424 ext4_grpblk_t start, ext4_grpblk_t max,
6425 ext4_grpblk_t minblocks, bool set_trimmed)
6427 struct ext4_buddy e4b;
6430 trace_ext4_trim_all_free(sb, group, start, max);
6432 ret = ext4_mb_load_buddy(sb, group, &e4b);
6434 ext4_warning(sb, "Error %d loading buddy information for %u",
6439 ext4_lock_group(sb, group);
6441 if (!EXT4_MB_GRP_WAS_TRIMMED(e4b.bd_info) ||
6442 minblocks < EXT4_SB(sb)->s_last_trim_minblks) {
6443 ret = ext4_try_to_trim_range(sb, &e4b, start, max, minblocks);
6444 if (ret >= 0 && set_trimmed)
6445 EXT4_MB_GRP_SET_TRIMMED(e4b.bd_info);
6450 ext4_unlock_group(sb, group);
6451 ext4_mb_unload_buddy(&e4b);
6453 ext4_debug("trimmed %d blocks in the group %d\n",
6460 * ext4_trim_fs() -- trim ioctl handle function
6461 * @sb: superblock for filesystem
6462 * @range: fstrim_range structure
6464 * start: First Byte to trim
6465 * len: number of Bytes to trim from start
6466 * minlen: minimum extent length in Bytes
6467 * ext4_trim_fs goes through all allocation groups containing Bytes from
6468 * start to start+len. For each such a group ext4_trim_all_free function
6469 * is invoked to trim all free space.
6471 int ext4_trim_fs(struct super_block *sb, struct fstrim_range *range)
6473 unsigned int discard_granularity = bdev_discard_granularity(sb->s_bdev);
6474 struct ext4_group_info *grp;
6475 ext4_group_t group, first_group, last_group;
6476 ext4_grpblk_t cnt = 0, first_cluster, last_cluster;
6477 uint64_t start, end, minlen, trimmed = 0;
6478 ext4_fsblk_t first_data_blk =
6479 le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block);
6480 ext4_fsblk_t max_blks = ext4_blocks_count(EXT4_SB(sb)->s_es);
6481 bool whole_group, eof = false;
6484 start = range->start >> sb->s_blocksize_bits;
6485 end = start + (range->len >> sb->s_blocksize_bits) - 1;
6486 minlen = EXT4_NUM_B2C(EXT4_SB(sb),
6487 range->minlen >> sb->s_blocksize_bits);
6489 if (minlen > EXT4_CLUSTERS_PER_GROUP(sb) ||
6490 start >= max_blks ||
6491 range->len < sb->s_blocksize)
6493 /* No point to try to trim less than discard granularity */
6494 if (range->minlen < discard_granularity) {
6495 minlen = EXT4_NUM_B2C(EXT4_SB(sb),
6496 discard_granularity >> sb->s_blocksize_bits);
6497 if (minlen > EXT4_CLUSTERS_PER_GROUP(sb))
6500 if (end >= max_blks - 1) {
6504 if (end <= first_data_blk)
6506 if (start < first_data_blk)
6507 start = first_data_blk;
6509 /* Determine first and last group to examine based on start and end */
6510 ext4_get_group_no_and_offset(sb, (ext4_fsblk_t) start,
6511 &first_group, &first_cluster);
6512 ext4_get_group_no_and_offset(sb, (ext4_fsblk_t) end,
6513 &last_group, &last_cluster);
6515 /* end now represents the last cluster to discard in this group */
6516 end = EXT4_CLUSTERS_PER_GROUP(sb) - 1;
6519 for (group = first_group; group <= last_group; group++) {
6520 grp = ext4_get_group_info(sb, group);
6521 /* We only do this if the grp has never been initialized */
6522 if (unlikely(EXT4_MB_GRP_NEED_INIT(grp))) {
6523 ret = ext4_mb_init_group(sb, group, GFP_NOFS);
6529 * For all the groups except the last one, last cluster will
6530 * always be EXT4_CLUSTERS_PER_GROUP(sb)-1, so we only need to
6531 * change it for the last group, note that last_cluster is
6532 * already computed earlier by ext4_get_group_no_and_offset()
6534 if (group == last_group) {
6536 whole_group = eof ? true : end == EXT4_CLUSTERS_PER_GROUP(sb) - 1;
6538 if (grp->bb_free >= minlen) {
6539 cnt = ext4_trim_all_free(sb, group, first_cluster,
6540 end, minlen, whole_group);
6549 * For every group except the first one, we are sure
6550 * that the first cluster to discard will be cluster #0.
6556 EXT4_SB(sb)->s_last_trim_minblks = minlen;
6559 range->len = EXT4_C2B(EXT4_SB(sb), trimmed) << sb->s_blocksize_bits;
6563 /* Iterate all the free extents in the group. */
6565 ext4_mballoc_query_range(
6566 struct super_block *sb,
6568 ext4_grpblk_t start,
6570 ext4_mballoc_query_range_fn formatter,
6575 struct ext4_buddy e4b;
6578 error = ext4_mb_load_buddy(sb, group, &e4b);
6581 bitmap = e4b.bd_bitmap;
6583 ext4_lock_group(sb, group);
6585 start = (e4b.bd_info->bb_first_free > start) ?
6586 e4b.bd_info->bb_first_free : start;
6587 if (end >= EXT4_CLUSTERS_PER_GROUP(sb))
6588 end = EXT4_CLUSTERS_PER_GROUP(sb) - 1;
6590 while (start <= end) {
6591 start = mb_find_next_zero_bit(bitmap, end + 1, start);
6594 next = mb_find_next_bit(bitmap, end + 1, start);
6596 ext4_unlock_group(sb, group);
6597 error = formatter(sb, group, start, next - start, priv);
6600 ext4_lock_group(sb, group);
6605 ext4_unlock_group(sb, group);
6607 ext4_mb_unload_buddy(&e4b);