]>
Commit | Line | Data |
---|---|---|
c9de560d AT |
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 | ||
8f6e39a7 | 24 | #include "mballoc.h" |
c9de560d AT |
25 | /* |
26 | * MUSTDO: | |
27 | * - test ext4_ext_search_left() and ext4_ext_search_right() | |
28 | * - search for metadata in few groups | |
29 | * | |
30 | * TODO v4: | |
31 | * - normalization should take into account whether file is still open | |
32 | * - discard preallocations if no free space left (policy?) | |
33 | * - don't normalize tails | |
34 | * - quota | |
35 | * - reservation for superuser | |
36 | * | |
37 | * TODO v3: | |
38 | * - bitmap read-ahead (proposed by Oleg Drokin aka green) | |
39 | * - track min/max extents in each group for better group selection | |
40 | * - mb_mark_used() may allocate chunk right after splitting buddy | |
41 | * - tree of groups sorted by number of free blocks | |
42 | * - error handling | |
43 | */ | |
44 | ||
45 | /* | |
46 | * The allocation request involve request for multiple number of blocks | |
47 | * near to the goal(block) value specified. | |
48 | * | |
49 | * During initialization phase of the allocator we decide to use the group | |
50 | * preallocation or inode preallocation depending on the size file. The | |
51 | * size of the file could be the resulting file size we would have after | |
52 | * allocation or the current file size which ever is larger. If the size is | |
53 | * less that sbi->s_mb_stream_request we select the group | |
54 | * preallocation. The default value of s_mb_stream_request is 16 | |
55 | * blocks. This can also be tuned via | |
56 | * /proc/fs/ext4/<partition>/stream_req. The value is represented in terms | |
57 | * of number of blocks. | |
58 | * | |
59 | * The main motivation for having small file use group preallocation is to | |
60 | * ensure that we have small file closer in the disk. | |
61 | * | |
62 | * First stage the allocator looks at the inode prealloc list | |
63 | * ext4_inode_info->i_prealloc_list contain list of prealloc spaces for | |
64 | * this particular inode. The inode prealloc space is represented as: | |
65 | * | |
66 | * pa_lstart -> the logical start block for this prealloc space | |
67 | * pa_pstart -> the physical start block for this prealloc space | |
68 | * pa_len -> lenght for this prealloc space | |
69 | * pa_free -> free space available in this prealloc space | |
70 | * | |
71 | * The inode preallocation space is used looking at the _logical_ start | |
72 | * block. If only the logical file block falls within the range of prealloc | |
73 | * space we will consume the particular prealloc space. This make sure that | |
74 | * that the we have contiguous physical blocks representing the file blocks | |
75 | * | |
76 | * The important thing to be noted in case of inode prealloc space is that | |
77 | * we don't modify the values associated to inode prealloc space except | |
78 | * pa_free. | |
79 | * | |
80 | * If we are not able to find blocks in the inode prealloc space and if we | |
81 | * have the group allocation flag set then we look at the locality group | |
82 | * prealloc space. These are per CPU prealloc list repreasented as | |
83 | * | |
84 | * ext4_sb_info.s_locality_groups[smp_processor_id()] | |
85 | * | |
86 | * The reason for having a per cpu locality group is to reduce the contention | |
87 | * between CPUs. It is possible to get scheduled at this point. | |
88 | * | |
89 | * The locality group prealloc space is used looking at whether we have | |
90 | * enough free space (pa_free) withing the prealloc space. | |
91 | * | |
92 | * If we can't allocate blocks via inode prealloc or/and locality group | |
93 | * prealloc then we look at the buddy cache. The buddy cache is represented | |
94 | * by ext4_sb_info.s_buddy_cache (struct inode) whose file offset gets | |
95 | * mapped to the buddy and bitmap information regarding different | |
96 | * groups. The buddy information is attached to buddy cache inode so that | |
97 | * we can access them through the page cache. The information regarding | |
98 | * each group is loaded via ext4_mb_load_buddy. The information involve | |
99 | * block bitmap and buddy information. The information are stored in the | |
100 | * inode as: | |
101 | * | |
102 | * { page } | |
103 | * [ group 0 buddy][ group 0 bitmap] [group 1][ group 1]... | |
104 | * | |
105 | * | |
106 | * one block each for bitmap and buddy information. So for each group we | |
107 | * take up 2 blocks. A page can contain blocks_per_page (PAGE_CACHE_SIZE / | |
108 | * blocksize) blocks. So it can have information regarding groups_per_page | |
109 | * which is blocks_per_page/2 | |
110 | * | |
111 | * The buddy cache inode is not stored on disk. The inode is thrown | |
112 | * away when the filesystem is unmounted. | |
113 | * | |
114 | * We look for count number of blocks in the buddy cache. If we were able | |
115 | * to locate that many free blocks we return with additional information | |
116 | * regarding rest of the contiguous physical block available | |
117 | * | |
118 | * Before allocating blocks via buddy cache we normalize the request | |
119 | * blocks. This ensure we ask for more blocks that we needed. The extra | |
120 | * blocks that we get after allocation is added to the respective prealloc | |
121 | * list. In case of inode preallocation we follow a list of heuristics | |
122 | * based on file size. This can be found in ext4_mb_normalize_request. If | |
123 | * we are doing a group prealloc we try to normalize the request to | |
124 | * sbi->s_mb_group_prealloc. Default value of s_mb_group_prealloc is set to | |
125 | * 512 blocks. This can be tuned via | |
126 | * /proc/fs/ext4/<partition/group_prealloc. The value is represented in | |
127 | * terms of number of blocks. If we have mounted the file system with -O | |
128 | * stripe=<value> option the group prealloc request is normalized to the | |
129 | * stripe value (sbi->s_stripe) | |
130 | * | |
131 | * The regular allocator(using the buddy cache) support few tunables. | |
132 | * | |
133 | * /proc/fs/ext4/<partition>/min_to_scan | |
134 | * /proc/fs/ext4/<partition>/max_to_scan | |
135 | * /proc/fs/ext4/<partition>/order2_req | |
136 | * | |
137 | * The regular allocator use buddy scan only if the request len is power of | |
138 | * 2 blocks and the order of allocation is >= sbi->s_mb_order2_reqs. The | |
139 | * value of s_mb_order2_reqs can be tuned via | |
140 | * /proc/fs/ext4/<partition>/order2_req. If the request len is equal to | |
141 | * stripe size (sbi->s_stripe), we try to search for contigous block in | |
142 | * stripe size. This should result in better allocation on RAID setup. If | |
143 | * not we search in the specific group using bitmap for best extents. The | |
144 | * tunable min_to_scan and max_to_scan controll the behaviour here. | |
145 | * min_to_scan indicate how long the mballoc __must__ look for a best | |
146 | * extent and max_to_scanindicate how long the mballoc __can__ look for a | |
147 | * best extent in the found extents. Searching for the blocks starts with | |
148 | * the group specified as the goal value in allocation context via | |
149 | * ac_g_ex. Each group is first checked based on the criteria whether it | |
150 | * can used for allocation. ext4_mb_good_group explains how the groups are | |
151 | * checked. | |
152 | * | |
153 | * Both the prealloc space are getting populated as above. So for the first | |
154 | * request we will hit the buddy cache which will result in this prealloc | |
155 | * space getting filled. The prealloc space is then later used for the | |
156 | * subsequent request. | |
157 | */ | |
158 | ||
159 | /* | |
160 | * mballoc operates on the following data: | |
161 | * - on-disk bitmap | |
162 | * - in-core buddy (actually includes buddy and bitmap) | |
163 | * - preallocation descriptors (PAs) | |
164 | * | |
165 | * there are two types of preallocations: | |
166 | * - inode | |
167 | * assiged to specific inode and can be used for this inode only. | |
168 | * it describes part of inode's space preallocated to specific | |
169 | * physical blocks. any block from that preallocated can be used | |
170 | * independent. the descriptor just tracks number of blocks left | |
171 | * unused. so, before taking some block from descriptor, one must | |
172 | * make sure corresponded logical block isn't allocated yet. this | |
173 | * also means that freeing any block within descriptor's range | |
174 | * must discard all preallocated blocks. | |
175 | * - locality group | |
176 | * assigned to specific locality group which does not translate to | |
177 | * permanent set of inodes: inode can join and leave group. space | |
178 | * from this type of preallocation can be used for any inode. thus | |
179 | * it's consumed from the beginning to the end. | |
180 | * | |
181 | * relation between them can be expressed as: | |
182 | * in-core buddy = on-disk bitmap + preallocation descriptors | |
183 | * | |
184 | * this mean blocks mballoc considers used are: | |
185 | * - allocated blocks (persistent) | |
186 | * - preallocated blocks (non-persistent) | |
187 | * | |
188 | * consistency in mballoc world means that at any time a block is either | |
189 | * free or used in ALL structures. notice: "any time" should not be read | |
190 | * literally -- time is discrete and delimited by locks. | |
191 | * | |
192 | * to keep it simple, we don't use block numbers, instead we count number of | |
193 | * blocks: how many blocks marked used/free in on-disk bitmap, buddy and PA. | |
194 | * | |
195 | * all operations can be expressed as: | |
196 | * - init buddy: buddy = on-disk + PAs | |
197 | * - new PA: buddy += N; PA = N | |
198 | * - use inode PA: on-disk += N; PA -= N | |
199 | * - discard inode PA buddy -= on-disk - PA; PA = 0 | |
200 | * - use locality group PA on-disk += N; PA -= N | |
201 | * - discard locality group PA buddy -= PA; PA = 0 | |
202 | * note: 'buddy -= on-disk - PA' is used to show that on-disk bitmap | |
203 | * is used in real operation because we can't know actual used | |
204 | * bits from PA, only from on-disk bitmap | |
205 | * | |
206 | * if we follow this strict logic, then all operations above should be atomic. | |
207 | * given some of them can block, we'd have to use something like semaphores | |
208 | * killing performance on high-end SMP hardware. let's try to relax it using | |
209 | * the following knowledge: | |
210 | * 1) if buddy is referenced, it's already initialized | |
211 | * 2) while block is used in buddy and the buddy is referenced, | |
212 | * nobody can re-allocate that block | |
213 | * 3) we work on bitmaps and '+' actually means 'set bits'. if on-disk has | |
214 | * bit set and PA claims same block, it's OK. IOW, one can set bit in | |
215 | * on-disk bitmap if buddy has same bit set or/and PA covers corresponded | |
216 | * block | |
217 | * | |
218 | * so, now we're building a concurrency table: | |
219 | * - init buddy vs. | |
220 | * - new PA | |
221 | * blocks for PA are allocated in the buddy, buddy must be referenced | |
222 | * until PA is linked to allocation group to avoid concurrent buddy init | |
223 | * - use inode PA | |
224 | * we need to make sure that either on-disk bitmap or PA has uptodate data | |
225 | * given (3) we care that PA-=N operation doesn't interfere with init | |
226 | * - discard inode PA | |
227 | * the simplest way would be to have buddy initialized by the discard | |
228 | * - use locality group PA | |
229 | * again PA-=N must be serialized with init | |
230 | * - discard locality group PA | |
231 | * the simplest way would be to have buddy initialized by the discard | |
232 | * - new PA vs. | |
233 | * - use inode PA | |
234 | * i_data_sem serializes them | |
235 | * - discard inode PA | |
236 | * discard process must wait until PA isn't used by another process | |
237 | * - use locality group PA | |
238 | * some mutex should serialize them | |
239 | * - discard locality group PA | |
240 | * discard process must wait until PA isn't used by another process | |
241 | * - use inode PA | |
242 | * - use inode PA | |
243 | * i_data_sem or another mutex should 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 | * nothing wrong here -- they're different PAs covering different blocks | |
248 | * - discard locality group PA | |
249 | * discard process must wait until PA isn't used by another process | |
250 | * | |
251 | * now we're ready to make few consequences: | |
252 | * - PA is referenced and while it is no discard is possible | |
253 | * - PA is referenced until block isn't marked in on-disk bitmap | |
254 | * - PA changes only after on-disk bitmap | |
255 | * - discard must not compete with init. either init is done before | |
256 | * any discard or they're serialized somehow | |
257 | * - buddy init as sum of on-disk bitmap and PAs is done atomically | |
258 | * | |
259 | * a special case when we've used PA to emptiness. no need to modify buddy | |
260 | * in this case, but we should care about concurrent init | |
261 | * | |
262 | */ | |
263 | ||
264 | /* | |
265 | * Logic in few words: | |
266 | * | |
267 | * - allocation: | |
268 | * load group | |
269 | * find blocks | |
270 | * mark bits in on-disk bitmap | |
271 | * release group | |
272 | * | |
273 | * - use preallocation: | |
274 | * find proper PA (per-inode or group) | |
275 | * load group | |
276 | * mark bits in on-disk bitmap | |
277 | * release group | |
278 | * release PA | |
279 | * | |
280 | * - free: | |
281 | * load group | |
282 | * mark bits in on-disk bitmap | |
283 | * release group | |
284 | * | |
285 | * - discard preallocations in group: | |
286 | * mark PAs deleted | |
287 | * move them onto local list | |
288 | * load on-disk bitmap | |
289 | * load group | |
290 | * remove PA from object (inode or locality group) | |
291 | * mark free blocks in-core | |
292 | * | |
293 | * - discard inode's preallocations: | |
294 | */ | |
295 | ||
296 | /* | |
297 | * Locking rules | |
298 | * | |
299 | * Locks: | |
300 | * - bitlock on a group (group) | |
301 | * - object (inode/locality) (object) | |
302 | * - per-pa lock (pa) | |
303 | * | |
304 | * Paths: | |
305 | * - new pa | |
306 | * object | |
307 | * group | |
308 | * | |
309 | * - find and use pa: | |
310 | * pa | |
311 | * | |
312 | * - release consumed pa: | |
313 | * pa | |
314 | * group | |
315 | * object | |
316 | * | |
317 | * - generate in-core bitmap: | |
318 | * group | |
319 | * pa | |
320 | * | |
321 | * - discard all for given object (inode, locality group): | |
322 | * object | |
323 | * pa | |
324 | * group | |
325 | * | |
326 | * - discard all for given group: | |
327 | * group | |
328 | * pa | |
329 | * group | |
330 | * object | |
331 | * | |
332 | */ | |
333 | ||
ffad0a44 AK |
334 | static inline void *mb_correct_addr_and_bit(int *bit, void *addr) |
335 | { | |
c9de560d | 336 | #if BITS_PER_LONG == 64 |
ffad0a44 AK |
337 | *bit += ((unsigned long) addr & 7UL) << 3; |
338 | addr = (void *) ((unsigned long) addr & ~7UL); | |
c9de560d | 339 | #elif BITS_PER_LONG == 32 |
ffad0a44 AK |
340 | *bit += ((unsigned long) addr & 3UL) << 3; |
341 | addr = (void *) ((unsigned long) addr & ~3UL); | |
c9de560d AT |
342 | #else |
343 | #error "how many bits you are?!" | |
344 | #endif | |
ffad0a44 AK |
345 | return addr; |
346 | } | |
c9de560d AT |
347 | |
348 | static inline int mb_test_bit(int bit, void *addr) | |
349 | { | |
350 | /* | |
351 | * ext4_test_bit on architecture like powerpc | |
352 | * needs unsigned long aligned address | |
353 | */ | |
ffad0a44 | 354 | addr = mb_correct_addr_and_bit(&bit, addr); |
c9de560d AT |
355 | return ext4_test_bit(bit, addr); |
356 | } | |
357 | ||
358 | static inline void mb_set_bit(int bit, void *addr) | |
359 | { | |
ffad0a44 | 360 | addr = mb_correct_addr_and_bit(&bit, addr); |
c9de560d AT |
361 | ext4_set_bit(bit, addr); |
362 | } | |
363 | ||
364 | static inline void mb_set_bit_atomic(spinlock_t *lock, int bit, void *addr) | |
365 | { | |
ffad0a44 | 366 | addr = mb_correct_addr_and_bit(&bit, addr); |
c9de560d AT |
367 | ext4_set_bit_atomic(lock, bit, addr); |
368 | } | |
369 | ||
370 | static inline void mb_clear_bit(int bit, void *addr) | |
371 | { | |
ffad0a44 | 372 | addr = mb_correct_addr_and_bit(&bit, addr); |
c9de560d AT |
373 | ext4_clear_bit(bit, addr); |
374 | } | |
375 | ||
376 | static inline void mb_clear_bit_atomic(spinlock_t *lock, int bit, void *addr) | |
377 | { | |
ffad0a44 | 378 | addr = mb_correct_addr_and_bit(&bit, addr); |
c9de560d AT |
379 | ext4_clear_bit_atomic(lock, bit, addr); |
380 | } | |
381 | ||
ffad0a44 AK |
382 | static inline int mb_find_next_zero_bit(void *addr, int max, int start) |
383 | { | |
e7dfb246 | 384 | int fix = 0, ret, tmpmax; |
ffad0a44 | 385 | addr = mb_correct_addr_and_bit(&fix, addr); |
e7dfb246 | 386 | tmpmax = max + fix; |
ffad0a44 AK |
387 | start += fix; |
388 | ||
e7dfb246 AK |
389 | ret = ext4_find_next_zero_bit(addr, tmpmax, start) - fix; |
390 | if (ret > max) | |
391 | return max; | |
392 | return ret; | |
ffad0a44 AK |
393 | } |
394 | ||
395 | static inline int mb_find_next_bit(void *addr, int max, int start) | |
396 | { | |
e7dfb246 | 397 | int fix = 0, ret, tmpmax; |
ffad0a44 | 398 | addr = mb_correct_addr_and_bit(&fix, addr); |
e7dfb246 | 399 | tmpmax = max + fix; |
ffad0a44 AK |
400 | start += fix; |
401 | ||
e7dfb246 AK |
402 | ret = ext4_find_next_bit(addr, tmpmax, start) - fix; |
403 | if (ret > max) | |
404 | return max; | |
405 | return ret; | |
ffad0a44 AK |
406 | } |
407 | ||
c9de560d AT |
408 | static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max) |
409 | { | |
410 | char *bb; | |
411 | ||
c9de560d AT |
412 | BUG_ON(EXT4_MB_BITMAP(e4b) == EXT4_MB_BUDDY(e4b)); |
413 | BUG_ON(max == NULL); | |
414 | ||
415 | if (order > e4b->bd_blkbits + 1) { | |
416 | *max = 0; | |
417 | return NULL; | |
418 | } | |
419 | ||
420 | /* at order 0 we see each particular block */ | |
421 | *max = 1 << (e4b->bd_blkbits + 3); | |
422 | if (order == 0) | |
423 | return EXT4_MB_BITMAP(e4b); | |
424 | ||
425 | bb = EXT4_MB_BUDDY(e4b) + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order]; | |
426 | *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order]; | |
427 | ||
428 | return bb; | |
429 | } | |
430 | ||
431 | #ifdef DOUBLE_CHECK | |
432 | static void mb_free_blocks_double(struct inode *inode, struct ext4_buddy *e4b, | |
433 | int first, int count) | |
434 | { | |
435 | int i; | |
436 | struct super_block *sb = e4b->bd_sb; | |
437 | ||
438 | if (unlikely(e4b->bd_info->bb_bitmap == NULL)) | |
439 | return; | |
440 | BUG_ON(!ext4_is_group_locked(sb, e4b->bd_group)); | |
441 | for (i = 0; i < count; i++) { | |
442 | if (!mb_test_bit(first + i, e4b->bd_info->bb_bitmap)) { | |
443 | ext4_fsblk_t blocknr; | |
444 | blocknr = e4b->bd_group * EXT4_BLOCKS_PER_GROUP(sb); | |
445 | blocknr += first + i; | |
446 | blocknr += | |
447 | le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block); | |
448 | ||
46e665e9 | 449 | ext4_error(sb, __func__, "double-free of inode" |
c9de560d AT |
450 | " %lu's block %llu(bit %u in group %lu)\n", |
451 | inode ? inode->i_ino : 0, blocknr, | |
452 | first + i, e4b->bd_group); | |
453 | } | |
454 | mb_clear_bit(first + i, e4b->bd_info->bb_bitmap); | |
455 | } | |
456 | } | |
457 | ||
458 | static void mb_mark_used_double(struct ext4_buddy *e4b, int first, int count) | |
459 | { | |
460 | int i; | |
461 | ||
462 | if (unlikely(e4b->bd_info->bb_bitmap == NULL)) | |
463 | return; | |
464 | BUG_ON(!ext4_is_group_locked(e4b->bd_sb, e4b->bd_group)); | |
465 | for (i = 0; i < count; i++) { | |
466 | BUG_ON(mb_test_bit(first + i, e4b->bd_info->bb_bitmap)); | |
467 | mb_set_bit(first + i, e4b->bd_info->bb_bitmap); | |
468 | } | |
469 | } | |
470 | ||
471 | static void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap) | |
472 | { | |
473 | if (memcmp(e4b->bd_info->bb_bitmap, bitmap, e4b->bd_sb->s_blocksize)) { | |
474 | unsigned char *b1, *b2; | |
475 | int i; | |
476 | b1 = (unsigned char *) e4b->bd_info->bb_bitmap; | |
477 | b2 = (unsigned char *) bitmap; | |
478 | for (i = 0; i < e4b->bd_sb->s_blocksize; i++) { | |
479 | if (b1[i] != b2[i]) { | |
480 | printk("corruption in group %lu at byte %u(%u):" | |
481 | " %x in copy != %x on disk/prealloc\n", | |
482 | e4b->bd_group, i, i * 8, b1[i], b2[i]); | |
483 | BUG(); | |
484 | } | |
485 | } | |
486 | } | |
487 | } | |
488 | ||
489 | #else | |
490 | static inline void mb_free_blocks_double(struct inode *inode, | |
491 | struct ext4_buddy *e4b, int first, int count) | |
492 | { | |
493 | return; | |
494 | } | |
495 | static inline void mb_mark_used_double(struct ext4_buddy *e4b, | |
496 | int first, int count) | |
497 | { | |
498 | return; | |
499 | } | |
500 | static inline void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap) | |
501 | { | |
502 | return; | |
503 | } | |
504 | #endif | |
505 | ||
506 | #ifdef AGGRESSIVE_CHECK | |
507 | ||
508 | #define MB_CHECK_ASSERT(assert) \ | |
509 | do { \ | |
510 | if (!(assert)) { \ | |
511 | printk(KERN_EMERG \ | |
512 | "Assertion failure in %s() at %s:%d: \"%s\"\n", \ | |
513 | function, file, line, # assert); \ | |
514 | BUG(); \ | |
515 | } \ | |
516 | } while (0) | |
517 | ||
518 | static int __mb_check_buddy(struct ext4_buddy *e4b, char *file, | |
519 | const char *function, int line) | |
520 | { | |
521 | struct super_block *sb = e4b->bd_sb; | |
522 | int order = e4b->bd_blkbits + 1; | |
523 | int max; | |
524 | int max2; | |
525 | int i; | |
526 | int j; | |
527 | int k; | |
528 | int count; | |
529 | struct ext4_group_info *grp; | |
530 | int fragments = 0; | |
531 | int fstart; | |
532 | struct list_head *cur; | |
533 | void *buddy; | |
534 | void *buddy2; | |
535 | ||
536 | if (!test_opt(sb, MBALLOC)) | |
537 | return 0; | |
538 | ||
539 | { | |
540 | static int mb_check_counter; | |
541 | if (mb_check_counter++ % 100 != 0) | |
542 | return 0; | |
543 | } | |
544 | ||
545 | while (order > 1) { | |
546 | buddy = mb_find_buddy(e4b, order, &max); | |
547 | MB_CHECK_ASSERT(buddy); | |
548 | buddy2 = mb_find_buddy(e4b, order - 1, &max2); | |
549 | MB_CHECK_ASSERT(buddy2); | |
550 | MB_CHECK_ASSERT(buddy != buddy2); | |
551 | MB_CHECK_ASSERT(max * 2 == max2); | |
552 | ||
553 | count = 0; | |
554 | for (i = 0; i < max; i++) { | |
555 | ||
556 | if (mb_test_bit(i, buddy)) { | |
557 | /* only single bit in buddy2 may be 1 */ | |
558 | if (!mb_test_bit(i << 1, buddy2)) { | |
559 | MB_CHECK_ASSERT( | |
560 | mb_test_bit((i<<1)+1, buddy2)); | |
561 | } else if (!mb_test_bit((i << 1) + 1, buddy2)) { | |
562 | MB_CHECK_ASSERT( | |
563 | mb_test_bit(i << 1, buddy2)); | |
564 | } | |
565 | continue; | |
566 | } | |
567 | ||
568 | /* both bits in buddy2 must be 0 */ | |
569 | MB_CHECK_ASSERT(mb_test_bit(i << 1, buddy2)); | |
570 | MB_CHECK_ASSERT(mb_test_bit((i << 1) + 1, buddy2)); | |
571 | ||
572 | for (j = 0; j < (1 << order); j++) { | |
573 | k = (i * (1 << order)) + j; | |
574 | MB_CHECK_ASSERT( | |
575 | !mb_test_bit(k, EXT4_MB_BITMAP(e4b))); | |
576 | } | |
577 | count++; | |
578 | } | |
579 | MB_CHECK_ASSERT(e4b->bd_info->bb_counters[order] == count); | |
580 | order--; | |
581 | } | |
582 | ||
583 | fstart = -1; | |
584 | buddy = mb_find_buddy(e4b, 0, &max); | |
585 | for (i = 0; i < max; i++) { | |
586 | if (!mb_test_bit(i, buddy)) { | |
587 | MB_CHECK_ASSERT(i >= e4b->bd_info->bb_first_free); | |
588 | if (fstart == -1) { | |
589 | fragments++; | |
590 | fstart = i; | |
591 | } | |
592 | continue; | |
593 | } | |
594 | fstart = -1; | |
595 | /* check used bits only */ | |
596 | for (j = 0; j < e4b->bd_blkbits + 1; j++) { | |
597 | buddy2 = mb_find_buddy(e4b, j, &max2); | |
598 | k = i >> j; | |
599 | MB_CHECK_ASSERT(k < max2); | |
600 | MB_CHECK_ASSERT(mb_test_bit(k, buddy2)); | |
601 | } | |
602 | } | |
603 | MB_CHECK_ASSERT(!EXT4_MB_GRP_NEED_INIT(e4b->bd_info)); | |
604 | MB_CHECK_ASSERT(e4b->bd_info->bb_fragments == fragments); | |
605 | ||
606 | grp = ext4_get_group_info(sb, e4b->bd_group); | |
607 | buddy = mb_find_buddy(e4b, 0, &max); | |
608 | list_for_each(cur, &grp->bb_prealloc_list) { | |
609 | ext4_group_t groupnr; | |
610 | struct ext4_prealloc_space *pa; | |
60bd63d1 SR |
611 | pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); |
612 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &groupnr, &k); | |
c9de560d | 613 | MB_CHECK_ASSERT(groupnr == e4b->bd_group); |
60bd63d1 | 614 | for (i = 0; i < pa->pa_len; i++) |
c9de560d AT |
615 | MB_CHECK_ASSERT(mb_test_bit(k + i, buddy)); |
616 | } | |
617 | return 0; | |
618 | } | |
619 | #undef MB_CHECK_ASSERT | |
620 | #define mb_check_buddy(e4b) __mb_check_buddy(e4b, \ | |
46e665e9 | 621 | __FILE__, __func__, __LINE__) |
c9de560d AT |
622 | #else |
623 | #define mb_check_buddy(e4b) | |
624 | #endif | |
625 | ||
626 | /* FIXME!! need more doc */ | |
627 | static void ext4_mb_mark_free_simple(struct super_block *sb, | |
628 | void *buddy, unsigned first, int len, | |
629 | struct ext4_group_info *grp) | |
630 | { | |
631 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
632 | unsigned short min; | |
633 | unsigned short max; | |
634 | unsigned short chunk; | |
635 | unsigned short border; | |
636 | ||
b73fce69 | 637 | BUG_ON(len > EXT4_BLOCKS_PER_GROUP(sb)); |
c9de560d AT |
638 | |
639 | border = 2 << sb->s_blocksize_bits; | |
640 | ||
641 | while (len > 0) { | |
642 | /* find how many blocks can be covered since this position */ | |
643 | max = ffs(first | border) - 1; | |
644 | ||
645 | /* find how many blocks of power 2 we need to mark */ | |
646 | min = fls(len) - 1; | |
647 | ||
648 | if (max < min) | |
649 | min = max; | |
650 | chunk = 1 << min; | |
651 | ||
652 | /* mark multiblock chunks only */ | |
653 | grp->bb_counters[min]++; | |
654 | if (min > 0) | |
655 | mb_clear_bit(first >> min, | |
656 | buddy + sbi->s_mb_offsets[min]); | |
657 | ||
658 | len -= chunk; | |
659 | first += chunk; | |
660 | } | |
661 | } | |
662 | ||
663 | static void ext4_mb_generate_buddy(struct super_block *sb, | |
664 | void *buddy, void *bitmap, ext4_group_t group) | |
665 | { | |
666 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
667 | unsigned short max = EXT4_BLOCKS_PER_GROUP(sb); | |
668 | unsigned short i = 0; | |
669 | unsigned short first; | |
670 | unsigned short len; | |
671 | unsigned free = 0; | |
672 | unsigned fragments = 0; | |
673 | unsigned long long period = get_cycles(); | |
674 | ||
675 | /* initialize buddy from bitmap which is aggregation | |
676 | * of on-disk bitmap and preallocations */ | |
ffad0a44 | 677 | i = mb_find_next_zero_bit(bitmap, max, 0); |
c9de560d AT |
678 | grp->bb_first_free = i; |
679 | while (i < max) { | |
680 | fragments++; | |
681 | first = i; | |
ffad0a44 | 682 | i = mb_find_next_bit(bitmap, max, i); |
c9de560d AT |
683 | len = i - first; |
684 | free += len; | |
685 | if (len > 1) | |
686 | ext4_mb_mark_free_simple(sb, buddy, first, len, grp); | |
687 | else | |
688 | grp->bb_counters[0]++; | |
689 | if (i < max) | |
ffad0a44 | 690 | i = mb_find_next_zero_bit(bitmap, max, i); |
c9de560d AT |
691 | } |
692 | grp->bb_fragments = fragments; | |
693 | ||
694 | if (free != grp->bb_free) { | |
46e665e9 | 695 | ext4_error(sb, __func__, |
c9de560d AT |
696 | "EXT4-fs: group %lu: %u blocks in bitmap, %u in gd\n", |
697 | group, free, grp->bb_free); | |
e56eb659 AK |
698 | /* |
699 | * If we intent to continue, we consider group descritor | |
700 | * corrupt and update bb_free using bitmap value | |
701 | */ | |
c9de560d AT |
702 | grp->bb_free = free; |
703 | } | |
704 | ||
705 | clear_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, &(grp->bb_state)); | |
706 | ||
707 | period = get_cycles() - period; | |
708 | spin_lock(&EXT4_SB(sb)->s_bal_lock); | |
709 | EXT4_SB(sb)->s_mb_buddies_generated++; | |
710 | EXT4_SB(sb)->s_mb_generation_time += period; | |
711 | spin_unlock(&EXT4_SB(sb)->s_bal_lock); | |
712 | } | |
713 | ||
714 | /* The buddy information is attached the buddy cache inode | |
715 | * for convenience. The information regarding each group | |
716 | * is loaded via ext4_mb_load_buddy. The information involve | |
717 | * block bitmap and buddy information. The information are | |
718 | * stored in the inode as | |
719 | * | |
720 | * { page } | |
721 | * [ group 0 buddy][ group 0 bitmap] [group 1][ group 1]... | |
722 | * | |
723 | * | |
724 | * one block each for bitmap and buddy information. | |
725 | * So for each group we take up 2 blocks. A page can | |
726 | * contain blocks_per_page (PAGE_CACHE_SIZE / blocksize) blocks. | |
727 | * So it can have information regarding groups_per_page which | |
728 | * is blocks_per_page/2 | |
729 | */ | |
730 | ||
731 | static int ext4_mb_init_cache(struct page *page, char *incore) | |
732 | { | |
733 | int blocksize; | |
734 | int blocks_per_page; | |
735 | int groups_per_page; | |
736 | int err = 0; | |
737 | int i; | |
738 | ext4_group_t first_group; | |
739 | int first_block; | |
740 | struct super_block *sb; | |
741 | struct buffer_head *bhs; | |
742 | struct buffer_head **bh; | |
743 | struct inode *inode; | |
744 | char *data; | |
745 | char *bitmap; | |
746 | ||
747 | mb_debug("init page %lu\n", page->index); | |
748 | ||
749 | inode = page->mapping->host; | |
750 | sb = inode->i_sb; | |
751 | blocksize = 1 << inode->i_blkbits; | |
752 | blocks_per_page = PAGE_CACHE_SIZE / blocksize; | |
753 | ||
754 | groups_per_page = blocks_per_page >> 1; | |
755 | if (groups_per_page == 0) | |
756 | groups_per_page = 1; | |
757 | ||
758 | /* allocate buffer_heads to read bitmaps */ | |
759 | if (groups_per_page > 1) { | |
760 | err = -ENOMEM; | |
761 | i = sizeof(struct buffer_head *) * groups_per_page; | |
762 | bh = kzalloc(i, GFP_NOFS); | |
763 | if (bh == NULL) | |
764 | goto out; | |
765 | } else | |
766 | bh = &bhs; | |
767 | ||
768 | first_group = page->index * blocks_per_page / 2; | |
769 | ||
770 | /* read all groups the page covers into the cache */ | |
771 | for (i = 0; i < groups_per_page; i++) { | |
772 | struct ext4_group_desc *desc; | |
773 | ||
774 | if (first_group + i >= EXT4_SB(sb)->s_groups_count) | |
775 | break; | |
776 | ||
777 | err = -EIO; | |
778 | desc = ext4_get_group_desc(sb, first_group + i, NULL); | |
779 | if (desc == NULL) | |
780 | goto out; | |
781 | ||
782 | err = -ENOMEM; | |
783 | bh[i] = sb_getblk(sb, ext4_block_bitmap(sb, desc)); | |
784 | if (bh[i] == NULL) | |
785 | goto out; | |
786 | ||
787 | if (bh_uptodate_or_lock(bh[i])) | |
788 | continue; | |
789 | ||
790 | if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { | |
791 | ext4_init_block_bitmap(sb, bh[i], | |
792 | first_group + i, desc); | |
793 | set_buffer_uptodate(bh[i]); | |
794 | unlock_buffer(bh[i]); | |
795 | continue; | |
796 | } | |
797 | get_bh(bh[i]); | |
798 | bh[i]->b_end_io = end_buffer_read_sync; | |
799 | submit_bh(READ, bh[i]); | |
800 | mb_debug("read bitmap for group %lu\n", first_group + i); | |
801 | } | |
802 | ||
803 | /* wait for I/O completion */ | |
804 | for (i = 0; i < groups_per_page && bh[i]; i++) | |
805 | wait_on_buffer(bh[i]); | |
806 | ||
807 | err = -EIO; | |
808 | for (i = 0; i < groups_per_page && bh[i]; i++) | |
809 | if (!buffer_uptodate(bh[i])) | |
810 | goto out; | |
811 | ||
31b481dc | 812 | err = 0; |
c9de560d AT |
813 | first_block = page->index * blocks_per_page; |
814 | for (i = 0; i < blocks_per_page; i++) { | |
815 | int group; | |
816 | struct ext4_group_info *grinfo; | |
817 | ||
818 | group = (first_block + i) >> 1; | |
819 | if (group >= EXT4_SB(sb)->s_groups_count) | |
820 | break; | |
821 | ||
822 | /* | |
823 | * data carry information regarding this | |
824 | * particular group in the format specified | |
825 | * above | |
826 | * | |
827 | */ | |
828 | data = page_address(page) + (i * blocksize); | |
829 | bitmap = bh[group - first_group]->b_data; | |
830 | ||
831 | /* | |
832 | * We place the buddy block and bitmap block | |
833 | * close together | |
834 | */ | |
835 | if ((first_block + i) & 1) { | |
836 | /* this is block of buddy */ | |
837 | BUG_ON(incore == NULL); | |
838 | mb_debug("put buddy for group %u in page %lu/%x\n", | |
839 | group, page->index, i * blocksize); | |
840 | memset(data, 0xff, blocksize); | |
841 | grinfo = ext4_get_group_info(sb, group); | |
842 | grinfo->bb_fragments = 0; | |
843 | memset(grinfo->bb_counters, 0, | |
844 | sizeof(unsigned short)*(sb->s_blocksize_bits+2)); | |
845 | /* | |
846 | * incore got set to the group block bitmap below | |
847 | */ | |
848 | ext4_mb_generate_buddy(sb, data, incore, group); | |
849 | incore = NULL; | |
850 | } else { | |
851 | /* this is block of bitmap */ | |
852 | BUG_ON(incore != NULL); | |
853 | mb_debug("put bitmap for group %u in page %lu/%x\n", | |
854 | group, page->index, i * blocksize); | |
855 | ||
856 | /* see comments in ext4_mb_put_pa() */ | |
857 | ext4_lock_group(sb, group); | |
858 | memcpy(data, bitmap, blocksize); | |
859 | ||
860 | /* mark all preallocated blks used in in-core bitmap */ | |
861 | ext4_mb_generate_from_pa(sb, data, group); | |
862 | ext4_unlock_group(sb, group); | |
863 | ||
864 | /* set incore so that the buddy information can be | |
865 | * generated using this | |
866 | */ | |
867 | incore = data; | |
868 | } | |
869 | } | |
870 | SetPageUptodate(page); | |
871 | ||
872 | out: | |
873 | if (bh) { | |
874 | for (i = 0; i < groups_per_page && bh[i]; i++) | |
875 | brelse(bh[i]); | |
876 | if (bh != &bhs) | |
877 | kfree(bh); | |
878 | } | |
879 | return err; | |
880 | } | |
881 | ||
4ddfef7b ES |
882 | static noinline_for_stack int |
883 | ext4_mb_load_buddy(struct super_block *sb, ext4_group_t group, | |
884 | struct ext4_buddy *e4b) | |
c9de560d AT |
885 | { |
886 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
887 | struct inode *inode = sbi->s_buddy_cache; | |
888 | int blocks_per_page; | |
889 | int block; | |
890 | int pnum; | |
891 | int poff; | |
892 | struct page *page; | |
fdf6c7a7 | 893 | int ret; |
c9de560d AT |
894 | |
895 | mb_debug("load group %lu\n", group); | |
896 | ||
897 | blocks_per_page = PAGE_CACHE_SIZE / sb->s_blocksize; | |
898 | ||
899 | e4b->bd_blkbits = sb->s_blocksize_bits; | |
900 | e4b->bd_info = ext4_get_group_info(sb, group); | |
901 | e4b->bd_sb = sb; | |
902 | e4b->bd_group = group; | |
903 | e4b->bd_buddy_page = NULL; | |
904 | e4b->bd_bitmap_page = NULL; | |
905 | ||
906 | /* | |
907 | * the buddy cache inode stores the block bitmap | |
908 | * and buddy information in consecutive blocks. | |
909 | * So for each group we need two blocks. | |
910 | */ | |
911 | block = group * 2; | |
912 | pnum = block / blocks_per_page; | |
913 | poff = block % blocks_per_page; | |
914 | ||
915 | /* we could use find_or_create_page(), but it locks page | |
916 | * what we'd like to avoid in fast path ... */ | |
917 | page = find_get_page(inode->i_mapping, pnum); | |
918 | if (page == NULL || !PageUptodate(page)) { | |
919 | if (page) | |
920 | page_cache_release(page); | |
921 | page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); | |
922 | if (page) { | |
923 | BUG_ON(page->mapping != inode->i_mapping); | |
924 | if (!PageUptodate(page)) { | |
fdf6c7a7 SF |
925 | ret = ext4_mb_init_cache(page, NULL); |
926 | if (ret) { | |
927 | unlock_page(page); | |
928 | goto err; | |
929 | } | |
c9de560d AT |
930 | mb_cmp_bitmaps(e4b, page_address(page) + |
931 | (poff * sb->s_blocksize)); | |
932 | } | |
933 | unlock_page(page); | |
934 | } | |
935 | } | |
fdf6c7a7 SF |
936 | if (page == NULL || !PageUptodate(page)) { |
937 | ret = -EIO; | |
c9de560d | 938 | goto err; |
fdf6c7a7 | 939 | } |
c9de560d AT |
940 | e4b->bd_bitmap_page = page; |
941 | e4b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize); | |
942 | mark_page_accessed(page); | |
943 | ||
944 | block++; | |
945 | pnum = block / blocks_per_page; | |
946 | poff = block % blocks_per_page; | |
947 | ||
948 | page = find_get_page(inode->i_mapping, pnum); | |
949 | if (page == NULL || !PageUptodate(page)) { | |
950 | if (page) | |
951 | page_cache_release(page); | |
952 | page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); | |
953 | if (page) { | |
954 | BUG_ON(page->mapping != inode->i_mapping); | |
fdf6c7a7 SF |
955 | if (!PageUptodate(page)) { |
956 | ret = ext4_mb_init_cache(page, e4b->bd_bitmap); | |
957 | if (ret) { | |
958 | unlock_page(page); | |
959 | goto err; | |
960 | } | |
961 | } | |
c9de560d AT |
962 | unlock_page(page); |
963 | } | |
964 | } | |
fdf6c7a7 SF |
965 | if (page == NULL || !PageUptodate(page)) { |
966 | ret = -EIO; | |
c9de560d | 967 | goto err; |
fdf6c7a7 | 968 | } |
c9de560d AT |
969 | e4b->bd_buddy_page = page; |
970 | e4b->bd_buddy = page_address(page) + (poff * sb->s_blocksize); | |
971 | mark_page_accessed(page); | |
972 | ||
973 | BUG_ON(e4b->bd_bitmap_page == NULL); | |
974 | BUG_ON(e4b->bd_buddy_page == NULL); | |
975 | ||
976 | return 0; | |
977 | ||
978 | err: | |
979 | if (e4b->bd_bitmap_page) | |
980 | page_cache_release(e4b->bd_bitmap_page); | |
981 | if (e4b->bd_buddy_page) | |
982 | page_cache_release(e4b->bd_buddy_page); | |
983 | e4b->bd_buddy = NULL; | |
984 | e4b->bd_bitmap = NULL; | |
fdf6c7a7 | 985 | return ret; |
c9de560d AT |
986 | } |
987 | ||
988 | static void ext4_mb_release_desc(struct ext4_buddy *e4b) | |
989 | { | |
990 | if (e4b->bd_bitmap_page) | |
991 | page_cache_release(e4b->bd_bitmap_page); | |
992 | if (e4b->bd_buddy_page) | |
993 | page_cache_release(e4b->bd_buddy_page); | |
994 | } | |
995 | ||
996 | ||
997 | static int mb_find_order_for_block(struct ext4_buddy *e4b, int block) | |
998 | { | |
999 | int order = 1; | |
1000 | void *bb; | |
1001 | ||
1002 | BUG_ON(EXT4_MB_BITMAP(e4b) == EXT4_MB_BUDDY(e4b)); | |
1003 | BUG_ON(block >= (1 << (e4b->bd_blkbits + 3))); | |
1004 | ||
1005 | bb = EXT4_MB_BUDDY(e4b); | |
1006 | while (order <= e4b->bd_blkbits + 1) { | |
1007 | block = block >> 1; | |
1008 | if (!mb_test_bit(block, bb)) { | |
1009 | /* this block is part of buddy of order 'order' */ | |
1010 | return order; | |
1011 | } | |
1012 | bb += 1 << (e4b->bd_blkbits - order); | |
1013 | order++; | |
1014 | } | |
1015 | return 0; | |
1016 | } | |
1017 | ||
1018 | static void mb_clear_bits(spinlock_t *lock, void *bm, int cur, int len) | |
1019 | { | |
1020 | __u32 *addr; | |
1021 | ||
1022 | len = cur + len; | |
1023 | while (cur < len) { | |
1024 | if ((cur & 31) == 0 && (len - cur) >= 32) { | |
1025 | /* fast path: clear whole word at once */ | |
1026 | addr = bm + (cur >> 3); | |
1027 | *addr = 0; | |
1028 | cur += 32; | |
1029 | continue; | |
1030 | } | |
1031 | mb_clear_bit_atomic(lock, cur, bm); | |
1032 | cur++; | |
1033 | } | |
1034 | } | |
1035 | ||
1036 | static void mb_set_bits(spinlock_t *lock, void *bm, int cur, int len) | |
1037 | { | |
1038 | __u32 *addr; | |
1039 | ||
1040 | len = cur + len; | |
1041 | while (cur < len) { | |
1042 | if ((cur & 31) == 0 && (len - cur) >= 32) { | |
1043 | /* fast path: set whole word at once */ | |
1044 | addr = bm + (cur >> 3); | |
1045 | *addr = 0xffffffff; | |
1046 | cur += 32; | |
1047 | continue; | |
1048 | } | |
1049 | mb_set_bit_atomic(lock, cur, bm); | |
1050 | cur++; | |
1051 | } | |
1052 | } | |
1053 | ||
1054 | static int mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b, | |
1055 | int first, int count) | |
1056 | { | |
1057 | int block = 0; | |
1058 | int max = 0; | |
1059 | int order; | |
1060 | void *buddy; | |
1061 | void *buddy2; | |
1062 | struct super_block *sb = e4b->bd_sb; | |
1063 | ||
1064 | BUG_ON(first + count > (sb->s_blocksize << 3)); | |
1065 | BUG_ON(!ext4_is_group_locked(sb, e4b->bd_group)); | |
1066 | mb_check_buddy(e4b); | |
1067 | mb_free_blocks_double(inode, e4b, first, count); | |
1068 | ||
1069 | e4b->bd_info->bb_free += count; | |
1070 | if (first < e4b->bd_info->bb_first_free) | |
1071 | e4b->bd_info->bb_first_free = first; | |
1072 | ||
1073 | /* let's maintain fragments counter */ | |
1074 | if (first != 0) | |
1075 | block = !mb_test_bit(first - 1, EXT4_MB_BITMAP(e4b)); | |
1076 | if (first + count < EXT4_SB(sb)->s_mb_maxs[0]) | |
1077 | max = !mb_test_bit(first + count, EXT4_MB_BITMAP(e4b)); | |
1078 | if (block && max) | |
1079 | e4b->bd_info->bb_fragments--; | |
1080 | else if (!block && !max) | |
1081 | e4b->bd_info->bb_fragments++; | |
1082 | ||
1083 | /* let's maintain buddy itself */ | |
1084 | while (count-- > 0) { | |
1085 | block = first++; | |
1086 | order = 0; | |
1087 | ||
1088 | if (!mb_test_bit(block, EXT4_MB_BITMAP(e4b))) { | |
1089 | ext4_fsblk_t blocknr; | |
1090 | blocknr = e4b->bd_group * EXT4_BLOCKS_PER_GROUP(sb); | |
1091 | blocknr += block; | |
1092 | blocknr += | |
1093 | le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block); | |
1094 | ||
46e665e9 | 1095 | ext4_error(sb, __func__, "double-free of inode" |
c9de560d AT |
1096 | " %lu's block %llu(bit %u in group %lu)\n", |
1097 | inode ? inode->i_ino : 0, blocknr, block, | |
1098 | e4b->bd_group); | |
1099 | } | |
1100 | mb_clear_bit(block, EXT4_MB_BITMAP(e4b)); | |
1101 | e4b->bd_info->bb_counters[order]++; | |
1102 | ||
1103 | /* start of the buddy */ | |
1104 | buddy = mb_find_buddy(e4b, order, &max); | |
1105 | ||
1106 | do { | |
1107 | block &= ~1UL; | |
1108 | if (mb_test_bit(block, buddy) || | |
1109 | mb_test_bit(block + 1, buddy)) | |
1110 | break; | |
1111 | ||
1112 | /* both the buddies are free, try to coalesce them */ | |
1113 | buddy2 = mb_find_buddy(e4b, order + 1, &max); | |
1114 | ||
1115 | if (!buddy2) | |
1116 | break; | |
1117 | ||
1118 | if (order > 0) { | |
1119 | /* for special purposes, we don't set | |
1120 | * free bits in bitmap */ | |
1121 | mb_set_bit(block, buddy); | |
1122 | mb_set_bit(block + 1, buddy); | |
1123 | } | |
1124 | e4b->bd_info->bb_counters[order]--; | |
1125 | e4b->bd_info->bb_counters[order]--; | |
1126 | ||
1127 | block = block >> 1; | |
1128 | order++; | |
1129 | e4b->bd_info->bb_counters[order]++; | |
1130 | ||
1131 | mb_clear_bit(block, buddy2); | |
1132 | buddy = buddy2; | |
1133 | } while (1); | |
1134 | } | |
1135 | mb_check_buddy(e4b); | |
1136 | ||
1137 | return 0; | |
1138 | } | |
1139 | ||
1140 | static int mb_find_extent(struct ext4_buddy *e4b, int order, int block, | |
1141 | int needed, struct ext4_free_extent *ex) | |
1142 | { | |
1143 | int next = block; | |
1144 | int max; | |
1145 | int ord; | |
1146 | void *buddy; | |
1147 | ||
1148 | BUG_ON(!ext4_is_group_locked(e4b->bd_sb, e4b->bd_group)); | |
1149 | BUG_ON(ex == NULL); | |
1150 | ||
1151 | buddy = mb_find_buddy(e4b, order, &max); | |
1152 | BUG_ON(buddy == NULL); | |
1153 | BUG_ON(block >= max); | |
1154 | if (mb_test_bit(block, buddy)) { | |
1155 | ex->fe_len = 0; | |
1156 | ex->fe_start = 0; | |
1157 | ex->fe_group = 0; | |
1158 | return 0; | |
1159 | } | |
1160 | ||
1161 | /* FIXME dorp order completely ? */ | |
1162 | if (likely(order == 0)) { | |
1163 | /* find actual order */ | |
1164 | order = mb_find_order_for_block(e4b, block); | |
1165 | block = block >> order; | |
1166 | } | |
1167 | ||
1168 | ex->fe_len = 1 << order; | |
1169 | ex->fe_start = block << order; | |
1170 | ex->fe_group = e4b->bd_group; | |
1171 | ||
1172 | /* calc difference from given start */ | |
1173 | next = next - ex->fe_start; | |
1174 | ex->fe_len -= next; | |
1175 | ex->fe_start += next; | |
1176 | ||
1177 | while (needed > ex->fe_len && | |
1178 | (buddy = mb_find_buddy(e4b, order, &max))) { | |
1179 | ||
1180 | if (block + 1 >= max) | |
1181 | break; | |
1182 | ||
1183 | next = (block + 1) * (1 << order); | |
1184 | if (mb_test_bit(next, EXT4_MB_BITMAP(e4b))) | |
1185 | break; | |
1186 | ||
1187 | ord = mb_find_order_for_block(e4b, next); | |
1188 | ||
1189 | order = ord; | |
1190 | block = next >> order; | |
1191 | ex->fe_len += 1 << order; | |
1192 | } | |
1193 | ||
1194 | BUG_ON(ex->fe_start + ex->fe_len > (1 << (e4b->bd_blkbits + 3))); | |
1195 | return ex->fe_len; | |
1196 | } | |
1197 | ||
1198 | static int mb_mark_used(struct ext4_buddy *e4b, struct ext4_free_extent *ex) | |
1199 | { | |
1200 | int ord; | |
1201 | int mlen = 0; | |
1202 | int max = 0; | |
1203 | int cur; | |
1204 | int start = ex->fe_start; | |
1205 | int len = ex->fe_len; | |
1206 | unsigned ret = 0; | |
1207 | int len0 = len; | |
1208 | void *buddy; | |
1209 | ||
1210 | BUG_ON(start + len > (e4b->bd_sb->s_blocksize << 3)); | |
1211 | BUG_ON(e4b->bd_group != ex->fe_group); | |
1212 | BUG_ON(!ext4_is_group_locked(e4b->bd_sb, e4b->bd_group)); | |
1213 | mb_check_buddy(e4b); | |
1214 | mb_mark_used_double(e4b, start, len); | |
1215 | ||
1216 | e4b->bd_info->bb_free -= len; | |
1217 | if (e4b->bd_info->bb_first_free == start) | |
1218 | e4b->bd_info->bb_first_free += len; | |
1219 | ||
1220 | /* let's maintain fragments counter */ | |
1221 | if (start != 0) | |
1222 | mlen = !mb_test_bit(start - 1, EXT4_MB_BITMAP(e4b)); | |
1223 | if (start + len < EXT4_SB(e4b->bd_sb)->s_mb_maxs[0]) | |
1224 | max = !mb_test_bit(start + len, EXT4_MB_BITMAP(e4b)); | |
1225 | if (mlen && max) | |
1226 | e4b->bd_info->bb_fragments++; | |
1227 | else if (!mlen && !max) | |
1228 | e4b->bd_info->bb_fragments--; | |
1229 | ||
1230 | /* let's maintain buddy itself */ | |
1231 | while (len) { | |
1232 | ord = mb_find_order_for_block(e4b, start); | |
1233 | ||
1234 | if (((start >> ord) << ord) == start && len >= (1 << ord)) { | |
1235 | /* the whole chunk may be allocated at once! */ | |
1236 | mlen = 1 << ord; | |
1237 | buddy = mb_find_buddy(e4b, ord, &max); | |
1238 | BUG_ON((start >> ord) >= max); | |
1239 | mb_set_bit(start >> ord, buddy); | |
1240 | e4b->bd_info->bb_counters[ord]--; | |
1241 | start += mlen; | |
1242 | len -= mlen; | |
1243 | BUG_ON(len < 0); | |
1244 | continue; | |
1245 | } | |
1246 | ||
1247 | /* store for history */ | |
1248 | if (ret == 0) | |
1249 | ret = len | (ord << 16); | |
1250 | ||
1251 | /* we have to split large buddy */ | |
1252 | BUG_ON(ord <= 0); | |
1253 | buddy = mb_find_buddy(e4b, ord, &max); | |
1254 | mb_set_bit(start >> ord, buddy); | |
1255 | e4b->bd_info->bb_counters[ord]--; | |
1256 | ||
1257 | ord--; | |
1258 | cur = (start >> ord) & ~1U; | |
1259 | buddy = mb_find_buddy(e4b, ord, &max); | |
1260 | mb_clear_bit(cur, buddy); | |
1261 | mb_clear_bit(cur + 1, buddy); | |
1262 | e4b->bd_info->bb_counters[ord]++; | |
1263 | e4b->bd_info->bb_counters[ord]++; | |
1264 | } | |
1265 | ||
1266 | mb_set_bits(sb_bgl_lock(EXT4_SB(e4b->bd_sb), ex->fe_group), | |
1267 | EXT4_MB_BITMAP(e4b), ex->fe_start, len0); | |
1268 | mb_check_buddy(e4b); | |
1269 | ||
1270 | return ret; | |
1271 | } | |
1272 | ||
1273 | /* | |
1274 | * Must be called under group lock! | |
1275 | */ | |
1276 | static void ext4_mb_use_best_found(struct ext4_allocation_context *ac, | |
1277 | struct ext4_buddy *e4b) | |
1278 | { | |
1279 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
1280 | int ret; | |
1281 | ||
1282 | BUG_ON(ac->ac_b_ex.fe_group != e4b->bd_group); | |
1283 | BUG_ON(ac->ac_status == AC_STATUS_FOUND); | |
1284 | ||
1285 | ac->ac_b_ex.fe_len = min(ac->ac_b_ex.fe_len, ac->ac_g_ex.fe_len); | |
1286 | ac->ac_b_ex.fe_logical = ac->ac_g_ex.fe_logical; | |
1287 | ret = mb_mark_used(e4b, &ac->ac_b_ex); | |
1288 | ||
1289 | /* preallocation can change ac_b_ex, thus we store actually | |
1290 | * allocated blocks for history */ | |
1291 | ac->ac_f_ex = ac->ac_b_ex; | |
1292 | ||
1293 | ac->ac_status = AC_STATUS_FOUND; | |
1294 | ac->ac_tail = ret & 0xffff; | |
1295 | ac->ac_buddy = ret >> 16; | |
1296 | ||
1297 | /* XXXXXXX: SUCH A HORRIBLE **CK */ | |
1298 | /*FIXME!! Why ? */ | |
1299 | ac->ac_bitmap_page = e4b->bd_bitmap_page; | |
1300 | get_page(ac->ac_bitmap_page); | |
1301 | ac->ac_buddy_page = e4b->bd_buddy_page; | |
1302 | get_page(ac->ac_buddy_page); | |
1303 | ||
1304 | /* store last allocated for subsequent stream allocation */ | |
1305 | if ((ac->ac_flags & EXT4_MB_HINT_DATA)) { | |
1306 | spin_lock(&sbi->s_md_lock); | |
1307 | sbi->s_mb_last_group = ac->ac_f_ex.fe_group; | |
1308 | sbi->s_mb_last_start = ac->ac_f_ex.fe_start; | |
1309 | spin_unlock(&sbi->s_md_lock); | |
1310 | } | |
1311 | } | |
1312 | ||
1313 | /* | |
1314 | * regular allocator, for general purposes allocation | |
1315 | */ | |
1316 | ||
1317 | static void ext4_mb_check_limits(struct ext4_allocation_context *ac, | |
1318 | struct ext4_buddy *e4b, | |
1319 | int finish_group) | |
1320 | { | |
1321 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
1322 | struct ext4_free_extent *bex = &ac->ac_b_ex; | |
1323 | struct ext4_free_extent *gex = &ac->ac_g_ex; | |
1324 | struct ext4_free_extent ex; | |
1325 | int max; | |
1326 | ||
1327 | /* | |
1328 | * We don't want to scan for a whole year | |
1329 | */ | |
1330 | if (ac->ac_found > sbi->s_mb_max_to_scan && | |
1331 | !(ac->ac_flags & EXT4_MB_HINT_FIRST)) { | |
1332 | ac->ac_status = AC_STATUS_BREAK; | |
1333 | return; | |
1334 | } | |
1335 | ||
1336 | /* | |
1337 | * Haven't found good chunk so far, let's continue | |
1338 | */ | |
1339 | if (bex->fe_len < gex->fe_len) | |
1340 | return; | |
1341 | ||
1342 | if ((finish_group || ac->ac_found > sbi->s_mb_min_to_scan) | |
1343 | && bex->fe_group == e4b->bd_group) { | |
1344 | /* recheck chunk's availability - we don't know | |
1345 | * when it was found (within this lock-unlock | |
1346 | * period or not) */ | |
1347 | max = mb_find_extent(e4b, 0, bex->fe_start, gex->fe_len, &ex); | |
1348 | if (max >= gex->fe_len) { | |
1349 | ext4_mb_use_best_found(ac, e4b); | |
1350 | return; | |
1351 | } | |
1352 | } | |
1353 | } | |
1354 | ||
1355 | /* | |
1356 | * The routine checks whether found extent is good enough. If it is, | |
1357 | * then the extent gets marked used and flag is set to the context | |
1358 | * to stop scanning. Otherwise, the extent is compared with the | |
1359 | * previous found extent and if new one is better, then it's stored | |
1360 | * in the context. Later, the best found extent will be used, if | |
1361 | * mballoc can't find good enough extent. | |
1362 | * | |
1363 | * FIXME: real allocation policy is to be designed yet! | |
1364 | */ | |
1365 | static void ext4_mb_measure_extent(struct ext4_allocation_context *ac, | |
1366 | struct ext4_free_extent *ex, | |
1367 | struct ext4_buddy *e4b) | |
1368 | { | |
1369 | struct ext4_free_extent *bex = &ac->ac_b_ex; | |
1370 | struct ext4_free_extent *gex = &ac->ac_g_ex; | |
1371 | ||
1372 | BUG_ON(ex->fe_len <= 0); | |
1373 | BUG_ON(ex->fe_len >= EXT4_BLOCKS_PER_GROUP(ac->ac_sb)); | |
1374 | BUG_ON(ex->fe_start >= EXT4_BLOCKS_PER_GROUP(ac->ac_sb)); | |
1375 | BUG_ON(ac->ac_status != AC_STATUS_CONTINUE); | |
1376 | ||
1377 | ac->ac_found++; | |
1378 | ||
1379 | /* | |
1380 | * The special case - take what you catch first | |
1381 | */ | |
1382 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_FIRST)) { | |
1383 | *bex = *ex; | |
1384 | ext4_mb_use_best_found(ac, e4b); | |
1385 | return; | |
1386 | } | |
1387 | ||
1388 | /* | |
1389 | * Let's check whether the chuck is good enough | |
1390 | */ | |
1391 | if (ex->fe_len == gex->fe_len) { | |
1392 | *bex = *ex; | |
1393 | ext4_mb_use_best_found(ac, e4b); | |
1394 | return; | |
1395 | } | |
1396 | ||
1397 | /* | |
1398 | * If this is first found extent, just store it in the context | |
1399 | */ | |
1400 | if (bex->fe_len == 0) { | |
1401 | *bex = *ex; | |
1402 | return; | |
1403 | } | |
1404 | ||
1405 | /* | |
1406 | * If new found extent is better, store it in the context | |
1407 | */ | |
1408 | if (bex->fe_len < gex->fe_len) { | |
1409 | /* if the request isn't satisfied, any found extent | |
1410 | * larger than previous best one is better */ | |
1411 | if (ex->fe_len > bex->fe_len) | |
1412 | *bex = *ex; | |
1413 | } else if (ex->fe_len > gex->fe_len) { | |
1414 | /* if the request is satisfied, then we try to find | |
1415 | * an extent that still satisfy the request, but is | |
1416 | * smaller than previous one */ | |
1417 | if (ex->fe_len < bex->fe_len) | |
1418 | *bex = *ex; | |
1419 | } | |
1420 | ||
1421 | ext4_mb_check_limits(ac, e4b, 0); | |
1422 | } | |
1423 | ||
1424 | static int ext4_mb_try_best_found(struct ext4_allocation_context *ac, | |
1425 | struct ext4_buddy *e4b) | |
1426 | { | |
1427 | struct ext4_free_extent ex = ac->ac_b_ex; | |
1428 | ext4_group_t group = ex.fe_group; | |
1429 | int max; | |
1430 | int err; | |
1431 | ||
1432 | BUG_ON(ex.fe_len <= 0); | |
1433 | err = ext4_mb_load_buddy(ac->ac_sb, group, e4b); | |
1434 | if (err) | |
1435 | return err; | |
1436 | ||
1437 | ext4_lock_group(ac->ac_sb, group); | |
1438 | max = mb_find_extent(e4b, 0, ex.fe_start, ex.fe_len, &ex); | |
1439 | ||
1440 | if (max > 0) { | |
1441 | ac->ac_b_ex = ex; | |
1442 | ext4_mb_use_best_found(ac, e4b); | |
1443 | } | |
1444 | ||
1445 | ext4_unlock_group(ac->ac_sb, group); | |
1446 | ext4_mb_release_desc(e4b); | |
1447 | ||
1448 | return 0; | |
1449 | } | |
1450 | ||
1451 | static int ext4_mb_find_by_goal(struct ext4_allocation_context *ac, | |
1452 | struct ext4_buddy *e4b) | |
1453 | { | |
1454 | ext4_group_t group = ac->ac_g_ex.fe_group; | |
1455 | int max; | |
1456 | int err; | |
1457 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
1458 | struct ext4_super_block *es = sbi->s_es; | |
1459 | struct ext4_free_extent ex; | |
1460 | ||
1461 | if (!(ac->ac_flags & EXT4_MB_HINT_TRY_GOAL)) | |
1462 | return 0; | |
1463 | ||
1464 | err = ext4_mb_load_buddy(ac->ac_sb, group, e4b); | |
1465 | if (err) | |
1466 | return err; | |
1467 | ||
1468 | ext4_lock_group(ac->ac_sb, group); | |
1469 | max = mb_find_extent(e4b, 0, ac->ac_g_ex.fe_start, | |
1470 | ac->ac_g_ex.fe_len, &ex); | |
1471 | ||
1472 | if (max >= ac->ac_g_ex.fe_len && ac->ac_g_ex.fe_len == sbi->s_stripe) { | |
1473 | ext4_fsblk_t start; | |
1474 | ||
1475 | start = (e4b->bd_group * EXT4_BLOCKS_PER_GROUP(ac->ac_sb)) + | |
1476 | ex.fe_start + le32_to_cpu(es->s_first_data_block); | |
1477 | /* use do_div to get remainder (would be 64-bit modulo) */ | |
1478 | if (do_div(start, sbi->s_stripe) == 0) { | |
1479 | ac->ac_found++; | |
1480 | ac->ac_b_ex = ex; | |
1481 | ext4_mb_use_best_found(ac, e4b); | |
1482 | } | |
1483 | } else if (max >= ac->ac_g_ex.fe_len) { | |
1484 | BUG_ON(ex.fe_len <= 0); | |
1485 | BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group); | |
1486 | BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start); | |
1487 | ac->ac_found++; | |
1488 | ac->ac_b_ex = ex; | |
1489 | ext4_mb_use_best_found(ac, e4b); | |
1490 | } else if (max > 0 && (ac->ac_flags & EXT4_MB_HINT_MERGE)) { | |
1491 | /* Sometimes, caller may want to merge even small | |
1492 | * number of blocks to an existing extent */ | |
1493 | BUG_ON(ex.fe_len <= 0); | |
1494 | BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group); | |
1495 | BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start); | |
1496 | ac->ac_found++; | |
1497 | ac->ac_b_ex = ex; | |
1498 | ext4_mb_use_best_found(ac, e4b); | |
1499 | } | |
1500 | ext4_unlock_group(ac->ac_sb, group); | |
1501 | ext4_mb_release_desc(e4b); | |
1502 | ||
1503 | return 0; | |
1504 | } | |
1505 | ||
1506 | /* | |
1507 | * The routine scans buddy structures (not bitmap!) from given order | |
1508 | * to max order and tries to find big enough chunk to satisfy the req | |
1509 | */ | |
1510 | static void ext4_mb_simple_scan_group(struct ext4_allocation_context *ac, | |
1511 | struct ext4_buddy *e4b) | |
1512 | { | |
1513 | struct super_block *sb = ac->ac_sb; | |
1514 | struct ext4_group_info *grp = e4b->bd_info; | |
1515 | void *buddy; | |
1516 | int i; | |
1517 | int k; | |
1518 | int max; | |
1519 | ||
1520 | BUG_ON(ac->ac_2order <= 0); | |
1521 | for (i = ac->ac_2order; i <= sb->s_blocksize_bits + 1; i++) { | |
1522 | if (grp->bb_counters[i] == 0) | |
1523 | continue; | |
1524 | ||
1525 | buddy = mb_find_buddy(e4b, i, &max); | |
1526 | BUG_ON(buddy == NULL); | |
1527 | ||
ffad0a44 | 1528 | k = mb_find_next_zero_bit(buddy, max, 0); |
c9de560d AT |
1529 | BUG_ON(k >= max); |
1530 | ||
1531 | ac->ac_found++; | |
1532 | ||
1533 | ac->ac_b_ex.fe_len = 1 << i; | |
1534 | ac->ac_b_ex.fe_start = k << i; | |
1535 | ac->ac_b_ex.fe_group = e4b->bd_group; | |
1536 | ||
1537 | ext4_mb_use_best_found(ac, e4b); | |
1538 | ||
1539 | BUG_ON(ac->ac_b_ex.fe_len != ac->ac_g_ex.fe_len); | |
1540 | ||
1541 | if (EXT4_SB(sb)->s_mb_stats) | |
1542 | atomic_inc(&EXT4_SB(sb)->s_bal_2orders); | |
1543 | ||
1544 | break; | |
1545 | } | |
1546 | } | |
1547 | ||
1548 | /* | |
1549 | * The routine scans the group and measures all found extents. | |
1550 | * In order to optimize scanning, caller must pass number of | |
1551 | * free blocks in the group, so the routine can know upper limit. | |
1552 | */ | |
1553 | static void ext4_mb_complex_scan_group(struct ext4_allocation_context *ac, | |
1554 | struct ext4_buddy *e4b) | |
1555 | { | |
1556 | struct super_block *sb = ac->ac_sb; | |
1557 | void *bitmap = EXT4_MB_BITMAP(e4b); | |
1558 | struct ext4_free_extent ex; | |
1559 | int i; | |
1560 | int free; | |
1561 | ||
1562 | free = e4b->bd_info->bb_free; | |
1563 | BUG_ON(free <= 0); | |
1564 | ||
1565 | i = e4b->bd_info->bb_first_free; | |
1566 | ||
1567 | while (free && ac->ac_status == AC_STATUS_CONTINUE) { | |
ffad0a44 | 1568 | i = mb_find_next_zero_bit(bitmap, |
c9de560d AT |
1569 | EXT4_BLOCKS_PER_GROUP(sb), i); |
1570 | if (i >= EXT4_BLOCKS_PER_GROUP(sb)) { | |
26346ff6 | 1571 | /* |
e56eb659 | 1572 | * IF we have corrupt bitmap, we won't find any |
26346ff6 AK |
1573 | * free blocks even though group info says we |
1574 | * we have free blocks | |
1575 | */ | |
46e665e9 | 1576 | ext4_error(sb, __func__, "%d free blocks as per " |
26346ff6 AK |
1577 | "group info. But bitmap says 0\n", |
1578 | free); | |
c9de560d AT |
1579 | break; |
1580 | } | |
1581 | ||
1582 | mb_find_extent(e4b, 0, i, ac->ac_g_ex.fe_len, &ex); | |
1583 | BUG_ON(ex.fe_len <= 0); | |
26346ff6 | 1584 | if (free < ex.fe_len) { |
46e665e9 | 1585 | ext4_error(sb, __func__, "%d free blocks as per " |
26346ff6 AK |
1586 | "group info. But got %d blocks\n", |
1587 | free, ex.fe_len); | |
e56eb659 AK |
1588 | /* |
1589 | * The number of free blocks differs. This mostly | |
1590 | * indicate that the bitmap is corrupt. So exit | |
1591 | * without claiming the space. | |
1592 | */ | |
1593 | break; | |
26346ff6 | 1594 | } |
c9de560d AT |
1595 | |
1596 | ext4_mb_measure_extent(ac, &ex, e4b); | |
1597 | ||
1598 | i += ex.fe_len; | |
1599 | free -= ex.fe_len; | |
1600 | } | |
1601 | ||
1602 | ext4_mb_check_limits(ac, e4b, 1); | |
1603 | } | |
1604 | ||
1605 | /* | |
1606 | * This is a special case for storages like raid5 | |
1607 | * we try to find stripe-aligned chunks for stripe-size requests | |
1608 | * XXX should do so at least for multiples of stripe size as well | |
1609 | */ | |
1610 | static void ext4_mb_scan_aligned(struct ext4_allocation_context *ac, | |
1611 | struct ext4_buddy *e4b) | |
1612 | { | |
1613 | struct super_block *sb = ac->ac_sb; | |
1614 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
1615 | void *bitmap = EXT4_MB_BITMAP(e4b); | |
1616 | struct ext4_free_extent ex; | |
1617 | ext4_fsblk_t first_group_block; | |
1618 | ext4_fsblk_t a; | |
1619 | ext4_grpblk_t i; | |
1620 | int max; | |
1621 | ||
1622 | BUG_ON(sbi->s_stripe == 0); | |
1623 | ||
1624 | /* find first stripe-aligned block in group */ | |
1625 | first_group_block = e4b->bd_group * EXT4_BLOCKS_PER_GROUP(sb) | |
1626 | + le32_to_cpu(sbi->s_es->s_first_data_block); | |
1627 | a = first_group_block + sbi->s_stripe - 1; | |
1628 | do_div(a, sbi->s_stripe); | |
1629 | i = (a * sbi->s_stripe) - first_group_block; | |
1630 | ||
1631 | while (i < EXT4_BLOCKS_PER_GROUP(sb)) { | |
1632 | if (!mb_test_bit(i, bitmap)) { | |
1633 | max = mb_find_extent(e4b, 0, i, sbi->s_stripe, &ex); | |
1634 | if (max >= sbi->s_stripe) { | |
1635 | ac->ac_found++; | |
1636 | ac->ac_b_ex = ex; | |
1637 | ext4_mb_use_best_found(ac, e4b); | |
1638 | break; | |
1639 | } | |
1640 | } | |
1641 | i += sbi->s_stripe; | |
1642 | } | |
1643 | } | |
1644 | ||
1645 | static int ext4_mb_good_group(struct ext4_allocation_context *ac, | |
1646 | ext4_group_t group, int cr) | |
1647 | { | |
1648 | unsigned free, fragments; | |
1649 | unsigned i, bits; | |
1650 | struct ext4_group_desc *desc; | |
1651 | struct ext4_group_info *grp = ext4_get_group_info(ac->ac_sb, group); | |
1652 | ||
1653 | BUG_ON(cr < 0 || cr >= 4); | |
1654 | BUG_ON(EXT4_MB_GRP_NEED_INIT(grp)); | |
1655 | ||
1656 | free = grp->bb_free; | |
1657 | fragments = grp->bb_fragments; | |
1658 | if (free == 0) | |
1659 | return 0; | |
1660 | if (fragments == 0) | |
1661 | return 0; | |
1662 | ||
1663 | switch (cr) { | |
1664 | case 0: | |
1665 | BUG_ON(ac->ac_2order == 0); | |
1666 | /* If this group is uninitialized, skip it initially */ | |
1667 | desc = ext4_get_group_desc(ac->ac_sb, group, NULL); | |
1668 | if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) | |
1669 | return 0; | |
1670 | ||
1671 | bits = ac->ac_sb->s_blocksize_bits + 1; | |
1672 | for (i = ac->ac_2order; i <= bits; i++) | |
1673 | if (grp->bb_counters[i] > 0) | |
1674 | return 1; | |
1675 | break; | |
1676 | case 1: | |
1677 | if ((free / fragments) >= ac->ac_g_ex.fe_len) | |
1678 | return 1; | |
1679 | break; | |
1680 | case 2: | |
1681 | if (free >= ac->ac_g_ex.fe_len) | |
1682 | return 1; | |
1683 | break; | |
1684 | case 3: | |
1685 | return 1; | |
1686 | default: | |
1687 | BUG(); | |
1688 | } | |
1689 | ||
1690 | return 0; | |
1691 | } | |
1692 | ||
4ddfef7b ES |
1693 | static noinline_for_stack int |
1694 | ext4_mb_regular_allocator(struct ext4_allocation_context *ac) | |
c9de560d AT |
1695 | { |
1696 | ext4_group_t group; | |
1697 | ext4_group_t i; | |
1698 | int cr; | |
1699 | int err = 0; | |
1700 | int bsbits; | |
1701 | struct ext4_sb_info *sbi; | |
1702 | struct super_block *sb; | |
1703 | struct ext4_buddy e4b; | |
1704 | loff_t size, isize; | |
1705 | ||
1706 | sb = ac->ac_sb; | |
1707 | sbi = EXT4_SB(sb); | |
1708 | BUG_ON(ac->ac_status == AC_STATUS_FOUND); | |
1709 | ||
1710 | /* first, try the goal */ | |
1711 | err = ext4_mb_find_by_goal(ac, &e4b); | |
1712 | if (err || ac->ac_status == AC_STATUS_FOUND) | |
1713 | goto out; | |
1714 | ||
1715 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) | |
1716 | goto out; | |
1717 | ||
1718 | /* | |
1719 | * ac->ac2_order is set only if the fe_len is a power of 2 | |
1720 | * if ac2_order is set we also set criteria to 0 so that we | |
1721 | * try exact allocation using buddy. | |
1722 | */ | |
1723 | i = fls(ac->ac_g_ex.fe_len); | |
1724 | ac->ac_2order = 0; | |
1725 | /* | |
1726 | * We search using buddy data only if the order of the request | |
1727 | * is greater than equal to the sbi_s_mb_order2_reqs | |
1728 | * You can tune it via /proc/fs/ext4/<partition>/order2_req | |
1729 | */ | |
1730 | if (i >= sbi->s_mb_order2_reqs) { | |
1731 | /* | |
1732 | * This should tell if fe_len is exactly power of 2 | |
1733 | */ | |
1734 | if ((ac->ac_g_ex.fe_len & (~(1 << (i - 1)))) == 0) | |
1735 | ac->ac_2order = i - 1; | |
1736 | } | |
1737 | ||
1738 | bsbits = ac->ac_sb->s_blocksize_bits; | |
1739 | /* if stream allocation is enabled, use global goal */ | |
1740 | size = ac->ac_o_ex.fe_logical + ac->ac_o_ex.fe_len; | |
1741 | isize = i_size_read(ac->ac_inode) >> bsbits; | |
1742 | if (size < isize) | |
1743 | size = isize; | |
1744 | ||
1745 | if (size < sbi->s_mb_stream_request && | |
1746 | (ac->ac_flags & EXT4_MB_HINT_DATA)) { | |
1747 | /* TBD: may be hot point */ | |
1748 | spin_lock(&sbi->s_md_lock); | |
1749 | ac->ac_g_ex.fe_group = sbi->s_mb_last_group; | |
1750 | ac->ac_g_ex.fe_start = sbi->s_mb_last_start; | |
1751 | spin_unlock(&sbi->s_md_lock); | |
1752 | } | |
c9de560d AT |
1753 | /* Let's just scan groups to find more-less suitable blocks */ |
1754 | cr = ac->ac_2order ? 0 : 1; | |
1755 | /* | |
1756 | * cr == 0 try to get exact allocation, | |
1757 | * cr == 3 try to get anything | |
1758 | */ | |
1759 | repeat: | |
1760 | for (; cr < 4 && ac->ac_status == AC_STATUS_CONTINUE; cr++) { | |
1761 | ac->ac_criteria = cr; | |
ed8f9c75 AK |
1762 | /* |
1763 | * searching for the right group start | |
1764 | * from the goal value specified | |
1765 | */ | |
1766 | group = ac->ac_g_ex.fe_group; | |
1767 | ||
c9de560d AT |
1768 | for (i = 0; i < EXT4_SB(sb)->s_groups_count; group++, i++) { |
1769 | struct ext4_group_info *grp; | |
1770 | struct ext4_group_desc *desc; | |
1771 | ||
1772 | if (group == EXT4_SB(sb)->s_groups_count) | |
1773 | group = 0; | |
1774 | ||
1775 | /* quick check to skip empty groups */ | |
1776 | grp = ext4_get_group_info(ac->ac_sb, group); | |
1777 | if (grp->bb_free == 0) | |
1778 | continue; | |
1779 | ||
1780 | /* | |
1781 | * if the group is already init we check whether it is | |
1782 | * a good group and if not we don't load the buddy | |
1783 | */ | |
1784 | if (EXT4_MB_GRP_NEED_INIT(grp)) { | |
1785 | /* | |
1786 | * we need full data about the group | |
1787 | * to make a good selection | |
1788 | */ | |
1789 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
1790 | if (err) | |
1791 | goto out; | |
1792 | ext4_mb_release_desc(&e4b); | |
1793 | } | |
1794 | ||
1795 | /* | |
1796 | * If the particular group doesn't satisfy our | |
1797 | * criteria we continue with the next group | |
1798 | */ | |
1799 | if (!ext4_mb_good_group(ac, group, cr)) | |
1800 | continue; | |
1801 | ||
1802 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
1803 | if (err) | |
1804 | goto out; | |
1805 | ||
1806 | ext4_lock_group(sb, group); | |
1807 | if (!ext4_mb_good_group(ac, group, cr)) { | |
1808 | /* someone did allocation from this group */ | |
1809 | ext4_unlock_group(sb, group); | |
1810 | ext4_mb_release_desc(&e4b); | |
1811 | continue; | |
1812 | } | |
1813 | ||
1814 | ac->ac_groups_scanned++; | |
1815 | desc = ext4_get_group_desc(sb, group, NULL); | |
1816 | if (cr == 0 || (desc->bg_flags & | |
1817 | cpu_to_le16(EXT4_BG_BLOCK_UNINIT) && | |
1818 | ac->ac_2order != 0)) | |
1819 | ext4_mb_simple_scan_group(ac, &e4b); | |
1820 | else if (cr == 1 && | |
1821 | ac->ac_g_ex.fe_len == sbi->s_stripe) | |
1822 | ext4_mb_scan_aligned(ac, &e4b); | |
1823 | else | |
1824 | ext4_mb_complex_scan_group(ac, &e4b); | |
1825 | ||
1826 | ext4_unlock_group(sb, group); | |
1827 | ext4_mb_release_desc(&e4b); | |
1828 | ||
1829 | if (ac->ac_status != AC_STATUS_CONTINUE) | |
1830 | break; | |
1831 | } | |
1832 | } | |
1833 | ||
1834 | if (ac->ac_b_ex.fe_len > 0 && ac->ac_status != AC_STATUS_FOUND && | |
1835 | !(ac->ac_flags & EXT4_MB_HINT_FIRST)) { | |
1836 | /* | |
1837 | * We've been searching too long. Let's try to allocate | |
1838 | * the best chunk we've found so far | |
1839 | */ | |
1840 | ||
1841 | ext4_mb_try_best_found(ac, &e4b); | |
1842 | if (ac->ac_status != AC_STATUS_FOUND) { | |
1843 | /* | |
1844 | * Someone more lucky has already allocated it. | |
1845 | * The only thing we can do is just take first | |
1846 | * found block(s) | |
1847 | printk(KERN_DEBUG "EXT4-fs: someone won our chunk\n"); | |
1848 | */ | |
1849 | ac->ac_b_ex.fe_group = 0; | |
1850 | ac->ac_b_ex.fe_start = 0; | |
1851 | ac->ac_b_ex.fe_len = 0; | |
1852 | ac->ac_status = AC_STATUS_CONTINUE; | |
1853 | ac->ac_flags |= EXT4_MB_HINT_FIRST; | |
1854 | cr = 3; | |
1855 | atomic_inc(&sbi->s_mb_lost_chunks); | |
1856 | goto repeat; | |
1857 | } | |
1858 | } | |
1859 | out: | |
1860 | return err; | |
1861 | } | |
1862 | ||
1863 | #ifdef EXT4_MB_HISTORY | |
1864 | struct ext4_mb_proc_session { | |
1865 | struct ext4_mb_history *history; | |
1866 | struct super_block *sb; | |
1867 | int start; | |
1868 | int max; | |
1869 | }; | |
1870 | ||
1871 | static void *ext4_mb_history_skip_empty(struct ext4_mb_proc_session *s, | |
1872 | struct ext4_mb_history *hs, | |
1873 | int first) | |
1874 | { | |
1875 | if (hs == s->history + s->max) | |
1876 | hs = s->history; | |
1877 | if (!first && hs == s->history + s->start) | |
1878 | return NULL; | |
1879 | while (hs->orig.fe_len == 0) { | |
1880 | hs++; | |
1881 | if (hs == s->history + s->max) | |
1882 | hs = s->history; | |
1883 | if (hs == s->history + s->start) | |
1884 | return NULL; | |
1885 | } | |
1886 | return hs; | |
1887 | } | |
1888 | ||
1889 | static void *ext4_mb_seq_history_start(struct seq_file *seq, loff_t *pos) | |
1890 | { | |
1891 | struct ext4_mb_proc_session *s = seq->private; | |
1892 | struct ext4_mb_history *hs; | |
1893 | int l = *pos; | |
1894 | ||
1895 | if (l == 0) | |
1896 | return SEQ_START_TOKEN; | |
1897 | hs = ext4_mb_history_skip_empty(s, s->history + s->start, 1); | |
1898 | if (!hs) | |
1899 | return NULL; | |
1900 | while (--l && (hs = ext4_mb_history_skip_empty(s, ++hs, 0)) != NULL); | |
1901 | return hs; | |
1902 | } | |
1903 | ||
1904 | static void *ext4_mb_seq_history_next(struct seq_file *seq, void *v, | |
1905 | loff_t *pos) | |
1906 | { | |
1907 | struct ext4_mb_proc_session *s = seq->private; | |
1908 | struct ext4_mb_history *hs = v; | |
1909 | ||
1910 | ++*pos; | |
1911 | if (v == SEQ_START_TOKEN) | |
1912 | return ext4_mb_history_skip_empty(s, s->history + s->start, 1); | |
1913 | else | |
1914 | return ext4_mb_history_skip_empty(s, ++hs, 0); | |
1915 | } | |
1916 | ||
1917 | static int ext4_mb_seq_history_show(struct seq_file *seq, void *v) | |
1918 | { | |
1919 | char buf[25], buf2[25], buf3[25], *fmt; | |
1920 | struct ext4_mb_history *hs = v; | |
1921 | ||
1922 | if (v == SEQ_START_TOKEN) { | |
1923 | seq_printf(seq, "%-5s %-8s %-23s %-23s %-23s %-5s " | |
1924 | "%-5s %-2s %-5s %-5s %-5s %-6s\n", | |
1925 | "pid", "inode", "original", "goal", "result", "found", | |
1926 | "grps", "cr", "flags", "merge", "tail", "broken"); | |
1927 | return 0; | |
1928 | } | |
1929 | ||
1930 | if (hs->op == EXT4_MB_HISTORY_ALLOC) { | |
1931 | fmt = "%-5u %-8u %-23s %-23s %-23s %-5u %-5u %-2u " | |
1932 | "%-5u %-5s %-5u %-6u\n"; | |
1933 | sprintf(buf2, "%lu/%d/%u@%u", hs->result.fe_group, | |
1934 | hs->result.fe_start, hs->result.fe_len, | |
1935 | hs->result.fe_logical); | |
1936 | sprintf(buf, "%lu/%d/%u@%u", hs->orig.fe_group, | |
1937 | hs->orig.fe_start, hs->orig.fe_len, | |
1938 | hs->orig.fe_logical); | |
1939 | sprintf(buf3, "%lu/%d/%u@%u", hs->goal.fe_group, | |
1940 | hs->goal.fe_start, hs->goal.fe_len, | |
1941 | hs->goal.fe_logical); | |
1942 | seq_printf(seq, fmt, hs->pid, hs->ino, buf, buf3, buf2, | |
1943 | hs->found, hs->groups, hs->cr, hs->flags, | |
1944 | hs->merged ? "M" : "", hs->tail, | |
1945 | hs->buddy ? 1 << hs->buddy : 0); | |
1946 | } else if (hs->op == EXT4_MB_HISTORY_PREALLOC) { | |
1947 | fmt = "%-5u %-8u %-23s %-23s %-23s\n"; | |
1948 | sprintf(buf2, "%lu/%d/%u@%u", hs->result.fe_group, | |
1949 | hs->result.fe_start, hs->result.fe_len, | |
1950 | hs->result.fe_logical); | |
1951 | sprintf(buf, "%lu/%d/%u@%u", hs->orig.fe_group, | |
1952 | hs->orig.fe_start, hs->orig.fe_len, | |
1953 | hs->orig.fe_logical); | |
1954 | seq_printf(seq, fmt, hs->pid, hs->ino, buf, "", buf2); | |
1955 | } else if (hs->op == EXT4_MB_HISTORY_DISCARD) { | |
1956 | sprintf(buf2, "%lu/%d/%u", hs->result.fe_group, | |
1957 | hs->result.fe_start, hs->result.fe_len); | |
1958 | seq_printf(seq, "%-5u %-8u %-23s discard\n", | |
1959 | hs->pid, hs->ino, buf2); | |
1960 | } else if (hs->op == EXT4_MB_HISTORY_FREE) { | |
1961 | sprintf(buf2, "%lu/%d/%u", hs->result.fe_group, | |
1962 | hs->result.fe_start, hs->result.fe_len); | |
1963 | seq_printf(seq, "%-5u %-8u %-23s free\n", | |
1964 | hs->pid, hs->ino, buf2); | |
1965 | } | |
1966 | return 0; | |
1967 | } | |
1968 | ||
1969 | static void ext4_mb_seq_history_stop(struct seq_file *seq, void *v) | |
1970 | { | |
1971 | } | |
1972 | ||
1973 | static struct seq_operations ext4_mb_seq_history_ops = { | |
1974 | .start = ext4_mb_seq_history_start, | |
1975 | .next = ext4_mb_seq_history_next, | |
1976 | .stop = ext4_mb_seq_history_stop, | |
1977 | .show = ext4_mb_seq_history_show, | |
1978 | }; | |
1979 | ||
1980 | static int ext4_mb_seq_history_open(struct inode *inode, struct file *file) | |
1981 | { | |
1982 | struct super_block *sb = PDE(inode)->data; | |
1983 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
1984 | struct ext4_mb_proc_session *s; | |
1985 | int rc; | |
1986 | int size; | |
1987 | ||
1988 | s = kmalloc(sizeof(*s), GFP_KERNEL); | |
1989 | if (s == NULL) | |
1990 | return -ENOMEM; | |
1991 | s->sb = sb; | |
1992 | size = sizeof(struct ext4_mb_history) * sbi->s_mb_history_max; | |
1993 | s->history = kmalloc(size, GFP_KERNEL); | |
1994 | if (s->history == NULL) { | |
1995 | kfree(s); | |
1996 | return -ENOMEM; | |
1997 | } | |
1998 | ||
1999 | spin_lock(&sbi->s_mb_history_lock); | |
2000 | memcpy(s->history, sbi->s_mb_history, size); | |
2001 | s->max = sbi->s_mb_history_max; | |
2002 | s->start = sbi->s_mb_history_cur % s->max; | |
2003 | spin_unlock(&sbi->s_mb_history_lock); | |
2004 | ||
2005 | rc = seq_open(file, &ext4_mb_seq_history_ops); | |
2006 | if (rc == 0) { | |
2007 | struct seq_file *m = (struct seq_file *)file->private_data; | |
2008 | m->private = s; | |
2009 | } else { | |
2010 | kfree(s->history); | |
2011 | kfree(s); | |
2012 | } | |
2013 | return rc; | |
2014 | ||
2015 | } | |
2016 | ||
2017 | static int ext4_mb_seq_history_release(struct inode *inode, struct file *file) | |
2018 | { | |
2019 | struct seq_file *seq = (struct seq_file *)file->private_data; | |
2020 | struct ext4_mb_proc_session *s = seq->private; | |
2021 | kfree(s->history); | |
2022 | kfree(s); | |
2023 | return seq_release(inode, file); | |
2024 | } | |
2025 | ||
2026 | static ssize_t ext4_mb_seq_history_write(struct file *file, | |
2027 | const char __user *buffer, | |
2028 | size_t count, loff_t *ppos) | |
2029 | { | |
2030 | struct seq_file *seq = (struct seq_file *)file->private_data; | |
2031 | struct ext4_mb_proc_session *s = seq->private; | |
2032 | struct super_block *sb = s->sb; | |
2033 | char str[32]; | |
2034 | int value; | |
2035 | ||
2036 | if (count >= sizeof(str)) { | |
2037 | printk(KERN_ERR "EXT4-fs: %s string too long, max %u bytes\n", | |
2038 | "mb_history", (int)sizeof(str)); | |
2039 | return -EOVERFLOW; | |
2040 | } | |
2041 | ||
2042 | if (copy_from_user(str, buffer, count)) | |
2043 | return -EFAULT; | |
2044 | ||
2045 | value = simple_strtol(str, NULL, 0); | |
2046 | if (value < 0) | |
2047 | return -ERANGE; | |
2048 | EXT4_SB(sb)->s_mb_history_filter = value; | |
2049 | ||
2050 | return count; | |
2051 | } | |
2052 | ||
2053 | static struct file_operations ext4_mb_seq_history_fops = { | |
2054 | .owner = THIS_MODULE, | |
2055 | .open = ext4_mb_seq_history_open, | |
2056 | .read = seq_read, | |
2057 | .write = ext4_mb_seq_history_write, | |
2058 | .llseek = seq_lseek, | |
2059 | .release = ext4_mb_seq_history_release, | |
2060 | }; | |
2061 | ||
2062 | static void *ext4_mb_seq_groups_start(struct seq_file *seq, loff_t *pos) | |
2063 | { | |
2064 | struct super_block *sb = seq->private; | |
2065 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2066 | ext4_group_t group; | |
2067 | ||
2068 | if (*pos < 0 || *pos >= sbi->s_groups_count) | |
2069 | return NULL; | |
2070 | ||
2071 | group = *pos + 1; | |
2072 | return (void *) group; | |
2073 | } | |
2074 | ||
2075 | static void *ext4_mb_seq_groups_next(struct seq_file *seq, void *v, loff_t *pos) | |
2076 | { | |
2077 | struct super_block *sb = seq->private; | |
2078 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2079 | ext4_group_t group; | |
2080 | ||
2081 | ++*pos; | |
2082 | if (*pos < 0 || *pos >= sbi->s_groups_count) | |
2083 | return NULL; | |
2084 | group = *pos + 1; | |
2085 | return (void *) group;; | |
2086 | } | |
2087 | ||
2088 | static int ext4_mb_seq_groups_show(struct seq_file *seq, void *v) | |
2089 | { | |
2090 | struct super_block *sb = seq->private; | |
2091 | long group = (long) v; | |
2092 | int i; | |
2093 | int err; | |
2094 | struct ext4_buddy e4b; | |
2095 | struct sg { | |
2096 | struct ext4_group_info info; | |
2097 | unsigned short counters[16]; | |
2098 | } sg; | |
2099 | ||
2100 | group--; | |
2101 | if (group == 0) | |
2102 | seq_printf(seq, "#%-5s: %-5s %-5s %-5s " | |
2103 | "[ %-5s %-5s %-5s %-5s %-5s %-5s %-5s " | |
2104 | "%-5s %-5s %-5s %-5s %-5s %-5s %-5s ]\n", | |
2105 | "group", "free", "frags", "first", | |
2106 | "2^0", "2^1", "2^2", "2^3", "2^4", "2^5", "2^6", | |
2107 | "2^7", "2^8", "2^9", "2^10", "2^11", "2^12", "2^13"); | |
2108 | ||
2109 | i = (sb->s_blocksize_bits + 2) * sizeof(sg.info.bb_counters[0]) + | |
2110 | sizeof(struct ext4_group_info); | |
2111 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
2112 | if (err) { | |
2113 | seq_printf(seq, "#%-5lu: I/O error\n", group); | |
2114 | return 0; | |
2115 | } | |
2116 | ext4_lock_group(sb, group); | |
2117 | memcpy(&sg, ext4_get_group_info(sb, group), i); | |
2118 | ext4_unlock_group(sb, group); | |
2119 | ext4_mb_release_desc(&e4b); | |
2120 | ||
2121 | seq_printf(seq, "#%-5lu: %-5u %-5u %-5u [", group, sg.info.bb_free, | |
2122 | sg.info.bb_fragments, sg.info.bb_first_free); | |
2123 | for (i = 0; i <= 13; i++) | |
2124 | seq_printf(seq, " %-5u", i <= sb->s_blocksize_bits + 1 ? | |
2125 | sg.info.bb_counters[i] : 0); | |
2126 | seq_printf(seq, " ]\n"); | |
2127 | ||
2128 | return 0; | |
2129 | } | |
2130 | ||
2131 | static void ext4_mb_seq_groups_stop(struct seq_file *seq, void *v) | |
2132 | { | |
2133 | } | |
2134 | ||
2135 | static struct seq_operations ext4_mb_seq_groups_ops = { | |
2136 | .start = ext4_mb_seq_groups_start, | |
2137 | .next = ext4_mb_seq_groups_next, | |
2138 | .stop = ext4_mb_seq_groups_stop, | |
2139 | .show = ext4_mb_seq_groups_show, | |
2140 | }; | |
2141 | ||
2142 | static int ext4_mb_seq_groups_open(struct inode *inode, struct file *file) | |
2143 | { | |
2144 | struct super_block *sb = PDE(inode)->data; | |
2145 | int rc; | |
2146 | ||
2147 | rc = seq_open(file, &ext4_mb_seq_groups_ops); | |
2148 | if (rc == 0) { | |
2149 | struct seq_file *m = (struct seq_file *)file->private_data; | |
2150 | m->private = sb; | |
2151 | } | |
2152 | return rc; | |
2153 | ||
2154 | } | |
2155 | ||
2156 | static struct file_operations ext4_mb_seq_groups_fops = { | |
2157 | .owner = THIS_MODULE, | |
2158 | .open = ext4_mb_seq_groups_open, | |
2159 | .read = seq_read, | |
2160 | .llseek = seq_lseek, | |
2161 | .release = seq_release, | |
2162 | }; | |
2163 | ||
2164 | static void ext4_mb_history_release(struct super_block *sb) | |
2165 | { | |
2166 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2167 | ||
2168 | remove_proc_entry("mb_groups", sbi->s_mb_proc); | |
2169 | remove_proc_entry("mb_history", sbi->s_mb_proc); | |
2170 | ||
2171 | kfree(sbi->s_mb_history); | |
2172 | } | |
2173 | ||
2174 | static void ext4_mb_history_init(struct super_block *sb) | |
2175 | { | |
2176 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2177 | int i; | |
2178 | ||
2179 | if (sbi->s_mb_proc != NULL) { | |
46fe74f2 DL |
2180 | proc_create_data("mb_history", S_IRUGO, sbi->s_mb_proc, |
2181 | &ext4_mb_seq_history_fops, sb); | |
2182 | proc_create_data("mb_groups", S_IRUGO, sbi->s_mb_proc, | |
2183 | &ext4_mb_seq_groups_fops, sb); | |
c9de560d AT |
2184 | } |
2185 | ||
2186 | sbi->s_mb_history_max = 1000; | |
2187 | sbi->s_mb_history_cur = 0; | |
2188 | spin_lock_init(&sbi->s_mb_history_lock); | |
2189 | i = sbi->s_mb_history_max * sizeof(struct ext4_mb_history); | |
2190 | sbi->s_mb_history = kmalloc(i, GFP_KERNEL); | |
2191 | if (likely(sbi->s_mb_history != NULL)) | |
2192 | memset(sbi->s_mb_history, 0, i); | |
2193 | /* if we can't allocate history, then we simple won't use it */ | |
2194 | } | |
2195 | ||
4ddfef7b ES |
2196 | static noinline_for_stack void |
2197 | ext4_mb_store_history(struct ext4_allocation_context *ac) | |
c9de560d AT |
2198 | { |
2199 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
2200 | struct ext4_mb_history h; | |
2201 | ||
2202 | if (unlikely(sbi->s_mb_history == NULL)) | |
2203 | return; | |
2204 | ||
2205 | if (!(ac->ac_op & sbi->s_mb_history_filter)) | |
2206 | return; | |
2207 | ||
2208 | h.op = ac->ac_op; | |
2209 | h.pid = current->pid; | |
2210 | h.ino = ac->ac_inode ? ac->ac_inode->i_ino : 0; | |
2211 | h.orig = ac->ac_o_ex; | |
2212 | h.result = ac->ac_b_ex; | |
2213 | h.flags = ac->ac_flags; | |
2214 | h.found = ac->ac_found; | |
2215 | h.groups = ac->ac_groups_scanned; | |
2216 | h.cr = ac->ac_criteria; | |
2217 | h.tail = ac->ac_tail; | |
2218 | h.buddy = ac->ac_buddy; | |
2219 | h.merged = 0; | |
2220 | if (ac->ac_op == EXT4_MB_HISTORY_ALLOC) { | |
2221 | if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start && | |
2222 | ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group) | |
2223 | h.merged = 1; | |
2224 | h.goal = ac->ac_g_ex; | |
2225 | h.result = ac->ac_f_ex; | |
2226 | } | |
2227 | ||
2228 | spin_lock(&sbi->s_mb_history_lock); | |
2229 | memcpy(sbi->s_mb_history + sbi->s_mb_history_cur, &h, sizeof(h)); | |
2230 | if (++sbi->s_mb_history_cur >= sbi->s_mb_history_max) | |
2231 | sbi->s_mb_history_cur = 0; | |
2232 | spin_unlock(&sbi->s_mb_history_lock); | |
2233 | } | |
2234 | ||
2235 | #else | |
2236 | #define ext4_mb_history_release(sb) | |
2237 | #define ext4_mb_history_init(sb) | |
2238 | #endif | |
2239 | ||
2240 | static int ext4_mb_init_backend(struct super_block *sb) | |
2241 | { | |
2242 | ext4_group_t i; | |
2243 | int j, len, metalen; | |
2244 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2245 | int num_meta_group_infos = | |
2246 | (sbi->s_groups_count + EXT4_DESC_PER_BLOCK(sb) - 1) >> | |
2247 | EXT4_DESC_PER_BLOCK_BITS(sb); | |
2248 | struct ext4_group_info **meta_group_info; | |
2249 | ||
2250 | /* An 8TB filesystem with 64-bit pointers requires a 4096 byte | |
2251 | * kmalloc. A 128kb malloc should suffice for a 256TB filesystem. | |
2252 | * So a two level scheme suffices for now. */ | |
2253 | sbi->s_group_info = kmalloc(sizeof(*sbi->s_group_info) * | |
2254 | num_meta_group_infos, GFP_KERNEL); | |
2255 | if (sbi->s_group_info == NULL) { | |
2256 | printk(KERN_ERR "EXT4-fs: can't allocate buddy meta group\n"); | |
2257 | return -ENOMEM; | |
2258 | } | |
2259 | sbi->s_buddy_cache = new_inode(sb); | |
2260 | if (sbi->s_buddy_cache == NULL) { | |
2261 | printk(KERN_ERR "EXT4-fs: can't get new inode\n"); | |
2262 | goto err_freesgi; | |
2263 | } | |
2264 | EXT4_I(sbi->s_buddy_cache)->i_disksize = 0; | |
2265 | ||
2266 | metalen = sizeof(*meta_group_info) << EXT4_DESC_PER_BLOCK_BITS(sb); | |
2267 | for (i = 0; i < num_meta_group_infos; i++) { | |
2268 | if ((i + 1) == num_meta_group_infos) | |
2269 | metalen = sizeof(*meta_group_info) * | |
2270 | (sbi->s_groups_count - | |
2271 | (i << EXT4_DESC_PER_BLOCK_BITS(sb))); | |
2272 | meta_group_info = kmalloc(metalen, GFP_KERNEL); | |
2273 | if (meta_group_info == NULL) { | |
2274 | printk(KERN_ERR "EXT4-fs: can't allocate mem for a " | |
2275 | "buddy group\n"); | |
2276 | goto err_freemeta; | |
2277 | } | |
2278 | sbi->s_group_info[i] = meta_group_info; | |
2279 | } | |
2280 | ||
2281 | /* | |
2282 | * calculate needed size. if change bb_counters size, | |
2283 | * don't forget about ext4_mb_generate_buddy() | |
2284 | */ | |
2285 | len = sizeof(struct ext4_group_info); | |
2286 | len += sizeof(unsigned short) * (sb->s_blocksize_bits + 2); | |
2287 | for (i = 0; i < sbi->s_groups_count; i++) { | |
2288 | struct ext4_group_desc *desc; | |
2289 | ||
2290 | meta_group_info = | |
2291 | sbi->s_group_info[i >> EXT4_DESC_PER_BLOCK_BITS(sb)]; | |
2292 | j = i & (EXT4_DESC_PER_BLOCK(sb) - 1); | |
2293 | ||
2294 | meta_group_info[j] = kzalloc(len, GFP_KERNEL); | |
2295 | if (meta_group_info[j] == NULL) { | |
2296 | printk(KERN_ERR "EXT4-fs: can't allocate buddy mem\n"); | |
c9de560d AT |
2297 | goto err_freebuddy; |
2298 | } | |
2299 | desc = ext4_get_group_desc(sb, i, NULL); | |
2300 | if (desc == NULL) { | |
2301 | printk(KERN_ERR | |
2302 | "EXT4-fs: can't read descriptor %lu\n", i); | |
f1fa3342 | 2303 | i++; |
c9de560d AT |
2304 | goto err_freebuddy; |
2305 | } | |
2306 | memset(meta_group_info[j], 0, len); | |
2307 | set_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, | |
2308 | &(meta_group_info[j]->bb_state)); | |
2309 | ||
2310 | /* | |
2311 | * initialize bb_free to be able to skip | |
2312 | * empty groups without initialization | |
2313 | */ | |
2314 | if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { | |
2315 | meta_group_info[j]->bb_free = | |
2316 | ext4_free_blocks_after_init(sb, i, desc); | |
2317 | } else { | |
2318 | meta_group_info[j]->bb_free = | |
2319 | le16_to_cpu(desc->bg_free_blocks_count); | |
2320 | } | |
2321 | ||
2322 | INIT_LIST_HEAD(&meta_group_info[j]->bb_prealloc_list); | |
2323 | ||
2324 | #ifdef DOUBLE_CHECK | |
2325 | { | |
2326 | struct buffer_head *bh; | |
2327 | meta_group_info[j]->bb_bitmap = | |
2328 | kmalloc(sb->s_blocksize, GFP_KERNEL); | |
2329 | BUG_ON(meta_group_info[j]->bb_bitmap == NULL); | |
2330 | bh = read_block_bitmap(sb, i); | |
2331 | BUG_ON(bh == NULL); | |
2332 | memcpy(meta_group_info[j]->bb_bitmap, bh->b_data, | |
2333 | sb->s_blocksize); | |
2334 | put_bh(bh); | |
2335 | } | |
2336 | #endif | |
2337 | ||
2338 | } | |
2339 | ||
2340 | return 0; | |
2341 | ||
2342 | err_freebuddy: | |
f1fa3342 | 2343 | while (i-- > 0) |
c9de560d | 2344 | kfree(ext4_get_group_info(sb, i)); |
c9de560d AT |
2345 | i = num_meta_group_infos; |
2346 | err_freemeta: | |
f1fa3342 | 2347 | while (i-- > 0) |
c9de560d AT |
2348 | kfree(sbi->s_group_info[i]); |
2349 | iput(sbi->s_buddy_cache); | |
2350 | err_freesgi: | |
2351 | kfree(sbi->s_group_info); | |
2352 | return -ENOMEM; | |
2353 | } | |
2354 | ||
2355 | int ext4_mb_init(struct super_block *sb, int needs_recovery) | |
2356 | { | |
2357 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2358 | unsigned i; | |
2359 | unsigned offset; | |
2360 | unsigned max; | |
2361 | ||
2362 | if (!test_opt(sb, MBALLOC)) | |
2363 | return 0; | |
2364 | ||
2365 | i = (sb->s_blocksize_bits + 2) * sizeof(unsigned short); | |
2366 | ||
2367 | sbi->s_mb_offsets = kmalloc(i, GFP_KERNEL); | |
2368 | if (sbi->s_mb_offsets == NULL) { | |
2369 | clear_opt(sbi->s_mount_opt, MBALLOC); | |
2370 | return -ENOMEM; | |
2371 | } | |
2372 | sbi->s_mb_maxs = kmalloc(i, GFP_KERNEL); | |
2373 | if (sbi->s_mb_maxs == NULL) { | |
2374 | clear_opt(sbi->s_mount_opt, MBALLOC); | |
2375 | kfree(sbi->s_mb_maxs); | |
2376 | return -ENOMEM; | |
2377 | } | |
2378 | ||
2379 | /* order 0 is regular bitmap */ | |
2380 | sbi->s_mb_maxs[0] = sb->s_blocksize << 3; | |
2381 | sbi->s_mb_offsets[0] = 0; | |
2382 | ||
2383 | i = 1; | |
2384 | offset = 0; | |
2385 | max = sb->s_blocksize << 2; | |
2386 | do { | |
2387 | sbi->s_mb_offsets[i] = offset; | |
2388 | sbi->s_mb_maxs[i] = max; | |
2389 | offset += 1 << (sb->s_blocksize_bits - i); | |
2390 | max = max >> 1; | |
2391 | i++; | |
2392 | } while (i <= sb->s_blocksize_bits + 1); | |
2393 | ||
2394 | /* init file for buddy data */ | |
2395 | i = ext4_mb_init_backend(sb); | |
2396 | if (i) { | |
2397 | clear_opt(sbi->s_mount_opt, MBALLOC); | |
2398 | kfree(sbi->s_mb_offsets); | |
2399 | kfree(sbi->s_mb_maxs); | |
2400 | return i; | |
2401 | } | |
2402 | ||
2403 | spin_lock_init(&sbi->s_md_lock); | |
2404 | INIT_LIST_HEAD(&sbi->s_active_transaction); | |
2405 | INIT_LIST_HEAD(&sbi->s_closed_transaction); | |
2406 | INIT_LIST_HEAD(&sbi->s_committed_transaction); | |
2407 | spin_lock_init(&sbi->s_bal_lock); | |
2408 | ||
2409 | sbi->s_mb_max_to_scan = MB_DEFAULT_MAX_TO_SCAN; | |
2410 | sbi->s_mb_min_to_scan = MB_DEFAULT_MIN_TO_SCAN; | |
2411 | sbi->s_mb_stats = MB_DEFAULT_STATS; | |
2412 | sbi->s_mb_stream_request = MB_DEFAULT_STREAM_THRESHOLD; | |
2413 | sbi->s_mb_order2_reqs = MB_DEFAULT_ORDER2_REQS; | |
2414 | sbi->s_mb_history_filter = EXT4_MB_HISTORY_DEFAULT; | |
2415 | sbi->s_mb_group_prealloc = MB_DEFAULT_GROUP_PREALLOC; | |
2416 | ||
2417 | i = sizeof(struct ext4_locality_group) * NR_CPUS; | |
2418 | sbi->s_locality_groups = kmalloc(i, GFP_KERNEL); | |
2419 | if (sbi->s_locality_groups == NULL) { | |
2420 | clear_opt(sbi->s_mount_opt, MBALLOC); | |
2421 | kfree(sbi->s_mb_offsets); | |
2422 | kfree(sbi->s_mb_maxs); | |
2423 | return -ENOMEM; | |
2424 | } | |
2425 | for (i = 0; i < NR_CPUS; i++) { | |
2426 | struct ext4_locality_group *lg; | |
2427 | lg = &sbi->s_locality_groups[i]; | |
2428 | mutex_init(&lg->lg_mutex); | |
2429 | INIT_LIST_HEAD(&lg->lg_prealloc_list); | |
2430 | spin_lock_init(&lg->lg_prealloc_lock); | |
2431 | } | |
2432 | ||
2433 | ext4_mb_init_per_dev_proc(sb); | |
2434 | ext4_mb_history_init(sb); | |
2435 | ||
2436 | printk("EXT4-fs: mballoc enabled\n"); | |
2437 | return 0; | |
2438 | } | |
2439 | ||
2440 | /* need to called with ext4 group lock (ext4_lock_group) */ | |
2441 | static void ext4_mb_cleanup_pa(struct ext4_group_info *grp) | |
2442 | { | |
2443 | struct ext4_prealloc_space *pa; | |
2444 | struct list_head *cur, *tmp; | |
2445 | int count = 0; | |
2446 | ||
2447 | list_for_each_safe(cur, tmp, &grp->bb_prealloc_list) { | |
2448 | pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); | |
2449 | list_del(&pa->pa_group_list); | |
2450 | count++; | |
2451 | kfree(pa); | |
2452 | } | |
2453 | if (count) | |
2454 | mb_debug("mballoc: %u PAs left\n", count); | |
2455 | ||
2456 | } | |
2457 | ||
2458 | int ext4_mb_release(struct super_block *sb) | |
2459 | { | |
2460 | ext4_group_t i; | |
2461 | int num_meta_group_infos; | |
2462 | struct ext4_group_info *grinfo; | |
2463 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2464 | ||
2465 | if (!test_opt(sb, MBALLOC)) | |
2466 | return 0; | |
2467 | ||
2468 | /* release freed, non-committed blocks */ | |
2469 | spin_lock(&sbi->s_md_lock); | |
2470 | list_splice_init(&sbi->s_closed_transaction, | |
2471 | &sbi->s_committed_transaction); | |
2472 | list_splice_init(&sbi->s_active_transaction, | |
2473 | &sbi->s_committed_transaction); | |
2474 | spin_unlock(&sbi->s_md_lock); | |
2475 | ext4_mb_free_committed_blocks(sb); | |
2476 | ||
2477 | if (sbi->s_group_info) { | |
2478 | for (i = 0; i < sbi->s_groups_count; i++) { | |
2479 | grinfo = ext4_get_group_info(sb, i); | |
2480 | #ifdef DOUBLE_CHECK | |
2481 | kfree(grinfo->bb_bitmap); | |
2482 | #endif | |
2483 | ext4_lock_group(sb, i); | |
2484 | ext4_mb_cleanup_pa(grinfo); | |
2485 | ext4_unlock_group(sb, i); | |
2486 | kfree(grinfo); | |
2487 | } | |
2488 | num_meta_group_infos = (sbi->s_groups_count + | |
2489 | EXT4_DESC_PER_BLOCK(sb) - 1) >> | |
2490 | EXT4_DESC_PER_BLOCK_BITS(sb); | |
2491 | for (i = 0; i < num_meta_group_infos; i++) | |
2492 | kfree(sbi->s_group_info[i]); | |
2493 | kfree(sbi->s_group_info); | |
2494 | } | |
2495 | kfree(sbi->s_mb_offsets); | |
2496 | kfree(sbi->s_mb_maxs); | |
2497 | if (sbi->s_buddy_cache) | |
2498 | iput(sbi->s_buddy_cache); | |
2499 | if (sbi->s_mb_stats) { | |
2500 | printk(KERN_INFO | |
2501 | "EXT4-fs: mballoc: %u blocks %u reqs (%u success)\n", | |
2502 | atomic_read(&sbi->s_bal_allocated), | |
2503 | atomic_read(&sbi->s_bal_reqs), | |
2504 | atomic_read(&sbi->s_bal_success)); | |
2505 | printk(KERN_INFO | |
2506 | "EXT4-fs: mballoc: %u extents scanned, %u goal hits, " | |
2507 | "%u 2^N hits, %u breaks, %u lost\n", | |
2508 | atomic_read(&sbi->s_bal_ex_scanned), | |
2509 | atomic_read(&sbi->s_bal_goals), | |
2510 | atomic_read(&sbi->s_bal_2orders), | |
2511 | atomic_read(&sbi->s_bal_breaks), | |
2512 | atomic_read(&sbi->s_mb_lost_chunks)); | |
2513 | printk(KERN_INFO | |
2514 | "EXT4-fs: mballoc: %lu generated and it took %Lu\n", | |
2515 | sbi->s_mb_buddies_generated++, | |
2516 | sbi->s_mb_generation_time); | |
2517 | printk(KERN_INFO | |
2518 | "EXT4-fs: mballoc: %u preallocated, %u discarded\n", | |
2519 | atomic_read(&sbi->s_mb_preallocated), | |
2520 | atomic_read(&sbi->s_mb_discarded)); | |
2521 | } | |
2522 | ||
2523 | kfree(sbi->s_locality_groups); | |
2524 | ||
2525 | ext4_mb_history_release(sb); | |
2526 | ext4_mb_destroy_per_dev_proc(sb); | |
2527 | ||
2528 | return 0; | |
2529 | } | |
2530 | ||
4ddfef7b ES |
2531 | static noinline_for_stack void |
2532 | ext4_mb_free_committed_blocks(struct super_block *sb) | |
c9de560d AT |
2533 | { |
2534 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2535 | int err; | |
2536 | int i; | |
2537 | int count = 0; | |
2538 | int count2 = 0; | |
2539 | struct ext4_free_metadata *md; | |
2540 | struct ext4_buddy e4b; | |
2541 | ||
2542 | if (list_empty(&sbi->s_committed_transaction)) | |
2543 | return; | |
2544 | ||
2545 | /* there is committed blocks to be freed yet */ | |
2546 | do { | |
2547 | /* get next array of blocks */ | |
2548 | md = NULL; | |
2549 | spin_lock(&sbi->s_md_lock); | |
2550 | if (!list_empty(&sbi->s_committed_transaction)) { | |
2551 | md = list_entry(sbi->s_committed_transaction.next, | |
2552 | struct ext4_free_metadata, list); | |
2553 | list_del(&md->list); | |
2554 | } | |
2555 | spin_unlock(&sbi->s_md_lock); | |
2556 | ||
2557 | if (md == NULL) | |
2558 | break; | |
2559 | ||
2560 | mb_debug("gonna free %u blocks in group %lu (0x%p):", | |
2561 | md->num, md->group, md); | |
2562 | ||
2563 | err = ext4_mb_load_buddy(sb, md->group, &e4b); | |
2564 | /* we expect to find existing buddy because it's pinned */ | |
2565 | BUG_ON(err != 0); | |
2566 | ||
2567 | /* there are blocks to put in buddy to make them really free */ | |
2568 | count += md->num; | |
2569 | count2++; | |
2570 | ext4_lock_group(sb, md->group); | |
2571 | for (i = 0; i < md->num; i++) { | |
2572 | mb_debug(" %u", md->blocks[i]); | |
2573 | err = mb_free_blocks(NULL, &e4b, md->blocks[i], 1); | |
2574 | BUG_ON(err != 0); | |
2575 | } | |
2576 | mb_debug("\n"); | |
2577 | ext4_unlock_group(sb, md->group); | |
2578 | ||
2579 | /* balance refcounts from ext4_mb_free_metadata() */ | |
2580 | page_cache_release(e4b.bd_buddy_page); | |
2581 | page_cache_release(e4b.bd_bitmap_page); | |
2582 | ||
2583 | kfree(md); | |
2584 | ext4_mb_release_desc(&e4b); | |
2585 | ||
2586 | } while (md); | |
2587 | ||
2588 | mb_debug("freed %u blocks in %u structures\n", count, count2); | |
2589 | } | |
2590 | ||
c9de560d AT |
2591 | #define EXT4_MB_STATS_NAME "stats" |
2592 | #define EXT4_MB_MAX_TO_SCAN_NAME "max_to_scan" | |
2593 | #define EXT4_MB_MIN_TO_SCAN_NAME "min_to_scan" | |
2594 | #define EXT4_MB_ORDER2_REQ "order2_req" | |
2595 | #define EXT4_MB_STREAM_REQ "stream_req" | |
2596 | #define EXT4_MB_GROUP_PREALLOC "group_prealloc" | |
2597 | ||
2598 | ||
2599 | ||
91d99827 AD |
2600 | #define MB_PROC_FOPS(name) \ |
2601 | static int ext4_mb_##name##_proc_show(struct seq_file *m, void *v) \ | |
c9de560d | 2602 | { \ |
91d99827 AD |
2603 | struct ext4_sb_info *sbi = m->private; \ |
2604 | \ | |
2605 | seq_printf(m, "%ld\n", sbi->s_mb_##name); \ | |
2606 | return 0; \ | |
2607 | } \ | |
2608 | \ | |
2609 | static int ext4_mb_##name##_proc_open(struct inode *inode, struct file *file)\ | |
2610 | { \ | |
2611 | return single_open(file, ext4_mb_##name##_proc_show, PDE(inode)->data);\ | |
2612 | } \ | |
2613 | \ | |
2614 | static ssize_t ext4_mb_##name##_proc_write(struct file *file, \ | |
2615 | const char __user *buf, size_t cnt, loff_t *ppos) \ | |
c9de560d | 2616 | { \ |
91d99827 | 2617 | struct ext4_sb_info *sbi = PDE(file->f_path.dentry->d_inode)->data;\ |
c9de560d AT |
2618 | char str[32]; \ |
2619 | long value; \ | |
2620 | if (cnt >= sizeof(str)) \ | |
2621 | return -EINVAL; \ | |
2622 | if (copy_from_user(str, buf, cnt)) \ | |
2623 | return -EFAULT; \ | |
2624 | value = simple_strtol(str, NULL, 0); \ | |
2625 | if (value <= 0) \ | |
2626 | return -ERANGE; \ | |
2627 | sbi->s_mb_##name = value; \ | |
2628 | return cnt; \ | |
91d99827 AD |
2629 | } \ |
2630 | \ | |
2631 | static const struct file_operations ext4_mb_##name##_proc_fops = { \ | |
2632 | .owner = THIS_MODULE, \ | |
2633 | .open = ext4_mb_##name##_proc_open, \ | |
2634 | .read = seq_read, \ | |
2635 | .llseek = seq_lseek, \ | |
2636 | .release = single_release, \ | |
2637 | .write = ext4_mb_##name##_proc_write, \ | |
2638 | }; | |
c9de560d | 2639 | |
91d99827 AD |
2640 | MB_PROC_FOPS(stats); |
2641 | MB_PROC_FOPS(max_to_scan); | |
2642 | MB_PROC_FOPS(min_to_scan); | |
2643 | MB_PROC_FOPS(order2_reqs); | |
2644 | MB_PROC_FOPS(stream_request); | |
2645 | MB_PROC_FOPS(group_prealloc); | |
c9de560d AT |
2646 | |
2647 | #define MB_PROC_HANDLER(name, var) \ | |
2648 | do { \ | |
91d99827 AD |
2649 | proc = proc_create_data(name, mode, sbi->s_mb_proc, \ |
2650 | &ext4_mb_##var##_proc_fops, sbi); \ | |
c9de560d AT |
2651 | if (proc == NULL) { \ |
2652 | printk(KERN_ERR "EXT4-fs: can't to create %s\n", name); \ | |
2653 | goto err_out; \ | |
2654 | } \ | |
c9de560d AT |
2655 | } while (0) |
2656 | ||
2657 | static int ext4_mb_init_per_dev_proc(struct super_block *sb) | |
2658 | { | |
2659 | mode_t mode = S_IFREG | S_IRUGO | S_IWUSR; | |
2660 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2661 | struct proc_dir_entry *proc; | |
2662 | char devname[64]; | |
2663 | ||
f36f21ec | 2664 | bdevname(sb->s_bdev, devname); |
c9de560d AT |
2665 | sbi->s_mb_proc = proc_mkdir(devname, proc_root_ext4); |
2666 | ||
2667 | MB_PROC_HANDLER(EXT4_MB_STATS_NAME, stats); | |
2668 | MB_PROC_HANDLER(EXT4_MB_MAX_TO_SCAN_NAME, max_to_scan); | |
2669 | MB_PROC_HANDLER(EXT4_MB_MIN_TO_SCAN_NAME, min_to_scan); | |
2670 | MB_PROC_HANDLER(EXT4_MB_ORDER2_REQ, order2_reqs); | |
2671 | MB_PROC_HANDLER(EXT4_MB_STREAM_REQ, stream_request); | |
2672 | MB_PROC_HANDLER(EXT4_MB_GROUP_PREALLOC, group_prealloc); | |
2673 | ||
2674 | return 0; | |
2675 | ||
2676 | err_out: | |
2677 | printk(KERN_ERR "EXT4-fs: Unable to create %s\n", devname); | |
2678 | remove_proc_entry(EXT4_MB_GROUP_PREALLOC, sbi->s_mb_proc); | |
2679 | remove_proc_entry(EXT4_MB_STREAM_REQ, sbi->s_mb_proc); | |
2680 | remove_proc_entry(EXT4_MB_ORDER2_REQ, sbi->s_mb_proc); | |
2681 | remove_proc_entry(EXT4_MB_MIN_TO_SCAN_NAME, sbi->s_mb_proc); | |
2682 | remove_proc_entry(EXT4_MB_MAX_TO_SCAN_NAME, sbi->s_mb_proc); | |
2683 | remove_proc_entry(EXT4_MB_STATS_NAME, sbi->s_mb_proc); | |
2684 | remove_proc_entry(devname, proc_root_ext4); | |
2685 | sbi->s_mb_proc = NULL; | |
2686 | ||
2687 | return -ENOMEM; | |
2688 | } | |
2689 | ||
2690 | static int ext4_mb_destroy_per_dev_proc(struct super_block *sb) | |
2691 | { | |
2692 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2693 | char devname[64]; | |
2694 | ||
2695 | if (sbi->s_mb_proc == NULL) | |
2696 | return -EINVAL; | |
2697 | ||
f36f21ec | 2698 | bdevname(sb->s_bdev, devname); |
c9de560d AT |
2699 | remove_proc_entry(EXT4_MB_GROUP_PREALLOC, sbi->s_mb_proc); |
2700 | remove_proc_entry(EXT4_MB_STREAM_REQ, sbi->s_mb_proc); | |
2701 | remove_proc_entry(EXT4_MB_ORDER2_REQ, sbi->s_mb_proc); | |
2702 | remove_proc_entry(EXT4_MB_MIN_TO_SCAN_NAME, sbi->s_mb_proc); | |
2703 | remove_proc_entry(EXT4_MB_MAX_TO_SCAN_NAME, sbi->s_mb_proc); | |
2704 | remove_proc_entry(EXT4_MB_STATS_NAME, sbi->s_mb_proc); | |
2705 | remove_proc_entry(devname, proc_root_ext4); | |
2706 | ||
2707 | return 0; | |
2708 | } | |
2709 | ||
2710 | int __init init_ext4_mballoc(void) | |
2711 | { | |
2712 | ext4_pspace_cachep = | |
2713 | kmem_cache_create("ext4_prealloc_space", | |
2714 | sizeof(struct ext4_prealloc_space), | |
2715 | 0, SLAB_RECLAIM_ACCOUNT, NULL); | |
2716 | if (ext4_pspace_cachep == NULL) | |
2717 | return -ENOMEM; | |
2718 | ||
256bdb49 ES |
2719 | ext4_ac_cachep = |
2720 | kmem_cache_create("ext4_alloc_context", | |
2721 | sizeof(struct ext4_allocation_context), | |
2722 | 0, SLAB_RECLAIM_ACCOUNT, NULL); | |
2723 | if (ext4_ac_cachep == NULL) { | |
2724 | kmem_cache_destroy(ext4_pspace_cachep); | |
2725 | return -ENOMEM; | |
2726 | } | |
c9de560d | 2727 | #ifdef CONFIG_PROC_FS |
36a5aeb8 | 2728 | proc_root_ext4 = proc_mkdir("fs/ext4", NULL); |
c9de560d | 2729 | if (proc_root_ext4 == NULL) |
36a5aeb8 | 2730 | printk(KERN_ERR "EXT4-fs: Unable to create fs/ext4\n"); |
c9de560d | 2731 | #endif |
c9de560d AT |
2732 | return 0; |
2733 | } | |
2734 | ||
2735 | void exit_ext4_mballoc(void) | |
2736 | { | |
2737 | /* XXX: synchronize_rcu(); */ | |
2738 | kmem_cache_destroy(ext4_pspace_cachep); | |
256bdb49 | 2739 | kmem_cache_destroy(ext4_ac_cachep); |
c9de560d | 2740 | #ifdef CONFIG_PROC_FS |
36a5aeb8 | 2741 | remove_proc_entry("fs/ext4", NULL); |
c9de560d AT |
2742 | #endif |
2743 | } | |
2744 | ||
2745 | ||
2746 | /* | |
2747 | * Check quota and mark choosed space (ac->ac_b_ex) non-free in bitmaps | |
2748 | * Returns 0 if success or error code | |
2749 | */ | |
4ddfef7b ES |
2750 | static noinline_for_stack int |
2751 | ext4_mb_mark_diskspace_used(struct ext4_allocation_context *ac, | |
c9de560d AT |
2752 | handle_t *handle) |
2753 | { | |
2754 | struct buffer_head *bitmap_bh = NULL; | |
2755 | struct ext4_super_block *es; | |
2756 | struct ext4_group_desc *gdp; | |
2757 | struct buffer_head *gdp_bh; | |
2758 | struct ext4_sb_info *sbi; | |
2759 | struct super_block *sb; | |
2760 | ext4_fsblk_t block; | |
519deca0 | 2761 | int err, len; |
c9de560d AT |
2762 | |
2763 | BUG_ON(ac->ac_status != AC_STATUS_FOUND); | |
2764 | BUG_ON(ac->ac_b_ex.fe_len <= 0); | |
2765 | ||
2766 | sb = ac->ac_sb; | |
2767 | sbi = EXT4_SB(sb); | |
2768 | es = sbi->s_es; | |
2769 | ||
c9de560d AT |
2770 | |
2771 | err = -EIO; | |
2772 | bitmap_bh = read_block_bitmap(sb, ac->ac_b_ex.fe_group); | |
2773 | if (!bitmap_bh) | |
2774 | goto out_err; | |
2775 | ||
2776 | err = ext4_journal_get_write_access(handle, bitmap_bh); | |
2777 | if (err) | |
2778 | goto out_err; | |
2779 | ||
2780 | err = -EIO; | |
2781 | gdp = ext4_get_group_desc(sb, ac->ac_b_ex.fe_group, &gdp_bh); | |
2782 | if (!gdp) | |
2783 | goto out_err; | |
2784 | ||
03cddb80 AK |
2785 | ext4_debug("using block group %lu(%d)\n", ac->ac_b_ex.fe_group, |
2786 | gdp->bg_free_blocks_count); | |
2787 | ||
c9de560d AT |
2788 | err = ext4_journal_get_write_access(handle, gdp_bh); |
2789 | if (err) | |
2790 | goto out_err; | |
2791 | ||
2792 | block = ac->ac_b_ex.fe_group * EXT4_BLOCKS_PER_GROUP(sb) | |
2793 | + ac->ac_b_ex.fe_start | |
2794 | + le32_to_cpu(es->s_first_data_block); | |
2795 | ||
519deca0 AK |
2796 | len = ac->ac_b_ex.fe_len; |
2797 | if (in_range(ext4_block_bitmap(sb, gdp), block, len) || | |
2798 | in_range(ext4_inode_bitmap(sb, gdp), block, len) || | |
2799 | in_range(block, ext4_inode_table(sb, gdp), | |
2800 | EXT4_SB(sb)->s_itb_per_group) || | |
2801 | in_range(block + len - 1, ext4_inode_table(sb, gdp), | |
2802 | EXT4_SB(sb)->s_itb_per_group)) { | |
46e665e9 | 2803 | ext4_error(sb, __func__, |
c9de560d AT |
2804 | "Allocating block in system zone - block = %llu", |
2805 | block); | |
519deca0 AK |
2806 | /* File system mounted not to panic on error |
2807 | * Fix the bitmap and repeat the block allocation | |
2808 | * We leak some of the blocks here. | |
2809 | */ | |
2810 | mb_set_bits(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group), | |
2811 | bitmap_bh->b_data, ac->ac_b_ex.fe_start, | |
2812 | ac->ac_b_ex.fe_len); | |
2813 | err = ext4_journal_dirty_metadata(handle, bitmap_bh); | |
2814 | if (!err) | |
2815 | err = -EAGAIN; | |
2816 | goto out_err; | |
c9de560d AT |
2817 | } |
2818 | #ifdef AGGRESSIVE_CHECK | |
2819 | { | |
2820 | int i; | |
2821 | for (i = 0; i < ac->ac_b_ex.fe_len; i++) { | |
2822 | BUG_ON(mb_test_bit(ac->ac_b_ex.fe_start + i, | |
2823 | bitmap_bh->b_data)); | |
2824 | } | |
2825 | } | |
2826 | #endif | |
2827 | mb_set_bits(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group), bitmap_bh->b_data, | |
2828 | ac->ac_b_ex.fe_start, ac->ac_b_ex.fe_len); | |
2829 | ||
2830 | spin_lock(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group)); | |
2831 | if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { | |
2832 | gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT); | |
2833 | gdp->bg_free_blocks_count = | |
2834 | cpu_to_le16(ext4_free_blocks_after_init(sb, | |
2835 | ac->ac_b_ex.fe_group, | |
2836 | gdp)); | |
2837 | } | |
e8546d06 | 2838 | le16_add_cpu(&gdp->bg_free_blocks_count, -ac->ac_b_ex.fe_len); |
c9de560d AT |
2839 | gdp->bg_checksum = ext4_group_desc_csum(sbi, ac->ac_b_ex.fe_group, gdp); |
2840 | spin_unlock(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group)); | |
2841 | percpu_counter_sub(&sbi->s_freeblocks_counter, ac->ac_b_ex.fe_len); | |
2842 | ||
2843 | err = ext4_journal_dirty_metadata(handle, bitmap_bh); | |
2844 | if (err) | |
2845 | goto out_err; | |
2846 | err = ext4_journal_dirty_metadata(handle, gdp_bh); | |
2847 | ||
2848 | out_err: | |
2849 | sb->s_dirt = 1; | |
42a10add | 2850 | brelse(bitmap_bh); |
c9de560d AT |
2851 | return err; |
2852 | } | |
2853 | ||
2854 | /* | |
2855 | * here we normalize request for locality group | |
2856 | * Group request are normalized to s_strip size if we set the same via mount | |
2857 | * option. If not we set it to s_mb_group_prealloc which can be configured via | |
2858 | * /proc/fs/ext4/<partition>/group_prealloc | |
2859 | * | |
2860 | * XXX: should we try to preallocate more than the group has now? | |
2861 | */ | |
2862 | static void ext4_mb_normalize_group_request(struct ext4_allocation_context *ac) | |
2863 | { | |
2864 | struct super_block *sb = ac->ac_sb; | |
2865 | struct ext4_locality_group *lg = ac->ac_lg; | |
2866 | ||
2867 | BUG_ON(lg == NULL); | |
2868 | if (EXT4_SB(sb)->s_stripe) | |
2869 | ac->ac_g_ex.fe_len = EXT4_SB(sb)->s_stripe; | |
2870 | else | |
2871 | ac->ac_g_ex.fe_len = EXT4_SB(sb)->s_mb_group_prealloc; | |
60bd63d1 | 2872 | mb_debug("#%u: goal %u blocks for locality group\n", |
c9de560d AT |
2873 | current->pid, ac->ac_g_ex.fe_len); |
2874 | } | |
2875 | ||
2876 | /* | |
2877 | * Normalization means making request better in terms of | |
2878 | * size and alignment | |
2879 | */ | |
4ddfef7b ES |
2880 | static noinline_for_stack void |
2881 | ext4_mb_normalize_request(struct ext4_allocation_context *ac, | |
c9de560d AT |
2882 | struct ext4_allocation_request *ar) |
2883 | { | |
2884 | int bsbits, max; | |
2885 | ext4_lblk_t end; | |
c9de560d AT |
2886 | loff_t size, orig_size, start_off; |
2887 | ext4_lblk_t start, orig_start; | |
2888 | struct ext4_inode_info *ei = EXT4_I(ac->ac_inode); | |
9a0762c5 | 2889 | struct ext4_prealloc_space *pa; |
c9de560d AT |
2890 | |
2891 | /* do normalize only data requests, metadata requests | |
2892 | do not need preallocation */ | |
2893 | if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) | |
2894 | return; | |
2895 | ||
2896 | /* sometime caller may want exact blocks */ | |
2897 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) | |
2898 | return; | |
2899 | ||
2900 | /* caller may indicate that preallocation isn't | |
2901 | * required (it's a tail, for example) */ | |
2902 | if (ac->ac_flags & EXT4_MB_HINT_NOPREALLOC) | |
2903 | return; | |
2904 | ||
2905 | if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) { | |
2906 | ext4_mb_normalize_group_request(ac); | |
2907 | return ; | |
2908 | } | |
2909 | ||
2910 | bsbits = ac->ac_sb->s_blocksize_bits; | |
2911 | ||
2912 | /* first, let's learn actual file size | |
2913 | * given current request is allocated */ | |
2914 | size = ac->ac_o_ex.fe_logical + ac->ac_o_ex.fe_len; | |
2915 | size = size << bsbits; | |
2916 | if (size < i_size_read(ac->ac_inode)) | |
2917 | size = i_size_read(ac->ac_inode); | |
2918 | ||
1930479c VC |
2919 | /* max size of free chunks */ |
2920 | max = 2 << bsbits; | |
c9de560d | 2921 | |
1930479c VC |
2922 | #define NRL_CHECK_SIZE(req, size, max, chunk_size) \ |
2923 | (req <= (size) || max <= (chunk_size)) | |
c9de560d AT |
2924 | |
2925 | /* first, try to predict filesize */ | |
2926 | /* XXX: should this table be tunable? */ | |
2927 | start_off = 0; | |
2928 | if (size <= 16 * 1024) { | |
2929 | size = 16 * 1024; | |
2930 | } else if (size <= 32 * 1024) { | |
2931 | size = 32 * 1024; | |
2932 | } else if (size <= 64 * 1024) { | |
2933 | size = 64 * 1024; | |
2934 | } else if (size <= 128 * 1024) { | |
2935 | size = 128 * 1024; | |
2936 | } else if (size <= 256 * 1024) { | |
2937 | size = 256 * 1024; | |
2938 | } else if (size <= 512 * 1024) { | |
2939 | size = 512 * 1024; | |
2940 | } else if (size <= 1024 * 1024) { | |
2941 | size = 1024 * 1024; | |
1930479c | 2942 | } else if (NRL_CHECK_SIZE(size, 4 * 1024 * 1024, max, 2 * 1024)) { |
c9de560d | 2943 | start_off = ((loff_t)ac->ac_o_ex.fe_logical >> |
1930479c VC |
2944 | (21 - bsbits)) << 21; |
2945 | size = 2 * 1024 * 1024; | |
2946 | } else if (NRL_CHECK_SIZE(size, 8 * 1024 * 1024, max, 4 * 1024)) { | |
c9de560d AT |
2947 | start_off = ((loff_t)ac->ac_o_ex.fe_logical >> |
2948 | (22 - bsbits)) << 22; | |
2949 | size = 4 * 1024 * 1024; | |
2950 | } else if (NRL_CHECK_SIZE(ac->ac_o_ex.fe_len, | |
1930479c | 2951 | (8<<20)>>bsbits, max, 8 * 1024)) { |
c9de560d AT |
2952 | start_off = ((loff_t)ac->ac_o_ex.fe_logical >> |
2953 | (23 - bsbits)) << 23; | |
2954 | size = 8 * 1024 * 1024; | |
2955 | } else { | |
2956 | start_off = (loff_t)ac->ac_o_ex.fe_logical << bsbits; | |
2957 | size = ac->ac_o_ex.fe_len << bsbits; | |
2958 | } | |
2959 | orig_size = size = size >> bsbits; | |
2960 | orig_start = start = start_off >> bsbits; | |
2961 | ||
2962 | /* don't cover already allocated blocks in selected range */ | |
2963 | if (ar->pleft && start <= ar->lleft) { | |
2964 | size -= ar->lleft + 1 - start; | |
2965 | start = ar->lleft + 1; | |
2966 | } | |
2967 | if (ar->pright && start + size - 1 >= ar->lright) | |
2968 | size -= start + size - ar->lright; | |
2969 | ||
2970 | end = start + size; | |
2971 | ||
2972 | /* check we don't cross already preallocated blocks */ | |
2973 | rcu_read_lock(); | |
9a0762c5 | 2974 | list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { |
c9de560d AT |
2975 | unsigned long pa_end; |
2976 | ||
c9de560d AT |
2977 | if (pa->pa_deleted) |
2978 | continue; | |
2979 | spin_lock(&pa->pa_lock); | |
2980 | if (pa->pa_deleted) { | |
2981 | spin_unlock(&pa->pa_lock); | |
2982 | continue; | |
2983 | } | |
2984 | ||
2985 | pa_end = pa->pa_lstart + pa->pa_len; | |
2986 | ||
2987 | /* PA must not overlap original request */ | |
2988 | BUG_ON(!(ac->ac_o_ex.fe_logical >= pa_end || | |
2989 | ac->ac_o_ex.fe_logical < pa->pa_lstart)); | |
2990 | ||
2991 | /* skip PA normalized request doesn't overlap with */ | |
2992 | if (pa->pa_lstart >= end) { | |
2993 | spin_unlock(&pa->pa_lock); | |
2994 | continue; | |
2995 | } | |
2996 | if (pa_end <= start) { | |
2997 | spin_unlock(&pa->pa_lock); | |
2998 | continue; | |
2999 | } | |
3000 | BUG_ON(pa->pa_lstart <= start && pa_end >= end); | |
3001 | ||
3002 | if (pa_end <= ac->ac_o_ex.fe_logical) { | |
3003 | BUG_ON(pa_end < start); | |
3004 | start = pa_end; | |
3005 | } | |
3006 | ||
3007 | if (pa->pa_lstart > ac->ac_o_ex.fe_logical) { | |
3008 | BUG_ON(pa->pa_lstart > end); | |
3009 | end = pa->pa_lstart; | |
3010 | } | |
3011 | spin_unlock(&pa->pa_lock); | |
3012 | } | |
3013 | rcu_read_unlock(); | |
3014 | size = end - start; | |
3015 | ||
3016 | /* XXX: extra loop to check we really don't overlap preallocations */ | |
3017 | rcu_read_lock(); | |
9a0762c5 | 3018 | list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { |
c9de560d | 3019 | unsigned long pa_end; |
c9de560d AT |
3020 | spin_lock(&pa->pa_lock); |
3021 | if (pa->pa_deleted == 0) { | |
3022 | pa_end = pa->pa_lstart + pa->pa_len; | |
3023 | BUG_ON(!(start >= pa_end || end <= pa->pa_lstart)); | |
3024 | } | |
3025 | spin_unlock(&pa->pa_lock); | |
3026 | } | |
3027 | rcu_read_unlock(); | |
3028 | ||
3029 | if (start + size <= ac->ac_o_ex.fe_logical && | |
3030 | start > ac->ac_o_ex.fe_logical) { | |
3031 | printk(KERN_ERR "start %lu, size %lu, fe_logical %lu\n", | |
3032 | (unsigned long) start, (unsigned long) size, | |
3033 | (unsigned long) ac->ac_o_ex.fe_logical); | |
3034 | } | |
3035 | BUG_ON(start + size <= ac->ac_o_ex.fe_logical && | |
3036 | start > ac->ac_o_ex.fe_logical); | |
3037 | BUG_ON(size <= 0 || size >= EXT4_BLOCKS_PER_GROUP(ac->ac_sb)); | |
3038 | ||
3039 | /* now prepare goal request */ | |
3040 | ||
3041 | /* XXX: is it better to align blocks WRT to logical | |
3042 | * placement or satisfy big request as is */ | |
3043 | ac->ac_g_ex.fe_logical = start; | |
3044 | ac->ac_g_ex.fe_len = size; | |
3045 | ||
3046 | /* define goal start in order to merge */ | |
3047 | if (ar->pright && (ar->lright == (start + size))) { | |
3048 | /* merge to the right */ | |
3049 | ext4_get_group_no_and_offset(ac->ac_sb, ar->pright - size, | |
3050 | &ac->ac_f_ex.fe_group, | |
3051 | &ac->ac_f_ex.fe_start); | |
3052 | ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL; | |
3053 | } | |
3054 | if (ar->pleft && (ar->lleft + 1 == start)) { | |
3055 | /* merge to the left */ | |
3056 | ext4_get_group_no_and_offset(ac->ac_sb, ar->pleft + 1, | |
3057 | &ac->ac_f_ex.fe_group, | |
3058 | &ac->ac_f_ex.fe_start); | |
3059 | ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL; | |
3060 | } | |
3061 | ||
3062 | mb_debug("goal: %u(was %u) blocks at %u\n", (unsigned) size, | |
3063 | (unsigned) orig_size, (unsigned) start); | |
3064 | } | |
3065 | ||
3066 | static void ext4_mb_collect_stats(struct ext4_allocation_context *ac) | |
3067 | { | |
3068 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
3069 | ||
3070 | if (sbi->s_mb_stats && ac->ac_g_ex.fe_len > 1) { | |
3071 | atomic_inc(&sbi->s_bal_reqs); | |
3072 | atomic_add(ac->ac_b_ex.fe_len, &sbi->s_bal_allocated); | |
3073 | if (ac->ac_o_ex.fe_len >= ac->ac_g_ex.fe_len) | |
3074 | atomic_inc(&sbi->s_bal_success); | |
3075 | atomic_add(ac->ac_found, &sbi->s_bal_ex_scanned); | |
3076 | if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start && | |
3077 | ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group) | |
3078 | atomic_inc(&sbi->s_bal_goals); | |
3079 | if (ac->ac_found > sbi->s_mb_max_to_scan) | |
3080 | atomic_inc(&sbi->s_bal_breaks); | |
3081 | } | |
3082 | ||
3083 | ext4_mb_store_history(ac); | |
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 | ext4_fsblk_t start; | |
3093 | ext4_fsblk_t end; | |
3094 | int len; | |
3095 | ||
3096 | /* found preallocated blocks, use them */ | |
3097 | start = pa->pa_pstart + (ac->ac_o_ex.fe_logical - pa->pa_lstart); | |
3098 | end = min(pa->pa_pstart + pa->pa_len, start + ac->ac_o_ex.fe_len); | |
3099 | len = end - start; | |
3100 | ext4_get_group_no_and_offset(ac->ac_sb, start, &ac->ac_b_ex.fe_group, | |
3101 | &ac->ac_b_ex.fe_start); | |
3102 | ac->ac_b_ex.fe_len = len; | |
3103 | ac->ac_status = AC_STATUS_FOUND; | |
3104 | ac->ac_pa = pa; | |
3105 | ||
3106 | BUG_ON(start < pa->pa_pstart); | |
3107 | BUG_ON(start + len > pa->pa_pstart + pa->pa_len); | |
3108 | BUG_ON(pa->pa_free < len); | |
3109 | pa->pa_free -= len; | |
3110 | ||
60bd63d1 | 3111 | mb_debug("use %llu/%u from inode pa %p\n", start, len, pa); |
c9de560d AT |
3112 | } |
3113 | ||
3114 | /* | |
3115 | * use blocks preallocated to locality group | |
3116 | */ | |
3117 | static void ext4_mb_use_group_pa(struct ext4_allocation_context *ac, | |
3118 | struct ext4_prealloc_space *pa) | |
3119 | { | |
03cddb80 | 3120 | unsigned int len = ac->ac_o_ex.fe_len; |
c9de560d AT |
3121 | ext4_get_group_no_and_offset(ac->ac_sb, pa->pa_pstart, |
3122 | &ac->ac_b_ex.fe_group, | |
3123 | &ac->ac_b_ex.fe_start); | |
3124 | ac->ac_b_ex.fe_len = len; | |
3125 | ac->ac_status = AC_STATUS_FOUND; | |
3126 | ac->ac_pa = pa; | |
3127 | ||
3128 | /* we don't correct pa_pstart or pa_plen here to avoid | |
26346ff6 | 3129 | * possible race when the group is being loaded concurrently |
c9de560d | 3130 | * instead we correct pa later, after blocks are marked |
26346ff6 AK |
3131 | * in on-disk bitmap -- see ext4_mb_release_context() |
3132 | * Other CPUs are prevented from allocating from this pa by lg_mutex | |
c9de560d AT |
3133 | */ |
3134 | mb_debug("use %u/%u from group pa %p\n", pa->pa_lstart-len, len, pa); | |
3135 | } | |
3136 | ||
3137 | /* | |
3138 | * search goal blocks in preallocated space | |
3139 | */ | |
4ddfef7b ES |
3140 | static noinline_for_stack int |
3141 | ext4_mb_use_preallocated(struct ext4_allocation_context *ac) | |
c9de560d AT |
3142 | { |
3143 | struct ext4_inode_info *ei = EXT4_I(ac->ac_inode); | |
3144 | struct ext4_locality_group *lg; | |
3145 | struct ext4_prealloc_space *pa; | |
c9de560d AT |
3146 | |
3147 | /* only data can be preallocated */ | |
3148 | if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) | |
3149 | return 0; | |
3150 | ||
3151 | /* first, try per-file preallocation */ | |
3152 | rcu_read_lock(); | |
9a0762c5 | 3153 | list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { |
c9de560d AT |
3154 | |
3155 | /* all fields in this condition don't change, | |
3156 | * so we can skip locking for them */ | |
3157 | if (ac->ac_o_ex.fe_logical < pa->pa_lstart || | |
3158 | ac->ac_o_ex.fe_logical >= pa->pa_lstart + pa->pa_len) | |
3159 | continue; | |
3160 | ||
3161 | /* found preallocated blocks, use them */ | |
3162 | spin_lock(&pa->pa_lock); | |
3163 | if (pa->pa_deleted == 0 && pa->pa_free) { | |
3164 | atomic_inc(&pa->pa_count); | |
3165 | ext4_mb_use_inode_pa(ac, pa); | |
3166 | spin_unlock(&pa->pa_lock); | |
3167 | ac->ac_criteria = 10; | |
3168 | rcu_read_unlock(); | |
3169 | return 1; | |
3170 | } | |
3171 | spin_unlock(&pa->pa_lock); | |
3172 | } | |
3173 | rcu_read_unlock(); | |
3174 | ||
3175 | /* can we use group allocation? */ | |
3176 | if (!(ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC)) | |
3177 | return 0; | |
3178 | ||
3179 | /* inode may have no locality group for some reason */ | |
3180 | lg = ac->ac_lg; | |
3181 | if (lg == NULL) | |
3182 | return 0; | |
3183 | ||
3184 | rcu_read_lock(); | |
9a0762c5 | 3185 | list_for_each_entry_rcu(pa, &lg->lg_prealloc_list, pa_inode_list) { |
c9de560d AT |
3186 | spin_lock(&pa->pa_lock); |
3187 | if (pa->pa_deleted == 0 && pa->pa_free >= ac->ac_o_ex.fe_len) { | |
3188 | atomic_inc(&pa->pa_count); | |
3189 | ext4_mb_use_group_pa(ac, pa); | |
3190 | spin_unlock(&pa->pa_lock); | |
3191 | ac->ac_criteria = 20; | |
3192 | rcu_read_unlock(); | |
3193 | return 1; | |
3194 | } | |
3195 | spin_unlock(&pa->pa_lock); | |
3196 | } | |
3197 | rcu_read_unlock(); | |
3198 | ||
3199 | return 0; | |
3200 | } | |
3201 | ||
3202 | /* | |
3203 | * the function goes through all preallocation in this group and marks them | |
3204 | * used in in-core bitmap. buddy must be generated from this bitmap | |
3205 | * Need to be called with ext4 group lock (ext4_lock_group) | |
3206 | */ | |
3207 | static void ext4_mb_generate_from_pa(struct super_block *sb, void *bitmap, | |
3208 | ext4_group_t group) | |
3209 | { | |
3210 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
3211 | struct ext4_prealloc_space *pa; | |
3212 | struct list_head *cur; | |
3213 | ext4_group_t groupnr; | |
3214 | ext4_grpblk_t start; | |
3215 | int preallocated = 0; | |
3216 | int count = 0; | |
3217 | int len; | |
3218 | ||
3219 | /* all form of preallocation discards first load group, | |
3220 | * so the only competing code is preallocation use. | |
3221 | * we don't need any locking here | |
3222 | * notice we do NOT ignore preallocations with pa_deleted | |
3223 | * otherwise we could leave used blocks available for | |
3224 | * allocation in buddy when concurrent ext4_mb_put_pa() | |
3225 | * is dropping preallocation | |
3226 | */ | |
3227 | list_for_each(cur, &grp->bb_prealloc_list) { | |
3228 | pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); | |
3229 | spin_lock(&pa->pa_lock); | |
3230 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, | |
3231 | &groupnr, &start); | |
3232 | len = pa->pa_len; | |
3233 | spin_unlock(&pa->pa_lock); | |
3234 | if (unlikely(len == 0)) | |
3235 | continue; | |
3236 | BUG_ON(groupnr != group); | |
3237 | mb_set_bits(sb_bgl_lock(EXT4_SB(sb), group), | |
3238 | bitmap, start, len); | |
3239 | preallocated += len; | |
3240 | count++; | |
3241 | } | |
3242 | mb_debug("prellocated %u for group %lu\n", preallocated, group); | |
3243 | } | |
3244 | ||
3245 | static void ext4_mb_pa_callback(struct rcu_head *head) | |
3246 | { | |
3247 | struct ext4_prealloc_space *pa; | |
3248 | pa = container_of(head, struct ext4_prealloc_space, u.pa_rcu); | |
3249 | kmem_cache_free(ext4_pspace_cachep, pa); | |
3250 | } | |
3251 | ||
3252 | /* | |
3253 | * drops a reference to preallocated space descriptor | |
3254 | * if this was the last reference and the space is consumed | |
3255 | */ | |
3256 | static void ext4_mb_put_pa(struct ext4_allocation_context *ac, | |
3257 | struct super_block *sb, struct ext4_prealloc_space *pa) | |
3258 | { | |
3259 | unsigned long grp; | |
3260 | ||
3261 | if (!atomic_dec_and_test(&pa->pa_count) || pa->pa_free != 0) | |
3262 | return; | |
3263 | ||
3264 | /* in this short window concurrent discard can set pa_deleted */ | |
3265 | spin_lock(&pa->pa_lock); | |
3266 | if (pa->pa_deleted == 1) { | |
3267 | spin_unlock(&pa->pa_lock); | |
3268 | return; | |
3269 | } | |
3270 | ||
3271 | pa->pa_deleted = 1; | |
3272 | spin_unlock(&pa->pa_lock); | |
3273 | ||
3274 | /* -1 is to protect from crossing allocation group */ | |
3275 | ext4_get_group_no_and_offset(sb, pa->pa_pstart - 1, &grp, NULL); | |
3276 | ||
3277 | /* | |
3278 | * possible race: | |
3279 | * | |
3280 | * P1 (buddy init) P2 (regular allocation) | |
3281 | * find block B in PA | |
3282 | * copy on-disk bitmap to buddy | |
3283 | * mark B in on-disk bitmap | |
3284 | * drop PA from group | |
3285 | * mark all PAs in buddy | |
3286 | * | |
3287 | * thus, P1 initializes buddy with B available. to prevent this | |
3288 | * we make "copy" and "mark all PAs" atomic and serialize "drop PA" | |
3289 | * against that pair | |
3290 | */ | |
3291 | ext4_lock_group(sb, grp); | |
3292 | list_del(&pa->pa_group_list); | |
3293 | ext4_unlock_group(sb, grp); | |
3294 | ||
3295 | spin_lock(pa->pa_obj_lock); | |
3296 | list_del_rcu(&pa->pa_inode_list); | |
3297 | spin_unlock(pa->pa_obj_lock); | |
3298 | ||
3299 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
3300 | } | |
3301 | ||
3302 | /* | |
3303 | * creates new preallocated space for given inode | |
3304 | */ | |
4ddfef7b ES |
3305 | static noinline_for_stack int |
3306 | ext4_mb_new_inode_pa(struct ext4_allocation_context *ac) | |
c9de560d AT |
3307 | { |
3308 | struct super_block *sb = ac->ac_sb; | |
3309 | struct ext4_prealloc_space *pa; | |
3310 | struct ext4_group_info *grp; | |
3311 | struct ext4_inode_info *ei; | |
3312 | ||
3313 | /* preallocate only when found space is larger then requested */ | |
3314 | BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len); | |
3315 | BUG_ON(ac->ac_status != AC_STATUS_FOUND); | |
3316 | BUG_ON(!S_ISREG(ac->ac_inode->i_mode)); | |
3317 | ||
3318 | pa = kmem_cache_alloc(ext4_pspace_cachep, GFP_NOFS); | |
3319 | if (pa == NULL) | |
3320 | return -ENOMEM; | |
3321 | ||
3322 | if (ac->ac_b_ex.fe_len < ac->ac_g_ex.fe_len) { | |
3323 | int winl; | |
3324 | int wins; | |
3325 | int win; | |
3326 | int offs; | |
3327 | ||
3328 | /* we can't allocate as much as normalizer wants. | |
3329 | * so, found space must get proper lstart | |
3330 | * to cover original request */ | |
3331 | BUG_ON(ac->ac_g_ex.fe_logical > ac->ac_o_ex.fe_logical); | |
3332 | BUG_ON(ac->ac_g_ex.fe_len < ac->ac_o_ex.fe_len); | |
3333 | ||
3334 | /* we're limited by original request in that | |
3335 | * logical block must be covered any way | |
3336 | * winl is window we can move our chunk within */ | |
3337 | winl = ac->ac_o_ex.fe_logical - ac->ac_g_ex.fe_logical; | |
3338 | ||
3339 | /* also, we should cover whole original request */ | |
3340 | wins = ac->ac_b_ex.fe_len - ac->ac_o_ex.fe_len; | |
3341 | ||
3342 | /* the smallest one defines real window */ | |
3343 | win = min(winl, wins); | |
3344 | ||
3345 | offs = ac->ac_o_ex.fe_logical % ac->ac_b_ex.fe_len; | |
3346 | if (offs && offs < win) | |
3347 | win = offs; | |
3348 | ||
3349 | ac->ac_b_ex.fe_logical = ac->ac_o_ex.fe_logical - win; | |
3350 | BUG_ON(ac->ac_o_ex.fe_logical < ac->ac_b_ex.fe_logical); | |
3351 | BUG_ON(ac->ac_o_ex.fe_len > ac->ac_b_ex.fe_len); | |
3352 | } | |
3353 | ||
3354 | /* preallocation can change ac_b_ex, thus we store actually | |
3355 | * allocated blocks for history */ | |
3356 | ac->ac_f_ex = ac->ac_b_ex; | |
3357 | ||
3358 | pa->pa_lstart = ac->ac_b_ex.fe_logical; | |
3359 | pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
3360 | pa->pa_len = ac->ac_b_ex.fe_len; | |
3361 | pa->pa_free = pa->pa_len; | |
3362 | atomic_set(&pa->pa_count, 1); | |
3363 | spin_lock_init(&pa->pa_lock); | |
3364 | pa->pa_deleted = 0; | |
3365 | pa->pa_linear = 0; | |
3366 | ||
3367 | mb_debug("new inode pa %p: %llu/%u for %u\n", pa, | |
3368 | pa->pa_pstart, pa->pa_len, pa->pa_lstart); | |
3369 | ||
3370 | ext4_mb_use_inode_pa(ac, pa); | |
3371 | atomic_add(pa->pa_free, &EXT4_SB(sb)->s_mb_preallocated); | |
3372 | ||
3373 | ei = EXT4_I(ac->ac_inode); | |
3374 | grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group); | |
3375 | ||
3376 | pa->pa_obj_lock = &ei->i_prealloc_lock; | |
3377 | pa->pa_inode = ac->ac_inode; | |
3378 | ||
3379 | ext4_lock_group(sb, ac->ac_b_ex.fe_group); | |
3380 | list_add(&pa->pa_group_list, &grp->bb_prealloc_list); | |
3381 | ext4_unlock_group(sb, ac->ac_b_ex.fe_group); | |
3382 | ||
3383 | spin_lock(pa->pa_obj_lock); | |
3384 | list_add_rcu(&pa->pa_inode_list, &ei->i_prealloc_list); | |
3385 | spin_unlock(pa->pa_obj_lock); | |
3386 | ||
3387 | return 0; | |
3388 | } | |
3389 | ||
3390 | /* | |
3391 | * creates new preallocated space for locality group inodes belongs to | |
3392 | */ | |
4ddfef7b ES |
3393 | static noinline_for_stack int |
3394 | ext4_mb_new_group_pa(struct ext4_allocation_context *ac) | |
c9de560d AT |
3395 | { |
3396 | struct super_block *sb = ac->ac_sb; | |
3397 | struct ext4_locality_group *lg; | |
3398 | struct ext4_prealloc_space *pa; | |
3399 | struct ext4_group_info *grp; | |
3400 | ||
3401 | /* preallocate only when found space is larger then requested */ | |
3402 | BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len); | |
3403 | BUG_ON(ac->ac_status != AC_STATUS_FOUND); | |
3404 | BUG_ON(!S_ISREG(ac->ac_inode->i_mode)); | |
3405 | ||
3406 | BUG_ON(ext4_pspace_cachep == NULL); | |
3407 | pa = kmem_cache_alloc(ext4_pspace_cachep, GFP_NOFS); | |
3408 | if (pa == NULL) | |
3409 | return -ENOMEM; | |
3410 | ||
3411 | /* preallocation can change ac_b_ex, thus we store actually | |
3412 | * allocated blocks for history */ | |
3413 | ac->ac_f_ex = ac->ac_b_ex; | |
3414 | ||
3415 | pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
3416 | pa->pa_lstart = pa->pa_pstart; | |
3417 | pa->pa_len = ac->ac_b_ex.fe_len; | |
3418 | pa->pa_free = pa->pa_len; | |
3419 | atomic_set(&pa->pa_count, 1); | |
3420 | spin_lock_init(&pa->pa_lock); | |
3421 | pa->pa_deleted = 0; | |
3422 | pa->pa_linear = 1; | |
3423 | ||
3424 | mb_debug("new group pa %p: %llu/%u for %u\n", pa, | |
3425 | pa->pa_pstart, pa->pa_len, pa->pa_lstart); | |
3426 | ||
3427 | ext4_mb_use_group_pa(ac, pa); | |
3428 | atomic_add(pa->pa_free, &EXT4_SB(sb)->s_mb_preallocated); | |
3429 | ||
3430 | grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group); | |
3431 | lg = ac->ac_lg; | |
3432 | BUG_ON(lg == NULL); | |
3433 | ||
3434 | pa->pa_obj_lock = &lg->lg_prealloc_lock; | |
3435 | pa->pa_inode = NULL; | |
3436 | ||
3437 | ext4_lock_group(sb, ac->ac_b_ex.fe_group); | |
3438 | list_add(&pa->pa_group_list, &grp->bb_prealloc_list); | |
3439 | ext4_unlock_group(sb, ac->ac_b_ex.fe_group); | |
3440 | ||
3441 | spin_lock(pa->pa_obj_lock); | |
3442 | list_add_tail_rcu(&pa->pa_inode_list, &lg->lg_prealloc_list); | |
3443 | spin_unlock(pa->pa_obj_lock); | |
3444 | ||
3445 | return 0; | |
3446 | } | |
3447 | ||
3448 | static int ext4_mb_new_preallocation(struct ext4_allocation_context *ac) | |
3449 | { | |
3450 | int err; | |
3451 | ||
3452 | if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) | |
3453 | err = ext4_mb_new_group_pa(ac); | |
3454 | else | |
3455 | err = ext4_mb_new_inode_pa(ac); | |
3456 | return err; | |
3457 | } | |
3458 | ||
3459 | /* | |
3460 | * finds all unused blocks in on-disk bitmap, frees them in | |
3461 | * in-core bitmap and buddy. | |
3462 | * @pa must be unlinked from inode and group lists, so that | |
3463 | * nobody else can find/use it. | |
3464 | * the caller MUST hold group/inode locks. | |
3465 | * TODO: optimize the case when there are no in-core structures yet | |
3466 | */ | |
4ddfef7b ES |
3467 | static noinline_for_stack int |
3468 | ext4_mb_release_inode_pa(struct ext4_buddy *e4b, struct buffer_head *bitmap_bh, | |
c83617db AK |
3469 | struct ext4_prealloc_space *pa, |
3470 | struct ext4_allocation_context *ac) | |
c9de560d | 3471 | { |
c9de560d AT |
3472 | struct super_block *sb = e4b->bd_sb; |
3473 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
3474 | unsigned long end; | |
3475 | unsigned long next; | |
3476 | ext4_group_t group; | |
3477 | ext4_grpblk_t bit; | |
3478 | sector_t start; | |
3479 | int err = 0; | |
3480 | int free = 0; | |
3481 | ||
3482 | BUG_ON(pa->pa_deleted == 0); | |
3483 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit); | |
3484 | BUG_ON(group != e4b->bd_group && pa->pa_len != 0); | |
3485 | end = bit + pa->pa_len; | |
3486 | ||
256bdb49 ES |
3487 | if (ac) { |
3488 | ac->ac_sb = sb; | |
3489 | ac->ac_inode = pa->pa_inode; | |
3490 | ac->ac_op = EXT4_MB_HISTORY_DISCARD; | |
3491 | } | |
c9de560d AT |
3492 | |
3493 | while (bit < end) { | |
ffad0a44 | 3494 | bit = mb_find_next_zero_bit(bitmap_bh->b_data, end, bit); |
c9de560d AT |
3495 | if (bit >= end) |
3496 | break; | |
ffad0a44 | 3497 | next = mb_find_next_bit(bitmap_bh->b_data, end, bit); |
c9de560d AT |
3498 | start = group * EXT4_BLOCKS_PER_GROUP(sb) + bit + |
3499 | le32_to_cpu(sbi->s_es->s_first_data_block); | |
3500 | mb_debug(" free preallocated %u/%u in group %u\n", | |
3501 | (unsigned) start, (unsigned) next - bit, | |
3502 | (unsigned) group); | |
3503 | free += next - bit; | |
3504 | ||
256bdb49 ES |
3505 | if (ac) { |
3506 | ac->ac_b_ex.fe_group = group; | |
3507 | ac->ac_b_ex.fe_start = bit; | |
3508 | ac->ac_b_ex.fe_len = next - bit; | |
3509 | ac->ac_b_ex.fe_logical = 0; | |
3510 | ext4_mb_store_history(ac); | |
3511 | } | |
c9de560d AT |
3512 | |
3513 | mb_free_blocks(pa->pa_inode, e4b, bit, next - bit); | |
3514 | bit = next + 1; | |
3515 | } | |
3516 | if (free != pa->pa_free) { | |
26346ff6 | 3517 | printk(KERN_CRIT "pa %p: logic %lu, phys. %lu, len %lu\n", |
c9de560d AT |
3518 | pa, (unsigned long) pa->pa_lstart, |
3519 | (unsigned long) pa->pa_pstart, | |
3520 | (unsigned long) pa->pa_len); | |
46e665e9 | 3521 | ext4_error(sb, __func__, "free %u, pa_free %u\n", |
26346ff6 | 3522 | free, pa->pa_free); |
e56eb659 AK |
3523 | /* |
3524 | * pa is already deleted so we use the value obtained | |
3525 | * from the bitmap and continue. | |
3526 | */ | |
c9de560d | 3527 | } |
c9de560d AT |
3528 | atomic_add(free, &sbi->s_mb_discarded); |
3529 | ||
3530 | return err; | |
3531 | } | |
3532 | ||
4ddfef7b ES |
3533 | static noinline_for_stack int |
3534 | ext4_mb_release_group_pa(struct ext4_buddy *e4b, | |
c83617db AK |
3535 | struct ext4_prealloc_space *pa, |
3536 | struct ext4_allocation_context *ac) | |
c9de560d | 3537 | { |
c9de560d AT |
3538 | struct super_block *sb = e4b->bd_sb; |
3539 | ext4_group_t group; | |
3540 | ext4_grpblk_t bit; | |
3541 | ||
256bdb49 ES |
3542 | if (ac) |
3543 | ac->ac_op = EXT4_MB_HISTORY_DISCARD; | |
c9de560d AT |
3544 | |
3545 | BUG_ON(pa->pa_deleted == 0); | |
3546 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit); | |
3547 | BUG_ON(group != e4b->bd_group && pa->pa_len != 0); | |
3548 | mb_free_blocks(pa->pa_inode, e4b, bit, pa->pa_len); | |
3549 | atomic_add(pa->pa_len, &EXT4_SB(sb)->s_mb_discarded); | |
3550 | ||
256bdb49 ES |
3551 | if (ac) { |
3552 | ac->ac_sb = sb; | |
3553 | ac->ac_inode = NULL; | |
3554 | ac->ac_b_ex.fe_group = group; | |
3555 | ac->ac_b_ex.fe_start = bit; | |
3556 | ac->ac_b_ex.fe_len = pa->pa_len; | |
3557 | ac->ac_b_ex.fe_logical = 0; | |
3558 | ext4_mb_store_history(ac); | |
256bdb49 | 3559 | } |
c9de560d AT |
3560 | |
3561 | return 0; | |
3562 | } | |
3563 | ||
3564 | /* | |
3565 | * releases all preallocations in given group | |
3566 | * | |
3567 | * first, we need to decide discard policy: | |
3568 | * - when do we discard | |
3569 | * 1) ENOSPC | |
3570 | * - how many do we discard | |
3571 | * 1) how many requested | |
3572 | */ | |
4ddfef7b ES |
3573 | static noinline_for_stack int |
3574 | ext4_mb_discard_group_preallocations(struct super_block *sb, | |
c9de560d AT |
3575 | ext4_group_t group, int needed) |
3576 | { | |
3577 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
3578 | struct buffer_head *bitmap_bh = NULL; | |
3579 | struct ext4_prealloc_space *pa, *tmp; | |
c83617db | 3580 | struct ext4_allocation_context *ac; |
c9de560d AT |
3581 | struct list_head list; |
3582 | struct ext4_buddy e4b; | |
3583 | int err; | |
3584 | int busy = 0; | |
3585 | int free = 0; | |
3586 | ||
3587 | mb_debug("discard preallocation for group %lu\n", group); | |
3588 | ||
3589 | if (list_empty(&grp->bb_prealloc_list)) | |
3590 | return 0; | |
3591 | ||
3592 | bitmap_bh = read_block_bitmap(sb, group); | |
3593 | if (bitmap_bh == NULL) { | |
3594 | /* error handling here */ | |
3595 | ext4_mb_release_desc(&e4b); | |
3596 | BUG_ON(bitmap_bh == NULL); | |
3597 | } | |
3598 | ||
3599 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
3600 | BUG_ON(err != 0); /* error handling here */ | |
3601 | ||
3602 | if (needed == 0) | |
3603 | needed = EXT4_BLOCKS_PER_GROUP(sb) + 1; | |
3604 | ||
3605 | grp = ext4_get_group_info(sb, group); | |
3606 | INIT_LIST_HEAD(&list); | |
3607 | ||
c83617db | 3608 | ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); |
c9de560d AT |
3609 | repeat: |
3610 | ext4_lock_group(sb, group); | |
3611 | list_for_each_entry_safe(pa, tmp, | |
3612 | &grp->bb_prealloc_list, pa_group_list) { | |
3613 | spin_lock(&pa->pa_lock); | |
3614 | if (atomic_read(&pa->pa_count)) { | |
3615 | spin_unlock(&pa->pa_lock); | |
3616 | busy = 1; | |
3617 | continue; | |
3618 | } | |
3619 | if (pa->pa_deleted) { | |
3620 | spin_unlock(&pa->pa_lock); | |
3621 | continue; | |
3622 | } | |
3623 | ||
3624 | /* seems this one can be freed ... */ | |
3625 | pa->pa_deleted = 1; | |
3626 | ||
3627 | /* we can trust pa_free ... */ | |
3628 | free += pa->pa_free; | |
3629 | ||
3630 | spin_unlock(&pa->pa_lock); | |
3631 | ||
3632 | list_del(&pa->pa_group_list); | |
3633 | list_add(&pa->u.pa_tmp_list, &list); | |
3634 | } | |
3635 | ||
3636 | /* if we still need more blocks and some PAs were used, try again */ | |
3637 | if (free < needed && busy) { | |
3638 | busy = 0; | |
3639 | ext4_unlock_group(sb, group); | |
3640 | /* | |
3641 | * Yield the CPU here so that we don't get soft lockup | |
3642 | * in non preempt case. | |
3643 | */ | |
3644 | yield(); | |
3645 | goto repeat; | |
3646 | } | |
3647 | ||
3648 | /* found anything to free? */ | |
3649 | if (list_empty(&list)) { | |
3650 | BUG_ON(free != 0); | |
3651 | goto out; | |
3652 | } | |
3653 | ||
3654 | /* now free all selected PAs */ | |
3655 | list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) { | |
3656 | ||
3657 | /* remove from object (inode or locality group) */ | |
3658 | spin_lock(pa->pa_obj_lock); | |
3659 | list_del_rcu(&pa->pa_inode_list); | |
3660 | spin_unlock(pa->pa_obj_lock); | |
3661 | ||
3662 | if (pa->pa_linear) | |
c83617db | 3663 | ext4_mb_release_group_pa(&e4b, pa, ac); |
c9de560d | 3664 | else |
c83617db | 3665 | ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa, ac); |
c9de560d AT |
3666 | |
3667 | list_del(&pa->u.pa_tmp_list); | |
3668 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
3669 | } | |
3670 | ||
3671 | out: | |
3672 | ext4_unlock_group(sb, group); | |
c83617db AK |
3673 | if (ac) |
3674 | kmem_cache_free(ext4_ac_cachep, ac); | |
c9de560d AT |
3675 | ext4_mb_release_desc(&e4b); |
3676 | put_bh(bitmap_bh); | |
3677 | return free; | |
3678 | } | |
3679 | ||
3680 | /* | |
3681 | * releases all non-used preallocated blocks for given inode | |
3682 | * | |
3683 | * It's important to discard preallocations under i_data_sem | |
3684 | * We don't want another block to be served from the prealloc | |
3685 | * space when we are discarding the inode prealloc space. | |
3686 | * | |
3687 | * FIXME!! Make sure it is valid at all the call sites | |
3688 | */ | |
3689 | void ext4_mb_discard_inode_preallocations(struct inode *inode) | |
3690 | { | |
3691 | struct ext4_inode_info *ei = EXT4_I(inode); | |
3692 | struct super_block *sb = inode->i_sb; | |
3693 | struct buffer_head *bitmap_bh = NULL; | |
3694 | struct ext4_prealloc_space *pa, *tmp; | |
c83617db | 3695 | struct ext4_allocation_context *ac; |
c9de560d AT |
3696 | ext4_group_t group = 0; |
3697 | struct list_head list; | |
3698 | struct ext4_buddy e4b; | |
3699 | int err; | |
3700 | ||
3701 | if (!test_opt(sb, MBALLOC) || !S_ISREG(inode->i_mode)) { | |
3702 | /*BUG_ON(!list_empty(&ei->i_prealloc_list));*/ | |
3703 | return; | |
3704 | } | |
3705 | ||
3706 | mb_debug("discard preallocation for inode %lu\n", inode->i_ino); | |
3707 | ||
3708 | INIT_LIST_HEAD(&list); | |
3709 | ||
c83617db | 3710 | ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); |
c9de560d AT |
3711 | repeat: |
3712 | /* first, collect all pa's in the inode */ | |
3713 | spin_lock(&ei->i_prealloc_lock); | |
3714 | while (!list_empty(&ei->i_prealloc_list)) { | |
3715 | pa = list_entry(ei->i_prealloc_list.next, | |
3716 | struct ext4_prealloc_space, pa_inode_list); | |
3717 | BUG_ON(pa->pa_obj_lock != &ei->i_prealloc_lock); | |
3718 | spin_lock(&pa->pa_lock); | |
3719 | if (atomic_read(&pa->pa_count)) { | |
3720 | /* this shouldn't happen often - nobody should | |
3721 | * use preallocation while we're discarding it */ | |
3722 | spin_unlock(&pa->pa_lock); | |
3723 | spin_unlock(&ei->i_prealloc_lock); | |
3724 | printk(KERN_ERR "uh-oh! used pa while discarding\n"); | |
3725 | WARN_ON(1); | |
3726 | schedule_timeout_uninterruptible(HZ); | |
3727 | goto repeat; | |
3728 | ||
3729 | } | |
3730 | if (pa->pa_deleted == 0) { | |
3731 | pa->pa_deleted = 1; | |
3732 | spin_unlock(&pa->pa_lock); | |
3733 | list_del_rcu(&pa->pa_inode_list); | |
3734 | list_add(&pa->u.pa_tmp_list, &list); | |
3735 | continue; | |
3736 | } | |
3737 | ||
3738 | /* someone is deleting pa right now */ | |
3739 | spin_unlock(&pa->pa_lock); | |
3740 | spin_unlock(&ei->i_prealloc_lock); | |
3741 | ||
3742 | /* we have to wait here because pa_deleted | |
3743 | * doesn't mean pa is already unlinked from | |
3744 | * the list. as we might be called from | |
3745 | * ->clear_inode() the inode will get freed | |
3746 | * and concurrent thread which is unlinking | |
3747 | * pa from inode's list may access already | |
3748 | * freed memory, bad-bad-bad */ | |
3749 | ||
3750 | /* XXX: if this happens too often, we can | |
3751 | * add a flag to force wait only in case | |
3752 | * of ->clear_inode(), but not in case of | |
3753 | * regular truncate */ | |
3754 | schedule_timeout_uninterruptible(HZ); | |
3755 | goto repeat; | |
3756 | } | |
3757 | spin_unlock(&ei->i_prealloc_lock); | |
3758 | ||
3759 | list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) { | |
3760 | BUG_ON(pa->pa_linear != 0); | |
3761 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, NULL); | |
3762 | ||
3763 | err = ext4_mb_load_buddy(sb, group, &e4b); | |
3764 | BUG_ON(err != 0); /* error handling here */ | |
3765 | ||
3766 | bitmap_bh = read_block_bitmap(sb, group); | |
3767 | if (bitmap_bh == NULL) { | |
3768 | /* error handling here */ | |
3769 | ext4_mb_release_desc(&e4b); | |
3770 | BUG_ON(bitmap_bh == NULL); | |
3771 | } | |
3772 | ||
3773 | ext4_lock_group(sb, group); | |
3774 | list_del(&pa->pa_group_list); | |
c83617db | 3775 | ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa, ac); |
c9de560d AT |
3776 | ext4_unlock_group(sb, group); |
3777 | ||
3778 | ext4_mb_release_desc(&e4b); | |
3779 | put_bh(bitmap_bh); | |
3780 | ||
3781 | list_del(&pa->u.pa_tmp_list); | |
3782 | call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); | |
3783 | } | |
c83617db AK |
3784 | if (ac) |
3785 | kmem_cache_free(ext4_ac_cachep, ac); | |
c9de560d AT |
3786 | } |
3787 | ||
3788 | /* | |
3789 | * finds all preallocated spaces and return blocks being freed to them | |
3790 | * if preallocated space becomes full (no block is used from the space) | |
3791 | * then the function frees space in buddy | |
3792 | * XXX: at the moment, truncate (which is the only way to free blocks) | |
3793 | * discards all preallocations | |
3794 | */ | |
3795 | static void ext4_mb_return_to_preallocation(struct inode *inode, | |
3796 | struct ext4_buddy *e4b, | |
3797 | sector_t block, int count) | |
3798 | { | |
3799 | BUG_ON(!list_empty(&EXT4_I(inode)->i_prealloc_list)); | |
3800 | } | |
3801 | #ifdef MB_DEBUG | |
3802 | static void ext4_mb_show_ac(struct ext4_allocation_context *ac) | |
3803 | { | |
3804 | struct super_block *sb = ac->ac_sb; | |
3805 | ext4_group_t i; | |
3806 | ||
3807 | printk(KERN_ERR "EXT4-fs: Can't allocate:" | |
3808 | " Allocation context details:\n"); | |
3809 | printk(KERN_ERR "EXT4-fs: status %d flags %d\n", | |
3810 | ac->ac_status, ac->ac_flags); | |
3811 | printk(KERN_ERR "EXT4-fs: orig %lu/%lu/%lu@%lu, goal %lu/%lu/%lu@%lu, " | |
3812 | "best %lu/%lu/%lu@%lu cr %d\n", | |
3813 | (unsigned long)ac->ac_o_ex.fe_group, | |
3814 | (unsigned long)ac->ac_o_ex.fe_start, | |
3815 | (unsigned long)ac->ac_o_ex.fe_len, | |
3816 | (unsigned long)ac->ac_o_ex.fe_logical, | |
3817 | (unsigned long)ac->ac_g_ex.fe_group, | |
3818 | (unsigned long)ac->ac_g_ex.fe_start, | |
3819 | (unsigned long)ac->ac_g_ex.fe_len, | |
3820 | (unsigned long)ac->ac_g_ex.fe_logical, | |
3821 | (unsigned long)ac->ac_b_ex.fe_group, | |
3822 | (unsigned long)ac->ac_b_ex.fe_start, | |
3823 | (unsigned long)ac->ac_b_ex.fe_len, | |
3824 | (unsigned long)ac->ac_b_ex.fe_logical, | |
3825 | (int)ac->ac_criteria); | |
3826 | printk(KERN_ERR "EXT4-fs: %lu scanned, %d found\n", ac->ac_ex_scanned, | |
3827 | ac->ac_found); | |
3828 | printk(KERN_ERR "EXT4-fs: groups: \n"); | |
3829 | for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) { | |
3830 | struct ext4_group_info *grp = ext4_get_group_info(sb, i); | |
3831 | struct ext4_prealloc_space *pa; | |
3832 | ext4_grpblk_t start; | |
3833 | struct list_head *cur; | |
3834 | ext4_lock_group(sb, i); | |
3835 | list_for_each(cur, &grp->bb_prealloc_list) { | |
3836 | pa = list_entry(cur, struct ext4_prealloc_space, | |
3837 | pa_group_list); | |
3838 | spin_lock(&pa->pa_lock); | |
3839 | ext4_get_group_no_and_offset(sb, pa->pa_pstart, | |
3840 | NULL, &start); | |
3841 | spin_unlock(&pa->pa_lock); | |
3842 | printk(KERN_ERR "PA:%lu:%d:%u \n", i, | |
3843 | start, pa->pa_len); | |
3844 | } | |
60bd63d1 | 3845 | ext4_unlock_group(sb, i); |
c9de560d AT |
3846 | |
3847 | if (grp->bb_free == 0) | |
3848 | continue; | |
3849 | printk(KERN_ERR "%lu: %d/%d \n", | |
3850 | i, grp->bb_free, grp->bb_fragments); | |
3851 | } | |
3852 | printk(KERN_ERR "\n"); | |
3853 | } | |
3854 | #else | |
3855 | static inline void ext4_mb_show_ac(struct ext4_allocation_context *ac) | |
3856 | { | |
3857 | return; | |
3858 | } | |
3859 | #endif | |
3860 | ||
3861 | /* | |
3862 | * We use locality group preallocation for small size file. The size of the | |
3863 | * file is determined by the current size or the resulting size after | |
3864 | * allocation which ever is larger | |
3865 | * | |
3866 | * One can tune this size via /proc/fs/ext4/<partition>/stream_req | |
3867 | */ | |
3868 | static void ext4_mb_group_or_file(struct ext4_allocation_context *ac) | |
3869 | { | |
3870 | struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); | |
3871 | int bsbits = ac->ac_sb->s_blocksize_bits; | |
3872 | loff_t size, isize; | |
3873 | ||
3874 | if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) | |
3875 | return; | |
3876 | ||
3877 | size = ac->ac_o_ex.fe_logical + ac->ac_o_ex.fe_len; | |
3878 | isize = i_size_read(ac->ac_inode) >> bsbits; | |
3879 | size = max(size, isize); | |
3880 | ||
3881 | /* don't use group allocation for large files */ | |
3882 | if (size >= sbi->s_mb_stream_request) | |
3883 | return; | |
3884 | ||
3885 | if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) | |
3886 | return; | |
3887 | ||
3888 | BUG_ON(ac->ac_lg != NULL); | |
3889 | /* | |
3890 | * locality group prealloc space are per cpu. The reason for having | |
3891 | * per cpu locality group is to reduce the contention between block | |
3892 | * request from multiple CPUs. | |
3893 | */ | |
3894 | ac->ac_lg = &sbi->s_locality_groups[get_cpu()]; | |
3895 | put_cpu(); | |
3896 | ||
3897 | /* we're going to use group allocation */ | |
3898 | ac->ac_flags |= EXT4_MB_HINT_GROUP_ALLOC; | |
3899 | ||
3900 | /* serialize all allocations in the group */ | |
3901 | mutex_lock(&ac->ac_lg->lg_mutex); | |
3902 | } | |
3903 | ||
4ddfef7b ES |
3904 | static noinline_for_stack int |
3905 | ext4_mb_initialize_context(struct ext4_allocation_context *ac, | |
c9de560d AT |
3906 | struct ext4_allocation_request *ar) |
3907 | { | |
3908 | struct super_block *sb = ar->inode->i_sb; | |
3909 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
3910 | struct ext4_super_block *es = sbi->s_es; | |
3911 | ext4_group_t group; | |
3912 | unsigned long len; | |
3913 | unsigned long goal; | |
3914 | ext4_grpblk_t block; | |
3915 | ||
3916 | /* we can't allocate > group size */ | |
3917 | len = ar->len; | |
3918 | ||
3919 | /* just a dirty hack to filter too big requests */ | |
3920 | if (len >= EXT4_BLOCKS_PER_GROUP(sb) - 10) | |
3921 | len = EXT4_BLOCKS_PER_GROUP(sb) - 10; | |
3922 | ||
3923 | /* start searching from the goal */ | |
3924 | goal = ar->goal; | |
3925 | if (goal < le32_to_cpu(es->s_first_data_block) || | |
3926 | goal >= ext4_blocks_count(es)) | |
3927 | goal = le32_to_cpu(es->s_first_data_block); | |
3928 | ext4_get_group_no_and_offset(sb, goal, &group, &block); | |
3929 | ||
3930 | /* set up allocation goals */ | |
3931 | ac->ac_b_ex.fe_logical = ar->logical; | |
3932 | ac->ac_b_ex.fe_group = 0; | |
3933 | ac->ac_b_ex.fe_start = 0; | |
3934 | ac->ac_b_ex.fe_len = 0; | |
3935 | ac->ac_status = AC_STATUS_CONTINUE; | |
3936 | ac->ac_groups_scanned = 0; | |
3937 | ac->ac_ex_scanned = 0; | |
3938 | ac->ac_found = 0; | |
3939 | ac->ac_sb = sb; | |
3940 | ac->ac_inode = ar->inode; | |
3941 | ac->ac_o_ex.fe_logical = ar->logical; | |
3942 | ac->ac_o_ex.fe_group = group; | |
3943 | ac->ac_o_ex.fe_start = block; | |
3944 | ac->ac_o_ex.fe_len = len; | |
3945 | ac->ac_g_ex.fe_logical = ar->logical; | |
3946 | ac->ac_g_ex.fe_group = group; | |
3947 | ac->ac_g_ex.fe_start = block; | |
3948 | ac->ac_g_ex.fe_len = len; | |
3949 | ac->ac_f_ex.fe_len = 0; | |
3950 | ac->ac_flags = ar->flags; | |
3951 | ac->ac_2order = 0; | |
3952 | ac->ac_criteria = 0; | |
3953 | ac->ac_pa = NULL; | |
3954 | ac->ac_bitmap_page = NULL; | |
3955 | ac->ac_buddy_page = NULL; | |
3956 | ac->ac_lg = NULL; | |
3957 | ||
3958 | /* we have to define context: we'll we work with a file or | |
3959 | * locality group. this is a policy, actually */ | |
3960 | ext4_mb_group_or_file(ac); | |
3961 | ||
3962 | mb_debug("init ac: %u blocks @ %u, goal %u, flags %x, 2^%d, " | |
3963 | "left: %u/%u, right %u/%u to %swritable\n", | |
3964 | (unsigned) ar->len, (unsigned) ar->logical, | |
3965 | (unsigned) ar->goal, ac->ac_flags, ac->ac_2order, | |
3966 | (unsigned) ar->lleft, (unsigned) ar->pleft, | |
3967 | (unsigned) ar->lright, (unsigned) ar->pright, | |
3968 | atomic_read(&ar->inode->i_writecount) ? "" : "non-"); | |
3969 | return 0; | |
3970 | ||
3971 | } | |
3972 | ||
3973 | /* | |
3974 | * release all resource we used in allocation | |
3975 | */ | |
3976 | static int ext4_mb_release_context(struct ext4_allocation_context *ac) | |
3977 | { | |
3978 | if (ac->ac_pa) { | |
3979 | if (ac->ac_pa->pa_linear) { | |
3980 | /* see comment in ext4_mb_use_group_pa() */ | |
3981 | spin_lock(&ac->ac_pa->pa_lock); | |
3982 | ac->ac_pa->pa_pstart += ac->ac_b_ex.fe_len; | |
3983 | ac->ac_pa->pa_lstart += ac->ac_b_ex.fe_len; | |
3984 | ac->ac_pa->pa_free -= ac->ac_b_ex.fe_len; | |
3985 | ac->ac_pa->pa_len -= ac->ac_b_ex.fe_len; | |
3986 | spin_unlock(&ac->ac_pa->pa_lock); | |
3987 | } | |
3988 | ext4_mb_put_pa(ac, ac->ac_sb, ac->ac_pa); | |
3989 | } | |
3990 | if (ac->ac_bitmap_page) | |
3991 | page_cache_release(ac->ac_bitmap_page); | |
3992 | if (ac->ac_buddy_page) | |
3993 | page_cache_release(ac->ac_buddy_page); | |
3994 | if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) | |
3995 | mutex_unlock(&ac->ac_lg->lg_mutex); | |
3996 | ext4_mb_collect_stats(ac); | |
3997 | return 0; | |
3998 | } | |
3999 | ||
4000 | static int ext4_mb_discard_preallocations(struct super_block *sb, int needed) | |
4001 | { | |
4002 | ext4_group_t i; | |
4003 | int ret; | |
4004 | int freed = 0; | |
4005 | ||
4006 | for (i = 0; i < EXT4_SB(sb)->s_groups_count && needed > 0; i++) { | |
4007 | ret = ext4_mb_discard_group_preallocations(sb, i, needed); | |
4008 | freed += ret; | |
4009 | needed -= ret; | |
4010 | } | |
4011 | ||
4012 | return freed; | |
4013 | } | |
4014 | ||
4015 | /* | |
4016 | * Main entry point into mballoc to allocate blocks | |
4017 | * it tries to use preallocation first, then falls back | |
4018 | * to usual allocation | |
4019 | */ | |
4020 | ext4_fsblk_t ext4_mb_new_blocks(handle_t *handle, | |
4021 | struct ext4_allocation_request *ar, int *errp) | |
4022 | { | |
256bdb49 | 4023 | struct ext4_allocation_context *ac = NULL; |
c9de560d AT |
4024 | struct ext4_sb_info *sbi; |
4025 | struct super_block *sb; | |
4026 | ext4_fsblk_t block = 0; | |
4027 | int freed; | |
4028 | int inquota; | |
4029 | ||
4030 | sb = ar->inode->i_sb; | |
4031 | sbi = EXT4_SB(sb); | |
4032 | ||
4033 | if (!test_opt(sb, MBALLOC)) { | |
4034 | block = ext4_new_blocks_old(handle, ar->inode, ar->goal, | |
4035 | &(ar->len), errp); | |
4036 | return block; | |
4037 | } | |
4038 | ||
4039 | while (ar->len && DQUOT_ALLOC_BLOCK(ar->inode, ar->len)) { | |
4040 | ar->flags |= EXT4_MB_HINT_NOPREALLOC; | |
4041 | ar->len--; | |
4042 | } | |
4043 | if (ar->len == 0) { | |
4044 | *errp = -EDQUOT; | |
4045 | return 0; | |
4046 | } | |
4047 | inquota = ar->len; | |
4048 | ||
256bdb49 ES |
4049 | ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); |
4050 | if (!ac) { | |
4051 | *errp = -ENOMEM; | |
4052 | return 0; | |
4053 | } | |
4054 | ||
c9de560d AT |
4055 | ext4_mb_poll_new_transaction(sb, handle); |
4056 | ||
256bdb49 | 4057 | *errp = ext4_mb_initialize_context(ac, ar); |
c9de560d AT |
4058 | if (*errp) { |
4059 | ar->len = 0; | |
4060 | goto out; | |
4061 | } | |
4062 | ||
256bdb49 ES |
4063 | ac->ac_op = EXT4_MB_HISTORY_PREALLOC; |
4064 | if (!ext4_mb_use_preallocated(ac)) { | |
c9de560d | 4065 | |
256bdb49 ES |
4066 | ac->ac_op = EXT4_MB_HISTORY_ALLOC; |
4067 | ext4_mb_normalize_request(ac, ar); | |
c9de560d AT |
4068 | repeat: |
4069 | /* allocate space in core */ | |
256bdb49 | 4070 | ext4_mb_regular_allocator(ac); |
c9de560d AT |
4071 | |
4072 | /* as we've just preallocated more space than | |
4073 | * user requested orinally, we store allocated | |
4074 | * space in a special descriptor */ | |
256bdb49 ES |
4075 | if (ac->ac_status == AC_STATUS_FOUND && |
4076 | ac->ac_o_ex.fe_len < ac->ac_b_ex.fe_len) | |
4077 | ext4_mb_new_preallocation(ac); | |
c9de560d AT |
4078 | } |
4079 | ||
256bdb49 | 4080 | if (likely(ac->ac_status == AC_STATUS_FOUND)) { |
519deca0 AK |
4081 | *errp = ext4_mb_mark_diskspace_used(ac, handle); |
4082 | if (*errp == -EAGAIN) { | |
4083 | ac->ac_b_ex.fe_group = 0; | |
4084 | ac->ac_b_ex.fe_start = 0; | |
4085 | ac->ac_b_ex.fe_len = 0; | |
4086 | ac->ac_status = AC_STATUS_CONTINUE; | |
4087 | goto repeat; | |
4088 | } else if (*errp) { | |
4089 | ac->ac_b_ex.fe_len = 0; | |
4090 | ar->len = 0; | |
4091 | ext4_mb_show_ac(ac); | |
4092 | } else { | |
4093 | block = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); | |
4094 | ar->len = ac->ac_b_ex.fe_len; | |
4095 | } | |
c9de560d | 4096 | } else { |
256bdb49 | 4097 | freed = ext4_mb_discard_preallocations(sb, ac->ac_o_ex.fe_len); |
c9de560d AT |
4098 | if (freed) |
4099 | goto repeat; | |
4100 | *errp = -ENOSPC; | |
256bdb49 | 4101 | ac->ac_b_ex.fe_len = 0; |
c9de560d | 4102 | ar->len = 0; |
256bdb49 | 4103 | ext4_mb_show_ac(ac); |
c9de560d AT |
4104 | } |
4105 | ||
256bdb49 | 4106 | ext4_mb_release_context(ac); |
c9de560d AT |
4107 | |
4108 | out: | |
4109 | if (ar->len < inquota) | |
4110 | DQUOT_FREE_BLOCK(ar->inode, inquota - ar->len); | |
4111 | ||
256bdb49 | 4112 | kmem_cache_free(ext4_ac_cachep, ac); |
c9de560d AT |
4113 | return block; |
4114 | } | |
4115 | static void ext4_mb_poll_new_transaction(struct super_block *sb, | |
4116 | handle_t *handle) | |
4117 | { | |
4118 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
4119 | ||
4120 | if (sbi->s_last_transaction == handle->h_transaction->t_tid) | |
4121 | return; | |
4122 | ||
4123 | /* new transaction! time to close last one and free blocks for | |
4124 | * committed transaction. we know that only transaction can be | |
4125 | * active, so previos transaction can be being logged and we | |
4126 | * know that transaction before previous is known to be already | |
4127 | * logged. this means that now we may free blocks freed in all | |
4128 | * transactions before previous one. hope I'm clear enough ... */ | |
4129 | ||
4130 | spin_lock(&sbi->s_md_lock); | |
4131 | if (sbi->s_last_transaction != handle->h_transaction->t_tid) { | |
4132 | mb_debug("new transaction %lu, old %lu\n", | |
4133 | (unsigned long) handle->h_transaction->t_tid, | |
4134 | (unsigned long) sbi->s_last_transaction); | |
4135 | list_splice_init(&sbi->s_closed_transaction, | |
4136 | &sbi->s_committed_transaction); | |
4137 | list_splice_init(&sbi->s_active_transaction, | |
4138 | &sbi->s_closed_transaction); | |
4139 | sbi->s_last_transaction = handle->h_transaction->t_tid; | |
4140 | } | |
4141 | spin_unlock(&sbi->s_md_lock); | |
4142 | ||
4143 | ext4_mb_free_committed_blocks(sb); | |
4144 | } | |
4145 | ||
4ddfef7b ES |
4146 | static noinline_for_stack int |
4147 | ext4_mb_free_metadata(handle_t *handle, struct ext4_buddy *e4b, | |
c9de560d AT |
4148 | ext4_group_t group, ext4_grpblk_t block, int count) |
4149 | { | |
4150 | struct ext4_group_info *db = e4b->bd_info; | |
4151 | struct super_block *sb = e4b->bd_sb; | |
4152 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
4153 | struct ext4_free_metadata *md; | |
4154 | int i; | |
4155 | ||
4156 | BUG_ON(e4b->bd_bitmap_page == NULL); | |
4157 | BUG_ON(e4b->bd_buddy_page == NULL); | |
4158 | ||
4159 | ext4_lock_group(sb, group); | |
4160 | for (i = 0; i < count; i++) { | |
4161 | md = db->bb_md_cur; | |
4162 | if (md && db->bb_tid != handle->h_transaction->t_tid) { | |
4163 | db->bb_md_cur = NULL; | |
4164 | md = NULL; | |
4165 | } | |
4166 | ||
4167 | if (md == NULL) { | |
4168 | ext4_unlock_group(sb, group); | |
4169 | md = kmalloc(sizeof(*md), GFP_NOFS); | |
4170 | if (md == NULL) | |
4171 | return -ENOMEM; | |
4172 | md->num = 0; | |
4173 | md->group = group; | |
4174 | ||
4175 | ext4_lock_group(sb, group); | |
4176 | if (db->bb_md_cur == NULL) { | |
4177 | spin_lock(&sbi->s_md_lock); | |
4178 | list_add(&md->list, &sbi->s_active_transaction); | |
4179 | spin_unlock(&sbi->s_md_lock); | |
4180 | /* protect buddy cache from being freed, | |
4181 | * otherwise we'll refresh it from | |
4182 | * on-disk bitmap and lose not-yet-available | |
4183 | * blocks */ | |
4184 | page_cache_get(e4b->bd_buddy_page); | |
4185 | page_cache_get(e4b->bd_bitmap_page); | |
4186 | db->bb_md_cur = md; | |
4187 | db->bb_tid = handle->h_transaction->t_tid; | |
4188 | mb_debug("new md 0x%p for group %lu\n", | |
4189 | md, md->group); | |
4190 | } else { | |
4191 | kfree(md); | |
4192 | md = db->bb_md_cur; | |
4193 | } | |
4194 | } | |
4195 | ||
4196 | BUG_ON(md->num >= EXT4_BB_MAX_BLOCKS); | |
4197 | md->blocks[md->num] = block + i; | |
4198 | md->num++; | |
4199 | if (md->num == EXT4_BB_MAX_BLOCKS) { | |
4200 | /* no more space, put full container on a sb's list */ | |
4201 | db->bb_md_cur = NULL; | |
4202 | } | |
4203 | } | |
4204 | ext4_unlock_group(sb, group); | |
4205 | return 0; | |
4206 | } | |
4207 | ||
4208 | /* | |
4209 | * Main entry point into mballoc to free blocks | |
4210 | */ | |
4211 | void ext4_mb_free_blocks(handle_t *handle, struct inode *inode, | |
4212 | unsigned long block, unsigned long count, | |
4213 | int metadata, unsigned long *freed) | |
4214 | { | |
26346ff6 | 4215 | struct buffer_head *bitmap_bh = NULL; |
c9de560d | 4216 | struct super_block *sb = inode->i_sb; |
256bdb49 | 4217 | struct ext4_allocation_context *ac = NULL; |
c9de560d AT |
4218 | struct ext4_group_desc *gdp; |
4219 | struct ext4_super_block *es; | |
4220 | unsigned long overflow; | |
4221 | ext4_grpblk_t bit; | |
4222 | struct buffer_head *gd_bh; | |
4223 | ext4_group_t block_group; | |
4224 | struct ext4_sb_info *sbi; | |
4225 | struct ext4_buddy e4b; | |
4226 | int err = 0; | |
4227 | int ret; | |
4228 | ||
4229 | *freed = 0; | |
4230 | ||
4231 | ext4_mb_poll_new_transaction(sb, handle); | |
4232 | ||
4233 | sbi = EXT4_SB(sb); | |
4234 | es = EXT4_SB(sb)->s_es; | |
4235 | if (block < le32_to_cpu(es->s_first_data_block) || | |
4236 | block + count < block || | |
4237 | block + count > ext4_blocks_count(es)) { | |
46e665e9 | 4238 | ext4_error(sb, __func__, |
c9de560d AT |
4239 | "Freeing blocks not in datazone - " |
4240 | "block = %lu, count = %lu", block, count); | |
4241 | goto error_return; | |
4242 | } | |
4243 | ||
4244 | ext4_debug("freeing block %lu\n", block); | |
4245 | ||
256bdb49 ES |
4246 | ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); |
4247 | if (ac) { | |
4248 | ac->ac_op = EXT4_MB_HISTORY_FREE; | |
4249 | ac->ac_inode = inode; | |
4250 | ac->ac_sb = sb; | |
4251 | } | |
c9de560d AT |
4252 | |
4253 | do_more: | |
4254 | overflow = 0; | |
4255 | ext4_get_group_no_and_offset(sb, block, &block_group, &bit); | |
4256 | ||
4257 | /* | |
4258 | * Check to see if we are freeing blocks across a group | |
4259 | * boundary. | |
4260 | */ | |
4261 | if (bit + count > EXT4_BLOCKS_PER_GROUP(sb)) { | |
4262 | overflow = bit + count - EXT4_BLOCKS_PER_GROUP(sb); | |
4263 | count -= overflow; | |
4264 | } | |
4265 | bitmap_bh = read_block_bitmap(sb, block_group); | |
4266 | if (!bitmap_bh) | |
4267 | goto error_return; | |
4268 | gdp = ext4_get_group_desc(sb, block_group, &gd_bh); | |
4269 | if (!gdp) | |
4270 | goto error_return; | |
4271 | ||
4272 | if (in_range(ext4_block_bitmap(sb, gdp), block, count) || | |
4273 | in_range(ext4_inode_bitmap(sb, gdp), block, count) || | |
4274 | in_range(block, ext4_inode_table(sb, gdp), | |
4275 | EXT4_SB(sb)->s_itb_per_group) || | |
4276 | in_range(block + count - 1, ext4_inode_table(sb, gdp), | |
4277 | EXT4_SB(sb)->s_itb_per_group)) { | |
4278 | ||
46e665e9 | 4279 | ext4_error(sb, __func__, |
c9de560d AT |
4280 | "Freeing blocks in system zone - " |
4281 | "Block = %lu, count = %lu", block, count); | |
519deca0 AK |
4282 | /* err = 0. ext4_std_error should be a no op */ |
4283 | goto error_return; | |
c9de560d AT |
4284 | } |
4285 | ||
4286 | BUFFER_TRACE(bitmap_bh, "getting write access"); | |
4287 | err = ext4_journal_get_write_access(handle, bitmap_bh); | |
4288 | if (err) | |
4289 | goto error_return; | |
4290 | ||
4291 | /* | |
4292 | * We are about to modify some metadata. Call the journal APIs | |
4293 | * to unshare ->b_data if a currently-committing transaction is | |
4294 | * using it | |
4295 | */ | |
4296 | BUFFER_TRACE(gd_bh, "get_write_access"); | |
4297 | err = ext4_journal_get_write_access(handle, gd_bh); | |
4298 | if (err) | |
4299 | goto error_return; | |
4300 | ||
4301 | err = ext4_mb_load_buddy(sb, block_group, &e4b); | |
4302 | if (err) | |
4303 | goto error_return; | |
4304 | ||
4305 | #ifdef AGGRESSIVE_CHECK | |
4306 | { | |
4307 | int i; | |
4308 | for (i = 0; i < count; i++) | |
4309 | BUG_ON(!mb_test_bit(bit + i, bitmap_bh->b_data)); | |
4310 | } | |
4311 | #endif | |
4312 | mb_clear_bits(sb_bgl_lock(sbi, block_group), bitmap_bh->b_data, | |
4313 | bit, count); | |
4314 | ||
4315 | /* We dirtied the bitmap block */ | |
4316 | BUFFER_TRACE(bitmap_bh, "dirtied bitmap block"); | |
4317 | err = ext4_journal_dirty_metadata(handle, bitmap_bh); | |
4318 | ||
256bdb49 ES |
4319 | if (ac) { |
4320 | ac->ac_b_ex.fe_group = block_group; | |
4321 | ac->ac_b_ex.fe_start = bit; | |
4322 | ac->ac_b_ex.fe_len = count; | |
4323 | ext4_mb_store_history(ac); | |
4324 | } | |
c9de560d AT |
4325 | |
4326 | if (metadata) { | |
4327 | /* blocks being freed are metadata. these blocks shouldn't | |
4328 | * be used until this transaction is committed */ | |
4329 | ext4_mb_free_metadata(handle, &e4b, block_group, bit, count); | |
4330 | } else { | |
4331 | ext4_lock_group(sb, block_group); | |
4332 | err = mb_free_blocks(inode, &e4b, bit, count); | |
4333 | ext4_mb_return_to_preallocation(inode, &e4b, block, count); | |
4334 | ext4_unlock_group(sb, block_group); | |
4335 | BUG_ON(err != 0); | |
4336 | } | |
4337 | ||
4338 | spin_lock(sb_bgl_lock(sbi, block_group)); | |
e8546d06 | 4339 | le16_add_cpu(&gdp->bg_free_blocks_count, count); |
c9de560d AT |
4340 | gdp->bg_checksum = ext4_group_desc_csum(sbi, block_group, gdp); |
4341 | spin_unlock(sb_bgl_lock(sbi, block_group)); | |
4342 | percpu_counter_add(&sbi->s_freeblocks_counter, count); | |
4343 | ||
4344 | ext4_mb_release_desc(&e4b); | |
4345 | ||
4346 | *freed += count; | |
4347 | ||
4348 | /* And the group descriptor block */ | |
4349 | BUFFER_TRACE(gd_bh, "dirtied group descriptor block"); | |
4350 | ret = ext4_journal_dirty_metadata(handle, gd_bh); | |
4351 | if (!err) | |
4352 | err = ret; | |
4353 | ||
4354 | if (overflow && !err) { | |
4355 | block += count; | |
4356 | count = overflow; | |
4357 | put_bh(bitmap_bh); | |
4358 | goto do_more; | |
4359 | } | |
4360 | sb->s_dirt = 1; | |
4361 | error_return: | |
4362 | brelse(bitmap_bh); | |
4363 | ext4_std_error(sb, err); | |
256bdb49 ES |
4364 | if (ac) |
4365 | kmem_cache_free(ext4_ac_cachep, ac); | |
c9de560d AT |
4366 | return; |
4367 | } |