]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com | |
3 | * Written by Alex Tomas <alex@clusterfs.com> | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or modify | |
6 | * it under the terms of the GNU General Public License version 2 as | |
7 | * published by the Free Software Foundation. | |
8 | * | |
9 | * This program is distributed in the hope that it will be useful, | |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
13 | * | |
14 | * You should have received a copy of the GNU General Public Licens | |
15 | * along with this program; if not, write to the Free Software | |
16 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111- | |
17 | */ | |
18 | ||
19 | ||
20 | /* | |
21 | * mballoc.c contains the multiblocks allocation routines | |
22 | */ | |
23 | ||
24 | #include "ext4_jbd2.h" | |
25 | #include "mballoc.h" | |
26 | #include <linux/debugfs.h> | |
27 | #include <linux/log2.h> | |
28 | #include <linux/slab.h> | |
29 | #include <trace/events/ext4.h> | |
30 | ||
31 | /* | |
32 | * MUSTDO: | |
33 | * - test ext4_ext_search_left() and ext4_ext_search_right() | |
34 | * - search for metadata in few groups | |
35 | * | |
36 | * TODO v4: | |
37 | * - normalization should take into account whether file is still open | |
38 | * - discard preallocations if no free space left (policy?) | |
39 | * - don't normalize tails | |
40 | * - quota | |
41 | * - reservation for superuser | |
42 | * | |
43 | * TODO v3: | |
44 | * - bitmap read-ahead (proposed by Oleg Drokin aka green) | |
45 | * - track min/max extents in each group for better group selection | |
46 | * - mb_mark_used() may allocate chunk right after splitting buddy | |
47 | * - tree of groups sorted by number of free blocks | |
48 | * - error handling | |
49 | */ | |
50 | ||
51 | /* | |
52 | * The allocation request involve request for multiple number of blocks | |
53 | * near to the goal(block) value specified. | |
54 | * | |
55 | * During initialization phase of the allocator we decide to use the | |
56 | * group preallocation or inode preallocation depending on the size of | |
57 | * the file. The size of the file could be the resulting file size we | |
58 | * would have after allocation, or the current file size, which ever | |
59 | * is larger. If the size is less than sbi->s_mb_stream_request we | |
60 | * select to use the group preallocation. The default value of | |
61 | * s_mb_stream_request is 16 blocks. This can also be tuned via | |
62 | * /sys/fs/ext4/<partition>/mb_stream_req. The value is represented in | |
63 | * terms of number of blocks. | |
64 | * | |
65 | * The main motivation for having small file use group preallocation is to | |
66 | * ensure that we have small files closer together on the disk. | |
67 | * | |
68 | * First stage the allocator looks at the inode prealloc list, | |
69 | * ext4_inode_info->i_prealloc_list, which contains list of prealloc | |
70 | * spaces for this particular inode. The inode prealloc space is | |
71 | * represented as: | |
72 | * | |
73 | * pa_lstart -> the logical start block for this prealloc space | |
74 | * pa_pstart -> the physical start block for this prealloc space | |
75 | * pa_len -> length for this prealloc space (in clusters) | |
76 | * pa_free -> free space available in this prealloc space (in clusters) | |
77 | * | |
78 | * The inode preallocation space is used looking at the _logical_ start | |
79 | * block. If only the logical file block falls within the range of prealloc | |
80 | * space we will consume the particular prealloc space. This makes sure that | |
81 | * we have contiguous physical blocks representing the file blocks | |
82 | * | |
83 | * The important thing to be noted in case of inode prealloc space is that | |
84 | * we don't modify the values associated to inode prealloc space except | |
85 | * pa_free. | |
86 | * | |
87 | * If we are not able to find blocks in the inode prealloc space and if we | |
88 | * have the group allocation flag set then we look at the locality group | |
89 | * prealloc space. These are per CPU prealloc list represented as | |
90 | * | |
91 | * ext4_sb_info.s_locality_groups[smp_processor_id()] | |
92 | * | |
93 | * The reason for having a per cpu locality group is to reduce the contention | |
94 | * between CPUs. It is possible to get scheduled at this point. | |
95 | * | |
96 | * The locality group prealloc space is used looking at whether we have | |
97 | * enough free space (pa_free) within the prealloc space. | |
98 | * | |
99 | * If we can't allocate blocks via inode prealloc or/and locality group | |
100 | * prealloc then we look at the buddy cache. The buddy cache is represented | |
101 | * by ext4_sb_info.s_buddy_cache (struct inode) whose file offset gets | |
102 | * mapped to the buddy and bitmap information regarding different | |
103 | * groups. The buddy information is attached to buddy cache inode so that | |
104 | * we can access them through the page cache. The information regarding | |
105 | * each group is loaded via ext4_mb_load_buddy. The information involve | |
106 | * block bitmap and buddy information. The information are stored in the | |
107 | * inode as: | |
108 | * | |
109 | * { page } | |
110 | * [ group 0 bitmap][ group 0 buddy] [group 1][ group 1]... | |
111 | * | |
112 | * | |
113 | * one block each for bitmap and buddy information. So for each group we | |
114 | * take up 2 blocks. A page can contain blocks_per_page (PAGE_CACHE_SIZE / | |
115 | * blocksize) blocks. So it can have information regarding groups_per_page | |
116 | * which is blocks_per_page/2 | |
117 | * | |
118 | * The buddy cache inode is not stored on disk. The inode is thrown | |
119 | * away when the filesystem is unmounted. | |
120 | * | |
121 | * We look for count number of blocks in the buddy cache. If we were able | |
122 | * to locate that many free blocks we return with additional information | |
123 | * regarding rest of the contiguous physical block available | |
124 | * | |
125 | * Before allocating blocks via buddy cache we normalize the request | |
126 | * blocks. This ensure we ask for more blocks that we needed. The extra | |
127 | * blocks that we get after allocation is added to the respective prealloc | |
128 | * list. In case of inode preallocation we follow a list of heuristics | |
129 | * based on file size. This can be found in ext4_mb_normalize_request. If | |
130 | * we are doing a group prealloc we try to normalize the request to | |
131 | * sbi->s_mb_group_prealloc. The default value of s_mb_group_prealloc is | |
132 | * dependent on the cluster size; for non-bigalloc file systems, it is | |
133 | * 512 blocks. This can be tuned via | |
134 | * /sys/fs/ext4/<partition>/mb_group_prealloc. The value is represented in | |
135 | * terms of number of blocks. If we have mounted the file system with -O | |
136 | * stripe=<value> option the group prealloc request is normalized to the | |
137 | * the smallest multiple of the stripe value (sbi->s_stripe) which is | |
138 | * greater than the default mb_group_prealloc. | |
139 | * | |
140 | * The regular allocator (using the buddy cache) supports a few tunables. | |
141 | * | |
142 | * /sys/fs/ext4/<partition>/mb_min_to_scan | |
143 | * /sys/fs/ext4/<partition>/mb_max_to_scan | |
144 | * /sys/fs/ext4/<partition>/mb_order2_req | |
145 | * | |
146 | * The regular allocator uses buddy scan only if the request len is power of | |
147 | * 2 blocks and the order of allocation is >= sbi->s_mb_order2_reqs. The | |
148 | * value of s_mb_order2_reqs can be tuned via | |
149 | * /sys/fs/ext4/<partition>/mb_order2_req. If the request len is equal to | |
150 | * stripe size (sbi->s_stripe), we try to search for contiguous block in | |
151 | * stripe size. This should result in better allocation on RAID setups. If | |
152 | * not, we search in the specific group using bitmap for best extents. The | |
153 | * tunable min_to_scan and max_to_scan control the behaviour here. | |
154 | * min_to_scan indicate how long the mballoc __must__ look for a best | |
155 | * extent and max_to_scan indicates how long the mballoc __can__ look for a | |
156 | * best extent in the found extents. Searching for the blocks starts with | |
157 | * the group specified as the goal value in allocation context via | |
158 | * ac_g_ex. Each group is first checked based on the criteria whether it | |
159 | * can be used for allocation. ext4_mb_good_group explains how the groups are | |
160 | * checked. | |
161 | * | |
162 | * Both the prealloc space are getting populated as above. So for the first | |
163 | * request we will hit the buddy cache which will result in this prealloc | |
164 | * space getting filled. The prealloc space is then later used for the | |
165 | * subsequent request. | |
166 | */ | |
167 | ||
168 | /* | |
169 | * mballoc operates on the following data: | |
170 | * - on-disk bitmap | |
171 | * - in-core buddy (actually includes buddy and bitmap) | |
172 | * - preallocation descriptors (PAs) | |
173 | * | |
174 | * there are two types of preallocations: | |
175 | * - inode | |
176 | * assiged to specific inode and can be used for this inode only. | |
177 | * it describes part of inode's space preallocated to specific | |
178 | * physical blocks. any block from that preallocated can be used | |
179 | * independent. the descriptor just tracks number of blocks left | |
180 | * unused. so, before taking some block from descriptor, one must | |
181 | * make sure corresponded logical block isn't allocated yet. this | |
182 | * also means that freeing any block within descriptor's range | |
183 | * must discard all preallocated blocks. | |
184 | * - locality group | |
185 | * assigned to specific locality group which does not translate to | |
186 | * permanent set of inodes: inode can join and leave group. space | |
187 | * from this type of preallocation can be used for any inode. thus | |
188 | * it's consumed from the beginning to the end. | |
189 | * | |
190 | * relation between them can be expressed as: | |
191 | * in-core buddy = on-disk bitmap + preallocation descriptors | |
192 | * | |
193 | * this mean blocks mballoc considers used are: | |
194 | * - allocated blocks (persistent) | |
195 | * - preallocated blocks (non-persistent) | |
196 | * | |
197 | * consistency in mballoc world means that at any time a block is either | |
198 | * free or used in ALL structures. notice: "any time" should not be read | |
199 | * literally -- time is discrete and delimited by locks. | |
200 | * | |
201 | * to keep it simple, we don't use block numbers, instead we count number of | |
202 | * blocks: how many blocks marked used/free in on-disk bitmap, buddy and PA. | |
203 | * | |
204 | * all operations can be expressed as: | |
205 | * - init buddy: buddy = on-disk + PAs | |
206 | * - new PA: buddy += N; PA = N | |
207 | * - use inode PA: on-disk += N; PA -= N | |
208 | * - discard inode PA buddy -= on-disk - PA; PA = 0 | |
209 | * - use locality group PA on-disk += N; PA -= N | |
210 | * - discard locality group PA buddy -= PA; PA = 0 | |
211 | * note: 'buddy -= on-disk - PA' is used to show that on-disk bitmap | |
212 | * is used in real operation because we can't know actual used | |
213 | * bits from PA, only from on-disk bitmap | |
214 | * | |
215 | * if we follow this strict logic, then all operations above should be atomic. | |
216 | * given some of them can block, we'd have to use something like semaphores | |
217 | * killing performance on high-end SMP hardware. let's try to relax it using | |
218 | * the following knowledge: | |
219 | * 1) if buddy is referenced, it's already initialized | |
220 | * 2) while block is used in buddy and the buddy is referenced, | |
221 | * nobody can re-allocate that block | |
222 | * 3) we work on bitmaps and '+' actually means 'set bits'. if on-disk has | |
223 | * bit set and PA claims same block, it's OK. IOW, one can set bit in | |
224 | * on-disk bitmap if buddy has same bit set or/and PA covers corresponded | |
225 | * block | |
226 | * | |
227 | * so, now we're building a concurrency table: | |
228 | * - init buddy vs. | |
229 | * - new PA | |
230 | * blocks for PA are allocated in the buddy, buddy must be referenced | |
231 | * until PA is linked to allocation group to avoid concurrent buddy init | |
232 | * - use inode PA | |
233 | * we need to make sure that either on-disk bitmap or PA has uptodate data | |
234 | * given (3) we care that PA-=N operation doesn't interfere with init | |
235 | * - discard inode PA | |
236 | * the simplest way would be to have buddy initialized by the discard | |
237 | * - use locality group PA | |
238 | * again PA-=N must be serialized with init | |
239 | * - discard locality group PA | |
240 | * the simplest way would be to have buddy initialized by the discard | |
241 | * - new PA vs. | |
242 | * - use inode PA | |
243 | * i_data_sem serializes them | |
244 | * - discard inode PA | |
245 | * discard process must wait until PA isn't used by another process | |
246 | * - use locality group PA | |
247 | * some mutex should serialize them | |
248 | * - discard locality group PA | |
249 | * discard process must wait until PA isn't used by another process | |
250 | * - use inode PA | |
251 | * - use inode PA | |
252 | * i_data_sem or another mutex should serializes them | |
253 | * - discard inode PA | |
254 | * discard process must wait until PA isn't used by another process | |
255 | * - use locality group PA | |
256 | * nothing wrong here -- they're different PAs covering different blocks | |
257 | * - discard locality group PA | |
258 | * discard process must wait until PA isn't used by another process | |
259 | * | |
260 | * now we're ready to make few consequences: | |
261 | * - PA is referenced and while it is no discard is possible | |
262 | * - PA is referenced until block isn't marked in on-disk bitmap | |
263 | * - PA changes only after on-disk bitmap | |
264 | * - discard must not compete with init. either init is done before | |
265 | * any discard or they're serialized somehow | |
266 | * - buddy init as sum of on-disk bitmap and PAs is done atomically | |
267 | * | |
268 | * a special case when we've used PA to emptiness. no need to modify buddy | |
269 | * in this case, but we should care about concurrent init | |
270 | * | |
271 | */ | |
272 | ||
273 | /* | |
274 | * Logic in few words: | |
275 | * | |
276 | * - allocation: | |
277 | * load group | |
278 | * find blocks | |
279 | * mark bits in on-disk bitmap | |
280 | * release group | |
281 | * | |
282 | * - use preallocation: | |
283 | * find proper PA (per-inode or group) | |
284 | * load group | |
285 | * mark bits in on-disk bitmap | |
286 | * release group | |
287 | * release PA | |
288 | * | |
289 | * - free: | |
290 | * load group | |
291 | * mark bits in on-disk bitmap | |
292 | * release group | |
293 | * | |
294 | * - discard preallocations in group: | |
295 | * mark PAs deleted | |
296 | * move them onto local list | |
297 | * load on-disk bitmap | |
298 | * load group | |
299 | * remove PA from object (inode or locality group) | |
300 | * mark free blocks in-core | |
301 | * | |
302 | * - discard inode's preallocations: | |
303 | */ | |
304 | ||
305 | /* | |
306 | * Locking rules | |
307 | * | |
308 | * Locks: | |
309 | * - bitlock on a group (group) | |
310 | * - object (inode/locality) (object) | |
311 | * - per-pa lock (pa) | |
312 | * | |
313 | * Paths: | |
314 | * - new pa | |
315 | * object | |
316 | * group | |
317 | * | |
318 | * - find and use pa: | |
319 | * pa | |
320 | * | |
321 | * - release consumed pa: | |
322 | * pa | |
323 | * group | |
324 | * object | |
325 | * | |
326 | * - generate in-core bitmap: | |
327 | * group | |
328 | * pa | |
329 | * | |
330 | * - discard all for given object (inode, locality group): | |
331 | * object | |
332 | * pa | |
333 | * group | |
334 | * | |
335 | * - discard all for given group: | |
336 | * group | |
337 | * pa | |
338 | * group | |
339 | * object | |
340 | * | |
341 | */ | |
342 | static struct kmem_cache *ext4_pspace_cachep; | |
343 | static struct kmem_cache *ext4_ac_cachep; | |
344 | static struct kmem_cache *ext4_free_data_cachep; | |
345 | ||
346 | /* We create slab caches for groupinfo data structures based on the | |
347 | * superblock block size. There will be one per mounted filesystem for | |
348 | * each unique s_blocksize_bits */ | |
349 | #define NR_GRPINFO_CACHES 8 | |
350 | static struct kmem_cache *ext4_groupinfo_caches[NR_GRPINFO_CACHES]; | |
351 | ||
352 | static const char *ext4_groupinfo_slab_names[NR_GRPINFO_CACHES] = { | |
353 | "ext4_groupinfo_1k", "ext4_groupinfo_2k", "ext4_groupinfo_4k", | |
354 | "ext4_groupinfo_8k", "ext4_groupinfo_16k", "ext4_groupinfo_32k", | |
355 | "ext4_groupinfo_64k", "ext4_groupinfo_128k" | |
356 | }; | |
357 | ||
358 | static void ext4_mb_generate_from_pa(struct super_block *sb, void *bitmap, | |
359 | ext4_group_t group); | |
360 | static void ext4_mb_generate_from_freelist(struct super_block *sb, void *bitmap, | |
361 | ext4_group_t group); | |
362 | static void ext4_free_data_callback(struct super_block *sb, | |
363 | struct ext4_journal_cb_entry *jce, int rc); | |
364 | ||
365 | static inline void *mb_correct_addr_and_bit(int *bit, void *addr) | |
366 | { | |
367 | #if BITS_PER_LONG == 64 | |
368 | *bit += ((unsigned long) addr & 7UL) << 3; | |
369 | addr = (void *) ((unsigned long) addr & ~7UL); | |
370 | #elif BITS_PER_LONG == 32 | |
371 | *bit += ((unsigned long) addr & 3UL) << 3; | |
372 | addr = (void *) ((unsigned long) addr & ~3UL); | |
373 | #else | |
374 | #error "how many bits you are?!" | |
375 | #endif | |
376 | return addr; | |
377 | } | |
378 | ||
379 | static inline int mb_test_bit(int bit, void *addr) | |
380 | { | |
381 | /* | |
382 | * ext4_test_bit on architecture like powerpc | |
383 | * needs unsigned long aligned address | |
384 | */ | |
385 | addr = mb_correct_addr_and_bit(&bit, addr); | |
386 | return ext4_test_bit(bit, addr); | |
387 | } | |
388 | ||
389 | static inline void mb_set_bit(int bit, void *addr) | |
390 | { | |
391 | addr = mb_correct_addr_and_bit(&bit, addr); | |
392 | ext4_set_bit(bit, addr); | |
393 | } | |
394 | ||
395 | static inline void mb_clear_bit(int bit, void *addr) | |
396 | { | |
397 | addr = mb_correct_addr_and_bit(&bit, addr); | |
398 | ext4_clear_bit(bit, addr); | |
399 | } | |
400 | ||
401 | static inline int mb_find_next_zero_bit(void *addr, int max, int start) | |
402 | { | |
403 | int fix = 0, ret, tmpmax; | |
404 | addr = mb_correct_addr_and_bit(&fix, addr); | |
405 | tmpmax = max + fix; | |
406 | start += fix; | |
407 | ||
408 | ret = ext4_find_next_zero_bit(addr, tmpmax, start) - fix; | |
409 | if (ret > max) | |
410 | return max; | |
411 | return ret; | |
412 | } | |
413 | ||
414 | static inline int mb_find_next_bit(void *addr, int max, int start) | |
415 | { | |
416 | int fix = 0, ret, tmpmax; | |
417 | addr = mb_correct_addr_and_bit(&fix, addr); | |
418 | tmpmax = max + fix; | |
419 | start += fix; | |
420 | ||
421 | ret = ext4_find_next_bit(addr, tmpmax, start) - fix; | |
422 | if (ret > max) | |
423 | return max; | |
424 | return ret; | |
425 | } | |
426 | ||
427 | static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max) | |
428 | { | |
429 | char *bb; | |
430 | ||
431 | BUG_ON(e4b->bd_bitmap == e4b->bd_buddy); | |
432 | BUG_ON(max == NULL); | |
433 | ||
434 | if (order > e4b->bd_blkbits + 1) { | |
435 | *max = 0; | |
436 | return NULL; | |
437 | } | |
438 | ||
439 | /* at order 0 we see each particular block */ | |
440 | if (order == 0) { | |
441 | *max = 1 << (e4b->bd_blkbits + 3); | |
442 | return e4b->bd_bitmap; | |
443 | } | |
444 | ||
445 | bb = e4b->bd_buddy + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order]; | |
446 | *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order]; | |
447 | ||
448 | return bb; | |
449 | } | |
450 | ||
451 | #ifdef DOUBLE_CHECK | |
452 | static void mb_free_blocks_double(struct inode *inode, struct ext4_buddy *e4b, | |
453 | int first, int count) | |
454 | { | |
455 | int i; | |
456 | struct super_block *sb = e4b->bd_sb; | |
457 | ||
458 | if (unlikely(e4b->bd_info->bb_bitmap == NULL)) | |
459 | return; | |
460 | assert_spin_locked(ext4_group_lock_ptr(sb, e4b->bd_group)); | |
461 | for (i = 0; i < count; i++) { | |
462 | if (!mb_test_bit(first + i, e4b->bd_info->bb_bitmap)) { | |
463 | ext4_fsblk_t blocknr; | |
464 | ||
465 | blocknr = ext4_group_first_block_no(sb, e4b->bd_group); | |
466 | blocknr += EXT4_C2B(EXT4_SB(sb), first + i); | |
467 | ext4_grp_locked_error(sb, e4b->bd_group, | |
468 | inode ? inode->i_ino : 0, | |
469 | blocknr, | |
470 | "freeing block already freed " | |
471 | "(bit %u)", | |
472 | first + i); | |
473 | } | |
474 | mb_clear_bit(first + i, e4b->bd_info->bb_bitmap); | |
475 | } | |
476 | } | |
477 | ||
478 | static void mb_mark_used_double(struct ext4_buddy *e4b, int first, int count) | |
479 | { | |
480 | int i; | |
481 | ||
482 | if (unlikely(e4b->bd_info->bb_bitmap == NULL)) | |
483 | return; | |
484 | assert_spin_locked(ext4_group_lock_ptr(e4b->bd_sb, e4b->bd_group)); | |
485 | for (i = 0; i < count; i++) { | |
486 | BUG_ON(mb_test_bit(first + i, e4b->bd_info->bb_bitmap)); | |
487 | mb_set_bit(first + i, e4b->bd_info->bb_bitmap); | |
488 | } | |
489 | } | |
490 | ||
491 | static void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap) | |
492 | { | |
493 | if (memcmp(e4b->bd_info->bb_bitmap, bitmap, e4b->bd_sb->s_blocksize)) { | |
494 | unsigned char *b1, *b2; | |
495 | int i; | |
496 | b1 = (unsigned char *) e4b->bd_info->bb_bitmap; | |
497 | b2 = (unsigned char *) bitmap; | |
498 | for (i = 0; i < e4b->bd_sb->s_blocksize; i++) { | |
499 | if (b1[i] != b2[i]) { | |
500 | ext4_msg(e4b->bd_sb, KERN_ERR, | |
501 | "corruption in group %u " | |
502 | "at byte %u(%u): %x in copy != %x " | |
503 | "on disk/prealloc", | |
504 | e4b->bd_group, i, i * 8, b1[i], b2[i]); | |
505 | BUG(); | |
506 | } | |
507 | } | |
508 | } | |
509 | } | |
510 | ||
511 | #else | |
512 | static inline void mb_free_blocks_double(struct inode *inode, | |
513 | struct ext4_buddy *e4b, int first, int count) | |
514 | { | |
515 | return; | |
516 | } | |
517 | static inline void mb_mark_used_double(struct ext4_buddy *e4b, | |
518 | int first, int count) | |
519 | { | |
520 | return; | |
521 | } | |
522 | static inline void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap) | |
523 | { | |
524 | return; | |
525 | } | |
526 | #endif | |
527 | ||
528 | #ifdef AGGRESSIVE_CHECK | |
529 | ||
530 | #define MB_CHECK_ASSERT(assert) \ | |
531 | do { \ | |
532 | if (!(assert)) { \ | |
533 | printk(KERN_EMERG \ | |
534 | "Assertion failure in %s() at %s:%d: \"%s\"\n", \ | |
535 | function, file, line, # assert); \ | |
536 | BUG(); \ | |
537 | } \ | |
538 | } while (0) | |
539 | ||
540 | static int __mb_check_buddy(struct ext4_buddy *e4b, char *file, | |
541 | const char *function, int line) | |
542 | { | |
543 | struct super_block *sb = e4b->bd_sb; | |
544 | int order = e4b->bd_blkbits + 1; | |
545 | int max; | |
546 | int max2; | |
547 | int i; | |
548 | int j; | |
549 | int k; | |
550 | int count; | |
551 | struct ext4_group_info *grp; | |
552 | int fragments = 0; | |
553 | int fstart; | |
554 | struct list_head *cur; | |
555 | void *buddy; | |
556 | void *buddy2; | |
557 | ||
558 | { | |
559 | static int mb_check_counter; | |
560 | if (mb_check_counter++ % 100 != 0) | |
561 | return 0; | |
562 | } | |
563 | ||
564 | while (order > 1) { | |
565 | buddy = mb_find_buddy(e4b, order, &max); | |
566 | MB_CHECK_ASSERT(buddy); | |
567 | buddy2 = mb_find_buddy(e4b, order - 1, &max2); | |
568 | MB_CHECK_ASSERT(buddy2); | |
569 | MB_CHECK_ASSERT(buddy != buddy2); | |
570 | MB_CHECK_ASSERT(max * 2 == max2); | |
571 | ||
572 | count = 0; | |
573 | for (i = 0; i < max; i++) { | |
574 | ||
575 | if (mb_test_bit(i, buddy)) { | |
576 | /* only single bit in buddy2 may be 1 */ | |
577 | if (!mb_test_bit(i << 1, buddy2)) { | |
578 | MB_CHECK_ASSERT( | |
579 | mb_test_bit((i<<1)+1, buddy2)); | |
580 | } else if (!mb_test_bit((i << 1) + 1, buddy2)) { | |
581 | MB_CHECK_ASSERT( | |
582 | mb_test_bit(i << 1, buddy2)); | |
583 | } | |
584 | continue; | |
585 | } | |
586 | ||
587 | /* both bits in buddy2 must be 1 */ | |
588 | MB_CHECK_ASSERT(mb_test_bit(i << 1, buddy2)); | |
589 | MB_CHECK_ASSERT(mb_test_bit((i << 1) + 1, buddy2)); | |
590 | ||
591 | for (j = 0; j < (1 << order); j++) { | |
592 | k = (i * (1 << order)) + j; | |
593 | MB_CHECK_ASSERT( | |
594 | !mb_test_bit(k, e4b->bd_bitmap)); | |
595 | } | |
596 | count++; | |
597 | } | |
598 | MB_CHECK_ASSERT(e4b->bd_info->bb_counters[order] == count); | |
599 | order--; | |
600 | } | |
601 | ||
602 | fstart = -1; | |
603 | buddy = mb_find_buddy(e4b, 0, &max); | |
604 | for (i = 0; i < max; i++) { | |
605 | if (!mb_test_bit(i, buddy)) { | |
606 | MB_CHECK_ASSERT(i >= e4b->bd_info->bb_first_free); | |
607 | if (fstart == -1) { | |
608 | fragments++; | |
609 | fstart = i; | |
610 | } | |
611 | continue; | |
612 | } | |
613 | fstart = -1; | |
614 | /* check used bits only */ | |
615 | for (j = 0; j < e4b->bd_blkbits + 1; j++) { | |
616 | buddy2 = mb_find_buddy(e4b, j, &max2); | |
617 | k = i >> j; | |
618 | MB_CHECK_ASSERT(k < max2); | |
619 | MB_CHECK_ASSERT(mb_test_bit(k, buddy2)); | |
620 | } | |
621 | } | |
622 | MB_CHECK_ASSERT(!EXT4_MB_GRP_NEED_INIT(e4b->bd_info)); | |
623 | MB_CHECK_ASSERT(e4b->bd_info->bb_fragments == fragments); | |
624 | ||
625 | grp = ext4_get_group_info(sb, e4b->bd_group); | |
626 | list_for_each(cur, &grp->bb_prealloc_list) { | |
627 | ext4_group_t groupnr; | |
628 | struct ext4_prealloc_space *pa; | |
629 | pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); | |
630 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &groupnr, &k); | |
631 | MB_CHECK_ASSERT(groupnr == e4b->bd_group); | |
632 | for (i = 0; i < pa->pa_len; i++) | |
633 | MB_CHECK_ASSERT(mb_test_bit(k + i, buddy)); | |
634 | } | |
635 | return 0; | |
636 | } | |
637 | #undef MB_CHECK_ASSERT | |
638 | #define mb_check_buddy(e4b) __mb_check_buddy(e4b, \ | |
639 | __FILE__, __func__, __LINE__) | |
640 | #else | |
641 | #define mb_check_buddy(e4b) | |
642 | #endif | |
643 | ||
644 | /* | |
645 | * Divide blocks started from @first with length @len into | |
646 | * smaller chunks with power of 2 blocks. | |
647 | * Clear the bits in bitmap which the blocks of the chunk(s) covered, | |
648 | * then increase bb_counters[] for corresponded chunk size. | |
649 | */ | |
650 | static void ext4_mb_mark_free_simple(struct super_block *sb, | |
651 | void *buddy, ext4_grpblk_t first, ext4_grpblk_t len, | |
652 | struct ext4_group_info *grp) | |
653 | { | |
654 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
655 | ext4_grpblk_t min; | |
656 | ext4_grpblk_t max; | |
657 | ext4_grpblk_t chunk; | |
658 | unsigned short border; | |
659 | ||
660 | BUG_ON(len > EXT4_CLUSTERS_PER_GROUP(sb)); | |
661 | ||
662 | border = 2 << sb->s_blocksize_bits; | |
663 | ||
664 | while (len > 0) { | |
665 | /* find how many blocks can be covered since this position */ | |
666 | max = ffs(first | border) - 1; | |
667 | ||
668 | /* find how many blocks of power 2 we need to mark */ | |
669 | min = fls(len) - 1; | |
670 | ||
671 | if (max < min) | |
672 | min = max; | |
673 | chunk = 1 << min; | |
674 | ||
675 | /* mark multiblock chunks only */ | |
676 | grp->bb_counters[min]++; | |
677 | if (min > 0) | |
678 | mb_clear_bit(first >> min, | |
679 | buddy + sbi->s_mb_offsets[min]); | |
680 | ||
681 | len -= chunk; | |
682 | first += chunk; | |
683 | } | |
684 | } | |
685 | ||
686 | /* | |
687 | * Cache the order of the largest free extent we have available in this block | |
688 | * group. | |
689 | */ | |
690 | static void | |
691 | mb_set_largest_free_order(struct super_block *sb, struct ext4_group_info *grp) | |
692 | { | |
693 | int i; | |
694 | int bits; | |
695 | ||
696 | grp->bb_largest_free_order = -1; /* uninit */ | |
697 | ||
698 | bits = sb->s_blocksize_bits + 1; | |
699 | for (i = bits; i >= 0; i--) { | |
700 | if (grp->bb_counters[i] > 0) { | |
701 | grp->bb_largest_free_order = i; | |
702 | break; | |
703 | } | |
704 | } | |
705 | } | |
706 | ||
707 | static noinline_for_stack | |
708 | void ext4_mb_generate_buddy(struct super_block *sb, | |
709 | void *buddy, void *bitmap, ext4_group_t group) | |
710 | { | |
711 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
712 | ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb); | |
713 | ext4_grpblk_t i = 0; | |
714 | ext4_grpblk_t first; | |
715 | ext4_grpblk_t len; | |
716 | unsigned free = 0; | |
717 | unsigned fragments = 0; | |
718 | unsigned long long period = get_cycles(); | |
719 | ||
720 | /* initialize buddy from bitmap which is aggregation | |
721 | * of on-disk bitmap and preallocations */ | |
722 | i = mb_find_next_zero_bit(bitmap, max, 0); | |
723 | grp->bb_first_free = i; | |
724 | while (i < max) { | |
725 | fragments++; | |
726 | first = i; | |
727 | i = mb_find_next_bit(bitmap, max, i); | |
728 | len = i - first; | |
729 | free += len; | |
730 | if (len > 1) | |
731 | ext4_mb_mark_free_simple(sb, buddy, first, len, grp); | |
732 | else | |
733 | grp->bb_counters[0]++; | |
734 | if (i < max) | |
735 | i = mb_find_next_zero_bit(bitmap, max, i); | |
736 | } | |
737 | grp->bb_fragments = fragments; | |
738 | ||
739 | if (free != grp->bb_free) { | |
740 | ext4_grp_locked_error(sb, group, 0, 0, | |
741 | "%u clusters in bitmap, %u in gd", | |
742 | free, grp->bb_free); | |
743 | /* | |
744 | * If we intent to continue, we consider group descritor | |
745 | * corrupt and update bb_free using bitmap value | |
746 | */ | |
747 | grp->bb_free = free; | |
748 | } | |
749 | mb_set_largest_free_order(sb, grp); | |
750 | ||
751 | clear_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, &(grp->bb_state)); | |
752 | ||
753 | period = get_cycles() - period; | |
754 | spin_lock(&EXT4_SB(sb)->s_bal_lock); | |
755 | EXT4_SB(sb)->s_mb_buddies_generated++; | |
756 | EXT4_SB(sb)->s_mb_generation_time += period; | |
757 | spin_unlock(&EXT4_SB(sb)->s_bal_lock); | |
758 | } | |
759 | ||
760 | /* The buddy information is attached the buddy cache inode | |
761 | * for convenience. The information regarding each group | |
762 | * is loaded via ext4_mb_load_buddy. The information involve | |
763 | * block bitmap and buddy information. The information are | |
764 | * stored in the inode as | |
765 | * | |
766 | * { page } | |
767 | * [ group 0 bitmap][ group 0 buddy] [group 1][ group 1]... | |
768 | * | |
769 | * | |
770 | * one block each for bitmap and buddy information. | |
771 | * So for each group we take up 2 blocks. A page can | |
772 | * contain blocks_per_page (PAGE_CACHE_SIZE / blocksize) blocks. | |
773 | * So it can have information regarding groups_per_page which | |
774 | * is blocks_per_page/2 | |
775 | * | |
776 | * Locking note: This routine takes the block group lock of all groups | |
777 | * for this page; do not hold this lock when calling this routine! | |
778 | */ | |
779 | ||
780 | static int ext4_mb_init_cache(struct page *page, char *incore) | |
781 | { | |
782 | ext4_group_t ngroups; | |
783 | int blocksize; | |
784 | int blocks_per_page; | |
785 | int groups_per_page; | |
786 | int err = 0; | |
787 | int i; | |
788 | ext4_group_t first_group, group; | |
789 | int first_block; | |
790 | struct super_block *sb; | |
791 | struct buffer_head *bhs; | |
792 | struct buffer_head **bh = NULL; | |
793 | struct inode *inode; | |
794 | char *data; | |
795 | char *bitmap; | |
796 | struct ext4_group_info *grinfo; | |
797 | ||
798 | mb_debug(1, "init page %lu\n", page->index); | |
799 | ||
800 | inode = page->mapping->host; | |
801 | sb = inode->i_sb; | |
802 | ngroups = ext4_get_groups_count(sb); | |
803 | blocksize = 1 << inode->i_blkbits; | |
804 | blocks_per_page = PAGE_CACHE_SIZE / blocksize; | |
805 | ||
806 | groups_per_page = blocks_per_page >> 1; | |
807 | if (groups_per_page == 0) | |
808 | groups_per_page = 1; | |
809 | ||
810 | /* allocate buffer_heads to read bitmaps */ | |
811 | if (groups_per_page > 1) { | |
812 | i = sizeof(struct buffer_head *) * groups_per_page; | |
813 | bh = kzalloc(i, GFP_NOFS); | |
814 | if (bh == NULL) { | |
815 | err = -ENOMEM; | |
816 | goto out; | |
817 | } | |
818 | } else | |
819 | bh = &bhs; | |
820 | ||
821 | first_group = page->index * blocks_per_page / 2; | |
822 | ||
823 | /* read all groups the page covers into the cache */ | |
824 | for (i = 0, group = first_group; i < groups_per_page; i++, group++) { | |
825 | if (group >= ngroups) | |
826 | break; | |
827 | ||
828 | grinfo = ext4_get_group_info(sb, group); | |
829 | /* | |
830 | * If page is uptodate then we came here after online resize | |
831 | * which added some new uninitialized group info structs, so | |
832 | * we must skip all initialized uptodate buddies on the page, | |
833 | * which may be currently in use by an allocating task. | |
834 | */ | |
835 | if (PageUptodate(page) && !EXT4_MB_GRP_NEED_INIT(grinfo)) { | |
836 | bh[i] = NULL; | |
837 | continue; | |
838 | } | |
839 | if (!(bh[i] = ext4_read_block_bitmap_nowait(sb, group))) { | |
840 | err = -ENOMEM; | |
841 | goto out; | |
842 | } | |
843 | mb_debug(1, "read bitmap for group %u\n", group); | |
844 | } | |
845 | ||
846 | /* wait for I/O completion */ | |
847 | for (i = 0, group = first_group; i < groups_per_page; i++, group++) { | |
848 | if (bh[i] && ext4_wait_block_bitmap(sb, group, bh[i])) { | |
849 | err = -EIO; | |
850 | goto out; | |
851 | } | |
852 | } | |
853 | ||
854 | first_block = page->index * blocks_per_page; | |
855 | for (i = 0; i < blocks_per_page; i++) { | |
856 | int group; | |
857 | ||
858 | group = (first_block + i) >> 1; | |
859 | if (group >= ngroups) | |
860 | break; | |
861 | ||
862 | if (!bh[group - first_group]) | |
863 | /* skip initialized uptodate buddy */ | |
864 | continue; | |
865 | ||
866 | /* | |
867 | * data carry information regarding this | |
868 | * particular group in the format specified | |
869 | * above | |
870 | * | |
871 | */ | |
872 | data = page_address(page) + (i * blocksize); | |
873 | bitmap = bh[group - first_group]->b_data; | |
874 | ||
875 | /* | |
876 | * We place the buddy block and bitmap block | |
877 | * close together | |
878 | */ | |
879 | if ((first_block + i) & 1) { | |
880 | /* this is block of buddy */ | |
881 | BUG_ON(incore == NULL); | |
882 | mb_debug(1, "put buddy for group %u in page %lu/%x\n", | |
883 | group, page->index, i * blocksize); | |
884 | trace_ext4_mb_buddy_bitmap_load(sb, group); | |
885 | grinfo = ext4_get_group_info(sb, group); | |
886 | grinfo->bb_fragments = 0; | |
887 | memset(grinfo->bb_counters, 0, | |
888 | sizeof(*grinfo->bb_counters) * | |
889 | (sb->s_blocksize_bits+2)); | |
890 | /* | |
891 | * incore got set to the group block bitmap below | |
892 | */ | |
893 | ext4_lock_group(sb, group); | |
894 | /* init the buddy */ | |
895 | memset(data, 0xff, blocksize); | |
896 | ext4_mb_generate_buddy(sb, data, incore, group); | |
897 | ext4_unlock_group(sb, group); | |
898 | incore = NULL; | |
899 | } else { | |
900 | /* this is block of bitmap */ | |
901 | BUG_ON(incore != NULL); | |
902 | mb_debug(1, "put bitmap for group %u in page %lu/%x\n", | |
903 | group, page->index, i * blocksize); | |
904 | trace_ext4_mb_bitmap_load(sb, group); | |
905 | ||
906 | /* see comments in ext4_mb_put_pa() */ | |
907 | ext4_lock_group(sb, group); | |
908 | memcpy(data, bitmap, blocksize); | |
909 | ||
910 | /* mark all preallocated blks used in in-core bitmap */ | |
911 | ext4_mb_generate_from_pa(sb, data, group); | |
912 | ext4_mb_generate_from_freelist(sb, data, group); | |
913 | ext4_unlock_group(sb, group); | |
914 | ||
915 | /* set incore so that the buddy information can be | |
916 | * generated using this | |
917 | */ | |
918 | incore = data; | |
919 | } | |
920 | } | |
921 | SetPageUptodate(page); | |
922 | ||
923 | out: | |
924 | if (bh) { | |
925 | for (i = 0; i < groups_per_page; i++) | |
926 | brelse(bh[i]); | |
927 | if (bh != &bhs) | |
928 | kfree(bh); | |
929 | } | |
930 | return err; | |
931 | } | |
932 | ||
933 | /* | |
934 | * Lock the buddy and bitmap pages. This make sure other parallel init_group | |
935 | * on the same buddy page doesn't happen whild holding the buddy page lock. | |
936 | * Return locked buddy and bitmap pages on e4b struct. If buddy and bitmap | |
937 | * are on the same page e4b->bd_buddy_page is NULL and return value is 0. | |
938 | */ | |
939 | static int ext4_mb_get_buddy_page_lock(struct super_block *sb, | |
940 | ext4_group_t group, struct ext4_buddy *e4b) | |
941 | { | |
942 | struct inode *inode = EXT4_SB(sb)->s_buddy_cache; | |
943 | int block, pnum, poff; | |
944 | int blocks_per_page; | |
945 | struct page *page; | |
946 | ||
947 | e4b->bd_buddy_page = NULL; | |
948 | e4b->bd_bitmap_page = NULL; | |
949 | ||
950 | blocks_per_page = PAGE_CACHE_SIZE / sb->s_blocksize; | |
951 | /* | |
952 | * the buddy cache inode stores the block bitmap | |
953 | * and buddy information in consecutive blocks. | |
954 | * So for each group we need two blocks. | |
955 | */ | |
956 | block = group * 2; | |
957 | pnum = block / blocks_per_page; | |
958 | poff = block % blocks_per_page; | |
959 | page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); | |
960 | if (!page) | |
961 | return -EIO; | |
962 | BUG_ON(page->mapping != inode->i_mapping); | |
963 | e4b->bd_bitmap_page = page; | |
964 | e4b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize); | |
965 | ||
966 | if (blocks_per_page >= 2) { | |
967 | /* buddy and bitmap are on the same page */ | |
968 | return 0; | |
969 | } | |
970 | ||
971 | block++; | |
972 | pnum = block / blocks_per_page; | |
973 | page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); | |
974 | if (!page) | |
975 | return -EIO; | |
976 | BUG_ON(page->mapping != inode->i_mapping); | |
977 | e4b->bd_buddy_page = page; | |
978 | return 0; | |
979 | } | |
980 | ||
981 | static void ext4_mb_put_buddy_page_lock(struct ext4_buddy *e4b) | |
982 | { | |
983 | if (e4b->bd_bitmap_page) { | |
984 | unlock_page(e4b->bd_bitmap_page); | |
985 | page_cache_release(e4b->bd_bitmap_page); | |
986 | } | |
987 | if (e4b->bd_buddy_page) { | |
988 | unlock_page(e4b->bd_buddy_page); | |
989 | page_cache_release(e4b->bd_buddy_page); | |
990 | } | |
991 | } | |
992 | ||
993 | /* | |
994 | * Locking note: This routine calls ext4_mb_init_cache(), which takes the | |
995 | * block group lock of all groups for this page; do not hold the BG lock when | |
996 | * calling this routine! | |
997 | */ | |
998 | static noinline_for_stack | |
999 | int ext4_mb_init_group(struct super_block *sb, ext4_group_t group) | |
1000 | { | |
1001 | ||
1002 | struct ext4_group_info *this_grp; | |
1003 | struct ext4_buddy e4b; | |
1004 | struct page *page; | |
1005 | int ret = 0; | |
1006 | ||
1007 | mb_debug(1, "init group %u\n", group); | |
1008 | this_grp = ext4_get_group_info(sb, group); | |
1009 | /* | |
1010 | * This ensures that we don't reinit the buddy cache | |
1011 | * page which map to the group from which we are already | |
1012 | * allocating. If we are looking at the buddy cache we would | |
1013 | * have taken a reference using ext4_mb_load_buddy and that | |
1014 | * would have pinned buddy page to page cache. | |
1015 | */ | |
1016 | ret = ext4_mb_get_buddy_page_lock(sb, group, &e4b); | |
1017 | if (ret || !EXT4_MB_GRP_NEED_INIT(this_grp)) { | |
1018 | /* | |
1019 | * somebody initialized the group | |
1020 | * return without doing anything | |
1021 | */ | |
1022 | goto err; | |
1023 | } | |
1024 | ||
1025 | page = e4b.bd_bitmap_page; | |
1026 | ret = ext4_mb_init_cache(page, NULL); | |
1027 | if (ret) | |
1028 | goto err; | |
1029 | if (!PageUptodate(page)) { | |
1030 | ret = -EIO; | |
1031 | goto err; | |
1032 | } | |
1033 | mark_page_accessed(page); | |
1034 | ||
1035 | if (e4b.bd_buddy_page == NULL) { | |
1036 | /* | |
1037 | * If both the bitmap and buddy are in | |
1038 | * the same page we don't need to force | |
1039 | * init the buddy | |
1040 | */ | |
1041 | ret = 0; | |
1042 | goto err; | |
1043 | } | |
1044 | /* init buddy cache */ | |
1045 | page = e4b.bd_buddy_page; | |
1046 | ret = ext4_mb_init_cache(page, e4b.bd_bitmap); | |
1047 | if (ret) | |
1048 | goto err; | |
1049 | if (!PageUptodate(page)) { | |
1050 | ret = -EIO; | |
1051 | goto err; | |
1052 | } | |
1053 | mark_page_accessed(page); | |
1054 | err: | |
1055 | ext4_mb_put_buddy_page_lock(&e4b); | |
1056 | return ret; | |
1057 | } | |
1058 | ||
1059 | /* | |
1060 | * Locking note: This routine calls ext4_mb_init_cache(), which takes the | |
1061 | * block group lock of all groups for this page; do not hold the BG lock when | |
1062 | * calling this routine! | |
1063 | */ | |
1064 | static noinline_for_stack int | |
1065 | ext4_mb_load_buddy(struct super_block *sb, ext4_group_t group, | |
1066 | struct ext4_buddy *e4b) | |
1067 | { | |
1068 | int blocks_per_page; | |
1069 | int block; | |
1070 | int pnum; | |
1071 | int poff; | |
1072 | struct page *page; | |
1073 | int ret; | |
1074 | struct ext4_group_info *grp; | |
1075 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
1076 | struct inode *inode = sbi->s_buddy_cache; | |
1077 | ||
1078 | mb_debug(1, "load group %u\n", group); | |
1079 | ||
1080 | blocks_per_page = PAGE_CACHE_SIZE / sb->s_blocksize; | |
1081 | grp = ext4_get_group_info(sb, group); | |
1082 | ||
1083 | e4b->bd_blkbits = sb->s_blocksize_bits; | |
1084 | e4b->bd_info = grp; | |
1085 | e4b->bd_sb = sb; | |
1086 | e4b->bd_group = group; | |
1087 | e4b->bd_buddy_page = NULL; | |
1088 | e4b->bd_bitmap_page = NULL; | |
1089 | ||
1090 | if (unlikely(EXT4_MB_GRP_NEED_INIT(grp))) { | |
1091 | /* | |
1092 | * we need full data about the group | |
1093 | * to make a good selection | |
1094 | */ | |
1095 | ret = ext4_mb_init_group(sb, group); | |
1096 | if (ret) | |
1097 | return ret; | |
1098 | } | |
1099 | ||
1100 | /* | |
1101 | * the buddy cache inode stores the block bitmap | |
1102 | * and buddy information in consecutive blocks. | |
1103 | * So for each group we need two blocks. | |
1104 | */ | |
1105 | block = group * 2; | |
1106 | pnum = block / blocks_per_page; | |
1107 | poff = block % blocks_per_page; | |
1108 | ||
1109 | /* we could use find_or_create_page(), but it locks page | |
1110 | * what we'd like to avoid in fast path ... */ | |
1111 | page = find_get_page(inode->i_mapping, pnum); | |
1112 | if (page == NULL || !PageUptodate(page)) { | |
1113 | if (page) | |
1114 | /* | |
1115 | * drop the page reference and try | |
1116 | * to get the page with lock. If we | |
1117 | * are not uptodate that implies | |
1118 | * somebody just created the page but | |
1119 | * is yet to initialize the same. So | |
1120 | * wait for it to initialize. | |
1121 | */ | |
1122 | page_cache_release(page); | |
1123 | page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); | |
1124 | if (page) { | |
1125 | BUG_ON(page->mapping != inode->i_mapping); | |
1126 | if (!PageUptodate(page)) { | |
1127 | ret = ext4_mb_init_cache(page, NULL); | |
1128 | if (ret) { | |
1129 | unlock_page(page); | |
1130 | goto err; | |
1131 | } | |
1132 | mb_cmp_bitmaps(e4b, page_address(page) + | |
1133 | (poff * sb->s_blocksize)); | |
1134 | } | |
1135 | unlock_page(page); | |
1136 | } | |
1137 | } | |
1138 | if (page == NULL || !PageUptodate(page)) { | |
1139 | ret = -EIO; | |
1140 | goto err; | |
1141 | } | |
1142 | e4b->bd_bitmap_page = page; | |
1143 | e4b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize); | |
1144 | mark_page_accessed(page); | |
1145 | ||
1146 | block++; | |
1147 | pnum = block / blocks_per_page; | |
1148 | poff = block % blocks_per_page; | |
1149 | ||
1150 | page = find_get_page(inode->i_mapping, pnum); | |
1151 | if (page == NULL || !PageUptodate(page)) { | |
1152 | if (page) | |
1153 | page_cache_release(page); | |
1154 | page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); | |
1155 | if (page) { | |
1156 | BUG_ON(page->mapping != inode->i_mapping); | |
1157 | if (!PageUptodate(page)) { | |
1158 | ret = ext4_mb_init_cache(page, e4b->bd_bitmap); | |
1159 | if (ret) { | |
1160 | unlock_page(page); | |
1161 | goto err; | |
1162 | } | |
1163 | } | |
1164 | unlock_page(page); | |
1165 | } | |
1166 | } | |
1167 | if (page == NULL || !PageUptodate(page)) { | |
1168 | ret = -EIO; | |
1169 | goto err; | |
1170 | } | |
1171 | e4b->bd_buddy_page = page; | |
1172 | e4b->bd_buddy = page_address(page) + (poff * sb->s_blocksize); | |
1173 | mark_page_accessed(page); | |
1174 | ||
1175 | BUG_ON(e4b->bd_bitmap_page == NULL); | |
1176 | BUG_ON(e4b->bd_buddy_page == NULL); | |
1177 | ||
1178 | return 0; | |
1179 | ||
1180 | err: | |
1181 | if (page) | |
1182 | page_cache_release(page); | |
1183 | if (e4b->bd_bitmap_page) | |
1184 | page_cache_release(e4b->bd_bitmap_page); | |
1185 | if (e4b->bd_buddy_page) | |
1186 | page_cache_release(e4b->bd_buddy_page); | |
1187 | e4b->bd_buddy = NULL; | |
1188 | e4b->bd_bitmap = NULL; | |
1189 | return ret; | |
1190 | } | |
1191 | ||
1192 | static void ext4_mb_unload_buddy(struct ext4_buddy *e4b) | |
1193 | { | |
1194 | if (e4b->bd_bitmap_page) | |
1195 | page_cache_release(e4b->bd_bitmap_page); | |
1196 | if (e4b->bd_buddy_page) | |
1197 | page_cache_release(e4b->bd_buddy_page); | |
1198 | } | |
1199 | ||
1200 | ||
1201 | static int mb_find_order_for_block(struct ext4_buddy *e4b, int block) | |
1202 | { | |
1203 | int order = 1; | |
1204 | void *bb; | |
1205 | ||
1206 | BUG_ON(e4b->bd_bitmap == e4b->bd_buddy); | |
1207 | BUG_ON(block >= (1 << (e4b->bd_blkbits + 3))); | |
1208 | ||
1209 | bb = e4b->bd_buddy; | |
1210 | while (order <= e4b->bd_blkbits + 1) { | |
1211 | block = block >> 1; | |
1212 | if (!mb_test_bit(block, bb)) { | |
1213 | /* this block is part of buddy of order 'order' */ | |
1214 | return order; | |
1215 | } | |
1216 | bb += 1 << (e4b->bd_blkbits - order); | |
1217 | order++; | |
1218 | } | |
1219 | return 0; | |
1220 | } | |
1221 | ||
1222 | static void mb_clear_bits(void *bm, int cur, int len) | |
1223 | { | |
1224 | __u32 *addr; | |
1225 | ||
1226 | len = cur + len; | |
1227 | while (cur < len) { | |
1228 | if ((cur & 31) == 0 && (len - cur) >= 32) { | |
1229 | /* fast path: clear whole word at once */ | |
1230 | addr = bm + (cur >> 3); | |
1231 | *addr = 0; | |
1232 | cur += 32; | |
1233 | continue; | |
1234 | } | |
1235 | mb_clear_bit(cur, bm); | |
1236 | cur++; | |
1237 | } | |
1238 | } | |
1239 | ||
1240 | void ext4_set_bits(void *bm, int cur, int len) | |
1241 | { | |
1242 | __u32 *addr; | |
1243 | ||
1244 | len = cur + len; | |
1245 | while (cur < len) { | |
1246 | if ((cur & 31) == 0 && (len - cur) >= 32) { | |
1247 | /* fast path: set whole word at once */ | |
1248 | addr = bm + (cur >> 3); | |
1249 | *addr = 0xffffffff; | |
1250 | cur += 32; | |
1251 | continue; | |
1252 | } | |
1253 | mb_set_bit(cur, bm); | |
1254 | cur++; | |
1255 | } | |
1256 | } | |
1257 | ||
1258 | static void mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b, | |
1259 | int first, int count) | |
1260 | { | |
1261 | int block = 0; | |
1262 | int max = 0; | |
1263 | int order; | |
1264 | void *buddy; | |
1265 | void *buddy2; | |
1266 | struct super_block *sb = e4b->bd_sb; | |
1267 | ||
1268 | BUG_ON(first + count > (sb->s_blocksize << 3)); | |
1269 | assert_spin_locked(ext4_group_lock_ptr(sb, e4b->bd_group)); | |
1270 | mb_check_buddy(e4b); | |
1271 | mb_free_blocks_double(inode, e4b, first, count); | |
1272 | ||
1273 | e4b->bd_info->bb_free += count; | |
1274 | if (first < e4b->bd_info->bb_first_free) | |
1275 | e4b->bd_info->bb_first_free = first; | |
1276 | ||
1277 | /* let's maintain fragments counter */ | |
1278 | if (first != 0) | |
1279 | block = !mb_test_bit(first - 1, e4b->bd_bitmap); | |
1280 | if (first + count < EXT4_SB(sb)->s_mb_maxs[0]) | |
1281 | max = !mb_test_bit(first + count, e4b->bd_bitmap); | |
1282 | if (block && max) | |
1283 | e4b->bd_info->bb_fragments--; | |
1284 | else if (!block && !max) | |
1285 | e4b->bd_info->bb_fragments++; | |
1286 | ||
1287 | /* let's maintain buddy itself */ | |
1288 | while (count-- > 0) { | |
1289 | block = first++; | |
1290 | order = 0; | |
1291 | ||
1292 | if (!mb_test_bit(block, e4b->bd_bitmap)) { | |
1293 | ext4_fsblk_t blocknr; | |
1294 | ||
1295 | blocknr = ext4_group_first_block_no(sb, e4b->bd_group); | |
1296 | blocknr += EXT4_C2B(EXT4_SB(sb), block); | |
1297 | ext4_grp_locked_error(sb, e4b->bd_group, | |
1298 | inode ? inode->i_ino : 0, | |
1299 | blocknr, | |
1300 | "freeing already freed block " | |
1301 | "(bit %u)", block); | |
1302 | } | |
1303 | mb_clear_bit(block, e4b->bd_bitmap); | |
1304 | e4b->bd_info->bb_counters[order]++; | |
1305 | ||
1306 | /* start of the buddy */ | |
1307 | buddy = mb_find_buddy(e4b, order, &max); | |
1308 | ||
1309 | do { | |
1310 | block &= ~1UL; | |
1311 | if (mb_test_bit(block, buddy) || | |
1312 | mb_test_bit(block + 1, buddy)) | |
1313 | break; | |
1314 | ||
1315 | /* both the buddies are free, try to coalesce them */ | |
1316 | buddy2 = mb_find_buddy(e4b, order + 1, &max); | |
1317 | ||
1318 | if (!buddy2) | |
1319 | break; | |
1320 | ||
1321 | if (order > 0) { | |
1322 | /* for special purposes, we don't set | |
1323 | * free bits in bitmap */ | |
1324 | mb_set_bit(block, buddy); | |
1325 | mb_set_bit(block + 1, buddy); | |
1326 | } | |
1327 | e4b->bd_info->bb_counters[order]--; | |
1328 | e4b->bd_info->bb_counters[order]--; | |
1329 | ||
1330 | block = block >> 1; | |
1331 | order++; | |
1332 | e4b->bd_info->bb_counters[order]++; | |
1333 | ||
1334 | mb_clear_bit(block, buddy2); | |
1335 | buddy = buddy2; | |
1336 | } while (1); | |
1337 | } | |
1338 | mb_set_largest_free_order(sb, e4b->bd_info); | |
1339 | mb_check_buddy(e4b); | |
1340 | } | |
1341 | ||
1342 | static int mb_find_extent(struct ext4_buddy *e4b, int block, | |
1343 | int needed, struct ext4_free_extent *ex) | |
1344 | { | |
1345 | int next = block; | |
1346 | int max, order; | |
1347 | void *buddy; | |
1348 | ||
1349 | assert_spin_locked(ext4_group_lock_ptr(e4b->bd_sb, e4b->bd_group)); | |
1350 | BUG_ON(ex == NULL); | |
1351 | ||
1352 | buddy = mb_find_buddy(e4b, 0, &max); | |
1353 | BUG_ON(buddy == NULL); | |
1354 | BUG_ON(block >= max); | |
1355 | if (mb_test_bit(block, buddy)) { | |
1356 | ex->fe_len = 0; | |
1357 | ex->fe_start = 0; | |
1358 | ex->fe_group = 0; | |
1359 | return 0; | |
1360 | } | |
1361 | ||
1362 | /* find actual order */ | |
1363 | order = mb_find_order_for_block(e4b, block); | |
1364 | block = block >> order; | |
1365 | ||
1366 | ex->fe_len = 1 << order; | |
1367 | ex->fe_start = block << order; | |
1368 | ex->fe_group = e4b->bd_group; | |
1369 | ||
1370 | /* calc difference from given start */ | |
1371 | next = next - ex->fe_start; | |
1372 | ex->fe_len -= next; | |
1373 | ex->fe_start += next; | |
1374 | ||
1375 | while (needed > ex->fe_len && | |
1376 | (buddy = mb_find_buddy(e4b, order, &max))) { | |
1377 | ||
1378 | if (block + 1 >= max) | |
1379 | break; | |
1380 | ||
1381 | next = (block + 1) * (1 << order); | |
1382 | if (mb_test_bit(next, e4b->bd_bitmap)) | |
1383 | break; | |
1384 | ||
1385 | order = mb_find_order_for_block(e4b, next); | |
1386 | ||
1387 | block = next >> order; | |
1388 | ex->fe_len += 1 << order; | |
1389 | } | |
1390 | ||
1391 | BUG_ON(ex->fe_start + ex->fe_len > (1 << (e4b->bd_blkbits + 3))); | |
1392 | return ex->fe_len; | |
1393 | } | |
1394 | ||
1395 | static int mb_mark_used(struct ext4_buddy *e4b, struct ext4_free_extent *ex) | |
1396 | { | |
1397 | int ord; | |
1398 | int mlen = 0; | |
1399 | int max = 0; | |
1400 | int cur; | |
1401 | int start = ex->fe_start; | |
1402 | int len = ex->fe_len; | |
1403 | unsigned ret = 0; | |
1404 | int len0 = len; | |
1405 | void *buddy; | |
1406 | ||
1407 | BUG_ON(start + len > (e4b->bd_sb->s_blocksize << 3)); | |
1408 | BUG_ON(e4b->bd_group != ex->fe_group); | |
1409 | assert_spin_locked(ext4_group_lock_ptr(e4b->bd_sb, e4b->bd_group)); | |
1410 | mb_check_buddy(e4b); | |
1411 | mb_mark_used_double(e4b, start, len); | |
1412 | ||
1413 | e4b->bd_info->bb_free -= len; | |
1414 | if (e4b->bd_info->bb_first_free == start) | |
1415 | e4b->bd_info->bb_first_free += len; | |
1416 | ||
1417 | /* let's maintain fragments counter */ | |
1418 | if (start != 0) | |
1419 | mlen = !mb_test_bit(start - 1, e4b->bd_bitmap); | |
1420 | if (start + len < EXT4_SB(e4b->bd_sb)->s_mb_maxs[0]) | |
1421 | max = !mb_test_bit(start + len, e4b->bd_bitmap); | |
1422 | if (mlen && max) | |
1423 | e4b->bd_info->bb_fragments++; | |
1424 | else if (!mlen && !max) | |
1425 | e4b->bd_info->bb_fragments--; | |
1426 | ||
1427 | /* let's maintain buddy itself */ | |
1428 | while (len) { | |
1429 | ord = mb_find_order_for_block(e4b, start); | |
1430 | ||
1431 | if (((start >> ord) << ord) == start && len >= (1 << ord)) { | |
1432 | /* the whole chunk may be allocated at once! */ | |
1433 | mlen = 1 << ord; | |
1434 | buddy = mb_find_buddy(e4b, ord, &max); | |
1435 | BUG_ON((start >> ord) >= max); | |
1436 | mb_set_bit(start >> ord, buddy); | |
1437 | e4b->bd_info->bb_counters[ord]--; | |
1438 | start += mlen; | |
1439 | len -= mlen; | |
1440 | BUG_ON(len < 0); | |
1441 | continue; | |
1442 | } | |
1443 | ||
1444 | /* store for history */ | |
1445 | if (ret == 0) | |
1446 | ret = len | (ord << 16); | |
1447 | ||
1448 | /* we have to split large buddy */ | |
1449 | BUG_ON(ord <= 0); | |
1450 | buddy = mb_find_buddy(e4b, ord, &max); | |
1451 | mb_set_bit(start >> ord, buddy); | |
1452 | e4b->bd_info->bb_counters[ord]--; | |
1453 | ||
1454 | ord--; | |
1455 | cur = (start >> ord) & ~1U; | |
1456 | buddy = mb_find_buddy(e4b, ord, &max); | |
1457 | mb_clear_bit(cur, buddy); | |
1458 | mb_clear_bit(cur + 1, buddy); | |
1459 | e4b->bd_info->bb_counters[ord]++; | |
1460 | e4b->bd_info->bb_counters[ord]++; | |
1461 | } | |
1462 | mb_set_largest_free_order(e4b->bd_sb, e4b->bd_info); | |
1463 | ||
1464 | ext4_set_bits(e4b->bd_bitmap, ex->fe_start, len0); | |
1465 | mb_check_buddy(e4b); | |
1466 | ||
1467 | return ret; | |
1468 | } | |
1469 | ||
1470 | /* | |
1471 | * Must be called under group lock! | |
1472 | */ | |
1473 | static void ext4_mb_use_best_found(struct ext4_allocation_context *ac, | |
1474 | struct ext4_buddy *e4b) | |
1475 | { | |
1476 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
1477 | int ret; | |
1478 | ||
1479 | BUG_ON(ac->ac_b_ex.fe_group != e4b->bd_group); | |
1480 | BUG_ON(ac->ac_status == AC_STATUS_FOUND); | |
1481 | ||
1482 | ac->ac_b_ex.fe_len = min(ac->ac_b_ex.fe_len, ac->ac_g_ex.fe_len); | |
1483 | ac->ac_b_ex.fe_logical = ac->ac_g_ex.fe_logical; | |
1484 | ret = mb_mark_used(e4b, &ac->ac_b_ex); | |
1485 | ||
1486 | /* preallocation can change ac_b_ex, thus we store actually | |
1487 | * allocated blocks for history */ | |
1488 | ac->ac_f_ex = ac->ac_b_ex; | |
1489 | ||
1490 | ac->ac_status = AC_STATUS_FOUND; | |
1491 | ac->ac_tail = ret & 0xffff; | |
1492 | ac->ac_buddy = ret >> 16; | |
1493 | ||
1494 | /* | |
1495 | * take the page reference. We want the page to be pinned | |
1496 | * so that we don't get a ext4_mb_init_cache_call for this | |
1497 | * group until we update the bitmap. That would mean we | |
1498 | * double allocate blocks. The reference is dropped | |
1499 | * in ext4_mb_release_context | |
1500 | */ | |
1501 | ac->ac_bitmap_page = e4b->bd_bitmap_page; | |
1502 | get_page(ac->ac_bitmap_page); | |
1503 | ac->ac_buddy_page = e4b->bd_buddy_page; | |
1504 | get_page(ac->ac_buddy_page); | |
1505 | /* store last allocated for subsequent stream allocation */ | |
1506 | if (ac->ac_flags & EXT4_MB_STREAM_ALLOC) { | |
1507 | spin_lock(&sbi->s_md_lock); | |
1508 | sbi->s_mb_last_group = ac->ac_f_ex.fe_group; | |
1509 | sbi->s_mb_last_start = ac->ac_f_ex.fe_start; | |
1510 | spin_unlock(&sbi->s_md_lock); | |
1511 | } | |
1512 | } | |
1513 | ||
1514 | /* | |
1515 | * regular allocator, for general purposes allocation | |
1516 | */ | |
1517 | ||
1518 | static void ext4_mb_check_limits(struct ext4_allocation_context *ac, | |
1519 | struct ext4_buddy *e4b, | |
1520 | int finish_group) | |
1521 | { | |
1522 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
1523 | struct ext4_free_extent *bex = &ac->ac_b_ex; | |
1524 | struct ext4_free_extent *gex = &ac->ac_g_ex; | |
1525 | struct ext4_free_extent ex; | |
1526 | int max; | |
1527 | ||
1528 | if (ac->ac_status == AC_STATUS_FOUND) | |
1529 | return; | |
1530 | /* | |
1531 | * We don't want to scan for a whole year | |
1532 | */ | |
1533 | if (ac->ac_found > sbi->s_mb_max_to_scan && | |
1534 | !(ac->ac_flags & EXT4_MB_HINT_FIRST)) { | |
1535 | ac->ac_status = AC_STATUS_BREAK; | |
1536 | return; | |
1537 | } | |
1538 | ||
1539 | /* | |
1540 | * Haven't found good chunk so far, let's continue | |
1541 | */ | |
1542 | if (bex->fe_len < gex->fe_len) | |
1543 | return; | |
1544 | ||
1545 | if ((finish_group || ac->ac_found > sbi->s_mb_min_to_scan) | |
1546 | && bex->fe_group == e4b->bd_group) { | |
1547 | /* recheck chunk's availability - we don't know | |
1548 | * when it was found (within this lock-unlock | |
1549 | * period or not) */ | |
1550 | max = mb_find_extent(e4b, bex->fe_start, gex->fe_len, &ex); | |
1551 | if (max >= gex->fe_len) { | |
1552 | ext4_mb_use_best_found(ac, e4b); | |
1553 | return; | |
1554 | } | |
1555 | } | |
1556 | } | |
1557 | ||
1558 | /* | |
1559 | * The routine checks whether found extent is good enough. If it is, | |
1560 | * then the extent gets marked used and flag is set to the context | |
1561 | * to stop scanning. Otherwise, the extent is compared with the | |
1562 | * previous found extent and if new one is better, then it's stored | |
1563 | * in the context. Later, the best found extent will be used, if | |
1564 | * mballoc can't find good enough extent. | |
1565 | * | |
1566 | * FIXME: real allocation policy is to be designed yet! | |
1567 | */ | |
1568 | static void ext4_mb_measure_extent(struct ext4_allocation_context *ac, | |
1569 | struct ext4_free_extent *ex, | |
1570 | struct ext4_buddy *e4b) | |
1571 | { | |
1572 | struct ext4_free_extent *bex = &ac->ac_b_ex; | |
1573 | struct ext4_free_extent *gex = &ac->ac_g_ex; | |
1574 | ||
1575 | BUG_ON(ex->fe_len <= 0); | |
1576 | BUG_ON(ex->fe_len > EXT4_CLUSTERS_PER_GROUP(ac->ac_sb)); | |
1577 | BUG_ON(ex->fe_start >= EXT4_CLUSTERS_PER_GROUP(ac->ac_sb)); | |
1578 | BUG_ON(ac->ac_status != AC_STATUS_CONTINUE); | |
1579 | ||
1580 | ac->ac_found++; | |
1581 | ||
1582 | /* | |
1583 | * The special case - take what you catch first | |
1584 | */ | |
1585 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_FIRST)) { | |
1586 | *bex = *ex; | |
1587 | ext4_mb_use_best_found(ac, e4b); | |
1588 | return; | |
1589 | } | |
1590 | ||
1591 | /* | |
1592 | * Let's check whether the chuck is good enough | |
1593 | */ | |
1594 | if (ex->fe_len == gex->fe_len) { | |
1595 | *bex = *ex; | |
1596 | ext4_mb_use_best_found(ac, e4b); | |
1597 | return; | |
1598 | } | |
1599 | ||
1600 | /* | |
1601 | * If this is first found extent, just store it in the context | |
1602 | */ | |
1603 | if (bex->fe_len == 0) { | |
1604 | *bex = *ex; | |
1605 | return; | |
1606 | } | |
1607 | ||
1608 | /* | |
1609 | * If new found extent is better, store it in the context | |
1610 | */ | |
1611 | if (bex->fe_len < gex->fe_len) { | |
1612 | /* if the request isn't satisfied, any found extent | |
1613 | * larger than previous best one is better */ | |
1614 | if (ex->fe_len > bex->fe_len) | |
1615 | *bex = *ex; | |
1616 | } else if (ex->fe_len > gex->fe_len) { | |
1617 | /* if the request is satisfied, then we try to find | |
1618 | * an extent that still satisfy the request, but is | |
1619 | * smaller than previous one */ | |
1620 | if (ex->fe_len < bex->fe_len) | |
1621 | *bex = *ex; | |
1622 | } | |
1623 | ||
1624 | ext4_mb_check_limits(ac, e4b, 0); | |
1625 | } | |
1626 | ||
1627 | static noinline_for_stack | |
1628 | int ext4_mb_try_best_found(struct ext4_allocation_context *ac, | |
1629 | struct ext4_buddy *e4b) | |
1630 | { | |
1631 | struct ext4_free_extent ex = ac->ac_b_ex; | |
1632 | ext4_group_t group = ex.fe_group; | |
1633 | int max; | |
1634 | int err; | |
1635 | ||
1636 | BUG_ON(ex.fe_len <= 0); | |
1637 | err = ext4_mb_load_buddy(ac->ac_sb, group, e4b); | |
1638 | if (err) | |
1639 | return err; | |
1640 | ||
1641 | ext4_lock_group(ac->ac_sb, group); | |
1642 | max = mb_find_extent(e4b, ex.fe_start, ex.fe_len, &ex); | |
1643 | ||
1644 | if (max > 0) { | |
1645 | ac->ac_b_ex = ex; | |
1646 | ext4_mb_use_best_found(ac, e4b); | |
1647 | } | |
1648 | ||
1649 | ext4_unlock_group(ac->ac_sb, group); | |
1650 | ext4_mb_unload_buddy(e4b); | |
1651 | ||
1652 | return 0; | |
1653 | } | |
1654 | ||
1655 | static noinline_for_stack | |
1656 | int ext4_mb_find_by_goal(struct ext4_allocation_context *ac, | |
1657 | struct ext4_buddy *e4b) | |
1658 | { | |
1659 | ext4_group_t group = ac->ac_g_ex.fe_group; | |
1660 | int max; | |
1661 | int err; | |
1662 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
1663 | struct ext4_free_extent ex; | |
1664 | ||
1665 | if (!(ac->ac_flags & EXT4_MB_HINT_TRY_GOAL)) | |
1666 | return 0; | |
1667 | ||
1668 | err = ext4_mb_load_buddy(ac->ac_sb, group, e4b); | |
1669 | if (err) | |
1670 | return err; | |
1671 | ||
1672 | ext4_lock_group(ac->ac_sb, group); | |
1673 | max = mb_find_extent(e4b, ac->ac_g_ex.fe_start, | |
1674 | ac->ac_g_ex.fe_len, &ex); | |
1675 | ||
1676 | if (max >= ac->ac_g_ex.fe_len && ac->ac_g_ex.fe_len == sbi->s_stripe) { | |
1677 | ext4_fsblk_t start; | |
1678 | ||
1679 | start = ext4_group_first_block_no(ac->ac_sb, e4b->bd_group) + | |
1680 | ex.fe_start; | |
1681 | /* use do_div to get remainder (would be 64-bit modulo) */ | |
1682 | if (do_div(start, sbi->s_stripe) == 0) { | |
1683 | ac->ac_found++; | |
1684 | ac->ac_b_ex = ex; | |
1685 | ext4_mb_use_best_found(ac, e4b); | |
1686 | } | |
1687 | } else if (max >= ac->ac_g_ex.fe_len) { | |
1688 | BUG_ON(ex.fe_len <= 0); | |
1689 | BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group); | |
1690 | BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start); | |
1691 | ac->ac_found++; | |
1692 | ac->ac_b_ex = ex; | |
1693 | ext4_mb_use_best_found(ac, e4b); | |
1694 | } else if (max > 0 && (ac->ac_flags & EXT4_MB_HINT_MERGE)) { | |
1695 | /* Sometimes, caller may want to merge even small | |
1696 | * number of blocks to an existing extent */ | |
1697 | BUG_ON(ex.fe_len <= 0); | |
1698 | BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group); | |
1699 | BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start); | |
1700 | ac->ac_found++; | |
1701 | ac->ac_b_ex = ex; | |
1702 | ext4_mb_use_best_found(ac, e4b); | |
1703 | } | |
1704 | ext4_unlock_group(ac->ac_sb, group); | |
1705 | ext4_mb_unload_buddy(e4b); | |
1706 | ||
1707 | return 0; | |
1708 | } | |
1709 | ||
1710 | /* | |
1711 | * The routine scans buddy structures (not bitmap!) from given order | |
1712 | * to max order and tries to find big enough chunk to satisfy the req | |
1713 | */ | |
1714 | static noinline_for_stack | |
1715 | void ext4_mb_simple_scan_group(struct ext4_allocation_context *ac, | |
1716 | struct ext4_buddy *e4b) | |
1717 | { | |
1718 | struct super_block *sb = ac->ac_sb; | |
1719 | struct ext4_group_info *grp = e4b->bd_info; | |
1720 | void *buddy; | |
1721 | int i; | |
1722 | int k; | |
1723 | int max; | |
1724 | ||
1725 | BUG_ON(ac->ac_2order <= 0); | |
1726 | for (i = ac->ac_2order; i <= sb->s_blocksize_bits + 1; i++) { | |
1727 | if (grp->bb_counters[i] == 0) | |
1728 | continue; | |
1729 | ||
1730 | buddy = mb_find_buddy(e4b, i, &max); | |
1731 | BUG_ON(buddy == NULL); | |
1732 | ||
1733 | k = mb_find_next_zero_bit(buddy, max, 0); | |
1734 | BUG_ON(k >= max); | |
1735 | ||
1736 | ac->ac_found++; | |
1737 | ||
1738 | ac->ac_b_ex.fe_len = 1 << i; | |
1739 | ac->ac_b_ex.fe_start = k << i; | |
1740 | ac->ac_b_ex.fe_group = e4b->bd_group; | |
1741 | ||
1742 | ext4_mb_use_best_found(ac, e4b); | |
1743 | ||
1744 | BUG_ON(ac->ac_b_ex.fe_len != ac->ac_g_ex.fe_len); | |
1745 | ||
1746 | if (EXT4_SB(sb)->s_mb_stats) | |
1747 | atomic_inc(&EXT4_SB(sb)->s_bal_2orders); | |
1748 | ||
1749 | break; | |
1750 | } | |
1751 | } | |
1752 | ||
1753 | /* | |
1754 | * The routine scans the group and measures all found extents. | |
1755 | * In order to optimize scanning, caller must pass number of | |
1756 | * free blocks in the group, so the routine can know upper limit. | |
1757 | */ | |
1758 | static noinline_for_stack | |
1759 | void ext4_mb_complex_scan_group(struct ext4_allocation_context *ac, | |
1760 | struct ext4_buddy *e4b) | |
1761 | { | |
1762 | struct super_block *sb = ac->ac_sb; | |
1763 | void *bitmap = e4b->bd_bitmap; | |
1764 | struct ext4_free_extent ex; | |
1765 | int i; | |
1766 | int free; | |
1767 | ||
1768 | free = e4b->bd_info->bb_free; | |
1769 | BUG_ON(free <= 0); | |
1770 | ||
1771 | i = e4b->bd_info->bb_first_free; | |
1772 | ||
1773 | while (free && ac->ac_status == AC_STATUS_CONTINUE) { | |
1774 | i = mb_find_next_zero_bit(bitmap, | |
1775 | EXT4_CLUSTERS_PER_GROUP(sb), i); | |
1776 | if (i >= EXT4_CLUSTERS_PER_GROUP(sb)) { | |
1777 | /* | |
1778 | * IF we have corrupt bitmap, we won't find any | |
1779 | * free blocks even though group info says we | |
1780 | * we have free blocks | |
1781 | */ | |
1782 | ext4_grp_locked_error(sb, e4b->bd_group, 0, 0, | |
1783 | "%d free clusters as per " | |
1784 | "group info. But bitmap says 0", | |
1785 | free); | |
1786 | break; | |
1787 | } | |
1788 | ||
1789 | mb_find_extent(e4b, i, ac->ac_g_ex.fe_len, &ex); | |
1790 | BUG_ON(ex.fe_len <= 0); | |
1791 | if (free < ex.fe_len) { | |
1792 | ext4_grp_locked_error(sb, e4b->bd_group, 0, 0, | |
1793 | "%d free clusters as per " | |
1794 | "group info. But got %d blocks", | |
1795 | free, ex.fe_len); | |
1796 | /* | |
1797 | * The number of free blocks differs. This mostly | |
1798 | * indicate that the bitmap is corrupt. So exit | |
1799 | * without claiming the space. | |
1800 | */ | |
1801 | break; | |
1802 | } | |
1803 | ||
1804 | ext4_mb_measure_extent(ac, &ex, e4b); | |
1805 | ||
1806 | i += ex.fe_len; | |
1807 | free -= ex.fe_len; | |
1808 | } | |
1809 | ||
1810 | ext4_mb_check_limits(ac, e4b, 1); | |
1811 | } | |
1812 | ||
1813 | /* | |
1814 | * This is a special case for storages like raid5 | |
1815 | * we try to find stripe-aligned chunks for stripe-size-multiple requests | |
1816 | */ | |
1817 | static noinline_for_stack | |
1818 | void ext4_mb_scan_aligned(struct ext4_allocation_context *ac, | |
1819 | struct ext4_buddy *e4b) | |
1820 | { | |
1821 | struct super_block *sb = ac->ac_sb; | |
1822 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
1823 | void *bitmap = e4b->bd_bitmap; | |
1824 | struct ext4_free_extent ex; | |
1825 | ext4_fsblk_t first_group_block; | |
1826 | ext4_fsblk_t a; | |
1827 | ext4_grpblk_t i; | |
1828 | int max; | |
1829 | ||
1830 | BUG_ON(sbi->s_stripe == 0); | |
1831 | ||
1832 | /* find first stripe-aligned block in group */ | |
1833 | first_group_block = ext4_group_first_block_no(sb, e4b->bd_group); | |
1834 | ||
1835 | a = first_group_block + sbi->s_stripe - 1; | |
1836 | do_div(a, sbi->s_stripe); | |
1837 | i = (a * sbi->s_stripe) - first_group_block; | |
1838 | ||
1839 | while (i < EXT4_CLUSTERS_PER_GROUP(sb)) { | |
1840 | if (!mb_test_bit(i, bitmap)) { | |
1841 | max = mb_find_extent(e4b, i, sbi->s_stripe, &ex); | |
1842 | if (max >= sbi->s_stripe) { | |
1843 | ac->ac_found++; | |
1844 | ac->ac_b_ex = ex; | |
1845 | ext4_mb_use_best_found(ac, e4b); | |
1846 | break; | |
1847 | } | |
1848 | } | |
1849 | i += sbi->s_stripe; | |
1850 | } | |
1851 | } | |
1852 | ||
1853 | /* This is now called BEFORE we load the buddy bitmap. */ | |
1854 | static int ext4_mb_good_group(struct ext4_allocation_context *ac, | |
1855 | ext4_group_t group, int cr) | |
1856 | { | |
1857 | unsigned free, fragments; | |
1858 | int flex_size = ext4_flex_bg_size(EXT4_SB(ac->ac_sb)); | |
1859 | struct ext4_group_info *grp = ext4_get_group_info(ac->ac_sb, group); | |
1860 | ||
1861 | BUG_ON(cr < 0 || cr >= 4); | |
1862 | ||
1863 | free = grp->bb_free; | |
1864 | if (free == 0) | |
1865 | return 0; | |
1866 | if (cr <= 2 && free < ac->ac_g_ex.fe_len) | |
1867 | return 0; | |
1868 | ||
1869 | /* We only do this if the grp has never been initialized */ | |
1870 | if (unlikely(EXT4_MB_GRP_NEED_INIT(grp))) { | |
1871 | int ret = ext4_mb_init_group(ac->ac_sb, group); | |
1872 | if (ret) | |
1873 | return 0; | |
1874 | } | |
1875 | ||
1876 | fragments = grp->bb_fragments; | |
1877 | if (fragments == 0) | |
1878 | return 0; | |
1879 | ||
1880 | switch (cr) { | |
1881 | case 0: | |
1882 | BUG_ON(ac->ac_2order == 0); | |
1883 | ||
1884 | if (grp->bb_largest_free_order < ac->ac_2order) | |
1885 | return 0; | |
1886 | ||
1887 | /* Avoid using the first bg of a flexgroup for data files */ | |
1888 | if ((ac->ac_flags & EXT4_MB_HINT_DATA) && | |
1889 | (flex_size >= EXT4_FLEX_SIZE_DIR_ALLOC_SCHEME) && | |
1890 | ((group % flex_size) == 0)) | |
1891 | return 0; | |
1892 | ||
1893 | return 1; | |
1894 | case 1: | |
1895 | if ((free / fragments) >= ac->ac_g_ex.fe_len) | |
1896 | return 1; | |
1897 | break; | |
1898 | case 2: | |
1899 | if (free >= ac->ac_g_ex.fe_len) | |
1900 | return 1; | |
1901 | break; | |
1902 | case 3: | |
1903 | return 1; | |
1904 | default: | |
1905 | BUG(); | |
1906 | } | |
1907 | ||
1908 | return 0; | |
1909 | } | |
1910 | ||
1911 | static noinline_for_stack int | |
1912 | ext4_mb_regular_allocator(struct ext4_allocation_context *ac) | |
1913 | { | |
1914 | ext4_group_t ngroups, group, i; | |
1915 | int cr; | |
1916 | int err = 0; | |
1917 | struct ext4_sb_info *sbi; | |
1918 | struct super_block *sb; | |
1919 | struct ext4_buddy e4b; | |
1920 | ||
1921 | sb = ac->ac_sb; | |
1922 | sbi = EXT4_SB(sb); | |
1923 | ngroups = ext4_get_groups_count(sb); | |
1924 | /* non-extent files are limited to low blocks/groups */ | |
1925 | if (!(ext4_test_inode_flag(ac->ac_inode, EXT4_INODE_EXTENTS))) | |
1926 | ngroups = sbi->s_blockfile_groups; | |
1927 | ||
1928 | BUG_ON(ac->ac_status == AC_STATUS_FOUND); | |
1929 | ||
1930 | /* first, try the goal */ | |
1931 | err = ext4_mb_find_by_goal(ac, &e4b); | |
1932 | if (err || ac->ac_status == AC_STATUS_FOUND) | |
1933 | goto out; | |
1934 | ||
1935 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) | |
1936 | goto out; | |
1937 | ||
1938 | /* | |
1939 | * ac->ac2_order is set only if the fe_len is a power of 2 | |
1940 | * if ac2_order is set we also set criteria to 0 so that we | |
1941 | * try exact allocation using buddy. | |
1942 | */ | |
1943 | i = fls(ac->ac_g_ex.fe_len); | |
1944 | ac->ac_2order = 0; | |
1945 | /* | |
1946 | * We search using buddy data only if the order of the request | |
1947 | * is greater than equal to the sbi_s_mb_order2_reqs | |
1948 | * You can tune it via /sys/fs/ext4/<partition>/mb_order2_req | |
1949 | */ | |
1950 | if (i >= sbi->s_mb_order2_reqs) { | |
1951 | /* | |
1952 | * This should tell if fe_len is exactly power of 2 | |
1953 | */ | |
1954 | if ((ac->ac_g_ex.fe_len & (~(1 << (i - 1)))) == 0) | |
1955 | ac->ac_2order = i - 1; | |
1956 | } | |
1957 | ||
1958 | /* if stream allocation is enabled, use global goal */ | |
1959 | if (ac->ac_flags & EXT4_MB_STREAM_ALLOC) { | |
1960 | /* TBD: may be hot point */ | |
1961 | spin_lock(&sbi->s_md_lock); | |
1962 | ac->ac_g_ex.fe_group = sbi->s_mb_last_group; | |
1963 | ac->ac_g_ex.fe_start = sbi->s_mb_last_start; | |
1964 | spin_unlock(&sbi->s_md_lock); | |
1965 | } | |
1966 | ||
1967 | /* Let's just scan groups to find more-less suitable blocks */ | |
1968 | cr = ac->ac_2order ? 0 : 1; | |
1969 | /* | |
1970 | * cr == 0 try to get exact allocation, | |
1971 | * cr == 3 try to get anything | |
1972 | */ | |
1973 | repeat: | |
1974 | for (; cr < 4 && ac->ac_status == AC_STATUS_CONTINUE; cr++) { | |
1975 | ac->ac_criteria = cr; | |
1976 | /* | |
1977 | * searching for the right group start | |
1978 | * from the goal value specified | |
1979 | */ | |
1980 | group = ac->ac_g_ex.fe_group; | |
1981 | ||
1982 | for (i = 0; i < ngroups; group++, i++) { | |
1983 | if (group == ngroups) | |
1984 | group = 0; | |
1985 | ||
1986 | /* This now checks without needing the buddy page */ | |
1987 | if (!ext4_mb_good_group(ac, group, cr)) | |
1988 | continue; | |
1989 | ||
1990 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
1991 | if (err) | |
1992 | goto out; | |
1993 | ||
1994 | ext4_lock_group(sb, group); | |
1995 | ||
1996 | /* | |
1997 | * We need to check again after locking the | |
1998 | * block group | |
1999 | */ | |
2000 | if (!ext4_mb_good_group(ac, group, cr)) { | |
2001 | ext4_unlock_group(sb, group); | |
2002 | ext4_mb_unload_buddy(&e4b); | |
2003 | continue; | |
2004 | } | |
2005 | ||
2006 | ac->ac_groups_scanned++; | |
2007 | if (cr == 0) | |
2008 | ext4_mb_simple_scan_group(ac, &e4b); | |
2009 | else if (cr == 1 && sbi->s_stripe && | |
2010 | !(ac->ac_g_ex.fe_len % sbi->s_stripe)) | |
2011 | ext4_mb_scan_aligned(ac, &e4b); | |
2012 | else | |
2013 | ext4_mb_complex_scan_group(ac, &e4b); | |
2014 | ||
2015 | ext4_unlock_group(sb, group); | |
2016 | ext4_mb_unload_buddy(&e4b); | |
2017 | ||
2018 | if (ac->ac_status != AC_STATUS_CONTINUE) | |
2019 | break; | |
2020 | } | |
2021 | } | |
2022 | ||
2023 | if (ac->ac_b_ex.fe_len > 0 && ac->ac_status != AC_STATUS_FOUND && | |
2024 | !(ac->ac_flags & EXT4_MB_HINT_FIRST)) { | |
2025 | /* | |
2026 | * We've been searching too long. Let's try to allocate | |
2027 | * the best chunk we've found so far | |
2028 | */ | |
2029 | ||
2030 | ext4_mb_try_best_found(ac, &e4b); | |
2031 | if (ac->ac_status != AC_STATUS_FOUND) { | |
2032 | /* | |
2033 | * Someone more lucky has already allocated it. | |
2034 | * The only thing we can do is just take first | |
2035 | * found block(s) | |
2036 | printk(KERN_DEBUG "EXT4-fs: someone won our chunk\n"); | |
2037 | */ | |
2038 | ac->ac_b_ex.fe_group = 0; | |
2039 | ac->ac_b_ex.fe_start = 0; | |
2040 | ac->ac_b_ex.fe_len = 0; | |
2041 | ac->ac_status = AC_STATUS_CONTINUE; | |
2042 | ac->ac_flags |= EXT4_MB_HINT_FIRST; | |
2043 | cr = 3; | |
2044 | atomic_inc(&sbi->s_mb_lost_chunks); | |
2045 | goto repeat; | |
2046 | } | |
2047 | } | |
2048 | out: | |
2049 | return err; | |
2050 | } | |
2051 | ||
2052 | static void *ext4_mb_seq_groups_start(struct seq_file *seq, loff_t *pos) | |
2053 | { | |
2054 | struct super_block *sb = seq->private; | |
2055 | ext4_group_t group; | |
2056 | ||
2057 | if (*pos < 0 || *pos >= ext4_get_groups_count(sb)) | |
2058 | return NULL; | |
2059 | group = *pos + 1; | |
2060 | return (void *) ((unsigned long) group); | |
2061 | } | |
2062 | ||
2063 | static void *ext4_mb_seq_groups_next(struct seq_file *seq, void *v, loff_t *pos) | |
2064 | { | |
2065 | struct super_block *sb = seq->private; | |
2066 | ext4_group_t group; | |
2067 | ||
2068 | ++*pos; | |
2069 | if (*pos < 0 || *pos >= ext4_get_groups_count(sb)) | |
2070 | return NULL; | |
2071 | group = *pos + 1; | |
2072 | return (void *) ((unsigned long) group); | |
2073 | } | |
2074 | ||
2075 | static int ext4_mb_seq_groups_show(struct seq_file *seq, void *v) | |
2076 | { | |
2077 | struct super_block *sb = seq->private; | |
2078 | ext4_group_t group = (ext4_group_t) ((unsigned long) v); | |
2079 | int i; | |
2080 | int err, buddy_loaded = 0; | |
2081 | struct ext4_buddy e4b; | |
2082 | struct ext4_group_info *grinfo; | |
2083 | struct sg { | |
2084 | struct ext4_group_info info; | |
2085 | ext4_grpblk_t counters[16]; | |
2086 | } sg; | |
2087 | ||
2088 | group--; | |
2089 | if (group == 0) | |
2090 | seq_printf(seq, "#%-5s: %-5s %-5s %-5s " | |
2091 | "[ %-5s %-5s %-5s %-5s %-5s %-5s %-5s " | |
2092 | "%-5s %-5s %-5s %-5s %-5s %-5s %-5s ]\n", | |
2093 | "group", "free", "frags", "first", | |
2094 | "2^0", "2^1", "2^2", "2^3", "2^4", "2^5", "2^6", | |
2095 | "2^7", "2^8", "2^9", "2^10", "2^11", "2^12", "2^13"); | |
2096 | ||
2097 | i = (sb->s_blocksize_bits + 2) * sizeof(sg.info.bb_counters[0]) + | |
2098 | sizeof(struct ext4_group_info); | |
2099 | grinfo = ext4_get_group_info(sb, group); | |
2100 | /* Load the group info in memory only if not already loaded. */ | |
2101 | if (unlikely(EXT4_MB_GRP_NEED_INIT(grinfo))) { | |
2102 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
2103 | if (err) { | |
2104 | seq_printf(seq, "#%-5u: I/O error\n", group); | |
2105 | return 0; | |
2106 | } | |
2107 | buddy_loaded = 1; | |
2108 | } | |
2109 | ||
2110 | memcpy(&sg, ext4_get_group_info(sb, group), i); | |
2111 | ||
2112 | if (buddy_loaded) | |
2113 | ext4_mb_unload_buddy(&e4b); | |
2114 | ||
2115 | seq_printf(seq, "#%-5u: %-5u %-5u %-5u [", group, sg.info.bb_free, | |
2116 | sg.info.bb_fragments, sg.info.bb_first_free); | |
2117 | for (i = 0; i <= 13; i++) | |
2118 | seq_printf(seq, " %-5u", i <= sb->s_blocksize_bits + 1 ? | |
2119 | sg.info.bb_counters[i] : 0); | |
2120 | seq_printf(seq, " ]\n"); | |
2121 | ||
2122 | return 0; | |
2123 | } | |
2124 | ||
2125 | static void ext4_mb_seq_groups_stop(struct seq_file *seq, void *v) | |
2126 | { | |
2127 | } | |
2128 | ||
2129 | static const struct seq_operations ext4_mb_seq_groups_ops = { | |
2130 | .start = ext4_mb_seq_groups_start, | |
2131 | .next = ext4_mb_seq_groups_next, | |
2132 | .stop = ext4_mb_seq_groups_stop, | |
2133 | .show = ext4_mb_seq_groups_show, | |
2134 | }; | |
2135 | ||
2136 | static int ext4_mb_seq_groups_open(struct inode *inode, struct file *file) | |
2137 | { | |
2138 | struct super_block *sb = PDE(inode)->data; | |
2139 | int rc; | |
2140 | ||
2141 | rc = seq_open(file, &ext4_mb_seq_groups_ops); | |
2142 | if (rc == 0) { | |
2143 | struct seq_file *m = file->private_data; | |
2144 | m->private = sb; | |
2145 | } | |
2146 | return rc; | |
2147 | ||
2148 | } | |
2149 | ||
2150 | static const struct file_operations ext4_mb_seq_groups_fops = { | |
2151 | .owner = THIS_MODULE, | |
2152 | .open = ext4_mb_seq_groups_open, | |
2153 | .read = seq_read, | |
2154 | .llseek = seq_lseek, | |
2155 | .release = seq_release, | |
2156 | }; | |
2157 | ||
2158 | static struct kmem_cache *get_groupinfo_cache(int blocksize_bits) | |
2159 | { | |
2160 | int cache_index = blocksize_bits - EXT4_MIN_BLOCK_LOG_SIZE; | |
2161 | struct kmem_cache *cachep = ext4_groupinfo_caches[cache_index]; | |
2162 | ||
2163 | BUG_ON(!cachep); | |
2164 | return cachep; | |
2165 | } | |
2166 | ||
2167 | /* | |
2168 | * Allocate the top-level s_group_info array for the specified number | |
2169 | * of groups | |
2170 | */ | |
2171 | int ext4_mb_alloc_groupinfo(struct super_block *sb, ext4_group_t ngroups) | |
2172 | { | |
2173 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2174 | unsigned size; | |
2175 | struct ext4_group_info ***new_groupinfo; | |
2176 | ||
2177 | size = (ngroups + EXT4_DESC_PER_BLOCK(sb) - 1) >> | |
2178 | EXT4_DESC_PER_BLOCK_BITS(sb); | |
2179 | if (size <= sbi->s_group_info_size) | |
2180 | return 0; | |
2181 | ||
2182 | size = roundup_pow_of_two(sizeof(*sbi->s_group_info) * size); | |
2183 | new_groupinfo = ext4_kvzalloc(size, GFP_KERNEL); | |
2184 | if (!new_groupinfo) { | |
2185 | ext4_msg(sb, KERN_ERR, "can't allocate buddy meta group"); | |
2186 | return -ENOMEM; | |
2187 | } | |
2188 | if (sbi->s_group_info) { | |
2189 | memcpy(new_groupinfo, sbi->s_group_info, | |
2190 | sbi->s_group_info_size * sizeof(*sbi->s_group_info)); | |
2191 | ext4_kvfree(sbi->s_group_info); | |
2192 | } | |
2193 | sbi->s_group_info = new_groupinfo; | |
2194 | sbi->s_group_info_size = size / sizeof(*sbi->s_group_info); | |
2195 | ext4_debug("allocated s_groupinfo array for %d meta_bg's\n", | |
2196 | sbi->s_group_info_size); | |
2197 | return 0; | |
2198 | } | |
2199 | ||
2200 | /* Create and initialize ext4_group_info data for the given group. */ | |
2201 | int ext4_mb_add_groupinfo(struct super_block *sb, ext4_group_t group, | |
2202 | struct ext4_group_desc *desc) | |
2203 | { | |
2204 | int i; | |
2205 | int metalen = 0; | |
2206 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2207 | struct ext4_group_info **meta_group_info; | |
2208 | struct kmem_cache *cachep = get_groupinfo_cache(sb->s_blocksize_bits); | |
2209 | ||
2210 | /* | |
2211 | * First check if this group is the first of a reserved block. | |
2212 | * If it's true, we have to allocate a new table of pointers | |
2213 | * to ext4_group_info structures | |
2214 | */ | |
2215 | if (group % EXT4_DESC_PER_BLOCK(sb) == 0) { | |
2216 | metalen = sizeof(*meta_group_info) << | |
2217 | EXT4_DESC_PER_BLOCK_BITS(sb); | |
2218 | meta_group_info = kmalloc(metalen, GFP_KERNEL); | |
2219 | if (meta_group_info == NULL) { | |
2220 | ext4_msg(sb, KERN_ERR, "can't allocate mem " | |
2221 | "for a buddy group"); | |
2222 | goto exit_meta_group_info; | |
2223 | } | |
2224 | sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)] = | |
2225 | meta_group_info; | |
2226 | } | |
2227 | ||
2228 | meta_group_info = | |
2229 | sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)]; | |
2230 | i = group & (EXT4_DESC_PER_BLOCK(sb) - 1); | |
2231 | ||
2232 | meta_group_info[i] = kmem_cache_alloc(cachep, GFP_KERNEL); | |
2233 | if (meta_group_info[i] == NULL) { | |
2234 | ext4_msg(sb, KERN_ERR, "can't allocate buddy mem"); | |
2235 | goto exit_group_info; | |
2236 | } | |
2237 | memset(meta_group_info[i], 0, kmem_cache_size(cachep)); | |
2238 | set_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, | |
2239 | &(meta_group_info[i]->bb_state)); | |
2240 | ||
2241 | /* | |
2242 | * initialize bb_free to be able to skip | |
2243 | * empty groups without initialization | |
2244 | */ | |
2245 | if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { | |
2246 | meta_group_info[i]->bb_free = | |
2247 | ext4_free_clusters_after_init(sb, group, desc); | |
2248 | } else { | |
2249 | meta_group_info[i]->bb_free = | |
2250 | ext4_free_group_clusters(sb, desc); | |
2251 | } | |
2252 | ||
2253 | INIT_LIST_HEAD(&meta_group_info[i]->bb_prealloc_list); | |
2254 | init_rwsem(&meta_group_info[i]->alloc_sem); | |
2255 | meta_group_info[i]->bb_free_root = RB_ROOT; | |
2256 | meta_group_info[i]->bb_largest_free_order = -1; /* uninit */ | |
2257 | ||
2258 | #ifdef DOUBLE_CHECK | |
2259 | { | |
2260 | struct buffer_head *bh; | |
2261 | meta_group_info[i]->bb_bitmap = | |
2262 | kmalloc(sb->s_blocksize, GFP_KERNEL); | |
2263 | BUG_ON(meta_group_info[i]->bb_bitmap == NULL); | |
2264 | bh = ext4_read_block_bitmap(sb, group); | |
2265 | BUG_ON(bh == NULL); | |
2266 | memcpy(meta_group_info[i]->bb_bitmap, bh->b_data, | |
2267 | sb->s_blocksize); | |
2268 | put_bh(bh); | |
2269 | } | |
2270 | #endif | |
2271 | ||
2272 | return 0; | |
2273 | ||
2274 | exit_group_info: | |
2275 | /* If a meta_group_info table has been allocated, release it now */ | |
2276 | if (group % EXT4_DESC_PER_BLOCK(sb) == 0) { | |
2277 | kfree(sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)]); | |
2278 | sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)] = NULL; | |
2279 | } | |
2280 | exit_meta_group_info: | |
2281 | return -ENOMEM; | |
2282 | } /* ext4_mb_add_groupinfo */ | |
2283 | ||
2284 | static int ext4_mb_init_backend(struct super_block *sb) | |
2285 | { | |
2286 | ext4_group_t ngroups = ext4_get_groups_count(sb); | |
2287 | ext4_group_t i; | |
2288 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2289 | int err; | |
2290 | struct ext4_group_desc *desc; | |
2291 | struct kmem_cache *cachep; | |
2292 | ||
2293 | err = ext4_mb_alloc_groupinfo(sb, ngroups); | |
2294 | if (err) | |
2295 | return err; | |
2296 | ||
2297 | sbi->s_buddy_cache = new_inode(sb); | |
2298 | if (sbi->s_buddy_cache == NULL) { | |
2299 | ext4_msg(sb, KERN_ERR, "can't get new inode"); | |
2300 | goto err_freesgi; | |
2301 | } | |
2302 | /* To avoid potentially colliding with an valid on-disk inode number, | |
2303 | * use EXT4_BAD_INO for the buddy cache inode number. This inode is | |
2304 | * not in the inode hash, so it should never be found by iget(), but | |
2305 | * this will avoid confusion if it ever shows up during debugging. */ | |
2306 | sbi->s_buddy_cache->i_ino = EXT4_BAD_INO; | |
2307 | EXT4_I(sbi->s_buddy_cache)->i_disksize = 0; | |
2308 | for (i = 0; i < ngroups; i++) { | |
2309 | desc = ext4_get_group_desc(sb, i, NULL); | |
2310 | if (desc == NULL) { | |
2311 | ext4_msg(sb, KERN_ERR, "can't read descriptor %u", i); | |
2312 | goto err_freebuddy; | |
2313 | } | |
2314 | if (ext4_mb_add_groupinfo(sb, i, desc) != 0) | |
2315 | goto err_freebuddy; | |
2316 | } | |
2317 | ||
2318 | return 0; | |
2319 | ||
2320 | err_freebuddy: | |
2321 | cachep = get_groupinfo_cache(sb->s_blocksize_bits); | |
2322 | while (i-- > 0) | |
2323 | kmem_cache_free(cachep, ext4_get_group_info(sb, i)); | |
2324 | i = sbi->s_group_info_size; | |
2325 | while (i-- > 0) | |
2326 | kfree(sbi->s_group_info[i]); | |
2327 | iput(sbi->s_buddy_cache); | |
2328 | err_freesgi: | |
2329 | ext4_kvfree(sbi->s_group_info); | |
2330 | return -ENOMEM; | |
2331 | } | |
2332 | ||
2333 | static void ext4_groupinfo_destroy_slabs(void) | |
2334 | { | |
2335 | int i; | |
2336 | ||
2337 | for (i = 0; i < NR_GRPINFO_CACHES; i++) { | |
2338 | if (ext4_groupinfo_caches[i]) | |
2339 | kmem_cache_destroy(ext4_groupinfo_caches[i]); | |
2340 | ext4_groupinfo_caches[i] = NULL; | |
2341 | } | |
2342 | } | |
2343 | ||
2344 | static int ext4_groupinfo_create_slab(size_t size) | |
2345 | { | |
2346 | static DEFINE_MUTEX(ext4_grpinfo_slab_create_mutex); | |
2347 | int slab_size; | |
2348 | int blocksize_bits = order_base_2(size); | |
2349 | int cache_index = blocksize_bits - EXT4_MIN_BLOCK_LOG_SIZE; | |
2350 | struct kmem_cache *cachep; | |
2351 | ||
2352 | if (cache_index >= NR_GRPINFO_CACHES) | |
2353 | return -EINVAL; | |
2354 | ||
2355 | if (unlikely(cache_index < 0)) | |
2356 | cache_index = 0; | |
2357 | ||
2358 | mutex_lock(&ext4_grpinfo_slab_create_mutex); | |
2359 | if (ext4_groupinfo_caches[cache_index]) { | |
2360 | mutex_unlock(&ext4_grpinfo_slab_create_mutex); | |
2361 | return 0; /* Already created */ | |
2362 | } | |
2363 | ||
2364 | slab_size = offsetof(struct ext4_group_info, | |
2365 | bb_counters[blocksize_bits + 2]); | |
2366 | ||
2367 | cachep = kmem_cache_create(ext4_groupinfo_slab_names[cache_index], | |
2368 | slab_size, 0, SLAB_RECLAIM_ACCOUNT, | |
2369 | NULL); | |
2370 | ||
2371 | ext4_groupinfo_caches[cache_index] = cachep; | |
2372 | ||
2373 | mutex_unlock(&ext4_grpinfo_slab_create_mutex); | |
2374 | if (!cachep) { | |
2375 | printk(KERN_EMERG | |
2376 | "EXT4-fs: no memory for groupinfo slab cache\n"); | |
2377 | return -ENOMEM; | |
2378 | } | |
2379 | ||
2380 | return 0; | |
2381 | } | |
2382 | ||
2383 | int ext4_mb_init(struct super_block *sb) | |
2384 | { | |
2385 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2386 | unsigned i, j; | |
2387 | unsigned offset; | |
2388 | unsigned max; | |
2389 | int ret; | |
2390 | ||
2391 | i = (sb->s_blocksize_bits + 2) * sizeof(*sbi->s_mb_offsets); | |
2392 | ||
2393 | sbi->s_mb_offsets = kmalloc(i, GFP_KERNEL); | |
2394 | if (sbi->s_mb_offsets == NULL) { | |
2395 | ret = -ENOMEM; | |
2396 | goto out; | |
2397 | } | |
2398 | ||
2399 | i = (sb->s_blocksize_bits + 2) * sizeof(*sbi->s_mb_maxs); | |
2400 | sbi->s_mb_maxs = kmalloc(i, GFP_KERNEL); | |
2401 | if (sbi->s_mb_maxs == NULL) { | |
2402 | ret = -ENOMEM; | |
2403 | goto out; | |
2404 | } | |
2405 | ||
2406 | ret = ext4_groupinfo_create_slab(sb->s_blocksize); | |
2407 | if (ret < 0) | |
2408 | goto out; | |
2409 | ||
2410 | /* order 0 is regular bitmap */ | |
2411 | sbi->s_mb_maxs[0] = sb->s_blocksize << 3; | |
2412 | sbi->s_mb_offsets[0] = 0; | |
2413 | ||
2414 | i = 1; | |
2415 | offset = 0; | |
2416 | max = sb->s_blocksize << 2; | |
2417 | do { | |
2418 | sbi->s_mb_offsets[i] = offset; | |
2419 | sbi->s_mb_maxs[i] = max; | |
2420 | offset += 1 << (sb->s_blocksize_bits - i); | |
2421 | max = max >> 1; | |
2422 | i++; | |
2423 | } while (i <= sb->s_blocksize_bits + 1); | |
2424 | ||
2425 | spin_lock_init(&sbi->s_md_lock); | |
2426 | spin_lock_init(&sbi->s_bal_lock); | |
2427 | ||
2428 | sbi->s_mb_max_to_scan = MB_DEFAULT_MAX_TO_SCAN; | |
2429 | sbi->s_mb_min_to_scan = MB_DEFAULT_MIN_TO_SCAN; | |
2430 | sbi->s_mb_stats = MB_DEFAULT_STATS; | |
2431 | sbi->s_mb_stream_request = MB_DEFAULT_STREAM_THRESHOLD; | |
2432 | sbi->s_mb_order2_reqs = MB_DEFAULT_ORDER2_REQS; | |
2433 | /* | |
2434 | * The default group preallocation is 512, which for 4k block | |
2435 | * sizes translates to 2 megabytes. However for bigalloc file | |
2436 | * systems, this is probably too big (i.e, if the cluster size | |
2437 | * is 1 megabyte, then group preallocation size becomes half a | |
2438 | * gigabyte!). As a default, we will keep a two megabyte | |
2439 | * group pralloc size for cluster sizes up to 64k, and after | |
2440 | * that, we will force a minimum group preallocation size of | |
2441 | * 32 clusters. This translates to 8 megs when the cluster | |
2442 | * size is 256k, and 32 megs when the cluster size is 1 meg, | |
2443 | * which seems reasonable as a default. | |
2444 | */ | |
2445 | sbi->s_mb_group_prealloc = max(MB_DEFAULT_GROUP_PREALLOC >> | |
2446 | sbi->s_cluster_bits, 32); | |
2447 | /* | |
2448 | * If there is a s_stripe > 1, then we set the s_mb_group_prealloc | |
2449 | * to the lowest multiple of s_stripe which is bigger than | |
2450 | * the s_mb_group_prealloc as determined above. We want | |
2451 | * the preallocation size to be an exact multiple of the | |
2452 | * RAID stripe size so that preallocations don't fragment | |
2453 | * the stripes. | |
2454 | */ | |
2455 | if (sbi->s_stripe > 1) { | |
2456 | sbi->s_mb_group_prealloc = roundup( | |
2457 | sbi->s_mb_group_prealloc, sbi->s_stripe); | |
2458 | } | |
2459 | ||
2460 | sbi->s_locality_groups = alloc_percpu(struct ext4_locality_group); | |
2461 | if (sbi->s_locality_groups == NULL) { | |
2462 | ret = -ENOMEM; | |
2463 | goto out_free_groupinfo_slab; | |
2464 | } | |
2465 | for_each_possible_cpu(i) { | |
2466 | struct ext4_locality_group *lg; | |
2467 | lg = per_cpu_ptr(sbi->s_locality_groups, i); | |
2468 | mutex_init(&lg->lg_mutex); | |
2469 | for (j = 0; j < PREALLOC_TB_SIZE; j++) | |
2470 | INIT_LIST_HEAD(&lg->lg_prealloc_list[j]); | |
2471 | spin_lock_init(&lg->lg_prealloc_lock); | |
2472 | } | |
2473 | ||
2474 | /* init file for buddy data */ | |
2475 | ret = ext4_mb_init_backend(sb); | |
2476 | if (ret != 0) | |
2477 | goto out_free_locality_groups; | |
2478 | ||
2479 | if (sbi->s_proc) | |
2480 | proc_create_data("mb_groups", S_IRUGO, sbi->s_proc, | |
2481 | &ext4_mb_seq_groups_fops, sb); | |
2482 | ||
2483 | return 0; | |
2484 | ||
2485 | out_free_locality_groups: | |
2486 | free_percpu(sbi->s_locality_groups); | |
2487 | sbi->s_locality_groups = NULL; | |
2488 | out_free_groupinfo_slab: | |
2489 | ext4_groupinfo_destroy_slabs(); | |
2490 | out: | |
2491 | kfree(sbi->s_mb_offsets); | |
2492 | sbi->s_mb_offsets = NULL; | |
2493 | kfree(sbi->s_mb_maxs); | |
2494 | sbi->s_mb_maxs = NULL; | |
2495 | return ret; | |
2496 | } | |
2497 | ||
2498 | /* need to called with the ext4 group lock held */ | |
2499 | static void ext4_mb_cleanup_pa(struct ext4_group_info *grp) | |
2500 | { | |
2501 | struct ext4_prealloc_space *pa; | |
2502 | struct list_head *cur, *tmp; | |
2503 | int count = 0; | |
2504 | ||
2505 | list_for_each_safe(cur, tmp, &grp->bb_prealloc_list) { | |
2506 | pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); | |
2507 | list_del(&pa->pa_group_list); | |
2508 | count++; | |
2509 | kmem_cache_free(ext4_pspace_cachep, pa); | |
2510 | } | |
2511 | if (count) | |
2512 | mb_debug(1, "mballoc: %u PAs left\n", count); | |
2513 | ||
2514 | } | |
2515 | ||
2516 | int ext4_mb_release(struct super_block *sb) | |
2517 | { | |
2518 | ext4_group_t ngroups = ext4_get_groups_count(sb); | |
2519 | ext4_group_t i; | |
2520 | int num_meta_group_infos; | |
2521 | struct ext4_group_info *grinfo; | |
2522 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2523 | struct kmem_cache *cachep = get_groupinfo_cache(sb->s_blocksize_bits); | |
2524 | ||
2525 | if (sbi->s_proc) | |
2526 | remove_proc_entry("mb_groups", sbi->s_proc); | |
2527 | ||
2528 | if (sbi->s_group_info) { | |
2529 | for (i = 0; i < ngroups; i++) { | |
2530 | grinfo = ext4_get_group_info(sb, i); | |
2531 | #ifdef DOUBLE_CHECK | |
2532 | kfree(grinfo->bb_bitmap); | |
2533 | #endif | |
2534 | ext4_lock_group(sb, i); | |
2535 | ext4_mb_cleanup_pa(grinfo); | |
2536 | ext4_unlock_group(sb, i); | |
2537 | kmem_cache_free(cachep, grinfo); | |
2538 | } | |
2539 | num_meta_group_infos = (ngroups + | |
2540 | EXT4_DESC_PER_BLOCK(sb) - 1) >> | |
2541 | EXT4_DESC_PER_BLOCK_BITS(sb); | |
2542 | for (i = 0; i < num_meta_group_infos; i++) | |
2543 | kfree(sbi->s_group_info[i]); | |
2544 | ext4_kvfree(sbi->s_group_info); | |
2545 | } | |
2546 | kfree(sbi->s_mb_offsets); | |
2547 | kfree(sbi->s_mb_maxs); | |
2548 | if (sbi->s_buddy_cache) | |
2549 | iput(sbi->s_buddy_cache); | |
2550 | if (sbi->s_mb_stats) { | |
2551 | ext4_msg(sb, KERN_INFO, | |
2552 | "mballoc: %u blocks %u reqs (%u success)", | |
2553 | atomic_read(&sbi->s_bal_allocated), | |
2554 | atomic_read(&sbi->s_bal_reqs), | |
2555 | atomic_read(&sbi->s_bal_success)); | |
2556 | ext4_msg(sb, KERN_INFO, | |
2557 | "mballoc: %u extents scanned, %u goal hits, " | |
2558 | "%u 2^N hits, %u breaks, %u lost", | |
2559 | atomic_read(&sbi->s_bal_ex_scanned), | |
2560 | atomic_read(&sbi->s_bal_goals), | |
2561 | atomic_read(&sbi->s_bal_2orders), | |
2562 | atomic_read(&sbi->s_bal_breaks), | |
2563 | atomic_read(&sbi->s_mb_lost_chunks)); | |
2564 | ext4_msg(sb, KERN_INFO, | |
2565 | "mballoc: %lu generated and it took %Lu", | |
2566 | sbi->s_mb_buddies_generated, | |
2567 | sbi->s_mb_generation_time); | |
2568 | ext4_msg(sb, KERN_INFO, | |
2569 | "mballoc: %u preallocated, %u discarded", | |
2570 | atomic_read(&sbi->s_mb_preallocated), | |
2571 | atomic_read(&sbi->s_mb_discarded)); | |
2572 | } | |
2573 | ||
2574 | free_percpu(sbi->s_locality_groups); | |
2575 | ||
2576 | return 0; | |
2577 | } | |
2578 | ||
2579 | static inline int ext4_issue_discard(struct super_block *sb, | |
2580 | ext4_group_t block_group, ext4_grpblk_t cluster, int count) | |
2581 | { | |
2582 | ext4_fsblk_t discard_block; | |
2583 | ||
2584 | discard_block = (EXT4_C2B(EXT4_SB(sb), cluster) + | |
2585 | ext4_group_first_block_no(sb, block_group)); | |
2586 | count = EXT4_C2B(EXT4_SB(sb), count); | |
2587 | trace_ext4_discard_blocks(sb, | |
2588 | (unsigned long long) discard_block, count); | |
2589 | return sb_issue_discard(sb, discard_block, count, GFP_NOFS, 0); | |
2590 | } | |
2591 | ||
2592 | /* | |
2593 | * This function is called by the jbd2 layer once the commit has finished, | |
2594 | * so we know we can free the blocks that were released with that commit. | |
2595 | */ | |
2596 | static void ext4_free_data_callback(struct super_block *sb, | |
2597 | struct ext4_journal_cb_entry *jce, | |
2598 | int rc) | |
2599 | { | |
2600 | struct ext4_free_data *entry = (struct ext4_free_data *)jce; | |
2601 | struct ext4_buddy e4b; | |
2602 | struct ext4_group_info *db; | |
2603 | int err, count = 0, count2 = 0; | |
2604 | ||
2605 | mb_debug(1, "gonna free %u blocks in group %u (0x%p):", | |
2606 | entry->efd_count, entry->efd_group, entry); | |
2607 | ||
2608 | if (test_opt(sb, DISCARD)) | |
2609 | ext4_issue_discard(sb, entry->efd_group, | |
2610 | entry->efd_start_cluster, entry->efd_count); | |
2611 | ||
2612 | err = ext4_mb_load_buddy(sb, entry->efd_group, &e4b); | |
2613 | /* we expect to find existing buddy because it's pinned */ | |
2614 | BUG_ON(err != 0); | |
2615 | ||
2616 | ||
2617 | db = e4b.bd_info; | |
2618 | /* there are blocks to put in buddy to make them really free */ | |
2619 | count += entry->efd_count; | |
2620 | count2++; | |
2621 | ext4_lock_group(sb, entry->efd_group); | |
2622 | /* Take it out of per group rb tree */ | |
2623 | rb_erase(&entry->efd_node, &(db->bb_free_root)); | |
2624 | mb_free_blocks(NULL, &e4b, entry->efd_start_cluster, entry->efd_count); | |
2625 | ||
2626 | /* | |
2627 | * Clear the trimmed flag for the group so that the next | |
2628 | * ext4_trim_fs can trim it. | |
2629 | * If the volume is mounted with -o discard, online discard | |
2630 | * is supported and the free blocks will be trimmed online. | |
2631 | */ | |
2632 | if (!test_opt(sb, DISCARD)) | |
2633 | EXT4_MB_GRP_CLEAR_TRIMMED(db); | |
2634 | ||
2635 | if (!db->bb_free_root.rb_node) { | |
2636 | /* No more items in the per group rb tree | |
2637 | * balance refcounts from ext4_mb_free_metadata() | |
2638 | */ | |
2639 | page_cache_release(e4b.bd_buddy_page); | |
2640 | page_cache_release(e4b.bd_bitmap_page); | |
2641 | } | |
2642 | ext4_unlock_group(sb, entry->efd_group); | |
2643 | kmem_cache_free(ext4_free_data_cachep, entry); | |
2644 | ext4_mb_unload_buddy(&e4b); | |
2645 | ||
2646 | mb_debug(1, "freed %u blocks in %u structures\n", count, count2); | |
2647 | } | |
2648 | ||
2649 | #ifdef CONFIG_EXT4_DEBUG | |
2650 | u8 mb_enable_debug __read_mostly; | |
2651 | ||
2652 | static struct dentry *debugfs_dir; | |
2653 | static struct dentry *debugfs_debug; | |
2654 | ||
2655 | static void __init ext4_create_debugfs_entry(void) | |
2656 | { | |
2657 | debugfs_dir = debugfs_create_dir("ext4", NULL); | |
2658 | if (debugfs_dir) | |
2659 | debugfs_debug = debugfs_create_u8("mballoc-debug", | |
2660 | S_IRUGO | S_IWUSR, | |
2661 | debugfs_dir, | |
2662 | &mb_enable_debug); | |
2663 | } | |
2664 | ||
2665 | static void ext4_remove_debugfs_entry(void) | |
2666 | { | |
2667 | debugfs_remove(debugfs_debug); | |
2668 | debugfs_remove(debugfs_dir); | |
2669 | } | |
2670 | ||
2671 | #else | |
2672 | ||
2673 | static void __init ext4_create_debugfs_entry(void) | |
2674 | { | |
2675 | } | |
2676 | ||
2677 | static void ext4_remove_debugfs_entry(void) | |
2678 | { | |
2679 | } | |
2680 | ||
2681 | #endif | |
2682 | ||
2683 | int __init ext4_init_mballoc(void) | |
2684 | { | |
2685 | ext4_pspace_cachep = KMEM_CACHE(ext4_prealloc_space, | |
2686 | SLAB_RECLAIM_ACCOUNT); | |
2687 | if (ext4_pspace_cachep == NULL) | |
2688 | return -ENOMEM; | |
2689 | ||
2690 | ext4_ac_cachep = KMEM_CACHE(ext4_allocation_context, | |
2691 | SLAB_RECLAIM_ACCOUNT); | |
2692 | if (ext4_ac_cachep == NULL) { | |
2693 | kmem_cache_destroy(ext4_pspace_cachep); | |
2694 | return -ENOMEM; | |
2695 | } | |
2696 | ||
2697 | ext4_free_data_cachep = KMEM_CACHE(ext4_free_data, | |
2698 | SLAB_RECLAIM_ACCOUNT); | |
2699 | if (ext4_free_data_cachep == NULL) { | |
2700 | kmem_cache_destroy(ext4_pspace_cachep); | |
2701 | kmem_cache_destroy(ext4_ac_cachep); | |
2702 | return -ENOMEM; | |
2703 | } | |
2704 | ext4_create_debugfs_entry(); | |
2705 | return 0; | |
2706 | } | |
2707 | ||
2708 | void ext4_exit_mballoc(void) | |
2709 | { | |
2710 | /* | |
2711 | * Wait for completion of call_rcu()'s on ext4_pspace_cachep | |
2712 | * before destroying the slab cache. | |
2713 | */ | |
2714 | rcu_barrier(); | |
2715 | kmem_cache_destroy(ext4_pspace_cachep); | |
2716 | kmem_cache_destroy(ext4_ac_cachep); | |
2717 | kmem_cache_destroy(ext4_free_data_cachep); | |
2718 | ext4_groupinfo_destroy_slabs(); | |
2719 | ext4_remove_debugfs_entry(); | |
2720 | } | |
2721 | ||
2722 | ||
2723 | /* | |
2724 | * Check quota and mark chosen space (ac->ac_b_ex) non-free in bitmaps | |
2725 | * Returns 0 if success or error code | |
2726 | */ | |
2727 | static noinline_for_stack int | |
2728 | ext4_mb_mark_diskspace_used(struct ext4_allocation_context *ac, | |
2729 | handle_t *handle, unsigned int reserv_clstrs) | |
2730 | { | |
2731 | struct buffer_head *bitmap_bh = NULL; | |
2732 | struct ext4_group_desc *gdp; | |
2733 | struct buffer_head *gdp_bh; | |
2734 | struct ext4_sb_info *sbi; | |
2735 | struct super_block *sb; | |
2736 | ext4_fsblk_t block; | |
2737 | int err, len; | |
2738 | ||
2739 | BUG_ON(ac->ac_status != AC_STATUS_FOUND); | |
2740 | BUG_ON(ac->ac_b_ex.fe_len <= 0); | |
2741 | ||
2742 | sb = ac->ac_sb; | |
2743 | sbi = EXT4_SB(sb); | |
2744 | ||
2745 | err = -EIO; | |
2746 | bitmap_bh = ext4_read_block_bitmap(sb, ac->ac_b_ex.fe_group); | |
2747 | if (!bitmap_bh) | |
2748 | goto out_err; | |
2749 | ||
2750 | err = ext4_journal_get_write_access(handle, bitmap_bh); | |
2751 | if (err) | |
2752 | goto out_err; | |
2753 | ||
2754 | err = -EIO; | |
2755 | gdp = ext4_get_group_desc(sb, ac->ac_b_ex.fe_group, &gdp_bh); | |
2756 | if (!gdp) | |
2757 | goto out_err; | |
2758 | ||
2759 | ext4_debug("using block group %u(%d)\n", ac->ac_b_ex.fe_group, | |
2760 | ext4_free_group_clusters(sb, gdp)); | |
2761 | ||
2762 | err = ext4_journal_get_write_access(handle, gdp_bh); | |
2763 | if (err) | |
2764 | goto out_err; | |
2765 | ||
2766 | block = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
2767 | ||
2768 | len = EXT4_C2B(sbi, ac->ac_b_ex.fe_len); | |
2769 | if (!ext4_data_block_valid(sbi, block, len)) { | |
2770 | ext4_error(sb, "Allocating blocks %llu-%llu which overlap " | |
2771 | "fs metadata", block, block+len); | |
2772 | /* File system mounted not to panic on error | |
2773 | * Fix the bitmap and repeat the block allocation | |
2774 | * We leak some of the blocks here. | |
2775 | */ | |
2776 | ext4_lock_group(sb, ac->ac_b_ex.fe_group); | |
2777 | ext4_set_bits(bitmap_bh->b_data, ac->ac_b_ex.fe_start, | |
2778 | ac->ac_b_ex.fe_len); | |
2779 | ext4_unlock_group(sb, ac->ac_b_ex.fe_group); | |
2780 | err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh); | |
2781 | if (!err) | |
2782 | err = -EAGAIN; | |
2783 | goto out_err; | |
2784 | } | |
2785 | ||
2786 | ext4_lock_group(sb, ac->ac_b_ex.fe_group); | |
2787 | #ifdef AGGRESSIVE_CHECK | |
2788 | { | |
2789 | int i; | |
2790 | for (i = 0; i < ac->ac_b_ex.fe_len; i++) { | |
2791 | BUG_ON(mb_test_bit(ac->ac_b_ex.fe_start + i, | |
2792 | bitmap_bh->b_data)); | |
2793 | } | |
2794 | } | |
2795 | #endif | |
2796 | ext4_set_bits(bitmap_bh->b_data, ac->ac_b_ex.fe_start, | |
2797 | ac->ac_b_ex.fe_len); | |
2798 | if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { | |
2799 | gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT); | |
2800 | ext4_free_group_clusters_set(sb, gdp, | |
2801 | ext4_free_clusters_after_init(sb, | |
2802 | ac->ac_b_ex.fe_group, gdp)); | |
2803 | } | |
2804 | len = ext4_free_group_clusters(sb, gdp) - ac->ac_b_ex.fe_len; | |
2805 | ext4_free_group_clusters_set(sb, gdp, len); | |
2806 | ext4_block_bitmap_csum_set(sb, ac->ac_b_ex.fe_group, gdp, bitmap_bh, | |
2807 | EXT4_BLOCKS_PER_GROUP(sb) / 8); | |
2808 | ext4_group_desc_csum_set(sb, ac->ac_b_ex.fe_group, gdp); | |
2809 | ||
2810 | ext4_unlock_group(sb, ac->ac_b_ex.fe_group); | |
2811 | percpu_counter_sub(&sbi->s_freeclusters_counter, ac->ac_b_ex.fe_len); | |
2812 | /* | |
2813 | * Now reduce the dirty block count also. Should not go negative | |
2814 | */ | |
2815 | if (!(ac->ac_flags & EXT4_MB_DELALLOC_RESERVED)) | |
2816 | /* release all the reserved blocks if non delalloc */ | |
2817 | percpu_counter_sub(&sbi->s_dirtyclusters_counter, | |
2818 | reserv_clstrs); | |
2819 | ||
2820 | if (sbi->s_log_groups_per_flex) { | |
2821 | ext4_group_t flex_group = ext4_flex_group(sbi, | |
2822 | ac->ac_b_ex.fe_group); | |
2823 | atomic_sub(ac->ac_b_ex.fe_len, | |
2824 | &sbi->s_flex_groups[flex_group].free_clusters); | |
2825 | } | |
2826 | ||
2827 | err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh); | |
2828 | if (err) | |
2829 | goto out_err; | |
2830 | err = ext4_handle_dirty_metadata(handle, NULL, gdp_bh); | |
2831 | ||
2832 | out_err: | |
2833 | brelse(bitmap_bh); | |
2834 | return err; | |
2835 | } | |
2836 | ||
2837 | /* | |
2838 | * here we normalize request for locality group | |
2839 | * Group request are normalized to s_mb_group_prealloc, which goes to | |
2840 | * s_strip if we set the same via mount option. | |
2841 | * s_mb_group_prealloc can be configured via | |
2842 | * /sys/fs/ext4/<partition>/mb_group_prealloc | |
2843 | * | |
2844 | * XXX: should we try to preallocate more than the group has now? | |
2845 | */ | |
2846 | static void ext4_mb_normalize_group_request(struct ext4_allocation_context *ac) | |
2847 | { | |
2848 | struct super_block *sb = ac->ac_sb; | |
2849 | struct ext4_locality_group *lg = ac->ac_lg; | |
2850 | ||
2851 | BUG_ON(lg == NULL); | |
2852 | ac->ac_g_ex.fe_len = EXT4_SB(sb)->s_mb_group_prealloc; | |
2853 | mb_debug(1, "#%u: goal %u blocks for locality group\n", | |
2854 | current->pid, ac->ac_g_ex.fe_len); | |
2855 | } | |
2856 | ||
2857 | /* | |
2858 | * Normalization means making request better in terms of | |
2859 | * size and alignment | |
2860 | */ | |
2861 | static noinline_for_stack void | |
2862 | ext4_mb_normalize_request(struct ext4_allocation_context *ac, | |
2863 | struct ext4_allocation_request *ar) | |
2864 | { | |
2865 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
2866 | int bsbits, max; | |
2867 | ext4_lblk_t end; | |
2868 | loff_t size, start_off; | |
2869 | loff_t orig_size __maybe_unused; | |
2870 | ext4_lblk_t start; | |
2871 | struct ext4_inode_info *ei = EXT4_I(ac->ac_inode); | |
2872 | struct ext4_prealloc_space *pa; | |
2873 | ||
2874 | /* do normalize only data requests, metadata requests | |
2875 | do not need preallocation */ | |
2876 | if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) | |
2877 | return; | |
2878 | ||
2879 | /* sometime caller may want exact blocks */ | |
2880 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) | |
2881 | return; | |
2882 | ||
2883 | /* caller may indicate that preallocation isn't | |
2884 | * required (it's a tail, for example) */ | |
2885 | if (ac->ac_flags & EXT4_MB_HINT_NOPREALLOC) | |
2886 | return; | |
2887 | ||
2888 | if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) { | |
2889 | ext4_mb_normalize_group_request(ac); | |
2890 | return ; | |
2891 | } | |
2892 | ||
2893 | bsbits = ac->ac_sb->s_blocksize_bits; | |
2894 | ||
2895 | /* first, let's learn actual file size | |
2896 | * given current request is allocated */ | |
2897 | size = ac->ac_o_ex.fe_logical + EXT4_C2B(sbi, ac->ac_o_ex.fe_len); | |
2898 | size = size << bsbits; | |
2899 | if (size < i_size_read(ac->ac_inode)) | |
2900 | size = i_size_read(ac->ac_inode); | |
2901 | orig_size = size; | |
2902 | ||
2903 | /* max size of free chunks */ | |
2904 | max = 2 << bsbits; | |
2905 | ||
2906 | #define NRL_CHECK_SIZE(req, size, max, chunk_size) \ | |
2907 | (req <= (size) || max <= (chunk_size)) | |
2908 | ||
2909 | /* first, try to predict filesize */ | |
2910 | /* XXX: should this table be tunable? */ | |
2911 | start_off = 0; | |
2912 | if (size <= 16 * 1024) { | |
2913 | size = 16 * 1024; | |
2914 | } else if (size <= 32 * 1024) { | |
2915 | size = 32 * 1024; | |
2916 | } else if (size <= 64 * 1024) { | |
2917 | size = 64 * 1024; | |
2918 | } else if (size <= 128 * 1024) { | |
2919 | size = 128 * 1024; | |
2920 | } else if (size <= 256 * 1024) { | |
2921 | size = 256 * 1024; | |
2922 | } else if (size <= 512 * 1024) { | |
2923 | size = 512 * 1024; | |
2924 | } else if (size <= 1024 * 1024) { | |
2925 | size = 1024 * 1024; | |
2926 | } else if (NRL_CHECK_SIZE(size, 4 * 1024 * 1024, max, 2 * 1024)) { | |
2927 | start_off = ((loff_t)ac->ac_o_ex.fe_logical >> | |
2928 | (21 - bsbits)) << 21; | |
2929 | size = 2 * 1024 * 1024; | |
2930 | } else if (NRL_CHECK_SIZE(size, 8 * 1024 * 1024, max, 4 * 1024)) { | |
2931 | start_off = ((loff_t)ac->ac_o_ex.fe_logical >> | |
2932 | (22 - bsbits)) << 22; | |
2933 | size = 4 * 1024 * 1024; | |
2934 | } else if (NRL_CHECK_SIZE(ac->ac_o_ex.fe_len, | |
2935 | (8<<20)>>bsbits, max, 8 * 1024)) { | |
2936 | start_off = ((loff_t)ac->ac_o_ex.fe_logical >> | |
2937 | (23 - bsbits)) << 23; | |
2938 | size = 8 * 1024 * 1024; | |
2939 | } else { | |
2940 | start_off = (loff_t)ac->ac_o_ex.fe_logical << bsbits; | |
2941 | size = ac->ac_o_ex.fe_len << bsbits; | |
2942 | } | |
2943 | size = size >> bsbits; | |
2944 | start = start_off >> bsbits; | |
2945 | ||
2946 | /* don't cover already allocated blocks in selected range */ | |
2947 | if (ar->pleft && start <= ar->lleft) { | |
2948 | size -= ar->lleft + 1 - start; | |
2949 | start = ar->lleft + 1; | |
2950 | } | |
2951 | if (ar->pright && start + size - 1 >= ar->lright) | |
2952 | size -= start + size - ar->lright; | |
2953 | ||
2954 | end = start + size; | |
2955 | ||
2956 | /* check we don't cross already preallocated blocks */ | |
2957 | rcu_read_lock(); | |
2958 | list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { | |
2959 | ext4_lblk_t pa_end; | |
2960 | ||
2961 | if (pa->pa_deleted) | |
2962 | continue; | |
2963 | spin_lock(&pa->pa_lock); | |
2964 | if (pa->pa_deleted) { | |
2965 | spin_unlock(&pa->pa_lock); | |
2966 | continue; | |
2967 | } | |
2968 | ||
2969 | pa_end = pa->pa_lstart + EXT4_C2B(EXT4_SB(ac->ac_sb), | |
2970 | pa->pa_len); | |
2971 | ||
2972 | /* PA must not overlap original request */ | |
2973 | BUG_ON(!(ac->ac_o_ex.fe_logical >= pa_end || | |
2974 | ac->ac_o_ex.fe_logical < pa->pa_lstart)); | |
2975 | ||
2976 | /* skip PAs this normalized request doesn't overlap with */ | |
2977 | if (pa->pa_lstart >= end || pa_end <= start) { | |
2978 | spin_unlock(&pa->pa_lock); | |
2979 | continue; | |
2980 | } | |
2981 | BUG_ON(pa->pa_lstart <= start && pa_end >= end); | |
2982 | ||
2983 | /* adjust start or end to be adjacent to this pa */ | |
2984 | if (pa_end <= ac->ac_o_ex.fe_logical) { | |
2985 | BUG_ON(pa_end < start); | |
2986 | start = pa_end; | |
2987 | } else if (pa->pa_lstart > ac->ac_o_ex.fe_logical) { | |
2988 | BUG_ON(pa->pa_lstart > end); | |
2989 | end = pa->pa_lstart; | |
2990 | } | |
2991 | spin_unlock(&pa->pa_lock); | |
2992 | } | |
2993 | rcu_read_unlock(); | |
2994 | size = end - start; | |
2995 | ||
2996 | /* XXX: extra loop to check we really don't overlap preallocations */ | |
2997 | rcu_read_lock(); | |
2998 | list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { | |
2999 | ext4_lblk_t pa_end; | |
3000 | ||
3001 | spin_lock(&pa->pa_lock); | |
3002 | if (pa->pa_deleted == 0) { | |
3003 | pa_end = pa->pa_lstart + EXT4_C2B(EXT4_SB(ac->ac_sb), | |
3004 | pa->pa_len); | |
3005 | BUG_ON(!(start >= pa_end || end <= pa->pa_lstart)); | |
3006 | } | |
3007 | spin_unlock(&pa->pa_lock); | |
3008 | } | |
3009 | rcu_read_unlock(); | |
3010 | ||
3011 | if (start + size <= ac->ac_o_ex.fe_logical && | |
3012 | start > ac->ac_o_ex.fe_logical) { | |
3013 | ext4_msg(ac->ac_sb, KERN_ERR, | |
3014 | "start %lu, size %lu, fe_logical %lu", | |
3015 | (unsigned long) start, (unsigned long) size, | |
3016 | (unsigned long) ac->ac_o_ex.fe_logical); | |
3017 | } | |
3018 | BUG_ON(start + size <= ac->ac_o_ex.fe_logical && | |
3019 | start > ac->ac_o_ex.fe_logical); | |
3020 | BUG_ON(size <= 0 || size > EXT4_CLUSTERS_PER_GROUP(ac->ac_sb)); | |
3021 | ||
3022 | /* now prepare goal request */ | |
3023 | ||
3024 | /* XXX: is it better to align blocks WRT to logical | |
3025 | * placement or satisfy big request as is */ | |
3026 | ac->ac_g_ex.fe_logical = start; | |
3027 | ac->ac_g_ex.fe_len = EXT4_NUM_B2C(sbi, size); | |
3028 | ||
3029 | /* define goal start in order to merge */ | |
3030 | if (ar->pright && (ar->lright == (start + size))) { | |
3031 | /* merge to the right */ | |
3032 | ext4_get_group_no_and_offset(ac->ac_sb, ar->pright - size, | |
3033 | &ac->ac_f_ex.fe_group, | |
3034 | &ac->ac_f_ex.fe_start); | |
3035 | ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL; | |
3036 | } | |
3037 | if (ar->pleft && (ar->lleft + 1 == start)) { | |
3038 | /* merge to the left */ | |
3039 | ext4_get_group_no_and_offset(ac->ac_sb, ar->pleft + 1, | |
3040 | &ac->ac_f_ex.fe_group, | |
3041 | &ac->ac_f_ex.fe_start); | |
3042 | ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL; | |
3043 | } | |
3044 | ||
3045 | mb_debug(1, "goal: %u(was %u) blocks at %u\n", (unsigned) size, | |
3046 | (unsigned) orig_size, (unsigned) start); | |
3047 | } | |
3048 | ||
3049 | static void ext4_mb_collect_stats(struct ext4_allocation_context *ac) | |
3050 | { | |
3051 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
3052 | ||
3053 | if (sbi->s_mb_stats && ac->ac_g_ex.fe_len > 1) { | |
3054 | atomic_inc(&sbi->s_bal_reqs); | |
3055 | atomic_add(ac->ac_b_ex.fe_len, &sbi->s_bal_allocated); | |
3056 | if (ac->ac_b_ex.fe_len >= ac->ac_o_ex.fe_len) | |
3057 | atomic_inc(&sbi->s_bal_success); | |
3058 | atomic_add(ac->ac_found, &sbi->s_bal_ex_scanned); | |
3059 | if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start && | |
3060 | ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group) | |
3061 | atomic_inc(&sbi->s_bal_goals); | |
3062 | if (ac->ac_found > sbi->s_mb_max_to_scan) | |
3063 | atomic_inc(&sbi->s_bal_breaks); | |
3064 | } | |
3065 | ||
3066 | if (ac->ac_op == EXT4_MB_HISTORY_ALLOC) | |
3067 | trace_ext4_mballoc_alloc(ac); | |
3068 | else | |
3069 | trace_ext4_mballoc_prealloc(ac); | |
3070 | } | |
3071 | ||
3072 | /* | |
3073 | * Called on failure; free up any blocks from the inode PA for this | |
3074 | * context. We don't need this for MB_GROUP_PA because we only change | |
3075 | * pa_free in ext4_mb_release_context(), but on failure, we've already | |
3076 | * zeroed out ac->ac_b_ex.fe_len, so group_pa->pa_free is not changed. | |
3077 | */ | |
3078 | static void ext4_discard_allocated_blocks(struct ext4_allocation_context *ac) | |
3079 | { | |
3080 | struct ext4_prealloc_space *pa = ac->ac_pa; | |
3081 | ||
3082 | if (pa && pa->pa_type == MB_INODE_PA) | |
3083 | pa->pa_free += ac->ac_b_ex.fe_len; | |
3084 | } | |
3085 | ||
3086 | /* | |
3087 | * use blocks preallocated to inode | |
3088 | */ | |
3089 | static void ext4_mb_use_inode_pa(struct ext4_allocation_context *ac, | |
3090 | struct ext4_prealloc_space *pa) | |
3091 | { | |
3092 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
3093 | ext4_fsblk_t start; | |
3094 | ext4_fsblk_t end; | |
3095 | int len; | |
3096 | ||
3097 | /* found preallocated blocks, use them */ | |
3098 | start = pa->pa_pstart + (ac->ac_o_ex.fe_logical - pa->pa_lstart); | |
3099 | end = min(pa->pa_pstart + EXT4_C2B(sbi, pa->pa_len), | |
3100 | start + EXT4_C2B(sbi, ac->ac_o_ex.fe_len)); | |
3101 | len = EXT4_NUM_B2C(sbi, end - start); | |
3102 | ext4_get_group_no_and_offset(ac->ac_sb, start, &ac->ac_b_ex.fe_group, | |
3103 | &ac->ac_b_ex.fe_start); | |
3104 | ac->ac_b_ex.fe_len = len; | |
3105 | ac->ac_status = AC_STATUS_FOUND; | |
3106 | ac->ac_pa = pa; | |
3107 | ||
3108 | BUG_ON(start < pa->pa_pstart); | |
3109 | BUG_ON(end > pa->pa_pstart + EXT4_C2B(sbi, pa->pa_len)); | |
3110 | BUG_ON(pa->pa_free < len); | |
3111 | pa->pa_free -= len; | |
3112 | ||
3113 | mb_debug(1, "use %llu/%u from inode pa %p\n", start, len, pa); | |
3114 | } | |
3115 | ||
3116 | /* | |
3117 | * use blocks preallocated to locality group | |
3118 | */ | |
3119 | static void ext4_mb_use_group_pa(struct ext4_allocation_context *ac, | |
3120 | struct ext4_prealloc_space *pa) | |
3121 | { | |
3122 | unsigned int len = ac->ac_o_ex.fe_len; | |
3123 | ||
3124 | ext4_get_group_no_and_offset(ac->ac_sb, pa->pa_pstart, | |
3125 | &ac->ac_b_ex.fe_group, | |
3126 | &ac->ac_b_ex.fe_start); | |
3127 | ac->ac_b_ex.fe_len = len; | |
3128 | ac->ac_status = AC_STATUS_FOUND; | |
3129 | ac->ac_pa = pa; | |
3130 | ||
3131 | /* we don't correct pa_pstart or pa_plen here to avoid | |
3132 | * possible race when the group is being loaded concurrently | |
3133 | * instead we correct pa later, after blocks are marked | |
3134 | * in on-disk bitmap -- see ext4_mb_release_context() | |
3135 | * Other CPUs are prevented from allocating from this pa by lg_mutex | |
3136 | */ | |
3137 | mb_debug(1, "use %u/%u from group pa %p\n", pa->pa_lstart-len, len, pa); | |
3138 | } | |
3139 | ||
3140 | /* | |
3141 | * Return the prealloc space that have minimal distance | |
3142 | * from the goal block. @cpa is the prealloc | |
3143 | * space that is having currently known minimal distance | |
3144 | * from the goal block. | |
3145 | */ | |
3146 | static struct ext4_prealloc_space * | |
3147 | ext4_mb_check_group_pa(ext4_fsblk_t goal_block, | |
3148 | struct ext4_prealloc_space *pa, | |
3149 | struct ext4_prealloc_space *cpa) | |
3150 | { | |
3151 | ext4_fsblk_t cur_distance, new_distance; | |
3152 | ||
3153 | if (cpa == NULL) { | |
3154 | atomic_inc(&pa->pa_count); | |
3155 | return pa; | |
3156 | } | |
3157 | cur_distance = abs(goal_block - cpa->pa_pstart); | |
3158 | new_distance = abs(goal_block - pa->pa_pstart); | |
3159 | ||
3160 | if (cur_distance <= new_distance) | |
3161 | return cpa; | |
3162 | ||
3163 | /* drop the previous reference */ | |
3164 | atomic_dec(&cpa->pa_count); | |
3165 | atomic_inc(&pa->pa_count); | |
3166 | return pa; | |
3167 | } | |
3168 | ||
3169 | /* | |
3170 | * search goal blocks in preallocated space | |
3171 | */ | |
3172 | static noinline_for_stack int | |
3173 | ext4_mb_use_preallocated(struct ext4_allocation_context *ac) | |
3174 | { | |
3175 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
3176 | int order, i; | |
3177 | struct ext4_inode_info *ei = EXT4_I(ac->ac_inode); | |
3178 | struct ext4_locality_group *lg; | |
3179 | struct ext4_prealloc_space *pa, *cpa = NULL; | |
3180 | ext4_fsblk_t goal_block; | |
3181 | ||
3182 | /* only data can be preallocated */ | |
3183 | if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) | |
3184 | return 0; | |
3185 | ||
3186 | /* first, try per-file preallocation */ | |
3187 | rcu_read_lock(); | |
3188 | list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { | |
3189 | ||
3190 | /* all fields in this condition don't change, | |
3191 | * so we can skip locking for them */ | |
3192 | if (ac->ac_o_ex.fe_logical < pa->pa_lstart || | |
3193 | ac->ac_o_ex.fe_logical >= (pa->pa_lstart + | |
3194 | EXT4_C2B(sbi, pa->pa_len))) | |
3195 | continue; | |
3196 | ||
3197 | /* non-extent files can't have physical blocks past 2^32 */ | |
3198 | if (!(ext4_test_inode_flag(ac->ac_inode, EXT4_INODE_EXTENTS)) && | |
3199 | (pa->pa_pstart + EXT4_C2B(sbi, pa->pa_len) > | |
3200 | EXT4_MAX_BLOCK_FILE_PHYS)) | |
3201 | continue; | |
3202 | ||
3203 | /* found preallocated blocks, use them */ | |
3204 | spin_lock(&pa->pa_lock); | |
3205 | if (pa->pa_deleted == 0 && pa->pa_free) { | |
3206 | atomic_inc(&pa->pa_count); | |
3207 | ext4_mb_use_inode_pa(ac, pa); | |
3208 | spin_unlock(&pa->pa_lock); | |
3209 | ac->ac_criteria = 10; | |
3210 | rcu_read_unlock(); | |
3211 | return 1; | |
3212 | } | |
3213 | spin_unlock(&pa->pa_lock); | |
3214 | } | |
3215 | rcu_read_unlock(); | |
3216 | ||
3217 | /* can we use group allocation? */ | |
3218 | if (!(ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC)) | |
3219 | return 0; | |
3220 | ||
3221 | /* inode may have no locality group for some reason */ | |
3222 | lg = ac->ac_lg; | |
3223 | if (lg == NULL) | |
3224 | return 0; | |
3225 | order = fls(ac->ac_o_ex.fe_len) - 1; | |
3226 | if (order > PREALLOC_TB_SIZE - 1) | |
3227 | /* The max size of hash table is PREALLOC_TB_SIZE */ | |
3228 | order = PREALLOC_TB_SIZE - 1; | |
3229 | ||
3230 | goal_block = ext4_grp_offs_to_block(ac->ac_sb, &ac->ac_g_ex); | |
3231 | /* | |
3232 | * search for the prealloc space that is having | |
3233 | * minimal distance from the goal block. | |
3234 | */ | |
3235 | for (i = order; i < PREALLOC_TB_SIZE; i++) { | |
3236 | rcu_read_lock(); | |
3237 | list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[i], | |
3238 | pa_inode_list) { | |
3239 | spin_lock(&pa->pa_lock); | |
3240 | if (pa->pa_deleted == 0 && | |
3241 | pa->pa_free >= ac->ac_o_ex.fe_len) { | |
3242 | ||
3243 | cpa = ext4_mb_check_group_pa(goal_block, | |
3244 | pa, cpa); | |
3245 | } | |
3246 | spin_unlock(&pa->pa_lock); | |
3247 | } | |
3248 | rcu_read_unlock(); | |
3249 | } | |
3250 | if (cpa) { | |
3251 | ext4_mb_use_group_pa(ac, cpa); | |
3252 | ac->ac_criteria = 20; | |
3253 | return 1; | |
3254 | } | |
3255 | return 0; | |
3256 | } | |
3257 | ||
3258 | /* | |
3259 | * the function goes through all block freed in the group | |
3260 | * but not yet committed and marks them used in in-core bitmap. | |
3261 | * buddy must be generated from this bitmap | |
3262 | * Need to be called with the ext4 group lock held | |
3263 | */ | |
3264 | static void ext4_mb_generate_from_freelist(struct super_block *sb, void *bitmap, | |
3265 | ext4_group_t group) | |
3266 | { | |
3267 | struct rb_node *n; | |
3268 | struct ext4_group_info *grp; | |
3269 | struct ext4_free_data *entry; | |
3270 | ||
3271 | grp = ext4_get_group_info(sb, group); | |
3272 | n = rb_first(&(grp->bb_free_root)); | |
3273 | ||
3274 | while (n) { | |
3275 | entry = rb_entry(n, struct ext4_free_data, efd_node); | |
3276 | ext4_set_bits(bitmap, entry->efd_start_cluster, entry->efd_count); | |
3277 | n = rb_next(n); | |
3278 | } | |
3279 | return; | |
3280 | } | |
3281 | ||
3282 | /* | |
3283 | * the function goes through all preallocation in this group and marks them | |
3284 | * used in in-core bitmap. buddy must be generated from this bitmap | |
3285 | * Need to be called with ext4 group lock held | |
3286 | */ | |
3287 | static noinline_for_stack | |
3288 | void ext4_mb_generate_from_pa(struct super_block *sb, void *bitmap, | |
3289 | ext4_group_t group) | |
3290 | { | |
3291 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
3292 | struct ext4_prealloc_space *pa; | |
3293 | struct list_head *cur; | |
3294 | ext4_group_t groupnr; | |
3295 | ext4_grpblk_t start; | |
3296 | int preallocated = 0; | |
3297 | int len; | |
3298 | ||
3299 | /* all form of preallocation discards first load group, | |
3300 | * so the only competing code is preallocation use. | |
3301 | * we don't need any locking here | |
3302 | * notice we do NOT ignore preallocations with pa_deleted | |
3303 | * otherwise we could leave used blocks available for | |
3304 | * allocation in buddy when concurrent ext4_mb_put_pa() | |
3305 | * is dropping preallocation | |
3306 | */ | |
3307 | list_for_each(cur, &grp->bb_prealloc_list) { | |
3308 | pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); | |
3309 | spin_lock(&pa->pa_lock); | |
3310 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, | |
3311 | &groupnr, &start); | |
3312 | len = pa->pa_len; | |
3313 | spin_unlock(&pa->pa_lock); | |
3314 | if (unlikely(len == 0)) | |
3315 | continue; | |
3316 | BUG_ON(groupnr != group); | |
3317 | ext4_set_bits(bitmap, start, len); | |
3318 | preallocated += len; | |
3319 | } | |
3320 | mb_debug(1, "prellocated %u for group %u\n", preallocated, group); | |
3321 | } | |
3322 | ||
3323 | static void ext4_mb_pa_callback(struct rcu_head *head) | |
3324 | { | |
3325 | struct ext4_prealloc_space *pa; | |
3326 | pa = container_of(head, struct ext4_prealloc_space, u.pa_rcu); | |
3327 | kmem_cache_free(ext4_pspace_cachep, pa); | |
3328 | } | |
3329 | ||
3330 | /* | |
3331 | * drops a reference to preallocated space descriptor | |
3332 | * if this was the last reference and the space is consumed | |
3333 | */ | |
3334 | static void ext4_mb_put_pa(struct ext4_allocation_context *ac, | |
3335 | struct super_block *sb, struct ext4_prealloc_space *pa) | |
3336 | { | |
3337 | ext4_group_t grp; | |
3338 | ext4_fsblk_t grp_blk; | |
3339 | ||
3340 | if (!atomic_dec_and_test(&pa->pa_count) || pa->pa_free != 0) | |
3341 | return; | |
3342 | ||
3343 | /* in this short window concurrent discard can set pa_deleted */ | |
3344 | spin_lock(&pa->pa_lock); | |
3345 | if (pa->pa_deleted == 1) { | |
3346 | spin_unlock(&pa->pa_lock); | |
3347 | return; | |
3348 | } | |
3349 | ||
3350 | pa->pa_deleted = 1; | |
3351 | spin_unlock(&pa->pa_lock); | |
3352 | ||
3353 | grp_blk = pa->pa_pstart; | |
3354 | /* | |
3355 | * If doing group-based preallocation, pa_pstart may be in the | |
3356 | * next group when pa is used up | |
3357 | */ | |
3358 | if (pa->pa_type == MB_GROUP_PA) | |
3359 | grp_blk--; | |
3360 | ||
3361 | ext4_get_group_no_and_offset(sb, grp_blk, &grp, NULL); | |
3362 | ||
3363 | /* | |
3364 | * possible race: | |
3365 | * | |
3366 | * P1 (buddy init) P2 (regular allocation) | |
3367 | * find block B in PA | |
3368 | * copy on-disk bitmap to buddy | |
3369 | * mark B in on-disk bitmap | |
3370 | * drop PA from group | |
3371 | * mark all PAs in buddy | |
3372 | * | |
3373 | * thus, P1 initializes buddy with B available. to prevent this | |
3374 | * we make "copy" and "mark all PAs" atomic and serialize "drop PA" | |
3375 | * against that pair | |
3376 | */ | |
3377 | ext4_lock_group(sb, grp); | |
3378 | list_del(&pa->pa_group_list); | |
3379 | ext4_unlock_group(sb, grp); | |
3380 | ||
3381 | spin_lock(pa->pa_obj_lock); | |
3382 | list_del_rcu(&pa->pa_inode_list); | |
3383 | spin_unlock(pa->pa_obj_lock); | |
3384 | ||
3385 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
3386 | } | |
3387 | ||
3388 | /* | |
3389 | * creates new preallocated space for given inode | |
3390 | */ | |
3391 | static noinline_for_stack int | |
3392 | ext4_mb_new_inode_pa(struct ext4_allocation_context *ac) | |
3393 | { | |
3394 | struct super_block *sb = ac->ac_sb; | |
3395 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
3396 | struct ext4_prealloc_space *pa; | |
3397 | struct ext4_group_info *grp; | |
3398 | struct ext4_inode_info *ei; | |
3399 | ||
3400 | /* preallocate only when found space is larger then requested */ | |
3401 | BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len); | |
3402 | BUG_ON(ac->ac_status != AC_STATUS_FOUND); | |
3403 | BUG_ON(!S_ISREG(ac->ac_inode->i_mode)); | |
3404 | ||
3405 | pa = kmem_cache_alloc(ext4_pspace_cachep, GFP_NOFS); | |
3406 | if (pa == NULL) | |
3407 | return -ENOMEM; | |
3408 | ||
3409 | if (ac->ac_b_ex.fe_len < ac->ac_g_ex.fe_len) { | |
3410 | int winl; | |
3411 | int wins; | |
3412 | int win; | |
3413 | int offs; | |
3414 | ||
3415 | /* we can't allocate as much as normalizer wants. | |
3416 | * so, found space must get proper lstart | |
3417 | * to cover original request */ | |
3418 | BUG_ON(ac->ac_g_ex.fe_logical > ac->ac_o_ex.fe_logical); | |
3419 | BUG_ON(ac->ac_g_ex.fe_len < ac->ac_o_ex.fe_len); | |
3420 | ||
3421 | /* we're limited by original request in that | |
3422 | * logical block must be covered any way | |
3423 | * winl is window we can move our chunk within */ | |
3424 | winl = ac->ac_o_ex.fe_logical - ac->ac_g_ex.fe_logical; | |
3425 | ||
3426 | /* also, we should cover whole original request */ | |
3427 | wins = EXT4_C2B(sbi, ac->ac_b_ex.fe_len - ac->ac_o_ex.fe_len); | |
3428 | ||
3429 | /* the smallest one defines real window */ | |
3430 | win = min(winl, wins); | |
3431 | ||
3432 | offs = ac->ac_o_ex.fe_logical % | |
3433 | EXT4_C2B(sbi, ac->ac_b_ex.fe_len); | |
3434 | if (offs && offs < win) | |
3435 | win = offs; | |
3436 | ||
3437 | ac->ac_b_ex.fe_logical = ac->ac_o_ex.fe_logical - | |
3438 | EXT4_B2C(sbi, win); | |
3439 | BUG_ON(ac->ac_o_ex.fe_logical < ac->ac_b_ex.fe_logical); | |
3440 | BUG_ON(ac->ac_o_ex.fe_len > ac->ac_b_ex.fe_len); | |
3441 | } | |
3442 | ||
3443 | /* preallocation can change ac_b_ex, thus we store actually | |
3444 | * allocated blocks for history */ | |
3445 | ac->ac_f_ex = ac->ac_b_ex; | |
3446 | ||
3447 | pa->pa_lstart = ac->ac_b_ex.fe_logical; | |
3448 | pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
3449 | pa->pa_len = ac->ac_b_ex.fe_len; | |
3450 | pa->pa_free = pa->pa_len; | |
3451 | atomic_set(&pa->pa_count, 1); | |
3452 | spin_lock_init(&pa->pa_lock); | |
3453 | INIT_LIST_HEAD(&pa->pa_inode_list); | |
3454 | INIT_LIST_HEAD(&pa->pa_group_list); | |
3455 | pa->pa_deleted = 0; | |
3456 | pa->pa_type = MB_INODE_PA; | |
3457 | ||
3458 | mb_debug(1, "new inode pa %p: %llu/%u for %u\n", pa, | |
3459 | pa->pa_pstart, pa->pa_len, pa->pa_lstart); | |
3460 | trace_ext4_mb_new_inode_pa(ac, pa); | |
3461 | ||
3462 | ext4_mb_use_inode_pa(ac, pa); | |
3463 | atomic_add(pa->pa_free, &sbi->s_mb_preallocated); | |
3464 | ||
3465 | ei = EXT4_I(ac->ac_inode); | |
3466 | grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group); | |
3467 | ||
3468 | pa->pa_obj_lock = &ei->i_prealloc_lock; | |
3469 | pa->pa_inode = ac->ac_inode; | |
3470 | ||
3471 | ext4_lock_group(sb, ac->ac_b_ex.fe_group); | |
3472 | list_add(&pa->pa_group_list, &grp->bb_prealloc_list); | |
3473 | ext4_unlock_group(sb, ac->ac_b_ex.fe_group); | |
3474 | ||
3475 | spin_lock(pa->pa_obj_lock); | |
3476 | list_add_rcu(&pa->pa_inode_list, &ei->i_prealloc_list); | |
3477 | spin_unlock(pa->pa_obj_lock); | |
3478 | ||
3479 | return 0; | |
3480 | } | |
3481 | ||
3482 | /* | |
3483 | * creates new preallocated space for locality group inodes belongs to | |
3484 | */ | |
3485 | static noinline_for_stack int | |
3486 | ext4_mb_new_group_pa(struct ext4_allocation_context *ac) | |
3487 | { | |
3488 | struct super_block *sb = ac->ac_sb; | |
3489 | struct ext4_locality_group *lg; | |
3490 | struct ext4_prealloc_space *pa; | |
3491 | struct ext4_group_info *grp; | |
3492 | ||
3493 | /* preallocate only when found space is larger then requested */ | |
3494 | BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len); | |
3495 | BUG_ON(ac->ac_status != AC_STATUS_FOUND); | |
3496 | BUG_ON(!S_ISREG(ac->ac_inode->i_mode)); | |
3497 | ||
3498 | BUG_ON(ext4_pspace_cachep == NULL); | |
3499 | pa = kmem_cache_alloc(ext4_pspace_cachep, GFP_NOFS); | |
3500 | if (pa == NULL) | |
3501 | return -ENOMEM; | |
3502 | ||
3503 | /* preallocation can change ac_b_ex, thus we store actually | |
3504 | * allocated blocks for history */ | |
3505 | ac->ac_f_ex = ac->ac_b_ex; | |
3506 | ||
3507 | pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
3508 | pa->pa_lstart = pa->pa_pstart; | |
3509 | pa->pa_len = ac->ac_b_ex.fe_len; | |
3510 | pa->pa_free = pa->pa_len; | |
3511 | atomic_set(&pa->pa_count, 1); | |
3512 | spin_lock_init(&pa->pa_lock); | |
3513 | INIT_LIST_HEAD(&pa->pa_inode_list); | |
3514 | INIT_LIST_HEAD(&pa->pa_group_list); | |
3515 | pa->pa_deleted = 0; | |
3516 | pa->pa_type = MB_GROUP_PA; | |
3517 | ||
3518 | mb_debug(1, "new group pa %p: %llu/%u for %u\n", pa, | |
3519 | pa->pa_pstart, pa->pa_len, pa->pa_lstart); | |
3520 | trace_ext4_mb_new_group_pa(ac, pa); | |
3521 | ||
3522 | ext4_mb_use_group_pa(ac, pa); | |
3523 | atomic_add(pa->pa_free, &EXT4_SB(sb)->s_mb_preallocated); | |
3524 | ||
3525 | grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group); | |
3526 | lg = ac->ac_lg; | |
3527 | BUG_ON(lg == NULL); | |
3528 | ||
3529 | pa->pa_obj_lock = &lg->lg_prealloc_lock; | |
3530 | pa->pa_inode = NULL; | |
3531 | ||
3532 | ext4_lock_group(sb, ac->ac_b_ex.fe_group); | |
3533 | list_add(&pa->pa_group_list, &grp->bb_prealloc_list); | |
3534 | ext4_unlock_group(sb, ac->ac_b_ex.fe_group); | |
3535 | ||
3536 | /* | |
3537 | * We will later add the new pa to the right bucket | |
3538 | * after updating the pa_free in ext4_mb_release_context | |
3539 | */ | |
3540 | return 0; | |
3541 | } | |
3542 | ||
3543 | static int ext4_mb_new_preallocation(struct ext4_allocation_context *ac) | |
3544 | { | |
3545 | int err; | |
3546 | ||
3547 | if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) | |
3548 | err = ext4_mb_new_group_pa(ac); | |
3549 | else | |
3550 | err = ext4_mb_new_inode_pa(ac); | |
3551 | return err; | |
3552 | } | |
3553 | ||
3554 | /* | |
3555 | * finds all unused blocks in on-disk bitmap, frees them in | |
3556 | * in-core bitmap and buddy. | |
3557 | * @pa must be unlinked from inode and group lists, so that | |
3558 | * nobody else can find/use it. | |
3559 | * the caller MUST hold group/inode locks. | |
3560 | * TODO: optimize the case when there are no in-core structures yet | |
3561 | */ | |
3562 | static noinline_for_stack int | |
3563 | ext4_mb_release_inode_pa(struct ext4_buddy *e4b, struct buffer_head *bitmap_bh, | |
3564 | struct ext4_prealloc_space *pa) | |
3565 | { | |
3566 | struct super_block *sb = e4b->bd_sb; | |
3567 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
3568 | unsigned int end; | |
3569 | unsigned int next; | |
3570 | ext4_group_t group; | |
3571 | ext4_grpblk_t bit; | |
3572 | unsigned long long grp_blk_start; | |
3573 | int err = 0; | |
3574 | int free = 0; | |
3575 | ||
3576 | BUG_ON(pa->pa_deleted == 0); | |
3577 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit); | |
3578 | grp_blk_start = pa->pa_pstart - EXT4_C2B(sbi, bit); | |
3579 | BUG_ON(group != e4b->bd_group && pa->pa_len != 0); | |
3580 | end = bit + pa->pa_len; | |
3581 | ||
3582 | while (bit < end) { | |
3583 | bit = mb_find_next_zero_bit(bitmap_bh->b_data, end, bit); | |
3584 | if (bit >= end) | |
3585 | break; | |
3586 | next = mb_find_next_bit(bitmap_bh->b_data, end, bit); | |
3587 | mb_debug(1, " free preallocated %u/%u in group %u\n", | |
3588 | (unsigned) ext4_group_first_block_no(sb, group) + bit, | |
3589 | (unsigned) next - bit, (unsigned) group); | |
3590 | free += next - bit; | |
3591 | ||
3592 | trace_ext4_mballoc_discard(sb, NULL, group, bit, next - bit); | |
3593 | trace_ext4_mb_release_inode_pa(pa, (grp_blk_start + | |
3594 | EXT4_C2B(sbi, bit)), | |
3595 | next - bit); | |
3596 | mb_free_blocks(pa->pa_inode, e4b, bit, next - bit); | |
3597 | bit = next + 1; | |
3598 | } | |
3599 | if (free != pa->pa_free) { | |
3600 | ext4_msg(e4b->bd_sb, KERN_CRIT, | |
3601 | "pa %p: logic %lu, phys. %lu, len %lu", | |
3602 | pa, (unsigned long) pa->pa_lstart, | |
3603 | (unsigned long) pa->pa_pstart, | |
3604 | (unsigned long) pa->pa_len); | |
3605 | ext4_grp_locked_error(sb, group, 0, 0, "free %u, pa_free %u", | |
3606 | free, pa->pa_free); | |
3607 | /* | |
3608 | * pa is already deleted so we use the value obtained | |
3609 | * from the bitmap and continue. | |
3610 | */ | |
3611 | } | |
3612 | atomic_add(free, &sbi->s_mb_discarded); | |
3613 | ||
3614 | return err; | |
3615 | } | |
3616 | ||
3617 | static noinline_for_stack int | |
3618 | ext4_mb_release_group_pa(struct ext4_buddy *e4b, | |
3619 | struct ext4_prealloc_space *pa) | |
3620 | { | |
3621 | struct super_block *sb = e4b->bd_sb; | |
3622 | ext4_group_t group; | |
3623 | ext4_grpblk_t bit; | |
3624 | ||
3625 | trace_ext4_mb_release_group_pa(sb, pa); | |
3626 | BUG_ON(pa->pa_deleted == 0); | |
3627 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit); | |
3628 | BUG_ON(group != e4b->bd_group && pa->pa_len != 0); | |
3629 | mb_free_blocks(pa->pa_inode, e4b, bit, pa->pa_len); | |
3630 | atomic_add(pa->pa_len, &EXT4_SB(sb)->s_mb_discarded); | |
3631 | trace_ext4_mballoc_discard(sb, NULL, group, bit, pa->pa_len); | |
3632 | ||
3633 | return 0; | |
3634 | } | |
3635 | ||
3636 | /* | |
3637 | * releases all preallocations in given group | |
3638 | * | |
3639 | * first, we need to decide discard policy: | |
3640 | * - when do we discard | |
3641 | * 1) ENOSPC | |
3642 | * - how many do we discard | |
3643 | * 1) how many requested | |
3644 | */ | |
3645 | static noinline_for_stack int | |
3646 | ext4_mb_discard_group_preallocations(struct super_block *sb, | |
3647 | ext4_group_t group, int needed) | |
3648 | { | |
3649 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
3650 | struct buffer_head *bitmap_bh = NULL; | |
3651 | struct ext4_prealloc_space *pa, *tmp; | |
3652 | struct list_head list; | |
3653 | struct ext4_buddy e4b; | |
3654 | int err; | |
3655 | int busy = 0; | |
3656 | int free = 0; | |
3657 | ||
3658 | mb_debug(1, "discard preallocation for group %u\n", group); | |
3659 | ||
3660 | if (list_empty(&grp->bb_prealloc_list)) | |
3661 | return 0; | |
3662 | ||
3663 | bitmap_bh = ext4_read_block_bitmap(sb, group); | |
3664 | if (bitmap_bh == NULL) { | |
3665 | ext4_error(sb, "Error reading block bitmap for %u", group); | |
3666 | return 0; | |
3667 | } | |
3668 | ||
3669 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
3670 | if (err) { | |
3671 | ext4_error(sb, "Error loading buddy information for %u", group); | |
3672 | put_bh(bitmap_bh); | |
3673 | return 0; | |
3674 | } | |
3675 | ||
3676 | if (needed == 0) | |
3677 | needed = EXT4_CLUSTERS_PER_GROUP(sb) + 1; | |
3678 | ||
3679 | INIT_LIST_HEAD(&list); | |
3680 | repeat: | |
3681 | ext4_lock_group(sb, group); | |
3682 | list_for_each_entry_safe(pa, tmp, | |
3683 | &grp->bb_prealloc_list, pa_group_list) { | |
3684 | spin_lock(&pa->pa_lock); | |
3685 | if (atomic_read(&pa->pa_count)) { | |
3686 | spin_unlock(&pa->pa_lock); | |
3687 | busy = 1; | |
3688 | continue; | |
3689 | } | |
3690 | if (pa->pa_deleted) { | |
3691 | spin_unlock(&pa->pa_lock); | |
3692 | continue; | |
3693 | } | |
3694 | ||
3695 | /* seems this one can be freed ... */ | |
3696 | pa->pa_deleted = 1; | |
3697 | ||
3698 | /* we can trust pa_free ... */ | |
3699 | free += pa->pa_free; | |
3700 | ||
3701 | spin_unlock(&pa->pa_lock); | |
3702 | ||
3703 | list_del(&pa->pa_group_list); | |
3704 | list_add(&pa->u.pa_tmp_list, &list); | |
3705 | } | |
3706 | ||
3707 | /* if we still need more blocks and some PAs were used, try again */ | |
3708 | if (free < needed && busy) { | |
3709 | busy = 0; | |
3710 | ext4_unlock_group(sb, group); | |
3711 | /* | |
3712 | * Yield the CPU here so that we don't get soft lockup | |
3713 | * in non preempt case. | |
3714 | */ | |
3715 | yield(); | |
3716 | goto repeat; | |
3717 | } | |
3718 | ||
3719 | /* found anything to free? */ | |
3720 | if (list_empty(&list)) { | |
3721 | BUG_ON(free != 0); | |
3722 | goto out; | |
3723 | } | |
3724 | ||
3725 | /* now free all selected PAs */ | |
3726 | list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) { | |
3727 | ||
3728 | /* remove from object (inode or locality group) */ | |
3729 | spin_lock(pa->pa_obj_lock); | |
3730 | list_del_rcu(&pa->pa_inode_list); | |
3731 | spin_unlock(pa->pa_obj_lock); | |
3732 | ||
3733 | if (pa->pa_type == MB_GROUP_PA) | |
3734 | ext4_mb_release_group_pa(&e4b, pa); | |
3735 | else | |
3736 | ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa); | |
3737 | ||
3738 | list_del(&pa->u.pa_tmp_list); | |
3739 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
3740 | } | |
3741 | ||
3742 | out: | |
3743 | ext4_unlock_group(sb, group); | |
3744 | ext4_mb_unload_buddy(&e4b); | |
3745 | put_bh(bitmap_bh); | |
3746 | return free; | |
3747 | } | |
3748 | ||
3749 | /* | |
3750 | * releases all non-used preallocated blocks for given inode | |
3751 | * | |
3752 | * It's important to discard preallocations under i_data_sem | |
3753 | * We don't want another block to be served from the prealloc | |
3754 | * space when we are discarding the inode prealloc space. | |
3755 | * | |
3756 | * FIXME!! Make sure it is valid at all the call sites | |
3757 | */ | |
3758 | void ext4_discard_preallocations(struct inode *inode) | |
3759 | { | |
3760 | struct ext4_inode_info *ei = EXT4_I(inode); | |
3761 | struct super_block *sb = inode->i_sb; | |
3762 | struct buffer_head *bitmap_bh = NULL; | |
3763 | struct ext4_prealloc_space *pa, *tmp; | |
3764 | ext4_group_t group = 0; | |
3765 | struct list_head list; | |
3766 | struct ext4_buddy e4b; | |
3767 | int err; | |
3768 | ||
3769 | if (!S_ISREG(inode->i_mode)) { | |
3770 | /*BUG_ON(!list_empty(&ei->i_prealloc_list));*/ | |
3771 | return; | |
3772 | } | |
3773 | ||
3774 | mb_debug(1, "discard preallocation for inode %lu\n", inode->i_ino); | |
3775 | trace_ext4_discard_preallocations(inode); | |
3776 | ||
3777 | INIT_LIST_HEAD(&list); | |
3778 | ||
3779 | repeat: | |
3780 | /* first, collect all pa's in the inode */ | |
3781 | spin_lock(&ei->i_prealloc_lock); | |
3782 | while (!list_empty(&ei->i_prealloc_list)) { | |
3783 | pa = list_entry(ei->i_prealloc_list.next, | |
3784 | struct ext4_prealloc_space, pa_inode_list); | |
3785 | BUG_ON(pa->pa_obj_lock != &ei->i_prealloc_lock); | |
3786 | spin_lock(&pa->pa_lock); | |
3787 | if (atomic_read(&pa->pa_count)) { | |
3788 | /* this shouldn't happen often - nobody should | |
3789 | * use preallocation while we're discarding it */ | |
3790 | spin_unlock(&pa->pa_lock); | |
3791 | spin_unlock(&ei->i_prealloc_lock); | |
3792 | ext4_msg(sb, KERN_ERR, | |
3793 | "uh-oh! used pa while discarding"); | |
3794 | WARN_ON(1); | |
3795 | schedule_timeout_uninterruptible(HZ); | |
3796 | goto repeat; | |
3797 | ||
3798 | } | |
3799 | if (pa->pa_deleted == 0) { | |
3800 | pa->pa_deleted = 1; | |
3801 | spin_unlock(&pa->pa_lock); | |
3802 | list_del_rcu(&pa->pa_inode_list); | |
3803 | list_add(&pa->u.pa_tmp_list, &list); | |
3804 | continue; | |
3805 | } | |
3806 | ||
3807 | /* someone is deleting pa right now */ | |
3808 | spin_unlock(&pa->pa_lock); | |
3809 | spin_unlock(&ei->i_prealloc_lock); | |
3810 | ||
3811 | /* we have to wait here because pa_deleted | |
3812 | * doesn't mean pa is already unlinked from | |
3813 | * the list. as we might be called from | |
3814 | * ->clear_inode() the inode will get freed | |
3815 | * and concurrent thread which is unlinking | |
3816 | * pa from inode's list may access already | |
3817 | * freed memory, bad-bad-bad */ | |
3818 | ||
3819 | /* XXX: if this happens too often, we can | |
3820 | * add a flag to force wait only in case | |
3821 | * of ->clear_inode(), but not in case of | |
3822 | * regular truncate */ | |
3823 | schedule_timeout_uninterruptible(HZ); | |
3824 | goto repeat; | |
3825 | } | |
3826 | spin_unlock(&ei->i_prealloc_lock); | |
3827 | ||
3828 | list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) { | |
3829 | BUG_ON(pa->pa_type != MB_INODE_PA); | |
3830 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, NULL); | |
3831 | ||
3832 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
3833 | if (err) { | |
3834 | ext4_error(sb, "Error loading buddy information for %u", | |
3835 | group); | |
3836 | continue; | |
3837 | } | |
3838 | ||
3839 | bitmap_bh = ext4_read_block_bitmap(sb, group); | |
3840 | if (bitmap_bh == NULL) { | |
3841 | ext4_error(sb, "Error reading block bitmap for %u", | |
3842 | group); | |
3843 | ext4_mb_unload_buddy(&e4b); | |
3844 | continue; | |
3845 | } | |
3846 | ||
3847 | ext4_lock_group(sb, group); | |
3848 | list_del(&pa->pa_group_list); | |
3849 | ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa); | |
3850 | ext4_unlock_group(sb, group); | |
3851 | ||
3852 | ext4_mb_unload_buddy(&e4b); | |
3853 | put_bh(bitmap_bh); | |
3854 | ||
3855 | list_del(&pa->u.pa_tmp_list); | |
3856 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
3857 | } | |
3858 | } | |
3859 | ||
3860 | #ifdef CONFIG_EXT4_DEBUG | |
3861 | static void ext4_mb_show_ac(struct ext4_allocation_context *ac) | |
3862 | { | |
3863 | struct super_block *sb = ac->ac_sb; | |
3864 | ext4_group_t ngroups, i; | |
3865 | ||
3866 | if (!mb_enable_debug || | |
3867 | (EXT4_SB(sb)->s_mount_flags & EXT4_MF_FS_ABORTED)) | |
3868 | return; | |
3869 | ||
3870 | ext4_msg(ac->ac_sb, KERN_ERR, "Can't allocate:" | |
3871 | " Allocation context details:"); | |
3872 | ext4_msg(ac->ac_sb, KERN_ERR, "status %d flags %d", | |
3873 | ac->ac_status, ac->ac_flags); | |
3874 | ext4_msg(ac->ac_sb, KERN_ERR, "orig %lu/%lu/%lu@%lu, " | |
3875 | "goal %lu/%lu/%lu@%lu, " | |
3876 | "best %lu/%lu/%lu@%lu cr %d", | |
3877 | (unsigned long)ac->ac_o_ex.fe_group, | |
3878 | (unsigned long)ac->ac_o_ex.fe_start, | |
3879 | (unsigned long)ac->ac_o_ex.fe_len, | |
3880 | (unsigned long)ac->ac_o_ex.fe_logical, | |
3881 | (unsigned long)ac->ac_g_ex.fe_group, | |
3882 | (unsigned long)ac->ac_g_ex.fe_start, | |
3883 | (unsigned long)ac->ac_g_ex.fe_len, | |
3884 | (unsigned long)ac->ac_g_ex.fe_logical, | |
3885 | (unsigned long)ac->ac_b_ex.fe_group, | |
3886 | (unsigned long)ac->ac_b_ex.fe_start, | |
3887 | (unsigned long)ac->ac_b_ex.fe_len, | |
3888 | (unsigned long)ac->ac_b_ex.fe_logical, | |
3889 | (int)ac->ac_criteria); | |
3890 | ext4_msg(ac->ac_sb, KERN_ERR, "%lu scanned, %d found", | |
3891 | ac->ac_ex_scanned, ac->ac_found); | |
3892 | ext4_msg(ac->ac_sb, KERN_ERR, "groups: "); | |
3893 | ngroups = ext4_get_groups_count(sb); | |
3894 | for (i = 0; i < ngroups; i++) { | |
3895 | struct ext4_group_info *grp = ext4_get_group_info(sb, i); | |
3896 | struct ext4_prealloc_space *pa; | |
3897 | ext4_grpblk_t start; | |
3898 | struct list_head *cur; | |
3899 | ext4_lock_group(sb, i); | |
3900 | list_for_each(cur, &grp->bb_prealloc_list) { | |
3901 | pa = list_entry(cur, struct ext4_prealloc_space, | |
3902 | pa_group_list); | |
3903 | spin_lock(&pa->pa_lock); | |
3904 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, | |
3905 | NULL, &start); | |
3906 | spin_unlock(&pa->pa_lock); | |
3907 | printk(KERN_ERR "PA:%u:%d:%u \n", i, | |
3908 | start, pa->pa_len); | |
3909 | } | |
3910 | ext4_unlock_group(sb, i); | |
3911 | ||
3912 | if (grp->bb_free == 0) | |
3913 | continue; | |
3914 | printk(KERN_ERR "%u: %d/%d \n", | |
3915 | i, grp->bb_free, grp->bb_fragments); | |
3916 | } | |
3917 | printk(KERN_ERR "\n"); | |
3918 | } | |
3919 | #else | |
3920 | static inline void ext4_mb_show_ac(struct ext4_allocation_context *ac) | |
3921 | { | |
3922 | return; | |
3923 | } | |
3924 | #endif | |
3925 | ||
3926 | /* | |
3927 | * We use locality group preallocation for small size file. The size of the | |
3928 | * file is determined by the current size or the resulting size after | |
3929 | * allocation which ever is larger | |
3930 | * | |
3931 | * One can tune this size via /sys/fs/ext4/<partition>/mb_stream_req | |
3932 | */ | |
3933 | static void ext4_mb_group_or_file(struct ext4_allocation_context *ac) | |
3934 | { | |
3935 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
3936 | int bsbits = ac->ac_sb->s_blocksize_bits; | |
3937 | loff_t size, isize; | |
3938 | ||
3939 | if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) | |
3940 | return; | |
3941 | ||
3942 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) | |
3943 | return; | |
3944 | ||
3945 | size = ac->ac_o_ex.fe_logical + EXT4_C2B(sbi, ac->ac_o_ex.fe_len); | |
3946 | isize = (i_size_read(ac->ac_inode) + ac->ac_sb->s_blocksize - 1) | |
3947 | >> bsbits; | |
3948 | ||
3949 | if ((size == isize) && | |
3950 | !ext4_fs_is_busy(sbi) && | |
3951 | (atomic_read(&ac->ac_inode->i_writecount) == 0)) { | |
3952 | ac->ac_flags |= EXT4_MB_HINT_NOPREALLOC; | |
3953 | return; | |
3954 | } | |
3955 | ||
3956 | if (sbi->s_mb_group_prealloc <= 0) { | |
3957 | ac->ac_flags |= EXT4_MB_STREAM_ALLOC; | |
3958 | return; | |
3959 | } | |
3960 | ||
3961 | /* don't use group allocation for large files */ | |
3962 | size = max(size, isize); | |
3963 | if (size > sbi->s_mb_stream_request) { | |
3964 | ac->ac_flags |= EXT4_MB_STREAM_ALLOC; | |
3965 | return; | |
3966 | } | |
3967 | ||
3968 | BUG_ON(ac->ac_lg != NULL); | |
3969 | /* | |
3970 | * locality group prealloc space are per cpu. The reason for having | |
3971 | * per cpu locality group is to reduce the contention between block | |
3972 | * request from multiple CPUs. | |
3973 | */ | |
3974 | ac->ac_lg = __this_cpu_ptr(sbi->s_locality_groups); | |
3975 | ||
3976 | /* we're going to use group allocation */ | |
3977 | ac->ac_flags |= EXT4_MB_HINT_GROUP_ALLOC; | |
3978 | ||
3979 | /* serialize all allocations in the group */ | |
3980 | mutex_lock(&ac->ac_lg->lg_mutex); | |
3981 | } | |
3982 | ||
3983 | static noinline_for_stack int | |
3984 | ext4_mb_initialize_context(struct ext4_allocation_context *ac, | |
3985 | struct ext4_allocation_request *ar) | |
3986 | { | |
3987 | struct super_block *sb = ar->inode->i_sb; | |
3988 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
3989 | struct ext4_super_block *es = sbi->s_es; | |
3990 | ext4_group_t group; | |
3991 | unsigned int len; | |
3992 | ext4_fsblk_t goal; | |
3993 | ext4_grpblk_t block; | |
3994 | ||
3995 | /* we can't allocate > group size */ | |
3996 | len = ar->len; | |
3997 | ||
3998 | /* just a dirty hack to filter too big requests */ | |
3999 | if (len >= EXT4_CLUSTERS_PER_GROUP(sb) - 10) | |
4000 | len = EXT4_CLUSTERS_PER_GROUP(sb) - 10; | |
4001 | ||
4002 | /* start searching from the goal */ | |
4003 | goal = ar->goal; | |
4004 | if (goal < le32_to_cpu(es->s_first_data_block) || | |
4005 | goal >= ext4_blocks_count(es)) | |
4006 | goal = le32_to_cpu(es->s_first_data_block); | |
4007 | ext4_get_group_no_and_offset(sb, goal, &group, &block); | |
4008 | ||
4009 | /* set up allocation goals */ | |
4010 | memset(ac, 0, sizeof(struct ext4_allocation_context)); | |
4011 | ac->ac_b_ex.fe_logical = ar->logical & ~(sbi->s_cluster_ratio - 1); | |
4012 | ac->ac_status = AC_STATUS_CONTINUE; | |
4013 | ac->ac_sb = sb; | |
4014 | ac->ac_inode = ar->inode; | |
4015 | ac->ac_o_ex.fe_logical = ac->ac_b_ex.fe_logical; | |
4016 | ac->ac_o_ex.fe_group = group; | |
4017 | ac->ac_o_ex.fe_start = block; | |
4018 | ac->ac_o_ex.fe_len = len; | |
4019 | ac->ac_g_ex = ac->ac_o_ex; | |
4020 | ac->ac_flags = ar->flags; | |
4021 | ||
4022 | /* we have to define context: we'll we work with a file or | |
4023 | * locality group. this is a policy, actually */ | |
4024 | ext4_mb_group_or_file(ac); | |
4025 | ||
4026 | mb_debug(1, "init ac: %u blocks @ %u, goal %u, flags %x, 2^%d, " | |
4027 | "left: %u/%u, right %u/%u to %swritable\n", | |
4028 | (unsigned) ar->len, (unsigned) ar->logical, | |
4029 | (unsigned) ar->goal, ac->ac_flags, ac->ac_2order, | |
4030 | (unsigned) ar->lleft, (unsigned) ar->pleft, | |
4031 | (unsigned) ar->lright, (unsigned) ar->pright, | |
4032 | atomic_read(&ar->inode->i_writecount) ? "" : "non-"); | |
4033 | return 0; | |
4034 | ||
4035 | } | |
4036 | ||
4037 | static noinline_for_stack void | |
4038 | ext4_mb_discard_lg_preallocations(struct super_block *sb, | |
4039 | struct ext4_locality_group *lg, | |
4040 | int order, int total_entries) | |
4041 | { | |
4042 | ext4_group_t group = 0; | |
4043 | struct ext4_buddy e4b; | |
4044 | struct list_head discard_list; | |
4045 | struct ext4_prealloc_space *pa, *tmp; | |
4046 | ||
4047 | mb_debug(1, "discard locality group preallocation\n"); | |
4048 | ||
4049 | INIT_LIST_HEAD(&discard_list); | |
4050 | ||
4051 | spin_lock(&lg->lg_prealloc_lock); | |
4052 | list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[order], | |
4053 | pa_inode_list) { | |
4054 | spin_lock(&pa->pa_lock); | |
4055 | if (atomic_read(&pa->pa_count)) { | |
4056 | /* | |
4057 | * This is the pa that we just used | |
4058 | * for block allocation. So don't | |
4059 | * free that | |
4060 | */ | |
4061 | spin_unlock(&pa->pa_lock); | |
4062 | continue; | |
4063 | } | |
4064 | if (pa->pa_deleted) { | |
4065 | spin_unlock(&pa->pa_lock); | |
4066 | continue; | |
4067 | } | |
4068 | /* only lg prealloc space */ | |
4069 | BUG_ON(pa->pa_type != MB_GROUP_PA); | |
4070 | ||
4071 | /* seems this one can be freed ... */ | |
4072 | pa->pa_deleted = 1; | |
4073 | spin_unlock(&pa->pa_lock); | |
4074 | ||
4075 | list_del_rcu(&pa->pa_inode_list); | |
4076 | list_add(&pa->u.pa_tmp_list, &discard_list); | |
4077 | ||
4078 | total_entries--; | |
4079 | if (total_entries <= 5) { | |
4080 | /* | |
4081 | * we want to keep only 5 entries | |
4082 | * allowing it to grow to 8. This | |
4083 | * mak sure we don't call discard | |
4084 | * soon for this list. | |
4085 | */ | |
4086 | break; | |
4087 | } | |
4088 | } | |
4089 | spin_unlock(&lg->lg_prealloc_lock); | |
4090 | ||
4091 | list_for_each_entry_safe(pa, tmp, &discard_list, u.pa_tmp_list) { | |
4092 | ||
4093 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, NULL); | |
4094 | if (ext4_mb_load_buddy(sb, group, &e4b)) { | |
4095 | ext4_error(sb, "Error loading buddy information for %u", | |
4096 | group); | |
4097 | continue; | |
4098 | } | |
4099 | ext4_lock_group(sb, group); | |
4100 | list_del(&pa->pa_group_list); | |
4101 | ext4_mb_release_group_pa(&e4b, pa); | |
4102 | ext4_unlock_group(sb, group); | |
4103 | ||
4104 | ext4_mb_unload_buddy(&e4b); | |
4105 | list_del(&pa->u.pa_tmp_list); | |
4106 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
4107 | } | |
4108 | } | |
4109 | ||
4110 | /* | |
4111 | * We have incremented pa_count. So it cannot be freed at this | |
4112 | * point. Also we hold lg_mutex. So no parallel allocation is | |
4113 | * possible from this lg. That means pa_free cannot be updated. | |
4114 | * | |
4115 | * A parallel ext4_mb_discard_group_preallocations is possible. | |
4116 | * which can cause the lg_prealloc_list to be updated. | |
4117 | */ | |
4118 | ||
4119 | static void ext4_mb_add_n_trim(struct ext4_allocation_context *ac) | |
4120 | { | |
4121 | int order, added = 0, lg_prealloc_count = 1; | |
4122 | struct super_block *sb = ac->ac_sb; | |
4123 | struct ext4_locality_group *lg = ac->ac_lg; | |
4124 | struct ext4_prealloc_space *tmp_pa, *pa = ac->ac_pa; | |
4125 | ||
4126 | order = fls(pa->pa_free) - 1; | |
4127 | if (order > PREALLOC_TB_SIZE - 1) | |
4128 | /* The max size of hash table is PREALLOC_TB_SIZE */ | |
4129 | order = PREALLOC_TB_SIZE - 1; | |
4130 | /* Add the prealloc space to lg */ | |
4131 | rcu_read_lock(); | |
4132 | list_for_each_entry_rcu(tmp_pa, &lg->lg_prealloc_list[order], | |
4133 | pa_inode_list) { | |
4134 | spin_lock(&tmp_pa->pa_lock); | |
4135 | if (tmp_pa->pa_deleted) { | |
4136 | spin_unlock(&tmp_pa->pa_lock); | |
4137 | continue; | |
4138 | } | |
4139 | if (!added && pa->pa_free < tmp_pa->pa_free) { | |
4140 | /* Add to the tail of the previous entry */ | |
4141 | list_add_tail_rcu(&pa->pa_inode_list, | |
4142 | &tmp_pa->pa_inode_list); | |
4143 | added = 1; | |
4144 | /* | |
4145 | * we want to count the total | |
4146 | * number of entries in the list | |
4147 | */ | |
4148 | } | |
4149 | spin_unlock(&tmp_pa->pa_lock); | |
4150 | lg_prealloc_count++; | |
4151 | } | |
4152 | if (!added) | |
4153 | list_add_tail_rcu(&pa->pa_inode_list, | |
4154 | &lg->lg_prealloc_list[order]); | |
4155 | rcu_read_unlock(); | |
4156 | ||
4157 | /* Now trim the list to be not more than 8 elements */ | |
4158 | if (lg_prealloc_count > 8) { | |
4159 | ext4_mb_discard_lg_preallocations(sb, lg, | |
4160 | order, lg_prealloc_count); | |
4161 | return; | |
4162 | } | |
4163 | return ; | |
4164 | } | |
4165 | ||
4166 | /* | |
4167 | * release all resource we used in allocation | |
4168 | */ | |
4169 | static int ext4_mb_release_context(struct ext4_allocation_context *ac) | |
4170 | { | |
4171 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
4172 | struct ext4_prealloc_space *pa = ac->ac_pa; | |
4173 | if (pa) { | |
4174 | if (pa->pa_type == MB_GROUP_PA) { | |
4175 | /* see comment in ext4_mb_use_group_pa() */ | |
4176 | spin_lock(&pa->pa_lock); | |
4177 | pa->pa_pstart += EXT4_C2B(sbi, ac->ac_b_ex.fe_len); | |
4178 | pa->pa_lstart += EXT4_C2B(sbi, ac->ac_b_ex.fe_len); | |
4179 | pa->pa_free -= ac->ac_b_ex.fe_len; | |
4180 | pa->pa_len -= ac->ac_b_ex.fe_len; | |
4181 | spin_unlock(&pa->pa_lock); | |
4182 | } | |
4183 | } | |
4184 | if (pa) { | |
4185 | /* | |
4186 | * We want to add the pa to the right bucket. | |
4187 | * Remove it from the list and while adding | |
4188 | * make sure the list to which we are adding | |
4189 | * doesn't grow big. | |
4190 | */ | |
4191 | if ((pa->pa_type == MB_GROUP_PA) && likely(pa->pa_free)) { | |
4192 | spin_lock(pa->pa_obj_lock); | |
4193 | list_del_rcu(&pa->pa_inode_list); | |
4194 | spin_unlock(pa->pa_obj_lock); | |
4195 | ext4_mb_add_n_trim(ac); | |
4196 | } | |
4197 | ext4_mb_put_pa(ac, ac->ac_sb, pa); | |
4198 | } | |
4199 | if (ac->ac_bitmap_page) | |
4200 | page_cache_release(ac->ac_bitmap_page); | |
4201 | if (ac->ac_buddy_page) | |
4202 | page_cache_release(ac->ac_buddy_page); | |
4203 | if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) | |
4204 | mutex_unlock(&ac->ac_lg->lg_mutex); | |
4205 | ext4_mb_collect_stats(ac); | |
4206 | return 0; | |
4207 | } | |
4208 | ||
4209 | static int ext4_mb_discard_preallocations(struct super_block *sb, int needed) | |
4210 | { | |
4211 | ext4_group_t i, ngroups = ext4_get_groups_count(sb); | |
4212 | int ret; | |
4213 | int freed = 0; | |
4214 | ||
4215 | trace_ext4_mb_discard_preallocations(sb, needed); | |
4216 | for (i = 0; i < ngroups && needed > 0; i++) { | |
4217 | ret = ext4_mb_discard_group_preallocations(sb, i, needed); | |
4218 | freed += ret; | |
4219 | needed -= ret; | |
4220 | } | |
4221 | ||
4222 | return freed; | |
4223 | } | |
4224 | ||
4225 | /* | |
4226 | * Main entry point into mballoc to allocate blocks | |
4227 | * it tries to use preallocation first, then falls back | |
4228 | * to usual allocation | |
4229 | */ | |
4230 | ext4_fsblk_t ext4_mb_new_blocks(handle_t *handle, | |
4231 | struct ext4_allocation_request *ar, int *errp) | |
4232 | { | |
4233 | int freed; | |
4234 | struct ext4_allocation_context *ac = NULL; | |
4235 | struct ext4_sb_info *sbi; | |
4236 | struct super_block *sb; | |
4237 | ext4_fsblk_t block = 0; | |
4238 | unsigned int inquota = 0; | |
4239 | unsigned int reserv_clstrs = 0; | |
4240 | ||
4241 | sb = ar->inode->i_sb; | |
4242 | sbi = EXT4_SB(sb); | |
4243 | ||
4244 | trace_ext4_request_blocks(ar); | |
4245 | ||
4246 | /* Allow to use superuser reservation for quota file */ | |
4247 | if (IS_NOQUOTA(ar->inode)) | |
4248 | ar->flags |= EXT4_MB_USE_ROOT_BLOCKS; | |
4249 | ||
4250 | /* | |
4251 | * For delayed allocation, we could skip the ENOSPC and | |
4252 | * EDQUOT check, as blocks and quotas have been already | |
4253 | * reserved when data being copied into pagecache. | |
4254 | */ | |
4255 | if (ext4_test_inode_state(ar->inode, EXT4_STATE_DELALLOC_RESERVED)) | |
4256 | ar->flags |= EXT4_MB_DELALLOC_RESERVED; | |
4257 | else { | |
4258 | /* Without delayed allocation we need to verify | |
4259 | * there is enough free blocks to do block allocation | |
4260 | * and verify allocation doesn't exceed the quota limits. | |
4261 | */ | |
4262 | while (ar->len && | |
4263 | ext4_claim_free_clusters(sbi, ar->len, ar->flags)) { | |
4264 | ||
4265 | /* let others to free the space */ | |
4266 | yield(); | |
4267 | ar->len = ar->len >> 1; | |
4268 | } | |
4269 | if (!ar->len) { | |
4270 | *errp = -ENOSPC; | |
4271 | return 0; | |
4272 | } | |
4273 | reserv_clstrs = ar->len; | |
4274 | if (ar->flags & EXT4_MB_USE_ROOT_BLOCKS) { | |
4275 | dquot_alloc_block_nofail(ar->inode, | |
4276 | EXT4_C2B(sbi, ar->len)); | |
4277 | } else { | |
4278 | while (ar->len && | |
4279 | dquot_alloc_block(ar->inode, | |
4280 | EXT4_C2B(sbi, ar->len))) { | |
4281 | ||
4282 | ar->flags |= EXT4_MB_HINT_NOPREALLOC; | |
4283 | ar->len--; | |
4284 | } | |
4285 | } | |
4286 | inquota = ar->len; | |
4287 | if (ar->len == 0) { | |
4288 | *errp = -EDQUOT; | |
4289 | goto out; | |
4290 | } | |
4291 | } | |
4292 | ||
4293 | ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); | |
4294 | if (!ac) { | |
4295 | ar->len = 0; | |
4296 | *errp = -ENOMEM; | |
4297 | goto out; | |
4298 | } | |
4299 | ||
4300 | *errp = ext4_mb_initialize_context(ac, ar); | |
4301 | if (*errp) { | |
4302 | ar->len = 0; | |
4303 | goto out; | |
4304 | } | |
4305 | ||
4306 | ac->ac_op = EXT4_MB_HISTORY_PREALLOC; | |
4307 | if (!ext4_mb_use_preallocated(ac)) { | |
4308 | ac->ac_op = EXT4_MB_HISTORY_ALLOC; | |
4309 | ext4_mb_normalize_request(ac, ar); | |
4310 | repeat: | |
4311 | /* allocate space in core */ | |
4312 | *errp = ext4_mb_regular_allocator(ac); | |
4313 | if (*errp) | |
4314 | goto errout; | |
4315 | ||
4316 | /* as we've just preallocated more space than | |
4317 | * user requested orinally, we store allocated | |
4318 | * space in a special descriptor */ | |
4319 | if (ac->ac_status == AC_STATUS_FOUND && | |
4320 | ac->ac_o_ex.fe_len < ac->ac_b_ex.fe_len) | |
4321 | ext4_mb_new_preallocation(ac); | |
4322 | } | |
4323 | if (likely(ac->ac_status == AC_STATUS_FOUND)) { | |
4324 | *errp = ext4_mb_mark_diskspace_used(ac, handle, reserv_clstrs); | |
4325 | if (*errp == -EAGAIN) { | |
4326 | /* | |
4327 | * drop the reference that we took | |
4328 | * in ext4_mb_use_best_found | |
4329 | */ | |
4330 | ext4_mb_release_context(ac); | |
4331 | ac->ac_b_ex.fe_group = 0; | |
4332 | ac->ac_b_ex.fe_start = 0; | |
4333 | ac->ac_b_ex.fe_len = 0; | |
4334 | ac->ac_status = AC_STATUS_CONTINUE; | |
4335 | goto repeat; | |
4336 | } else if (*errp) | |
4337 | errout: | |
4338 | ext4_discard_allocated_blocks(ac); | |
4339 | else { | |
4340 | block = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
4341 | ar->len = ac->ac_b_ex.fe_len; | |
4342 | } | |
4343 | } else { | |
4344 | freed = ext4_mb_discard_preallocations(sb, ac->ac_o_ex.fe_len); | |
4345 | if (freed) | |
4346 | goto repeat; | |
4347 | *errp = -ENOSPC; | |
4348 | } | |
4349 | ||
4350 | if (*errp) { | |
4351 | ac->ac_b_ex.fe_len = 0; | |
4352 | ar->len = 0; | |
4353 | ext4_mb_show_ac(ac); | |
4354 | } | |
4355 | ext4_mb_release_context(ac); | |
4356 | out: | |
4357 | if (ac) | |
4358 | kmem_cache_free(ext4_ac_cachep, ac); | |
4359 | if (inquota && ar->len < inquota) | |
4360 | dquot_free_block(ar->inode, EXT4_C2B(sbi, inquota - ar->len)); | |
4361 | if (!ar->len) { | |
4362 | if (!ext4_test_inode_state(ar->inode, | |
4363 | EXT4_STATE_DELALLOC_RESERVED)) | |
4364 | /* release all the reserved blocks if non delalloc */ | |
4365 | percpu_counter_sub(&sbi->s_dirtyclusters_counter, | |
4366 | reserv_clstrs); | |
4367 | } | |
4368 | ||
4369 | trace_ext4_allocate_blocks(ar, (unsigned long long)block); | |
4370 | ||
4371 | return block; | |
4372 | } | |
4373 | ||
4374 | /* | |
4375 | * We can merge two free data extents only if the physical blocks | |
4376 | * are contiguous, AND the extents were freed by the same transaction, | |
4377 | * AND the blocks are associated with the same group. | |
4378 | */ | |
4379 | static int can_merge(struct ext4_free_data *entry1, | |
4380 | struct ext4_free_data *entry2) | |
4381 | { | |
4382 | if ((entry1->efd_tid == entry2->efd_tid) && | |
4383 | (entry1->efd_group == entry2->efd_group) && | |
4384 | ((entry1->efd_start_cluster + entry1->efd_count) == entry2->efd_start_cluster)) | |
4385 | return 1; | |
4386 | return 0; | |
4387 | } | |
4388 | ||
4389 | static noinline_for_stack int | |
4390 | ext4_mb_free_metadata(handle_t *handle, struct ext4_buddy *e4b, | |
4391 | struct ext4_free_data *new_entry) | |
4392 | { | |
4393 | ext4_group_t group = e4b->bd_group; | |
4394 | ext4_grpblk_t cluster; | |
4395 | struct ext4_free_data *entry; | |
4396 | struct ext4_group_info *db = e4b->bd_info; | |
4397 | struct super_block *sb = e4b->bd_sb; | |
4398 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
4399 | struct rb_node **n = &db->bb_free_root.rb_node, *node; | |
4400 | struct rb_node *parent = NULL, *new_node; | |
4401 | ||
4402 | BUG_ON(!ext4_handle_valid(handle)); | |
4403 | BUG_ON(e4b->bd_bitmap_page == NULL); | |
4404 | BUG_ON(e4b->bd_buddy_page == NULL); | |
4405 | ||
4406 | new_node = &new_entry->efd_node; | |
4407 | cluster = new_entry->efd_start_cluster; | |
4408 | ||
4409 | if (!*n) { | |
4410 | /* first free block exent. We need to | |
4411 | protect buddy cache from being freed, | |
4412 | * otherwise we'll refresh it from | |
4413 | * on-disk bitmap and lose not-yet-available | |
4414 | * blocks */ | |
4415 | page_cache_get(e4b->bd_buddy_page); | |
4416 | page_cache_get(e4b->bd_bitmap_page); | |
4417 | } | |
4418 | while (*n) { | |
4419 | parent = *n; | |
4420 | entry = rb_entry(parent, struct ext4_free_data, efd_node); | |
4421 | if (cluster < entry->efd_start_cluster) | |
4422 | n = &(*n)->rb_left; | |
4423 | else if (cluster >= (entry->efd_start_cluster + entry->efd_count)) | |
4424 | n = &(*n)->rb_right; | |
4425 | else { | |
4426 | ext4_grp_locked_error(sb, group, 0, | |
4427 | ext4_group_first_block_no(sb, group) + | |
4428 | EXT4_C2B(sbi, cluster), | |
4429 | "Block already on to-be-freed list"); | |
4430 | return 0; | |
4431 | } | |
4432 | } | |
4433 | ||
4434 | rb_link_node(new_node, parent, n); | |
4435 | rb_insert_color(new_node, &db->bb_free_root); | |
4436 | ||
4437 | /* Now try to see the extent can be merged to left and right */ | |
4438 | node = rb_prev(new_node); | |
4439 | if (node) { | |
4440 | entry = rb_entry(node, struct ext4_free_data, efd_node); | |
4441 | if (can_merge(entry, new_entry)) { | |
4442 | new_entry->efd_start_cluster = entry->efd_start_cluster; | |
4443 | new_entry->efd_count += entry->efd_count; | |
4444 | rb_erase(node, &(db->bb_free_root)); | |
4445 | ext4_journal_callback_del(handle, &entry->efd_jce); | |
4446 | kmem_cache_free(ext4_free_data_cachep, entry); | |
4447 | } | |
4448 | } | |
4449 | ||
4450 | node = rb_next(new_node); | |
4451 | if (node) { | |
4452 | entry = rb_entry(node, struct ext4_free_data, efd_node); | |
4453 | if (can_merge(new_entry, entry)) { | |
4454 | new_entry->efd_count += entry->efd_count; | |
4455 | rb_erase(node, &(db->bb_free_root)); | |
4456 | ext4_journal_callback_del(handle, &entry->efd_jce); | |
4457 | kmem_cache_free(ext4_free_data_cachep, entry); | |
4458 | } | |
4459 | } | |
4460 | /* Add the extent to transaction's private list */ | |
4461 | ext4_journal_callback_add(handle, ext4_free_data_callback, | |
4462 | &new_entry->efd_jce); | |
4463 | return 0; | |
4464 | } | |
4465 | ||
4466 | /** | |
4467 | * ext4_free_blocks() -- Free given blocks and update quota | |
4468 | * @handle: handle for this transaction | |
4469 | * @inode: inode | |
4470 | * @block: start physical block to free | |
4471 | * @count: number of blocks to count | |
4472 | * @flags: flags used by ext4_free_blocks | |
4473 | */ | |
4474 | void ext4_free_blocks(handle_t *handle, struct inode *inode, | |
4475 | struct buffer_head *bh, ext4_fsblk_t block, | |
4476 | unsigned long count, int flags) | |
4477 | { | |
4478 | struct buffer_head *bitmap_bh = NULL; | |
4479 | struct super_block *sb = inode->i_sb; | |
4480 | struct ext4_group_desc *gdp; | |
4481 | unsigned long freed = 0; | |
4482 | unsigned int overflow; | |
4483 | ext4_grpblk_t bit; | |
4484 | struct buffer_head *gd_bh; | |
4485 | ext4_group_t block_group; | |
4486 | struct ext4_sb_info *sbi; | |
4487 | struct ext4_buddy e4b; | |
4488 | unsigned int count_clusters; | |
4489 | int err = 0; | |
4490 | int ret; | |
4491 | ||
4492 | if (bh) { | |
4493 | if (block) | |
4494 | BUG_ON(block != bh->b_blocknr); | |
4495 | else | |
4496 | block = bh->b_blocknr; | |
4497 | } | |
4498 | ||
4499 | sbi = EXT4_SB(sb); | |
4500 | if (!(flags & EXT4_FREE_BLOCKS_VALIDATED) && | |
4501 | !ext4_data_block_valid(sbi, block, count)) { | |
4502 | ext4_error(sb, "Freeing blocks not in datazone - " | |
4503 | "block = %llu, count = %lu", block, count); | |
4504 | goto error_return; | |
4505 | } | |
4506 | ||
4507 | ext4_debug("freeing block %llu\n", block); | |
4508 | trace_ext4_free_blocks(inode, block, count, flags); | |
4509 | ||
4510 | if (flags & EXT4_FREE_BLOCKS_FORGET) { | |
4511 | struct buffer_head *tbh = bh; | |
4512 | int i; | |
4513 | ||
4514 | BUG_ON(bh && (count > 1)); | |
4515 | ||
4516 | for (i = 0; i < count; i++) { | |
4517 | if (!bh) | |
4518 | tbh = sb_find_get_block(inode->i_sb, | |
4519 | block + i); | |
4520 | if (unlikely(!tbh)) | |
4521 | continue; | |
4522 | ext4_forget(handle, flags & EXT4_FREE_BLOCKS_METADATA, | |
4523 | inode, tbh, block + i); | |
4524 | } | |
4525 | } | |
4526 | ||
4527 | /* | |
4528 | * We need to make sure we don't reuse the freed block until | |
4529 | * after the transaction is committed, which we can do by | |
4530 | * treating the block as metadata, below. We make an | |
4531 | * exception if the inode is to be written in writeback mode | |
4532 | * since writeback mode has weak data consistency guarantees. | |
4533 | */ | |
4534 | if (!ext4_should_writeback_data(inode)) | |
4535 | flags |= EXT4_FREE_BLOCKS_METADATA; | |
4536 | ||
4537 | /* | |
4538 | * If the extent to be freed does not begin on a cluster | |
4539 | * boundary, we need to deal with partial clusters at the | |
4540 | * beginning and end of the extent. Normally we will free | |
4541 | * blocks at the beginning or the end unless we are explicitly | |
4542 | * requested to avoid doing so. | |
4543 | */ | |
4544 | overflow = block & (sbi->s_cluster_ratio - 1); | |
4545 | if (overflow) { | |
4546 | if (flags & EXT4_FREE_BLOCKS_NOFREE_FIRST_CLUSTER) { | |
4547 | overflow = sbi->s_cluster_ratio - overflow; | |
4548 | block += overflow; | |
4549 | if (count > overflow) | |
4550 | count -= overflow; | |
4551 | else | |
4552 | return; | |
4553 | } else { | |
4554 | block -= overflow; | |
4555 | count += overflow; | |
4556 | } | |
4557 | } | |
4558 | overflow = count & (sbi->s_cluster_ratio - 1); | |
4559 | if (overflow) { | |
4560 | if (flags & EXT4_FREE_BLOCKS_NOFREE_LAST_CLUSTER) { | |
4561 | if (count > overflow) | |
4562 | count -= overflow; | |
4563 | else | |
4564 | return; | |
4565 | } else | |
4566 | count += sbi->s_cluster_ratio - overflow; | |
4567 | } | |
4568 | ||
4569 | do_more: | |
4570 | overflow = 0; | |
4571 | ext4_get_group_no_and_offset(sb, block, &block_group, &bit); | |
4572 | ||
4573 | /* | |
4574 | * Check to see if we are freeing blocks across a group | |
4575 | * boundary. | |
4576 | */ | |
4577 | if (EXT4_C2B(sbi, bit) + count > EXT4_BLOCKS_PER_GROUP(sb)) { | |
4578 | overflow = EXT4_C2B(sbi, bit) + count - | |
4579 | EXT4_BLOCKS_PER_GROUP(sb); | |
4580 | count -= overflow; | |
4581 | } | |
4582 | count_clusters = EXT4_B2C(sbi, count); | |
4583 | bitmap_bh = ext4_read_block_bitmap(sb, block_group); | |
4584 | if (!bitmap_bh) { | |
4585 | err = -EIO; | |
4586 | goto error_return; | |
4587 | } | |
4588 | gdp = ext4_get_group_desc(sb, block_group, &gd_bh); | |
4589 | if (!gdp) { | |
4590 | err = -EIO; | |
4591 | goto error_return; | |
4592 | } | |
4593 | ||
4594 | if (in_range(ext4_block_bitmap(sb, gdp), block, count) || | |
4595 | in_range(ext4_inode_bitmap(sb, gdp), block, count) || | |
4596 | in_range(block, ext4_inode_table(sb, gdp), | |
4597 | EXT4_SB(sb)->s_itb_per_group) || | |
4598 | in_range(block + count - 1, ext4_inode_table(sb, gdp), | |
4599 | EXT4_SB(sb)->s_itb_per_group)) { | |
4600 | ||
4601 | ext4_error(sb, "Freeing blocks in system zone - " | |
4602 | "Block = %llu, count = %lu", block, count); | |
4603 | /* err = 0. ext4_std_error should be a no op */ | |
4604 | goto error_return; | |
4605 | } | |
4606 | ||
4607 | BUFFER_TRACE(bitmap_bh, "getting write access"); | |
4608 | err = ext4_journal_get_write_access(handle, bitmap_bh); | |
4609 | if (err) | |
4610 | goto error_return; | |
4611 | ||
4612 | /* | |
4613 | * We are about to modify some metadata. Call the journal APIs | |
4614 | * to unshare ->b_data if a currently-committing transaction is | |
4615 | * using it | |
4616 | */ | |
4617 | BUFFER_TRACE(gd_bh, "get_write_access"); | |
4618 | err = ext4_journal_get_write_access(handle, gd_bh); | |
4619 | if (err) | |
4620 | goto error_return; | |
4621 | #ifdef AGGRESSIVE_CHECK | |
4622 | { | |
4623 | int i; | |
4624 | for (i = 0; i < count_clusters; i++) | |
4625 | BUG_ON(!mb_test_bit(bit + i, bitmap_bh->b_data)); | |
4626 | } | |
4627 | #endif | |
4628 | trace_ext4_mballoc_free(sb, inode, block_group, bit, count_clusters); | |
4629 | ||
4630 | err = ext4_mb_load_buddy(sb, block_group, &e4b); | |
4631 | if (err) | |
4632 | goto error_return; | |
4633 | ||
4634 | if ((flags & EXT4_FREE_BLOCKS_METADATA) && ext4_handle_valid(handle)) { | |
4635 | struct ext4_free_data *new_entry; | |
4636 | /* | |
4637 | * blocks being freed are metadata. these blocks shouldn't | |
4638 | * be used until this transaction is committed | |
4639 | */ | |
4640 | new_entry = kmem_cache_alloc(ext4_free_data_cachep, GFP_NOFS); | |
4641 | if (!new_entry) { | |
4642 | ext4_mb_unload_buddy(&e4b); | |
4643 | err = -ENOMEM; | |
4644 | goto error_return; | |
4645 | } | |
4646 | new_entry->efd_start_cluster = bit; | |
4647 | new_entry->efd_group = block_group; | |
4648 | new_entry->efd_count = count_clusters; | |
4649 | new_entry->efd_tid = handle->h_transaction->t_tid; | |
4650 | ||
4651 | ext4_lock_group(sb, block_group); | |
4652 | mb_clear_bits(bitmap_bh->b_data, bit, count_clusters); | |
4653 | ext4_mb_free_metadata(handle, &e4b, new_entry); | |
4654 | } else { | |
4655 | /* need to update group_info->bb_free and bitmap | |
4656 | * with group lock held. generate_buddy look at | |
4657 | * them with group lock_held | |
4658 | */ | |
4659 | if (test_opt(sb, DISCARD)) | |
4660 | ext4_issue_discard(sb, block_group, bit, count); | |
4661 | ext4_lock_group(sb, block_group); | |
4662 | mb_clear_bits(bitmap_bh->b_data, bit, count_clusters); | |
4663 | mb_free_blocks(inode, &e4b, bit, count_clusters); | |
4664 | } | |
4665 | ||
4666 | ret = ext4_free_group_clusters(sb, gdp) + count_clusters; | |
4667 | ext4_free_group_clusters_set(sb, gdp, ret); | |
4668 | ext4_block_bitmap_csum_set(sb, block_group, gdp, bitmap_bh, | |
4669 | EXT4_BLOCKS_PER_GROUP(sb) / 8); | |
4670 | ext4_group_desc_csum_set(sb, block_group, gdp); | |
4671 | ext4_unlock_group(sb, block_group); | |
4672 | percpu_counter_add(&sbi->s_freeclusters_counter, count_clusters); | |
4673 | ||
4674 | if (sbi->s_log_groups_per_flex) { | |
4675 | ext4_group_t flex_group = ext4_flex_group(sbi, block_group); | |
4676 | atomic_add(count_clusters, | |
4677 | &sbi->s_flex_groups[flex_group].free_clusters); | |
4678 | } | |
4679 | ||
4680 | ext4_mb_unload_buddy(&e4b); | |
4681 | ||
4682 | freed += count; | |
4683 | ||
4684 | if (!(flags & EXT4_FREE_BLOCKS_NO_QUOT_UPDATE)) | |
4685 | dquot_free_block(inode, EXT4_C2B(sbi, count_clusters)); | |
4686 | ||
4687 | /* We dirtied the bitmap block */ | |
4688 | BUFFER_TRACE(bitmap_bh, "dirtied bitmap block"); | |
4689 | err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh); | |
4690 | ||
4691 | /* And the group descriptor block */ | |
4692 | BUFFER_TRACE(gd_bh, "dirtied group descriptor block"); | |
4693 | ret = ext4_handle_dirty_metadata(handle, NULL, gd_bh); | |
4694 | if (!err) | |
4695 | err = ret; | |
4696 | ||
4697 | if (overflow && !err) { | |
4698 | block += count; | |
4699 | count = overflow; | |
4700 | put_bh(bitmap_bh); | |
4701 | goto do_more; | |
4702 | } | |
4703 | error_return: | |
4704 | brelse(bitmap_bh); | |
4705 | ext4_std_error(sb, err); | |
4706 | return; | |
4707 | } | |
4708 | ||
4709 | /** | |
4710 | * ext4_group_add_blocks() -- Add given blocks to an existing group | |
4711 | * @handle: handle to this transaction | |
4712 | * @sb: super block | |
4713 | * @block: start physcial block to add to the block group | |
4714 | * @count: number of blocks to free | |
4715 | * | |
4716 | * This marks the blocks as free in the bitmap and buddy. | |
4717 | */ | |
4718 | int ext4_group_add_blocks(handle_t *handle, struct super_block *sb, | |
4719 | ext4_fsblk_t block, unsigned long count) | |
4720 | { | |
4721 | struct buffer_head *bitmap_bh = NULL; | |
4722 | struct buffer_head *gd_bh; | |
4723 | ext4_group_t block_group; | |
4724 | ext4_grpblk_t bit; | |
4725 | unsigned int i; | |
4726 | struct ext4_group_desc *desc; | |
4727 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
4728 | struct ext4_buddy e4b; | |
4729 | int err = 0, ret, blk_free_count; | |
4730 | ext4_grpblk_t blocks_freed; | |
4731 | ||
4732 | ext4_debug("Adding block(s) %llu-%llu\n", block, block + count - 1); | |
4733 | ||
4734 | if (count == 0) | |
4735 | return 0; | |
4736 | ||
4737 | ext4_get_group_no_and_offset(sb, block, &block_group, &bit); | |
4738 | /* | |
4739 | * Check to see if we are freeing blocks across a group | |
4740 | * boundary. | |
4741 | */ | |
4742 | if (bit + count > EXT4_BLOCKS_PER_GROUP(sb)) { | |
4743 | ext4_warning(sb, "too much blocks added to group %u\n", | |
4744 | block_group); | |
4745 | err = -EINVAL; | |
4746 | goto error_return; | |
4747 | } | |
4748 | ||
4749 | bitmap_bh = ext4_read_block_bitmap(sb, block_group); | |
4750 | if (!bitmap_bh) { | |
4751 | err = -EIO; | |
4752 | goto error_return; | |
4753 | } | |
4754 | ||
4755 | desc = ext4_get_group_desc(sb, block_group, &gd_bh); | |
4756 | if (!desc) { | |
4757 | err = -EIO; | |
4758 | goto error_return; | |
4759 | } | |
4760 | ||
4761 | if (in_range(ext4_block_bitmap(sb, desc), block, count) || | |
4762 | in_range(ext4_inode_bitmap(sb, desc), block, count) || | |
4763 | in_range(block, ext4_inode_table(sb, desc), sbi->s_itb_per_group) || | |
4764 | in_range(block + count - 1, ext4_inode_table(sb, desc), | |
4765 | sbi->s_itb_per_group)) { | |
4766 | ext4_error(sb, "Adding blocks in system zones - " | |
4767 | "Block = %llu, count = %lu", | |
4768 | block, count); | |
4769 | err = -EINVAL; | |
4770 | goto error_return; | |
4771 | } | |
4772 | ||
4773 | BUFFER_TRACE(bitmap_bh, "getting write access"); | |
4774 | err = ext4_journal_get_write_access(handle, bitmap_bh); | |
4775 | if (err) | |
4776 | goto error_return; | |
4777 | ||
4778 | /* | |
4779 | * We are about to modify some metadata. Call the journal APIs | |
4780 | * to unshare ->b_data if a currently-committing transaction is | |
4781 | * using it | |
4782 | */ | |
4783 | BUFFER_TRACE(gd_bh, "get_write_access"); | |
4784 | err = ext4_journal_get_write_access(handle, gd_bh); | |
4785 | if (err) | |
4786 | goto error_return; | |
4787 | ||
4788 | for (i = 0, blocks_freed = 0; i < count; i++) { | |
4789 | BUFFER_TRACE(bitmap_bh, "clear bit"); | |
4790 | if (!mb_test_bit(bit + i, bitmap_bh->b_data)) { | |
4791 | ext4_error(sb, "bit already cleared for block %llu", | |
4792 | (ext4_fsblk_t)(block + i)); | |
4793 | BUFFER_TRACE(bitmap_bh, "bit already cleared"); | |
4794 | } else { | |
4795 | blocks_freed++; | |
4796 | } | |
4797 | } | |
4798 | ||
4799 | err = ext4_mb_load_buddy(sb, block_group, &e4b); | |
4800 | if (err) | |
4801 | goto error_return; | |
4802 | ||
4803 | /* | |
4804 | * need to update group_info->bb_free and bitmap | |
4805 | * with group lock held. generate_buddy look at | |
4806 | * them with group lock_held | |
4807 | */ | |
4808 | ext4_lock_group(sb, block_group); | |
4809 | mb_clear_bits(bitmap_bh->b_data, bit, count); | |
4810 | mb_free_blocks(NULL, &e4b, bit, count); | |
4811 | blk_free_count = blocks_freed + ext4_free_group_clusters(sb, desc); | |
4812 | ext4_free_group_clusters_set(sb, desc, blk_free_count); | |
4813 | ext4_block_bitmap_csum_set(sb, block_group, desc, bitmap_bh, | |
4814 | EXT4_BLOCKS_PER_GROUP(sb) / 8); | |
4815 | ext4_group_desc_csum_set(sb, block_group, desc); | |
4816 | ext4_unlock_group(sb, block_group); | |
4817 | percpu_counter_add(&sbi->s_freeclusters_counter, | |
4818 | EXT4_B2C(sbi, blocks_freed)); | |
4819 | ||
4820 | if (sbi->s_log_groups_per_flex) { | |
4821 | ext4_group_t flex_group = ext4_flex_group(sbi, block_group); | |
4822 | atomic_add(EXT4_B2C(sbi, blocks_freed), | |
4823 | &sbi->s_flex_groups[flex_group].free_clusters); | |
4824 | } | |
4825 | ||
4826 | ext4_mb_unload_buddy(&e4b); | |
4827 | ||
4828 | /* We dirtied the bitmap block */ | |
4829 | BUFFER_TRACE(bitmap_bh, "dirtied bitmap block"); | |
4830 | err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh); | |
4831 | ||
4832 | /* And the group descriptor block */ | |
4833 | BUFFER_TRACE(gd_bh, "dirtied group descriptor block"); | |
4834 | ret = ext4_handle_dirty_metadata(handle, NULL, gd_bh); | |
4835 | if (!err) | |
4836 | err = ret; | |
4837 | ||
4838 | error_return: | |
4839 | brelse(bitmap_bh); | |
4840 | ext4_std_error(sb, err); | |
4841 | return err; | |
4842 | } | |
4843 | ||
4844 | /** | |
4845 | * ext4_trim_extent -- function to TRIM one single free extent in the group | |
4846 | * @sb: super block for the file system | |
4847 | * @start: starting block of the free extent in the alloc. group | |
4848 | * @count: number of blocks to TRIM | |
4849 | * @group: alloc. group we are working with | |
4850 | * @e4b: ext4 buddy for the group | |
4851 | * | |
4852 | * Trim "count" blocks starting at "start" in the "group". To assure that no | |
4853 | * one will allocate those blocks, mark it as used in buddy bitmap. This must | |
4854 | * be called with under the group lock. | |
4855 | */ | |
4856 | static void ext4_trim_extent(struct super_block *sb, int start, int count, | |
4857 | ext4_group_t group, struct ext4_buddy *e4b) | |
4858 | { | |
4859 | struct ext4_free_extent ex; | |
4860 | ||
4861 | trace_ext4_trim_extent(sb, group, start, count); | |
4862 | ||
4863 | assert_spin_locked(ext4_group_lock_ptr(sb, group)); | |
4864 | ||
4865 | ex.fe_start = start; | |
4866 | ex.fe_group = group; | |
4867 | ex.fe_len = count; | |
4868 | ||
4869 | /* | |
4870 | * Mark blocks used, so no one can reuse them while | |
4871 | * being trimmed. | |
4872 | */ | |
4873 | mb_mark_used(e4b, &ex); | |
4874 | ext4_unlock_group(sb, group); | |
4875 | ext4_issue_discard(sb, group, start, count); | |
4876 | ext4_lock_group(sb, group); | |
4877 | mb_free_blocks(NULL, e4b, start, ex.fe_len); | |
4878 | } | |
4879 | ||
4880 | /** | |
4881 | * ext4_trim_all_free -- function to trim all free space in alloc. group | |
4882 | * @sb: super block for file system | |
4883 | * @group: group to be trimmed | |
4884 | * @start: first group block to examine | |
4885 | * @max: last group block to examine | |
4886 | * @minblocks: minimum extent block count | |
4887 | * | |
4888 | * ext4_trim_all_free walks through group's buddy bitmap searching for free | |
4889 | * extents. When the free block is found, ext4_trim_extent is called to TRIM | |
4890 | * the extent. | |
4891 | * | |
4892 | * | |
4893 | * ext4_trim_all_free walks through group's block bitmap searching for free | |
4894 | * extents. When the free extent is found, mark it as used in group buddy | |
4895 | * bitmap. Then issue a TRIM command on this extent and free the extent in | |
4896 | * the group buddy bitmap. This is done until whole group is scanned. | |
4897 | */ | |
4898 | static ext4_grpblk_t | |
4899 | ext4_trim_all_free(struct super_block *sb, ext4_group_t group, | |
4900 | ext4_grpblk_t start, ext4_grpblk_t max, | |
4901 | ext4_grpblk_t minblocks) | |
4902 | { | |
4903 | void *bitmap; | |
4904 | ext4_grpblk_t next, count = 0, free_count = 0; | |
4905 | struct ext4_buddy e4b; | |
4906 | int ret; | |
4907 | ||
4908 | trace_ext4_trim_all_free(sb, group, start, max); | |
4909 | ||
4910 | ret = ext4_mb_load_buddy(sb, group, &e4b); | |
4911 | if (ret) { | |
4912 | ext4_error(sb, "Error in loading buddy " | |
4913 | "information for %u", group); | |
4914 | return ret; | |
4915 | } | |
4916 | bitmap = e4b.bd_bitmap; | |
4917 | ||
4918 | ext4_lock_group(sb, group); | |
4919 | if (EXT4_MB_GRP_WAS_TRIMMED(e4b.bd_info) && | |
4920 | minblocks >= atomic_read(&EXT4_SB(sb)->s_last_trim_minblks)) | |
4921 | goto out; | |
4922 | ||
4923 | start = (e4b.bd_info->bb_first_free > start) ? | |
4924 | e4b.bd_info->bb_first_free : start; | |
4925 | ||
4926 | while (start <= max) { | |
4927 | start = mb_find_next_zero_bit(bitmap, max + 1, start); | |
4928 | if (start > max) | |
4929 | break; | |
4930 | next = mb_find_next_bit(bitmap, max + 1, start); | |
4931 | ||
4932 | if ((next - start) >= minblocks) { | |
4933 | ext4_trim_extent(sb, start, | |
4934 | next - start, group, &e4b); | |
4935 | count += next - start; | |
4936 | } | |
4937 | free_count += next - start; | |
4938 | start = next + 1; | |
4939 | ||
4940 | if (fatal_signal_pending(current)) { | |
4941 | count = -ERESTARTSYS; | |
4942 | break; | |
4943 | } | |
4944 | ||
4945 | if (need_resched()) { | |
4946 | ext4_unlock_group(sb, group); | |
4947 | cond_resched(); | |
4948 | ext4_lock_group(sb, group); | |
4949 | } | |
4950 | ||
4951 | if ((e4b.bd_info->bb_free - free_count) < minblocks) | |
4952 | break; | |
4953 | } | |
4954 | ||
4955 | if (!ret) | |
4956 | EXT4_MB_GRP_SET_TRIMMED(e4b.bd_info); | |
4957 | out: | |
4958 | ext4_unlock_group(sb, group); | |
4959 | ext4_mb_unload_buddy(&e4b); | |
4960 | ||
4961 | ext4_debug("trimmed %d blocks in the group %d\n", | |
4962 | count, group); | |
4963 | ||
4964 | return count; | |
4965 | } | |
4966 | ||
4967 | /** | |
4968 | * ext4_trim_fs() -- trim ioctl handle function | |
4969 | * @sb: superblock for filesystem | |
4970 | * @range: fstrim_range structure | |
4971 | * | |
4972 | * start: First Byte to trim | |
4973 | * len: number of Bytes to trim from start | |
4974 | * minlen: minimum extent length in Bytes | |
4975 | * ext4_trim_fs goes through all allocation groups containing Bytes from | |
4976 | * start to start+len. For each such a group ext4_trim_all_free function | |
4977 | * is invoked to trim all free space. | |
4978 | */ | |
4979 | int ext4_trim_fs(struct super_block *sb, struct fstrim_range *range) | |
4980 | { | |
4981 | struct ext4_group_info *grp; | |
4982 | ext4_group_t group, first_group, last_group; | |
4983 | ext4_grpblk_t cnt = 0, first_cluster, last_cluster; | |
4984 | uint64_t start, end, minlen, trimmed = 0; | |
4985 | ext4_fsblk_t first_data_blk = | |
4986 | le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block); | |
4987 | ext4_fsblk_t max_blks = ext4_blocks_count(EXT4_SB(sb)->s_es); | |
4988 | int ret = 0; | |
4989 | ||
4990 | start = range->start >> sb->s_blocksize_bits; | |
4991 | end = start + (range->len >> sb->s_blocksize_bits) - 1; | |
4992 | minlen = range->minlen >> sb->s_blocksize_bits; | |
4993 | ||
4994 | if (unlikely(minlen > EXT4_CLUSTERS_PER_GROUP(sb)) || | |
4995 | unlikely(start >= max_blks)) | |
4996 | return -EINVAL; | |
4997 | if (end >= max_blks) | |
4998 | end = max_blks - 1; | |
4999 | if (end <= first_data_blk) | |
5000 | goto out; | |
5001 | if (start < first_data_blk) | |
5002 | start = first_data_blk; | |
5003 | ||
5004 | /* Determine first and last group to examine based on start and end */ | |
5005 | ext4_get_group_no_and_offset(sb, (ext4_fsblk_t) start, | |
5006 | &first_group, &first_cluster); | |
5007 | ext4_get_group_no_and_offset(sb, (ext4_fsblk_t) end, | |
5008 | &last_group, &last_cluster); | |
5009 | ||
5010 | /* end now represents the last cluster to discard in this group */ | |
5011 | end = EXT4_CLUSTERS_PER_GROUP(sb) - 1; | |
5012 | ||
5013 | for (group = first_group; group <= last_group; group++) { | |
5014 | grp = ext4_get_group_info(sb, group); | |
5015 | /* We only do this if the grp has never been initialized */ | |
5016 | if (unlikely(EXT4_MB_GRP_NEED_INIT(grp))) { | |
5017 | ret = ext4_mb_init_group(sb, group); | |
5018 | if (ret) | |
5019 | break; | |
5020 | } | |
5021 | ||
5022 | /* | |
5023 | * For all the groups except the last one, last cluster will | |
5024 | * always be EXT4_CLUSTERS_PER_GROUP(sb)-1, so we only need to | |
5025 | * change it for the last group, note that last_cluster is | |
5026 | * already computed earlier by ext4_get_group_no_and_offset() | |
5027 | */ | |
5028 | if (group == last_group) | |
5029 | end = last_cluster; | |
5030 | ||
5031 | if (grp->bb_free >= minlen) { | |
5032 | cnt = ext4_trim_all_free(sb, group, first_cluster, | |
5033 | end, minlen); | |
5034 | if (cnt < 0) { | |
5035 | ret = cnt; | |
5036 | break; | |
5037 | } | |
5038 | trimmed += cnt; | |
5039 | } | |
5040 | ||
5041 | /* | |
5042 | * For every group except the first one, we are sure | |
5043 | * that the first cluster to discard will be cluster #0. | |
5044 | */ | |
5045 | first_cluster = 0; | |
5046 | } | |
5047 | ||
5048 | if (!ret) | |
5049 | atomic_set(&EXT4_SB(sb)->s_last_trim_minblks, minlen); | |
5050 | ||
5051 | out: | |
5052 | range->len = trimmed * sb->s_blocksize; | |
5053 | return ret; | |
5054 | } |