1c9de560dSAlex Tomas /* 2c9de560dSAlex Tomas * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com 3c9de560dSAlex Tomas * Written by Alex Tomas <alex@clusterfs.com> 4c9de560dSAlex Tomas * 5c9de560dSAlex Tomas * This program is free software; you can redistribute it and/or modify 6c9de560dSAlex Tomas * it under the terms of the GNU General Public License version 2 as 7c9de560dSAlex Tomas * published by the Free Software Foundation. 8c9de560dSAlex Tomas * 9c9de560dSAlex Tomas * This program is distributed in the hope that it will be useful, 10c9de560dSAlex Tomas * but WITHOUT ANY WARRANTY; without even the implied warranty of 11c9de560dSAlex Tomas * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12c9de560dSAlex Tomas * GNU General Public License for more details. 13c9de560dSAlex Tomas * 14c9de560dSAlex Tomas * You should have received a copy of the GNU General Public Licens 15c9de560dSAlex Tomas * along with this program; if not, write to the Free Software 16c9de560dSAlex Tomas * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111- 17c9de560dSAlex Tomas */ 18c9de560dSAlex Tomas 19c9de560dSAlex Tomas 20c9de560dSAlex Tomas /* 21c9de560dSAlex Tomas * mballoc.c contains the multiblocks allocation routines 22c9de560dSAlex Tomas */ 23c9de560dSAlex Tomas 248f6e39a7SMingming Cao #include "mballoc.h" 25c9de560dSAlex Tomas /* 26c9de560dSAlex Tomas * MUSTDO: 27c9de560dSAlex Tomas * - test ext4_ext_search_left() and ext4_ext_search_right() 28c9de560dSAlex Tomas * - search for metadata in few groups 29c9de560dSAlex Tomas * 30c9de560dSAlex Tomas * TODO v4: 31c9de560dSAlex Tomas * - normalization should take into account whether file is still open 32c9de560dSAlex Tomas * - discard preallocations if no free space left (policy?) 33c9de560dSAlex Tomas * - don't normalize tails 34c9de560dSAlex Tomas * - quota 35c9de560dSAlex Tomas * - reservation for superuser 36c9de560dSAlex Tomas * 37c9de560dSAlex Tomas * TODO v3: 38c9de560dSAlex Tomas * - bitmap read-ahead (proposed by Oleg Drokin aka green) 39c9de560dSAlex Tomas * - track min/max extents in each group for better group selection 40c9de560dSAlex Tomas * - mb_mark_used() may allocate chunk right after splitting buddy 41c9de560dSAlex Tomas * - tree of groups sorted by number of free blocks 42c9de560dSAlex Tomas * - error handling 43c9de560dSAlex Tomas */ 44c9de560dSAlex Tomas 45c9de560dSAlex Tomas /* 46c9de560dSAlex Tomas * The allocation request involve request for multiple number of blocks 47c9de560dSAlex Tomas * near to the goal(block) value specified. 48c9de560dSAlex Tomas * 49c9de560dSAlex Tomas * During initialization phase of the allocator we decide to use the group 50c9de560dSAlex Tomas * preallocation or inode preallocation depending on the size file. The 51c9de560dSAlex Tomas * size of the file could be the resulting file size we would have after 52c9de560dSAlex Tomas * allocation or the current file size which ever is larger. If the size is 53c9de560dSAlex Tomas * less that sbi->s_mb_stream_request we select the group 54c9de560dSAlex Tomas * preallocation. The default value of s_mb_stream_request is 16 55c9de560dSAlex Tomas * blocks. This can also be tuned via 56c9de560dSAlex Tomas * /proc/fs/ext4/<partition>/stream_req. The value is represented in terms 57c9de560dSAlex Tomas * of number of blocks. 58c9de560dSAlex Tomas * 59c9de560dSAlex Tomas * The main motivation for having small file use group preallocation is to 60c9de560dSAlex Tomas * ensure that we have small file closer in the disk. 61c9de560dSAlex Tomas * 62c9de560dSAlex Tomas * First stage the allocator looks at the inode prealloc list 63c9de560dSAlex Tomas * ext4_inode_info->i_prealloc_list contain list of prealloc spaces for 64c9de560dSAlex Tomas * this particular inode. The inode prealloc space is represented as: 65c9de560dSAlex Tomas * 66c9de560dSAlex Tomas * pa_lstart -> the logical start block for this prealloc space 67c9de560dSAlex Tomas * pa_pstart -> the physical start block for this prealloc space 68c9de560dSAlex Tomas * pa_len -> lenght for this prealloc space 69c9de560dSAlex Tomas * pa_free -> free space available in this prealloc space 70c9de560dSAlex Tomas * 71c9de560dSAlex Tomas * The inode preallocation space is used looking at the _logical_ start 72c9de560dSAlex Tomas * block. If only the logical file block falls within the range of prealloc 73c9de560dSAlex Tomas * space we will consume the particular prealloc space. This make sure that 74c9de560dSAlex Tomas * that the we have contiguous physical blocks representing the file blocks 75c9de560dSAlex Tomas * 76c9de560dSAlex Tomas * The important thing to be noted in case of inode prealloc space is that 77c9de560dSAlex Tomas * we don't modify the values associated to inode prealloc space except 78c9de560dSAlex Tomas * pa_free. 79c9de560dSAlex Tomas * 80c9de560dSAlex Tomas * If we are not able to find blocks in the inode prealloc space and if we 81c9de560dSAlex Tomas * have the group allocation flag set then we look at the locality group 82c9de560dSAlex Tomas * prealloc space. These are per CPU prealloc list repreasented as 83c9de560dSAlex Tomas * 84c9de560dSAlex Tomas * ext4_sb_info.s_locality_groups[smp_processor_id()] 85c9de560dSAlex Tomas * 86c9de560dSAlex Tomas * The reason for having a per cpu locality group is to reduce the contention 87c9de560dSAlex Tomas * between CPUs. It is possible to get scheduled at this point. 88c9de560dSAlex Tomas * 89c9de560dSAlex Tomas * The locality group prealloc space is used looking at whether we have 90c9de560dSAlex Tomas * enough free space (pa_free) withing the prealloc space. 91c9de560dSAlex Tomas * 92c9de560dSAlex Tomas * If we can't allocate blocks via inode prealloc or/and locality group 93c9de560dSAlex Tomas * prealloc then we look at the buddy cache. The buddy cache is represented 94c9de560dSAlex Tomas * by ext4_sb_info.s_buddy_cache (struct inode) whose file offset gets 95c9de560dSAlex Tomas * mapped to the buddy and bitmap information regarding different 96c9de560dSAlex Tomas * groups. The buddy information is attached to buddy cache inode so that 97c9de560dSAlex Tomas * we can access them through the page cache. The information regarding 98c9de560dSAlex Tomas * each group is loaded via ext4_mb_load_buddy. The information involve 99c9de560dSAlex Tomas * block bitmap and buddy information. The information are stored in the 100c9de560dSAlex Tomas * inode as: 101c9de560dSAlex Tomas * 102c9de560dSAlex Tomas * { page } 103c9de560dSAlex Tomas * [ group 0 buddy][ group 0 bitmap] [group 1][ group 1]... 104c9de560dSAlex Tomas * 105c9de560dSAlex Tomas * 106c9de560dSAlex Tomas * one block each for bitmap and buddy information. So for each group we 107c9de560dSAlex Tomas * take up 2 blocks. A page can contain blocks_per_page (PAGE_CACHE_SIZE / 108c9de560dSAlex Tomas * blocksize) blocks. So it can have information regarding groups_per_page 109c9de560dSAlex Tomas * which is blocks_per_page/2 110c9de560dSAlex Tomas * 111c9de560dSAlex Tomas * The buddy cache inode is not stored on disk. The inode is thrown 112c9de560dSAlex Tomas * away when the filesystem is unmounted. 113c9de560dSAlex Tomas * 114c9de560dSAlex Tomas * We look for count number of blocks in the buddy cache. If we were able 115c9de560dSAlex Tomas * to locate that many free blocks we return with additional information 116c9de560dSAlex Tomas * regarding rest of the contiguous physical block available 117c9de560dSAlex Tomas * 118c9de560dSAlex Tomas * Before allocating blocks via buddy cache we normalize the request 119c9de560dSAlex Tomas * blocks. This ensure we ask for more blocks that we needed. The extra 120c9de560dSAlex Tomas * blocks that we get after allocation is added to the respective prealloc 121c9de560dSAlex Tomas * list. In case of inode preallocation we follow a list of heuristics 122c9de560dSAlex Tomas * based on file size. This can be found in ext4_mb_normalize_request. If 123c9de560dSAlex Tomas * we are doing a group prealloc we try to normalize the request to 124c9de560dSAlex Tomas * sbi->s_mb_group_prealloc. Default value of s_mb_group_prealloc is set to 125c9de560dSAlex Tomas * 512 blocks. This can be tuned via 126c9de560dSAlex Tomas * /proc/fs/ext4/<partition/group_prealloc. The value is represented in 127c9de560dSAlex Tomas * terms of number of blocks. If we have mounted the file system with -O 128c9de560dSAlex Tomas * stripe=<value> option the group prealloc request is normalized to the 129c9de560dSAlex Tomas * stripe value (sbi->s_stripe) 130c9de560dSAlex Tomas * 131c9de560dSAlex Tomas * The regular allocator(using the buddy cache) support few tunables. 132c9de560dSAlex Tomas * 133c9de560dSAlex Tomas * /proc/fs/ext4/<partition>/min_to_scan 134c9de560dSAlex Tomas * /proc/fs/ext4/<partition>/max_to_scan 135c9de560dSAlex Tomas * /proc/fs/ext4/<partition>/order2_req 136c9de560dSAlex Tomas * 137c9de560dSAlex Tomas * The regular allocator use buddy scan only if the request len is power of 138c9de560dSAlex Tomas * 2 blocks and the order of allocation is >= sbi->s_mb_order2_reqs. The 139c9de560dSAlex Tomas * value of s_mb_order2_reqs can be tuned via 140c9de560dSAlex Tomas * /proc/fs/ext4/<partition>/order2_req. If the request len is equal to 141c9de560dSAlex Tomas * stripe size (sbi->s_stripe), we try to search for contigous block in 142c9de560dSAlex Tomas * stripe size. This should result in better allocation on RAID setup. If 143c9de560dSAlex Tomas * not we search in the specific group using bitmap for best extents. The 144c9de560dSAlex Tomas * tunable min_to_scan and max_to_scan controll the behaviour here. 145c9de560dSAlex Tomas * min_to_scan indicate how long the mballoc __must__ look for a best 146c9de560dSAlex Tomas * extent and max_to_scanindicate how long the mballoc __can__ look for a 147c9de560dSAlex Tomas * best extent in the found extents. Searching for the blocks starts with 148c9de560dSAlex Tomas * the group specified as the goal value in allocation context via 149c9de560dSAlex Tomas * ac_g_ex. Each group is first checked based on the criteria whether it 150c9de560dSAlex Tomas * can used for allocation. ext4_mb_good_group explains how the groups are 151c9de560dSAlex Tomas * checked. 152c9de560dSAlex Tomas * 153c9de560dSAlex Tomas * Both the prealloc space are getting populated as above. So for the first 154c9de560dSAlex Tomas * request we will hit the buddy cache which will result in this prealloc 155c9de560dSAlex Tomas * space getting filled. The prealloc space is then later used for the 156c9de560dSAlex Tomas * subsequent request. 157c9de560dSAlex Tomas */ 158c9de560dSAlex Tomas 159c9de560dSAlex Tomas /* 160c9de560dSAlex Tomas * mballoc operates on the following data: 161c9de560dSAlex Tomas * - on-disk bitmap 162c9de560dSAlex Tomas * - in-core buddy (actually includes buddy and bitmap) 163c9de560dSAlex Tomas * - preallocation descriptors (PAs) 164c9de560dSAlex Tomas * 165c9de560dSAlex Tomas * there are two types of preallocations: 166c9de560dSAlex Tomas * - inode 167c9de560dSAlex Tomas * assiged to specific inode and can be used for this inode only. 168c9de560dSAlex Tomas * it describes part of inode's space preallocated to specific 169c9de560dSAlex Tomas * physical blocks. any block from that preallocated can be used 170c9de560dSAlex Tomas * independent. the descriptor just tracks number of blocks left 171c9de560dSAlex Tomas * unused. so, before taking some block from descriptor, one must 172c9de560dSAlex Tomas * make sure corresponded logical block isn't allocated yet. this 173c9de560dSAlex Tomas * also means that freeing any block within descriptor's range 174c9de560dSAlex Tomas * must discard all preallocated blocks. 175c9de560dSAlex Tomas * - locality group 176c9de560dSAlex Tomas * assigned to specific locality group which does not translate to 177c9de560dSAlex Tomas * permanent set of inodes: inode can join and leave group. space 178c9de560dSAlex Tomas * from this type of preallocation can be used for any inode. thus 179c9de560dSAlex Tomas * it's consumed from the beginning to the end. 180c9de560dSAlex Tomas * 181c9de560dSAlex Tomas * relation between them can be expressed as: 182c9de560dSAlex Tomas * in-core buddy = on-disk bitmap + preallocation descriptors 183c9de560dSAlex Tomas * 184c9de560dSAlex Tomas * this mean blocks mballoc considers used are: 185c9de560dSAlex Tomas * - allocated blocks (persistent) 186c9de560dSAlex Tomas * - preallocated blocks (non-persistent) 187c9de560dSAlex Tomas * 188c9de560dSAlex Tomas * consistency in mballoc world means that at any time a block is either 189c9de560dSAlex Tomas * free or used in ALL structures. notice: "any time" should not be read 190c9de560dSAlex Tomas * literally -- time is discrete and delimited by locks. 191c9de560dSAlex Tomas * 192c9de560dSAlex Tomas * to keep it simple, we don't use block numbers, instead we count number of 193c9de560dSAlex Tomas * blocks: how many blocks marked used/free in on-disk bitmap, buddy and PA. 194c9de560dSAlex Tomas * 195c9de560dSAlex Tomas * all operations can be expressed as: 196c9de560dSAlex Tomas * - init buddy: buddy = on-disk + PAs 197c9de560dSAlex Tomas * - new PA: buddy += N; PA = N 198c9de560dSAlex Tomas * - use inode PA: on-disk += N; PA -= N 199c9de560dSAlex Tomas * - discard inode PA buddy -= on-disk - PA; PA = 0 200c9de560dSAlex Tomas * - use locality group PA on-disk += N; PA -= N 201c9de560dSAlex Tomas * - discard locality group PA buddy -= PA; PA = 0 202c9de560dSAlex Tomas * note: 'buddy -= on-disk - PA' is used to show that on-disk bitmap 203c9de560dSAlex Tomas * is used in real operation because we can't know actual used 204c9de560dSAlex Tomas * bits from PA, only from on-disk bitmap 205c9de560dSAlex Tomas * 206c9de560dSAlex Tomas * if we follow this strict logic, then all operations above should be atomic. 207c9de560dSAlex Tomas * given some of them can block, we'd have to use something like semaphores 208c9de560dSAlex Tomas * killing performance on high-end SMP hardware. let's try to relax it using 209c9de560dSAlex Tomas * the following knowledge: 210c9de560dSAlex Tomas * 1) if buddy is referenced, it's already initialized 211c9de560dSAlex Tomas * 2) while block is used in buddy and the buddy is referenced, 212c9de560dSAlex Tomas * nobody can re-allocate that block 213c9de560dSAlex Tomas * 3) we work on bitmaps and '+' actually means 'set bits'. if on-disk has 214c9de560dSAlex Tomas * bit set and PA claims same block, it's OK. IOW, one can set bit in 215c9de560dSAlex Tomas * on-disk bitmap if buddy has same bit set or/and PA covers corresponded 216c9de560dSAlex Tomas * block 217c9de560dSAlex Tomas * 218c9de560dSAlex Tomas * so, now we're building a concurrency table: 219c9de560dSAlex Tomas * - init buddy vs. 220c9de560dSAlex Tomas * - new PA 221c9de560dSAlex Tomas * blocks for PA are allocated in the buddy, buddy must be referenced 222c9de560dSAlex Tomas * until PA is linked to allocation group to avoid concurrent buddy init 223c9de560dSAlex Tomas * - use inode PA 224c9de560dSAlex Tomas * we need to make sure that either on-disk bitmap or PA has uptodate data 225c9de560dSAlex Tomas * given (3) we care that PA-=N operation doesn't interfere with init 226c9de560dSAlex Tomas * - discard inode PA 227c9de560dSAlex Tomas * the simplest way would be to have buddy initialized by the discard 228c9de560dSAlex Tomas * - use locality group PA 229c9de560dSAlex Tomas * again PA-=N must be serialized with init 230c9de560dSAlex Tomas * - discard locality group PA 231c9de560dSAlex Tomas * the simplest way would be to have buddy initialized by the discard 232c9de560dSAlex Tomas * - new PA vs. 233c9de560dSAlex Tomas * - use inode PA 234c9de560dSAlex Tomas * i_data_sem serializes them 235c9de560dSAlex Tomas * - discard inode PA 236c9de560dSAlex Tomas * discard process must wait until PA isn't used by another process 237c9de560dSAlex Tomas * - use locality group PA 238c9de560dSAlex Tomas * some mutex should serialize them 239c9de560dSAlex Tomas * - discard locality group PA 240c9de560dSAlex Tomas * discard process must wait until PA isn't used by another process 241c9de560dSAlex Tomas * - use inode PA 242c9de560dSAlex Tomas * - use inode PA 243c9de560dSAlex Tomas * i_data_sem or another mutex should serializes them 244c9de560dSAlex Tomas * - discard inode PA 245c9de560dSAlex Tomas * discard process must wait until PA isn't used by another process 246c9de560dSAlex Tomas * - use locality group PA 247c9de560dSAlex Tomas * nothing wrong here -- they're different PAs covering different blocks 248c9de560dSAlex Tomas * - discard locality group PA 249c9de560dSAlex Tomas * discard process must wait until PA isn't used by another process 250c9de560dSAlex Tomas * 251c9de560dSAlex Tomas * now we're ready to make few consequences: 252c9de560dSAlex Tomas * - PA is referenced and while it is no discard is possible 253c9de560dSAlex Tomas * - PA is referenced until block isn't marked in on-disk bitmap 254c9de560dSAlex Tomas * - PA changes only after on-disk bitmap 255c9de560dSAlex Tomas * - discard must not compete with init. either init is done before 256c9de560dSAlex Tomas * any discard or they're serialized somehow 257c9de560dSAlex Tomas * - buddy init as sum of on-disk bitmap and PAs is done atomically 258c9de560dSAlex Tomas * 259c9de560dSAlex Tomas * a special case when we've used PA to emptiness. no need to modify buddy 260c9de560dSAlex Tomas * in this case, but we should care about concurrent init 261c9de560dSAlex Tomas * 262c9de560dSAlex Tomas */ 263c9de560dSAlex Tomas 264c9de560dSAlex Tomas /* 265c9de560dSAlex Tomas * Logic in few words: 266c9de560dSAlex Tomas * 267c9de560dSAlex Tomas * - allocation: 268c9de560dSAlex Tomas * load group 269c9de560dSAlex Tomas * find blocks 270c9de560dSAlex Tomas * mark bits in on-disk bitmap 271c9de560dSAlex Tomas * release group 272c9de560dSAlex Tomas * 273c9de560dSAlex Tomas * - use preallocation: 274c9de560dSAlex Tomas * find proper PA (per-inode or group) 275c9de560dSAlex Tomas * load group 276c9de560dSAlex Tomas * mark bits in on-disk bitmap 277c9de560dSAlex Tomas * release group 278c9de560dSAlex Tomas * release PA 279c9de560dSAlex Tomas * 280c9de560dSAlex Tomas * - free: 281c9de560dSAlex Tomas * load group 282c9de560dSAlex Tomas * mark bits in on-disk bitmap 283c9de560dSAlex Tomas * release group 284c9de560dSAlex Tomas * 285c9de560dSAlex Tomas * - discard preallocations in group: 286c9de560dSAlex Tomas * mark PAs deleted 287c9de560dSAlex Tomas * move them onto local list 288c9de560dSAlex Tomas * load on-disk bitmap 289c9de560dSAlex Tomas * load group 290c9de560dSAlex Tomas * remove PA from object (inode or locality group) 291c9de560dSAlex Tomas * mark free blocks in-core 292c9de560dSAlex Tomas * 293c9de560dSAlex Tomas * - discard inode's preallocations: 294c9de560dSAlex Tomas */ 295c9de560dSAlex Tomas 296c9de560dSAlex Tomas /* 297c9de560dSAlex Tomas * Locking rules 298c9de560dSAlex Tomas * 299c9de560dSAlex Tomas * Locks: 300c9de560dSAlex Tomas * - bitlock on a group (group) 301c9de560dSAlex Tomas * - object (inode/locality) (object) 302c9de560dSAlex Tomas * - per-pa lock (pa) 303c9de560dSAlex Tomas * 304c9de560dSAlex Tomas * Paths: 305c9de560dSAlex Tomas * - new pa 306c9de560dSAlex Tomas * object 307c9de560dSAlex Tomas * group 308c9de560dSAlex Tomas * 309c9de560dSAlex Tomas * - find and use pa: 310c9de560dSAlex Tomas * pa 311c9de560dSAlex Tomas * 312c9de560dSAlex Tomas * - release consumed pa: 313c9de560dSAlex Tomas * pa 314c9de560dSAlex Tomas * group 315c9de560dSAlex Tomas * object 316c9de560dSAlex Tomas * 317c9de560dSAlex Tomas * - generate in-core bitmap: 318c9de560dSAlex Tomas * group 319c9de560dSAlex Tomas * pa 320c9de560dSAlex Tomas * 321c9de560dSAlex Tomas * - discard all for given object (inode, locality group): 322c9de560dSAlex Tomas * object 323c9de560dSAlex Tomas * pa 324c9de560dSAlex Tomas * group 325c9de560dSAlex Tomas * 326c9de560dSAlex Tomas * - discard all for given group: 327c9de560dSAlex Tomas * group 328c9de560dSAlex Tomas * pa 329c9de560dSAlex Tomas * group 330c9de560dSAlex Tomas * object 331c9de560dSAlex Tomas * 332c9de560dSAlex Tomas */ 333c9de560dSAlex Tomas 334ffad0a44SAneesh Kumar K.V static inline void *mb_correct_addr_and_bit(int *bit, void *addr) 335ffad0a44SAneesh Kumar K.V { 336c9de560dSAlex Tomas #if BITS_PER_LONG == 64 337ffad0a44SAneesh Kumar K.V *bit += ((unsigned long) addr & 7UL) << 3; 338ffad0a44SAneesh Kumar K.V addr = (void *) ((unsigned long) addr & ~7UL); 339c9de560dSAlex Tomas #elif BITS_PER_LONG == 32 340ffad0a44SAneesh Kumar K.V *bit += ((unsigned long) addr & 3UL) << 3; 341ffad0a44SAneesh Kumar K.V addr = (void *) ((unsigned long) addr & ~3UL); 342c9de560dSAlex Tomas #else 343c9de560dSAlex Tomas #error "how many bits you are?!" 344c9de560dSAlex Tomas #endif 345ffad0a44SAneesh Kumar K.V return addr; 346ffad0a44SAneesh Kumar K.V } 347c9de560dSAlex Tomas 348c9de560dSAlex Tomas static inline int mb_test_bit(int bit, void *addr) 349c9de560dSAlex Tomas { 350c9de560dSAlex Tomas /* 351c9de560dSAlex Tomas * ext4_test_bit on architecture like powerpc 352c9de560dSAlex Tomas * needs unsigned long aligned address 353c9de560dSAlex Tomas */ 354ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&bit, addr); 355c9de560dSAlex Tomas return ext4_test_bit(bit, addr); 356c9de560dSAlex Tomas } 357c9de560dSAlex Tomas 358c9de560dSAlex Tomas static inline void mb_set_bit(int bit, void *addr) 359c9de560dSAlex Tomas { 360ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&bit, addr); 361c9de560dSAlex Tomas ext4_set_bit(bit, addr); 362c9de560dSAlex Tomas } 363c9de560dSAlex Tomas 364c9de560dSAlex Tomas static inline void mb_set_bit_atomic(spinlock_t *lock, int bit, void *addr) 365c9de560dSAlex Tomas { 366ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&bit, addr); 367c9de560dSAlex Tomas ext4_set_bit_atomic(lock, bit, addr); 368c9de560dSAlex Tomas } 369c9de560dSAlex Tomas 370c9de560dSAlex Tomas static inline void mb_clear_bit(int bit, void *addr) 371c9de560dSAlex Tomas { 372ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&bit, addr); 373c9de560dSAlex Tomas ext4_clear_bit(bit, addr); 374c9de560dSAlex Tomas } 375c9de560dSAlex Tomas 376c9de560dSAlex Tomas static inline void mb_clear_bit_atomic(spinlock_t *lock, int bit, void *addr) 377c9de560dSAlex Tomas { 378ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&bit, addr); 379c9de560dSAlex Tomas ext4_clear_bit_atomic(lock, bit, addr); 380c9de560dSAlex Tomas } 381c9de560dSAlex Tomas 382ffad0a44SAneesh Kumar K.V static inline int mb_find_next_zero_bit(void *addr, int max, int start) 383ffad0a44SAneesh Kumar K.V { 384e7dfb246SAneesh Kumar K.V int fix = 0, ret, tmpmax; 385ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&fix, addr); 386e7dfb246SAneesh Kumar K.V tmpmax = max + fix; 387ffad0a44SAneesh Kumar K.V start += fix; 388ffad0a44SAneesh Kumar K.V 389e7dfb246SAneesh Kumar K.V ret = ext4_find_next_zero_bit(addr, tmpmax, start) - fix; 390e7dfb246SAneesh Kumar K.V if (ret > max) 391e7dfb246SAneesh Kumar K.V return max; 392e7dfb246SAneesh Kumar K.V return ret; 393ffad0a44SAneesh Kumar K.V } 394ffad0a44SAneesh Kumar K.V 395ffad0a44SAneesh Kumar K.V static inline int mb_find_next_bit(void *addr, int max, int start) 396ffad0a44SAneesh Kumar K.V { 397e7dfb246SAneesh Kumar K.V int fix = 0, ret, tmpmax; 398ffad0a44SAneesh Kumar K.V addr = mb_correct_addr_and_bit(&fix, addr); 399e7dfb246SAneesh Kumar K.V tmpmax = max + fix; 400ffad0a44SAneesh Kumar K.V start += fix; 401ffad0a44SAneesh Kumar K.V 402e7dfb246SAneesh Kumar K.V ret = ext4_find_next_bit(addr, tmpmax, start) - fix; 403e7dfb246SAneesh Kumar K.V if (ret > max) 404e7dfb246SAneesh Kumar K.V return max; 405e7dfb246SAneesh Kumar K.V return ret; 406ffad0a44SAneesh Kumar K.V } 407ffad0a44SAneesh Kumar K.V 408c9de560dSAlex Tomas static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max) 409c9de560dSAlex Tomas { 410c9de560dSAlex Tomas char *bb; 411c9de560dSAlex Tomas 412c9de560dSAlex Tomas BUG_ON(EXT4_MB_BITMAP(e4b) == EXT4_MB_BUDDY(e4b)); 413c9de560dSAlex Tomas BUG_ON(max == NULL); 414c9de560dSAlex Tomas 415c9de560dSAlex Tomas if (order > e4b->bd_blkbits + 1) { 416c9de560dSAlex Tomas *max = 0; 417c9de560dSAlex Tomas return NULL; 418c9de560dSAlex Tomas } 419c9de560dSAlex Tomas 420c9de560dSAlex Tomas /* at order 0 we see each particular block */ 421c9de560dSAlex Tomas *max = 1 << (e4b->bd_blkbits + 3); 422c9de560dSAlex Tomas if (order == 0) 423c9de560dSAlex Tomas return EXT4_MB_BITMAP(e4b); 424c9de560dSAlex Tomas 425c9de560dSAlex Tomas bb = EXT4_MB_BUDDY(e4b) + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order]; 426c9de560dSAlex Tomas *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order]; 427c9de560dSAlex Tomas 428c9de560dSAlex Tomas return bb; 429c9de560dSAlex Tomas } 430c9de560dSAlex Tomas 431c9de560dSAlex Tomas #ifdef DOUBLE_CHECK 432c9de560dSAlex Tomas static void mb_free_blocks_double(struct inode *inode, struct ext4_buddy *e4b, 433c9de560dSAlex Tomas int first, int count) 434c9de560dSAlex Tomas { 435c9de560dSAlex Tomas int i; 436c9de560dSAlex Tomas struct super_block *sb = e4b->bd_sb; 437c9de560dSAlex Tomas 438c9de560dSAlex Tomas if (unlikely(e4b->bd_info->bb_bitmap == NULL)) 439c9de560dSAlex Tomas return; 440c9de560dSAlex Tomas BUG_ON(!ext4_is_group_locked(sb, e4b->bd_group)); 441c9de560dSAlex Tomas for (i = 0; i < count; i++) { 442c9de560dSAlex Tomas if (!mb_test_bit(first + i, e4b->bd_info->bb_bitmap)) { 443c9de560dSAlex Tomas ext4_fsblk_t blocknr; 444c9de560dSAlex Tomas blocknr = e4b->bd_group * EXT4_BLOCKS_PER_GROUP(sb); 445c9de560dSAlex Tomas blocknr += first + i; 446c9de560dSAlex Tomas blocknr += 447c9de560dSAlex Tomas le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block); 448c9de560dSAlex Tomas 44946e665e9SHarvey Harrison ext4_error(sb, __func__, "double-free of inode" 450c9de560dSAlex Tomas " %lu's block %llu(bit %u in group %lu)\n", 451c9de560dSAlex Tomas inode ? inode->i_ino : 0, blocknr, 452c9de560dSAlex Tomas first + i, e4b->bd_group); 453c9de560dSAlex Tomas } 454c9de560dSAlex Tomas mb_clear_bit(first + i, e4b->bd_info->bb_bitmap); 455c9de560dSAlex Tomas } 456c9de560dSAlex Tomas } 457c9de560dSAlex Tomas 458c9de560dSAlex Tomas static void mb_mark_used_double(struct ext4_buddy *e4b, int first, int count) 459c9de560dSAlex Tomas { 460c9de560dSAlex Tomas int i; 461c9de560dSAlex Tomas 462c9de560dSAlex Tomas if (unlikely(e4b->bd_info->bb_bitmap == NULL)) 463c9de560dSAlex Tomas return; 464c9de560dSAlex Tomas BUG_ON(!ext4_is_group_locked(e4b->bd_sb, e4b->bd_group)); 465c9de560dSAlex Tomas for (i = 0; i < count; i++) { 466c9de560dSAlex Tomas BUG_ON(mb_test_bit(first + i, e4b->bd_info->bb_bitmap)); 467c9de560dSAlex Tomas mb_set_bit(first + i, e4b->bd_info->bb_bitmap); 468c9de560dSAlex Tomas } 469c9de560dSAlex Tomas } 470c9de560dSAlex Tomas 471c9de560dSAlex Tomas static void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap) 472c9de560dSAlex Tomas { 473c9de560dSAlex Tomas if (memcmp(e4b->bd_info->bb_bitmap, bitmap, e4b->bd_sb->s_blocksize)) { 474c9de560dSAlex Tomas unsigned char *b1, *b2; 475c9de560dSAlex Tomas int i; 476c9de560dSAlex Tomas b1 = (unsigned char *) e4b->bd_info->bb_bitmap; 477c9de560dSAlex Tomas b2 = (unsigned char *) bitmap; 478c9de560dSAlex Tomas for (i = 0; i < e4b->bd_sb->s_blocksize; i++) { 479c9de560dSAlex Tomas if (b1[i] != b2[i]) { 4804776004fSTheodore Ts'o printk(KERN_ERR "corruption in group %lu " 4814776004fSTheodore Ts'o "at byte %u(%u): %x in copy != %x " 4824776004fSTheodore Ts'o "on disk/prealloc\n", 483c9de560dSAlex Tomas e4b->bd_group, i, i * 8, b1[i], b2[i]); 484c9de560dSAlex Tomas BUG(); 485c9de560dSAlex Tomas } 486c9de560dSAlex Tomas } 487c9de560dSAlex Tomas } 488c9de560dSAlex Tomas } 489c9de560dSAlex Tomas 490c9de560dSAlex Tomas #else 491c9de560dSAlex Tomas static inline void mb_free_blocks_double(struct inode *inode, 492c9de560dSAlex Tomas struct ext4_buddy *e4b, int first, int count) 493c9de560dSAlex Tomas { 494c9de560dSAlex Tomas return; 495c9de560dSAlex Tomas } 496c9de560dSAlex Tomas static inline void mb_mark_used_double(struct ext4_buddy *e4b, 497c9de560dSAlex Tomas int first, int count) 498c9de560dSAlex Tomas { 499c9de560dSAlex Tomas return; 500c9de560dSAlex Tomas } 501c9de560dSAlex Tomas static inline void mb_cmp_bitmaps(struct ext4_buddy *e4b, void *bitmap) 502c9de560dSAlex Tomas { 503c9de560dSAlex Tomas return; 504c9de560dSAlex Tomas } 505c9de560dSAlex Tomas #endif 506c9de560dSAlex Tomas 507c9de560dSAlex Tomas #ifdef AGGRESSIVE_CHECK 508c9de560dSAlex Tomas 509c9de560dSAlex Tomas #define MB_CHECK_ASSERT(assert) \ 510c9de560dSAlex Tomas do { \ 511c9de560dSAlex Tomas if (!(assert)) { \ 512c9de560dSAlex Tomas printk(KERN_EMERG \ 513c9de560dSAlex Tomas "Assertion failure in %s() at %s:%d: \"%s\"\n", \ 514c9de560dSAlex Tomas function, file, line, # assert); \ 515c9de560dSAlex Tomas BUG(); \ 516c9de560dSAlex Tomas } \ 517c9de560dSAlex Tomas } while (0) 518c9de560dSAlex Tomas 519c9de560dSAlex Tomas static int __mb_check_buddy(struct ext4_buddy *e4b, char *file, 520c9de560dSAlex Tomas const char *function, int line) 521c9de560dSAlex Tomas { 522c9de560dSAlex Tomas struct super_block *sb = e4b->bd_sb; 523c9de560dSAlex Tomas int order = e4b->bd_blkbits + 1; 524c9de560dSAlex Tomas int max; 525c9de560dSAlex Tomas int max2; 526c9de560dSAlex Tomas int i; 527c9de560dSAlex Tomas int j; 528c9de560dSAlex Tomas int k; 529c9de560dSAlex Tomas int count; 530c9de560dSAlex Tomas struct ext4_group_info *grp; 531c9de560dSAlex Tomas int fragments = 0; 532c9de560dSAlex Tomas int fstart; 533c9de560dSAlex Tomas struct list_head *cur; 534c9de560dSAlex Tomas void *buddy; 535c9de560dSAlex Tomas void *buddy2; 536c9de560dSAlex Tomas 537c9de560dSAlex Tomas { 538c9de560dSAlex Tomas static int mb_check_counter; 539c9de560dSAlex Tomas if (mb_check_counter++ % 100 != 0) 540c9de560dSAlex Tomas return 0; 541c9de560dSAlex Tomas } 542c9de560dSAlex Tomas 543c9de560dSAlex Tomas while (order > 1) { 544c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, order, &max); 545c9de560dSAlex Tomas MB_CHECK_ASSERT(buddy); 546c9de560dSAlex Tomas buddy2 = mb_find_buddy(e4b, order - 1, &max2); 547c9de560dSAlex Tomas MB_CHECK_ASSERT(buddy2); 548c9de560dSAlex Tomas MB_CHECK_ASSERT(buddy != buddy2); 549c9de560dSAlex Tomas MB_CHECK_ASSERT(max * 2 == max2); 550c9de560dSAlex Tomas 551c9de560dSAlex Tomas count = 0; 552c9de560dSAlex Tomas for (i = 0; i < max; i++) { 553c9de560dSAlex Tomas 554c9de560dSAlex Tomas if (mb_test_bit(i, buddy)) { 555c9de560dSAlex Tomas /* only single bit in buddy2 may be 1 */ 556c9de560dSAlex Tomas if (!mb_test_bit(i << 1, buddy2)) { 557c9de560dSAlex Tomas MB_CHECK_ASSERT( 558c9de560dSAlex Tomas mb_test_bit((i<<1)+1, buddy2)); 559c9de560dSAlex Tomas } else if (!mb_test_bit((i << 1) + 1, buddy2)) { 560c9de560dSAlex Tomas MB_CHECK_ASSERT( 561c9de560dSAlex Tomas mb_test_bit(i << 1, buddy2)); 562c9de560dSAlex Tomas } 563c9de560dSAlex Tomas continue; 564c9de560dSAlex Tomas } 565c9de560dSAlex Tomas 566c9de560dSAlex Tomas /* both bits in buddy2 must be 0 */ 567c9de560dSAlex Tomas MB_CHECK_ASSERT(mb_test_bit(i << 1, buddy2)); 568c9de560dSAlex Tomas MB_CHECK_ASSERT(mb_test_bit((i << 1) + 1, buddy2)); 569c9de560dSAlex Tomas 570c9de560dSAlex Tomas for (j = 0; j < (1 << order); j++) { 571c9de560dSAlex Tomas k = (i * (1 << order)) + j; 572c9de560dSAlex Tomas MB_CHECK_ASSERT( 573c9de560dSAlex Tomas !mb_test_bit(k, EXT4_MB_BITMAP(e4b))); 574c9de560dSAlex Tomas } 575c9de560dSAlex Tomas count++; 576c9de560dSAlex Tomas } 577c9de560dSAlex Tomas MB_CHECK_ASSERT(e4b->bd_info->bb_counters[order] == count); 578c9de560dSAlex Tomas order--; 579c9de560dSAlex Tomas } 580c9de560dSAlex Tomas 581c9de560dSAlex Tomas fstart = -1; 582c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, 0, &max); 583c9de560dSAlex Tomas for (i = 0; i < max; i++) { 584c9de560dSAlex Tomas if (!mb_test_bit(i, buddy)) { 585c9de560dSAlex Tomas MB_CHECK_ASSERT(i >= e4b->bd_info->bb_first_free); 586c9de560dSAlex Tomas if (fstart == -1) { 587c9de560dSAlex Tomas fragments++; 588c9de560dSAlex Tomas fstart = i; 589c9de560dSAlex Tomas } 590c9de560dSAlex Tomas continue; 591c9de560dSAlex Tomas } 592c9de560dSAlex Tomas fstart = -1; 593c9de560dSAlex Tomas /* check used bits only */ 594c9de560dSAlex Tomas for (j = 0; j < e4b->bd_blkbits + 1; j++) { 595c9de560dSAlex Tomas buddy2 = mb_find_buddy(e4b, j, &max2); 596c9de560dSAlex Tomas k = i >> j; 597c9de560dSAlex Tomas MB_CHECK_ASSERT(k < max2); 598c9de560dSAlex Tomas MB_CHECK_ASSERT(mb_test_bit(k, buddy2)); 599c9de560dSAlex Tomas } 600c9de560dSAlex Tomas } 601c9de560dSAlex Tomas MB_CHECK_ASSERT(!EXT4_MB_GRP_NEED_INIT(e4b->bd_info)); 602c9de560dSAlex Tomas MB_CHECK_ASSERT(e4b->bd_info->bb_fragments == fragments); 603c9de560dSAlex Tomas 604c9de560dSAlex Tomas grp = ext4_get_group_info(sb, e4b->bd_group); 605c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, 0, &max); 606c9de560dSAlex Tomas list_for_each(cur, &grp->bb_prealloc_list) { 607c9de560dSAlex Tomas ext4_group_t groupnr; 608c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 60960bd63d1SSolofo Ramangalahy pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); 61060bd63d1SSolofo Ramangalahy ext4_get_group_no_and_offset(sb, pa->pa_pstart, &groupnr, &k); 611c9de560dSAlex Tomas MB_CHECK_ASSERT(groupnr == e4b->bd_group); 61260bd63d1SSolofo Ramangalahy for (i = 0; i < pa->pa_len; i++) 613c9de560dSAlex Tomas MB_CHECK_ASSERT(mb_test_bit(k + i, buddy)); 614c9de560dSAlex Tomas } 615c9de560dSAlex Tomas return 0; 616c9de560dSAlex Tomas } 617c9de560dSAlex Tomas #undef MB_CHECK_ASSERT 618c9de560dSAlex Tomas #define mb_check_buddy(e4b) __mb_check_buddy(e4b, \ 61946e665e9SHarvey Harrison __FILE__, __func__, __LINE__) 620c9de560dSAlex Tomas #else 621c9de560dSAlex Tomas #define mb_check_buddy(e4b) 622c9de560dSAlex Tomas #endif 623c9de560dSAlex Tomas 624c9de560dSAlex Tomas /* FIXME!! need more doc */ 625c9de560dSAlex Tomas static void ext4_mb_mark_free_simple(struct super_block *sb, 626c9de560dSAlex Tomas void *buddy, unsigned first, int len, 627c9de560dSAlex Tomas struct ext4_group_info *grp) 628c9de560dSAlex Tomas { 629c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 630c9de560dSAlex Tomas unsigned short min; 631c9de560dSAlex Tomas unsigned short max; 632c9de560dSAlex Tomas unsigned short chunk; 633c9de560dSAlex Tomas unsigned short border; 634c9de560dSAlex Tomas 635b73fce69SValerie Clement BUG_ON(len > EXT4_BLOCKS_PER_GROUP(sb)); 636c9de560dSAlex Tomas 637c9de560dSAlex Tomas border = 2 << sb->s_blocksize_bits; 638c9de560dSAlex Tomas 639c9de560dSAlex Tomas while (len > 0) { 640c9de560dSAlex Tomas /* find how many blocks can be covered since this position */ 641c9de560dSAlex Tomas max = ffs(first | border) - 1; 642c9de560dSAlex Tomas 643c9de560dSAlex Tomas /* find how many blocks of power 2 we need to mark */ 644c9de560dSAlex Tomas min = fls(len) - 1; 645c9de560dSAlex Tomas 646c9de560dSAlex Tomas if (max < min) 647c9de560dSAlex Tomas min = max; 648c9de560dSAlex Tomas chunk = 1 << min; 649c9de560dSAlex Tomas 650c9de560dSAlex Tomas /* mark multiblock chunks only */ 651c9de560dSAlex Tomas grp->bb_counters[min]++; 652c9de560dSAlex Tomas if (min > 0) 653c9de560dSAlex Tomas mb_clear_bit(first >> min, 654c9de560dSAlex Tomas buddy + sbi->s_mb_offsets[min]); 655c9de560dSAlex Tomas 656c9de560dSAlex Tomas len -= chunk; 657c9de560dSAlex Tomas first += chunk; 658c9de560dSAlex Tomas } 659c9de560dSAlex Tomas } 660c9de560dSAlex Tomas 661c9de560dSAlex Tomas static void ext4_mb_generate_buddy(struct super_block *sb, 662c9de560dSAlex Tomas void *buddy, void *bitmap, ext4_group_t group) 663c9de560dSAlex Tomas { 664c9de560dSAlex Tomas struct ext4_group_info *grp = ext4_get_group_info(sb, group); 665c9de560dSAlex Tomas unsigned short max = EXT4_BLOCKS_PER_GROUP(sb); 666c9de560dSAlex Tomas unsigned short i = 0; 667c9de560dSAlex Tomas unsigned short first; 668c9de560dSAlex Tomas unsigned short len; 669c9de560dSAlex Tomas unsigned free = 0; 670c9de560dSAlex Tomas unsigned fragments = 0; 671c9de560dSAlex Tomas unsigned long long period = get_cycles(); 672c9de560dSAlex Tomas 673c9de560dSAlex Tomas /* initialize buddy from bitmap which is aggregation 674c9de560dSAlex Tomas * of on-disk bitmap and preallocations */ 675ffad0a44SAneesh Kumar K.V i = mb_find_next_zero_bit(bitmap, max, 0); 676c9de560dSAlex Tomas grp->bb_first_free = i; 677c9de560dSAlex Tomas while (i < max) { 678c9de560dSAlex Tomas fragments++; 679c9de560dSAlex Tomas first = i; 680ffad0a44SAneesh Kumar K.V i = mb_find_next_bit(bitmap, max, i); 681c9de560dSAlex Tomas len = i - first; 682c9de560dSAlex Tomas free += len; 683c9de560dSAlex Tomas if (len > 1) 684c9de560dSAlex Tomas ext4_mb_mark_free_simple(sb, buddy, first, len, grp); 685c9de560dSAlex Tomas else 686c9de560dSAlex Tomas grp->bb_counters[0]++; 687c9de560dSAlex Tomas if (i < max) 688ffad0a44SAneesh Kumar K.V i = mb_find_next_zero_bit(bitmap, max, i); 689c9de560dSAlex Tomas } 690c9de560dSAlex Tomas grp->bb_fragments = fragments; 691c9de560dSAlex Tomas 692c9de560dSAlex Tomas if (free != grp->bb_free) { 69346e665e9SHarvey Harrison ext4_error(sb, __func__, 694c9de560dSAlex Tomas "EXT4-fs: group %lu: %u blocks in bitmap, %u in gd\n", 695c9de560dSAlex Tomas group, free, grp->bb_free); 696e56eb659SAneesh Kumar K.V /* 697e56eb659SAneesh Kumar K.V * If we intent to continue, we consider group descritor 698e56eb659SAneesh Kumar K.V * corrupt and update bb_free using bitmap value 699e56eb659SAneesh Kumar K.V */ 700c9de560dSAlex Tomas grp->bb_free = free; 701c9de560dSAlex Tomas } 702c9de560dSAlex Tomas 703c9de560dSAlex Tomas clear_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, &(grp->bb_state)); 704c9de560dSAlex Tomas 705c9de560dSAlex Tomas period = get_cycles() - period; 706c9de560dSAlex Tomas spin_lock(&EXT4_SB(sb)->s_bal_lock); 707c9de560dSAlex Tomas EXT4_SB(sb)->s_mb_buddies_generated++; 708c9de560dSAlex Tomas EXT4_SB(sb)->s_mb_generation_time += period; 709c9de560dSAlex Tomas spin_unlock(&EXT4_SB(sb)->s_bal_lock); 710c9de560dSAlex Tomas } 711c9de560dSAlex Tomas 712c9de560dSAlex Tomas /* The buddy information is attached the buddy cache inode 713c9de560dSAlex Tomas * for convenience. The information regarding each group 714c9de560dSAlex Tomas * is loaded via ext4_mb_load_buddy. The information involve 715c9de560dSAlex Tomas * block bitmap and buddy information. The information are 716c9de560dSAlex Tomas * stored in the inode as 717c9de560dSAlex Tomas * 718c9de560dSAlex Tomas * { page } 719c9de560dSAlex Tomas * [ group 0 buddy][ group 0 bitmap] [group 1][ group 1]... 720c9de560dSAlex Tomas * 721c9de560dSAlex Tomas * 722c9de560dSAlex Tomas * one block each for bitmap and buddy information. 723c9de560dSAlex Tomas * So for each group we take up 2 blocks. A page can 724c9de560dSAlex Tomas * contain blocks_per_page (PAGE_CACHE_SIZE / blocksize) blocks. 725c9de560dSAlex Tomas * So it can have information regarding groups_per_page which 726c9de560dSAlex Tomas * is blocks_per_page/2 727c9de560dSAlex Tomas */ 728c9de560dSAlex Tomas 729c9de560dSAlex Tomas static int ext4_mb_init_cache(struct page *page, char *incore) 730c9de560dSAlex Tomas { 731c9de560dSAlex Tomas int blocksize; 732c9de560dSAlex Tomas int blocks_per_page; 733c9de560dSAlex Tomas int groups_per_page; 734c9de560dSAlex Tomas int err = 0; 735c9de560dSAlex Tomas int i; 736c9de560dSAlex Tomas ext4_group_t first_group; 737c9de560dSAlex Tomas int first_block; 738c9de560dSAlex Tomas struct super_block *sb; 739c9de560dSAlex Tomas struct buffer_head *bhs; 740c9de560dSAlex Tomas struct buffer_head **bh; 741c9de560dSAlex Tomas struct inode *inode; 742c9de560dSAlex Tomas char *data; 743c9de560dSAlex Tomas char *bitmap; 744c9de560dSAlex Tomas 745c9de560dSAlex Tomas mb_debug("init page %lu\n", page->index); 746c9de560dSAlex Tomas 747c9de560dSAlex Tomas inode = page->mapping->host; 748c9de560dSAlex Tomas sb = inode->i_sb; 749c9de560dSAlex Tomas blocksize = 1 << inode->i_blkbits; 750c9de560dSAlex Tomas blocks_per_page = PAGE_CACHE_SIZE / blocksize; 751c9de560dSAlex Tomas 752c9de560dSAlex Tomas groups_per_page = blocks_per_page >> 1; 753c9de560dSAlex Tomas if (groups_per_page == 0) 754c9de560dSAlex Tomas groups_per_page = 1; 755c9de560dSAlex Tomas 756c9de560dSAlex Tomas /* allocate buffer_heads to read bitmaps */ 757c9de560dSAlex Tomas if (groups_per_page > 1) { 758c9de560dSAlex Tomas err = -ENOMEM; 759c9de560dSAlex Tomas i = sizeof(struct buffer_head *) * groups_per_page; 760c9de560dSAlex Tomas bh = kzalloc(i, GFP_NOFS); 761c9de560dSAlex Tomas if (bh == NULL) 762c9de560dSAlex Tomas goto out; 763c9de560dSAlex Tomas } else 764c9de560dSAlex Tomas bh = &bhs; 765c9de560dSAlex Tomas 766c9de560dSAlex Tomas first_group = page->index * blocks_per_page / 2; 767c9de560dSAlex Tomas 768c9de560dSAlex Tomas /* read all groups the page covers into the cache */ 769c9de560dSAlex Tomas for (i = 0; i < groups_per_page; i++) { 770c9de560dSAlex Tomas struct ext4_group_desc *desc; 771c9de560dSAlex Tomas 772c9de560dSAlex Tomas if (first_group + i >= EXT4_SB(sb)->s_groups_count) 773c9de560dSAlex Tomas break; 774c9de560dSAlex Tomas 775c9de560dSAlex Tomas err = -EIO; 776c9de560dSAlex Tomas desc = ext4_get_group_desc(sb, first_group + i, NULL); 777c9de560dSAlex Tomas if (desc == NULL) 778c9de560dSAlex Tomas goto out; 779c9de560dSAlex Tomas 780c9de560dSAlex Tomas err = -ENOMEM; 781c9de560dSAlex Tomas bh[i] = sb_getblk(sb, ext4_block_bitmap(sb, desc)); 782c9de560dSAlex Tomas if (bh[i] == NULL) 783c9de560dSAlex Tomas goto out; 784c9de560dSAlex Tomas 785c806e68fSFrederic Bohe if (buffer_uptodate(bh[i]) && 786c806e68fSFrederic Bohe !(desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT))) 787c9de560dSAlex Tomas continue; 788c9de560dSAlex Tomas 789c806e68fSFrederic Bohe lock_buffer(bh[i]); 790b5f10eedSEric Sandeen spin_lock(sb_bgl_lock(EXT4_SB(sb), first_group + i)); 791c9de560dSAlex Tomas if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { 792c9de560dSAlex Tomas ext4_init_block_bitmap(sb, bh[i], 793c9de560dSAlex Tomas first_group + i, desc); 794c9de560dSAlex Tomas set_buffer_uptodate(bh[i]); 795c9de560dSAlex Tomas unlock_buffer(bh[i]); 796b5f10eedSEric Sandeen spin_unlock(sb_bgl_lock(EXT4_SB(sb), first_group + i)); 797c9de560dSAlex Tomas continue; 798c9de560dSAlex Tomas } 799b5f10eedSEric Sandeen spin_unlock(sb_bgl_lock(EXT4_SB(sb), first_group + i)); 800c9de560dSAlex Tomas get_bh(bh[i]); 801c9de560dSAlex Tomas bh[i]->b_end_io = end_buffer_read_sync; 802c9de560dSAlex Tomas submit_bh(READ, bh[i]); 803c9de560dSAlex Tomas mb_debug("read bitmap for group %lu\n", first_group + i); 804c9de560dSAlex Tomas } 805c9de560dSAlex Tomas 806c9de560dSAlex Tomas /* wait for I/O completion */ 807c9de560dSAlex Tomas for (i = 0; i < groups_per_page && bh[i]; i++) 808c9de560dSAlex Tomas wait_on_buffer(bh[i]); 809c9de560dSAlex Tomas 810c9de560dSAlex Tomas err = -EIO; 811c9de560dSAlex Tomas for (i = 0; i < groups_per_page && bh[i]; i++) 812c9de560dSAlex Tomas if (!buffer_uptodate(bh[i])) 813c9de560dSAlex Tomas goto out; 814c9de560dSAlex Tomas 81531b481dcSMingming Cao err = 0; 816c9de560dSAlex Tomas first_block = page->index * blocks_per_page; 817c9de560dSAlex Tomas for (i = 0; i < blocks_per_page; i++) { 818c9de560dSAlex Tomas int group; 819c9de560dSAlex Tomas struct ext4_group_info *grinfo; 820c9de560dSAlex Tomas 821c9de560dSAlex Tomas group = (first_block + i) >> 1; 822c9de560dSAlex Tomas if (group >= EXT4_SB(sb)->s_groups_count) 823c9de560dSAlex Tomas break; 824c9de560dSAlex Tomas 825c9de560dSAlex Tomas /* 826c9de560dSAlex Tomas * data carry information regarding this 827c9de560dSAlex Tomas * particular group in the format specified 828c9de560dSAlex Tomas * above 829c9de560dSAlex Tomas * 830c9de560dSAlex Tomas */ 831c9de560dSAlex Tomas data = page_address(page) + (i * blocksize); 832c9de560dSAlex Tomas bitmap = bh[group - first_group]->b_data; 833c9de560dSAlex Tomas 834c9de560dSAlex Tomas /* 835c9de560dSAlex Tomas * We place the buddy block and bitmap block 836c9de560dSAlex Tomas * close together 837c9de560dSAlex Tomas */ 838c9de560dSAlex Tomas if ((first_block + i) & 1) { 839c9de560dSAlex Tomas /* this is block of buddy */ 840c9de560dSAlex Tomas BUG_ON(incore == NULL); 841c9de560dSAlex Tomas mb_debug("put buddy for group %u in page %lu/%x\n", 842c9de560dSAlex Tomas group, page->index, i * blocksize); 843c9de560dSAlex Tomas memset(data, 0xff, blocksize); 844c9de560dSAlex Tomas grinfo = ext4_get_group_info(sb, group); 845c9de560dSAlex Tomas grinfo->bb_fragments = 0; 846c9de560dSAlex Tomas memset(grinfo->bb_counters, 0, 847c9de560dSAlex Tomas sizeof(unsigned short)*(sb->s_blocksize_bits+2)); 848c9de560dSAlex Tomas /* 849c9de560dSAlex Tomas * incore got set to the group block bitmap below 850c9de560dSAlex Tomas */ 851c9de560dSAlex Tomas ext4_mb_generate_buddy(sb, data, incore, group); 852c9de560dSAlex Tomas incore = NULL; 853c9de560dSAlex Tomas } else { 854c9de560dSAlex Tomas /* this is block of bitmap */ 855c9de560dSAlex Tomas BUG_ON(incore != NULL); 856c9de560dSAlex Tomas mb_debug("put bitmap for group %u in page %lu/%x\n", 857c9de560dSAlex Tomas group, page->index, i * blocksize); 858c9de560dSAlex Tomas 859c9de560dSAlex Tomas /* see comments in ext4_mb_put_pa() */ 860c9de560dSAlex Tomas ext4_lock_group(sb, group); 861c9de560dSAlex Tomas memcpy(data, bitmap, blocksize); 862c9de560dSAlex Tomas 863c9de560dSAlex Tomas /* mark all preallocated blks used in in-core bitmap */ 864c9de560dSAlex Tomas ext4_mb_generate_from_pa(sb, data, group); 865c9de560dSAlex Tomas ext4_unlock_group(sb, group); 866c9de560dSAlex Tomas 867c9de560dSAlex Tomas /* set incore so that the buddy information can be 868c9de560dSAlex Tomas * generated using this 869c9de560dSAlex Tomas */ 870c9de560dSAlex Tomas incore = data; 871c9de560dSAlex Tomas } 872c9de560dSAlex Tomas } 873c9de560dSAlex Tomas SetPageUptodate(page); 874c9de560dSAlex Tomas 875c9de560dSAlex Tomas out: 876c9de560dSAlex Tomas if (bh) { 877c9de560dSAlex Tomas for (i = 0; i < groups_per_page && bh[i]; i++) 878c9de560dSAlex Tomas brelse(bh[i]); 879c9de560dSAlex Tomas if (bh != &bhs) 880c9de560dSAlex Tomas kfree(bh); 881c9de560dSAlex Tomas } 882c9de560dSAlex Tomas return err; 883c9de560dSAlex Tomas } 884c9de560dSAlex Tomas 8854ddfef7bSEric Sandeen static noinline_for_stack int 8864ddfef7bSEric Sandeen ext4_mb_load_buddy(struct super_block *sb, ext4_group_t group, 887c9de560dSAlex Tomas struct ext4_buddy *e4b) 888c9de560dSAlex Tomas { 889c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 890c9de560dSAlex Tomas struct inode *inode = sbi->s_buddy_cache; 891c9de560dSAlex Tomas int blocks_per_page; 892c9de560dSAlex Tomas int block; 893c9de560dSAlex Tomas int pnum; 894c9de560dSAlex Tomas int poff; 895c9de560dSAlex Tomas struct page *page; 896fdf6c7a7SShen Feng int ret; 897c9de560dSAlex Tomas 898c9de560dSAlex Tomas mb_debug("load group %lu\n", group); 899c9de560dSAlex Tomas 900c9de560dSAlex Tomas blocks_per_page = PAGE_CACHE_SIZE / sb->s_blocksize; 901c9de560dSAlex Tomas 902c9de560dSAlex Tomas e4b->bd_blkbits = sb->s_blocksize_bits; 903c9de560dSAlex Tomas e4b->bd_info = ext4_get_group_info(sb, group); 904c9de560dSAlex Tomas e4b->bd_sb = sb; 905c9de560dSAlex Tomas e4b->bd_group = group; 906c9de560dSAlex Tomas e4b->bd_buddy_page = NULL; 907c9de560dSAlex Tomas e4b->bd_bitmap_page = NULL; 908c9de560dSAlex Tomas 909c9de560dSAlex Tomas /* 910c9de560dSAlex Tomas * the buddy cache inode stores the block bitmap 911c9de560dSAlex Tomas * and buddy information in consecutive blocks. 912c9de560dSAlex Tomas * So for each group we need two blocks. 913c9de560dSAlex Tomas */ 914c9de560dSAlex Tomas block = group * 2; 915c9de560dSAlex Tomas pnum = block / blocks_per_page; 916c9de560dSAlex Tomas poff = block % blocks_per_page; 917c9de560dSAlex Tomas 918c9de560dSAlex Tomas /* we could use find_or_create_page(), but it locks page 919c9de560dSAlex Tomas * what we'd like to avoid in fast path ... */ 920c9de560dSAlex Tomas page = find_get_page(inode->i_mapping, pnum); 921c9de560dSAlex Tomas if (page == NULL || !PageUptodate(page)) { 922c9de560dSAlex Tomas if (page) 923c9de560dSAlex Tomas page_cache_release(page); 924c9de560dSAlex Tomas page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); 925c9de560dSAlex Tomas if (page) { 926c9de560dSAlex Tomas BUG_ON(page->mapping != inode->i_mapping); 927c9de560dSAlex Tomas if (!PageUptodate(page)) { 928fdf6c7a7SShen Feng ret = ext4_mb_init_cache(page, NULL); 929fdf6c7a7SShen Feng if (ret) { 930fdf6c7a7SShen Feng unlock_page(page); 931fdf6c7a7SShen Feng goto err; 932fdf6c7a7SShen Feng } 933c9de560dSAlex Tomas mb_cmp_bitmaps(e4b, page_address(page) + 934c9de560dSAlex Tomas (poff * sb->s_blocksize)); 935c9de560dSAlex Tomas } 936c9de560dSAlex Tomas unlock_page(page); 937c9de560dSAlex Tomas } 938c9de560dSAlex Tomas } 939fdf6c7a7SShen Feng if (page == NULL || !PageUptodate(page)) { 940fdf6c7a7SShen Feng ret = -EIO; 941c9de560dSAlex Tomas goto err; 942fdf6c7a7SShen Feng } 943c9de560dSAlex Tomas e4b->bd_bitmap_page = page; 944c9de560dSAlex Tomas e4b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize); 945c9de560dSAlex Tomas mark_page_accessed(page); 946c9de560dSAlex Tomas 947c9de560dSAlex Tomas block++; 948c9de560dSAlex Tomas pnum = block / blocks_per_page; 949c9de560dSAlex Tomas poff = block % blocks_per_page; 950c9de560dSAlex Tomas 951c9de560dSAlex Tomas page = find_get_page(inode->i_mapping, pnum); 952c9de560dSAlex Tomas if (page == NULL || !PageUptodate(page)) { 953c9de560dSAlex Tomas if (page) 954c9de560dSAlex Tomas page_cache_release(page); 955c9de560dSAlex Tomas page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS); 956c9de560dSAlex Tomas if (page) { 957c9de560dSAlex Tomas BUG_ON(page->mapping != inode->i_mapping); 958fdf6c7a7SShen Feng if (!PageUptodate(page)) { 959fdf6c7a7SShen Feng ret = ext4_mb_init_cache(page, e4b->bd_bitmap); 960fdf6c7a7SShen Feng if (ret) { 961fdf6c7a7SShen Feng unlock_page(page); 962fdf6c7a7SShen Feng goto err; 963fdf6c7a7SShen Feng } 964fdf6c7a7SShen Feng } 965c9de560dSAlex Tomas unlock_page(page); 966c9de560dSAlex Tomas } 967c9de560dSAlex Tomas } 968fdf6c7a7SShen Feng if (page == NULL || !PageUptodate(page)) { 969fdf6c7a7SShen Feng ret = -EIO; 970c9de560dSAlex Tomas goto err; 971fdf6c7a7SShen Feng } 972c9de560dSAlex Tomas e4b->bd_buddy_page = page; 973c9de560dSAlex Tomas e4b->bd_buddy = page_address(page) + (poff * sb->s_blocksize); 974c9de560dSAlex Tomas mark_page_accessed(page); 975c9de560dSAlex Tomas 976c9de560dSAlex Tomas BUG_ON(e4b->bd_bitmap_page == NULL); 977c9de560dSAlex Tomas BUG_ON(e4b->bd_buddy_page == NULL); 978c9de560dSAlex Tomas 979c9de560dSAlex Tomas return 0; 980c9de560dSAlex Tomas 981c9de560dSAlex Tomas err: 982c9de560dSAlex Tomas if (e4b->bd_bitmap_page) 983c9de560dSAlex Tomas page_cache_release(e4b->bd_bitmap_page); 984c9de560dSAlex Tomas if (e4b->bd_buddy_page) 985c9de560dSAlex Tomas page_cache_release(e4b->bd_buddy_page); 986c9de560dSAlex Tomas e4b->bd_buddy = NULL; 987c9de560dSAlex Tomas e4b->bd_bitmap = NULL; 988fdf6c7a7SShen Feng return ret; 989c9de560dSAlex Tomas } 990c9de560dSAlex Tomas 991c9de560dSAlex Tomas static void ext4_mb_release_desc(struct ext4_buddy *e4b) 992c9de560dSAlex Tomas { 993c9de560dSAlex Tomas if (e4b->bd_bitmap_page) 994c9de560dSAlex Tomas page_cache_release(e4b->bd_bitmap_page); 995c9de560dSAlex Tomas if (e4b->bd_buddy_page) 996c9de560dSAlex Tomas page_cache_release(e4b->bd_buddy_page); 997c9de560dSAlex Tomas } 998c9de560dSAlex Tomas 999c9de560dSAlex Tomas 1000c9de560dSAlex Tomas static int mb_find_order_for_block(struct ext4_buddy *e4b, int block) 1001c9de560dSAlex Tomas { 1002c9de560dSAlex Tomas int order = 1; 1003c9de560dSAlex Tomas void *bb; 1004c9de560dSAlex Tomas 1005c9de560dSAlex Tomas BUG_ON(EXT4_MB_BITMAP(e4b) == EXT4_MB_BUDDY(e4b)); 1006c9de560dSAlex Tomas BUG_ON(block >= (1 << (e4b->bd_blkbits + 3))); 1007c9de560dSAlex Tomas 1008c9de560dSAlex Tomas bb = EXT4_MB_BUDDY(e4b); 1009c9de560dSAlex Tomas while (order <= e4b->bd_blkbits + 1) { 1010c9de560dSAlex Tomas block = block >> 1; 1011c9de560dSAlex Tomas if (!mb_test_bit(block, bb)) { 1012c9de560dSAlex Tomas /* this block is part of buddy of order 'order' */ 1013c9de560dSAlex Tomas return order; 1014c9de560dSAlex Tomas } 1015c9de560dSAlex Tomas bb += 1 << (e4b->bd_blkbits - order); 1016c9de560dSAlex Tomas order++; 1017c9de560dSAlex Tomas } 1018c9de560dSAlex Tomas return 0; 1019c9de560dSAlex Tomas } 1020c9de560dSAlex Tomas 1021c9de560dSAlex Tomas static void mb_clear_bits(spinlock_t *lock, void *bm, int cur, int len) 1022c9de560dSAlex Tomas { 1023c9de560dSAlex Tomas __u32 *addr; 1024c9de560dSAlex Tomas 1025c9de560dSAlex Tomas len = cur + len; 1026c9de560dSAlex Tomas while (cur < len) { 1027c9de560dSAlex Tomas if ((cur & 31) == 0 && (len - cur) >= 32) { 1028c9de560dSAlex Tomas /* fast path: clear whole word at once */ 1029c9de560dSAlex Tomas addr = bm + (cur >> 3); 1030c9de560dSAlex Tomas *addr = 0; 1031c9de560dSAlex Tomas cur += 32; 1032c9de560dSAlex Tomas continue; 1033c9de560dSAlex Tomas } 1034c9de560dSAlex Tomas mb_clear_bit_atomic(lock, cur, bm); 1035c9de560dSAlex Tomas cur++; 1036c9de560dSAlex Tomas } 1037c9de560dSAlex Tomas } 1038c9de560dSAlex Tomas 1039c9de560dSAlex Tomas static void mb_set_bits(spinlock_t *lock, void *bm, int cur, int len) 1040c9de560dSAlex Tomas { 1041c9de560dSAlex Tomas __u32 *addr; 1042c9de560dSAlex Tomas 1043c9de560dSAlex Tomas len = cur + len; 1044c9de560dSAlex Tomas while (cur < len) { 1045c9de560dSAlex Tomas if ((cur & 31) == 0 && (len - cur) >= 32) { 1046c9de560dSAlex Tomas /* fast path: set whole word at once */ 1047c9de560dSAlex Tomas addr = bm + (cur >> 3); 1048c9de560dSAlex Tomas *addr = 0xffffffff; 1049c9de560dSAlex Tomas cur += 32; 1050c9de560dSAlex Tomas continue; 1051c9de560dSAlex Tomas } 1052c9de560dSAlex Tomas mb_set_bit_atomic(lock, cur, bm); 1053c9de560dSAlex Tomas cur++; 1054c9de560dSAlex Tomas } 1055c9de560dSAlex Tomas } 1056c9de560dSAlex Tomas 10577e5a8cddSShen Feng static void mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b, 1058c9de560dSAlex Tomas int first, int count) 1059c9de560dSAlex Tomas { 1060c9de560dSAlex Tomas int block = 0; 1061c9de560dSAlex Tomas int max = 0; 1062c9de560dSAlex Tomas int order; 1063c9de560dSAlex Tomas void *buddy; 1064c9de560dSAlex Tomas void *buddy2; 1065c9de560dSAlex Tomas struct super_block *sb = e4b->bd_sb; 1066c9de560dSAlex Tomas 1067c9de560dSAlex Tomas BUG_ON(first + count > (sb->s_blocksize << 3)); 1068c9de560dSAlex Tomas BUG_ON(!ext4_is_group_locked(sb, e4b->bd_group)); 1069c9de560dSAlex Tomas mb_check_buddy(e4b); 1070c9de560dSAlex Tomas mb_free_blocks_double(inode, e4b, first, count); 1071c9de560dSAlex Tomas 1072c9de560dSAlex Tomas e4b->bd_info->bb_free += count; 1073c9de560dSAlex Tomas if (first < e4b->bd_info->bb_first_free) 1074c9de560dSAlex Tomas e4b->bd_info->bb_first_free = first; 1075c9de560dSAlex Tomas 1076c9de560dSAlex Tomas /* let's maintain fragments counter */ 1077c9de560dSAlex Tomas if (first != 0) 1078c9de560dSAlex Tomas block = !mb_test_bit(first - 1, EXT4_MB_BITMAP(e4b)); 1079c9de560dSAlex Tomas if (first + count < EXT4_SB(sb)->s_mb_maxs[0]) 1080c9de560dSAlex Tomas max = !mb_test_bit(first + count, EXT4_MB_BITMAP(e4b)); 1081c9de560dSAlex Tomas if (block && max) 1082c9de560dSAlex Tomas e4b->bd_info->bb_fragments--; 1083c9de560dSAlex Tomas else if (!block && !max) 1084c9de560dSAlex Tomas e4b->bd_info->bb_fragments++; 1085c9de560dSAlex Tomas 1086c9de560dSAlex Tomas /* let's maintain buddy itself */ 1087c9de560dSAlex Tomas while (count-- > 0) { 1088c9de560dSAlex Tomas block = first++; 1089c9de560dSAlex Tomas order = 0; 1090c9de560dSAlex Tomas 1091c9de560dSAlex Tomas if (!mb_test_bit(block, EXT4_MB_BITMAP(e4b))) { 1092c9de560dSAlex Tomas ext4_fsblk_t blocknr; 1093c9de560dSAlex Tomas blocknr = e4b->bd_group * EXT4_BLOCKS_PER_GROUP(sb); 1094c9de560dSAlex Tomas blocknr += block; 1095c9de560dSAlex Tomas blocknr += 1096c9de560dSAlex Tomas le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block); 10977e5a8cddSShen Feng ext4_unlock_group(sb, e4b->bd_group); 109846e665e9SHarvey Harrison ext4_error(sb, __func__, "double-free of inode" 1099c9de560dSAlex Tomas " %lu's block %llu(bit %u in group %lu)\n", 1100c9de560dSAlex Tomas inode ? inode->i_ino : 0, blocknr, block, 1101c9de560dSAlex Tomas e4b->bd_group); 11027e5a8cddSShen Feng ext4_lock_group(sb, e4b->bd_group); 1103c9de560dSAlex Tomas } 1104c9de560dSAlex Tomas mb_clear_bit(block, EXT4_MB_BITMAP(e4b)); 1105c9de560dSAlex Tomas e4b->bd_info->bb_counters[order]++; 1106c9de560dSAlex Tomas 1107c9de560dSAlex Tomas /* start of the buddy */ 1108c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, order, &max); 1109c9de560dSAlex Tomas 1110c9de560dSAlex Tomas do { 1111c9de560dSAlex Tomas block &= ~1UL; 1112c9de560dSAlex Tomas if (mb_test_bit(block, buddy) || 1113c9de560dSAlex Tomas mb_test_bit(block + 1, buddy)) 1114c9de560dSAlex Tomas break; 1115c9de560dSAlex Tomas 1116c9de560dSAlex Tomas /* both the buddies are free, try to coalesce them */ 1117c9de560dSAlex Tomas buddy2 = mb_find_buddy(e4b, order + 1, &max); 1118c9de560dSAlex Tomas 1119c9de560dSAlex Tomas if (!buddy2) 1120c9de560dSAlex Tomas break; 1121c9de560dSAlex Tomas 1122c9de560dSAlex Tomas if (order > 0) { 1123c9de560dSAlex Tomas /* for special purposes, we don't set 1124c9de560dSAlex Tomas * free bits in bitmap */ 1125c9de560dSAlex Tomas mb_set_bit(block, buddy); 1126c9de560dSAlex Tomas mb_set_bit(block + 1, buddy); 1127c9de560dSAlex Tomas } 1128c9de560dSAlex Tomas e4b->bd_info->bb_counters[order]--; 1129c9de560dSAlex Tomas e4b->bd_info->bb_counters[order]--; 1130c9de560dSAlex Tomas 1131c9de560dSAlex Tomas block = block >> 1; 1132c9de560dSAlex Tomas order++; 1133c9de560dSAlex Tomas e4b->bd_info->bb_counters[order]++; 1134c9de560dSAlex Tomas 1135c9de560dSAlex Tomas mb_clear_bit(block, buddy2); 1136c9de560dSAlex Tomas buddy = buddy2; 1137c9de560dSAlex Tomas } while (1); 1138c9de560dSAlex Tomas } 1139c9de560dSAlex Tomas mb_check_buddy(e4b); 1140c9de560dSAlex Tomas } 1141c9de560dSAlex Tomas 1142c9de560dSAlex Tomas static int mb_find_extent(struct ext4_buddy *e4b, int order, int block, 1143c9de560dSAlex Tomas int needed, struct ext4_free_extent *ex) 1144c9de560dSAlex Tomas { 1145c9de560dSAlex Tomas int next = block; 1146c9de560dSAlex Tomas int max; 1147c9de560dSAlex Tomas int ord; 1148c9de560dSAlex Tomas void *buddy; 1149c9de560dSAlex Tomas 1150c9de560dSAlex Tomas BUG_ON(!ext4_is_group_locked(e4b->bd_sb, e4b->bd_group)); 1151c9de560dSAlex Tomas BUG_ON(ex == NULL); 1152c9de560dSAlex Tomas 1153c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, order, &max); 1154c9de560dSAlex Tomas BUG_ON(buddy == NULL); 1155c9de560dSAlex Tomas BUG_ON(block >= max); 1156c9de560dSAlex Tomas if (mb_test_bit(block, buddy)) { 1157c9de560dSAlex Tomas ex->fe_len = 0; 1158c9de560dSAlex Tomas ex->fe_start = 0; 1159c9de560dSAlex Tomas ex->fe_group = 0; 1160c9de560dSAlex Tomas return 0; 1161c9de560dSAlex Tomas } 1162c9de560dSAlex Tomas 1163c9de560dSAlex Tomas /* FIXME dorp order completely ? */ 1164c9de560dSAlex Tomas if (likely(order == 0)) { 1165c9de560dSAlex Tomas /* find actual order */ 1166c9de560dSAlex Tomas order = mb_find_order_for_block(e4b, block); 1167c9de560dSAlex Tomas block = block >> order; 1168c9de560dSAlex Tomas } 1169c9de560dSAlex Tomas 1170c9de560dSAlex Tomas ex->fe_len = 1 << order; 1171c9de560dSAlex Tomas ex->fe_start = block << order; 1172c9de560dSAlex Tomas ex->fe_group = e4b->bd_group; 1173c9de560dSAlex Tomas 1174c9de560dSAlex Tomas /* calc difference from given start */ 1175c9de560dSAlex Tomas next = next - ex->fe_start; 1176c9de560dSAlex Tomas ex->fe_len -= next; 1177c9de560dSAlex Tomas ex->fe_start += next; 1178c9de560dSAlex Tomas 1179c9de560dSAlex Tomas while (needed > ex->fe_len && 1180c9de560dSAlex Tomas (buddy = mb_find_buddy(e4b, order, &max))) { 1181c9de560dSAlex Tomas 1182c9de560dSAlex Tomas if (block + 1 >= max) 1183c9de560dSAlex Tomas break; 1184c9de560dSAlex Tomas 1185c9de560dSAlex Tomas next = (block + 1) * (1 << order); 1186c9de560dSAlex Tomas if (mb_test_bit(next, EXT4_MB_BITMAP(e4b))) 1187c9de560dSAlex Tomas break; 1188c9de560dSAlex Tomas 1189c9de560dSAlex Tomas ord = mb_find_order_for_block(e4b, next); 1190c9de560dSAlex Tomas 1191c9de560dSAlex Tomas order = ord; 1192c9de560dSAlex Tomas block = next >> order; 1193c9de560dSAlex Tomas ex->fe_len += 1 << order; 1194c9de560dSAlex Tomas } 1195c9de560dSAlex Tomas 1196c9de560dSAlex Tomas BUG_ON(ex->fe_start + ex->fe_len > (1 << (e4b->bd_blkbits + 3))); 1197c9de560dSAlex Tomas return ex->fe_len; 1198c9de560dSAlex Tomas } 1199c9de560dSAlex Tomas 1200c9de560dSAlex Tomas static int mb_mark_used(struct ext4_buddy *e4b, struct ext4_free_extent *ex) 1201c9de560dSAlex Tomas { 1202c9de560dSAlex Tomas int ord; 1203c9de560dSAlex Tomas int mlen = 0; 1204c9de560dSAlex Tomas int max = 0; 1205c9de560dSAlex Tomas int cur; 1206c9de560dSAlex Tomas int start = ex->fe_start; 1207c9de560dSAlex Tomas int len = ex->fe_len; 1208c9de560dSAlex Tomas unsigned ret = 0; 1209c9de560dSAlex Tomas int len0 = len; 1210c9de560dSAlex Tomas void *buddy; 1211c9de560dSAlex Tomas 1212c9de560dSAlex Tomas BUG_ON(start + len > (e4b->bd_sb->s_blocksize << 3)); 1213c9de560dSAlex Tomas BUG_ON(e4b->bd_group != ex->fe_group); 1214c9de560dSAlex Tomas BUG_ON(!ext4_is_group_locked(e4b->bd_sb, e4b->bd_group)); 1215c9de560dSAlex Tomas mb_check_buddy(e4b); 1216c9de560dSAlex Tomas mb_mark_used_double(e4b, start, len); 1217c9de560dSAlex Tomas 1218c9de560dSAlex Tomas e4b->bd_info->bb_free -= len; 1219c9de560dSAlex Tomas if (e4b->bd_info->bb_first_free == start) 1220c9de560dSAlex Tomas e4b->bd_info->bb_first_free += len; 1221c9de560dSAlex Tomas 1222c9de560dSAlex Tomas /* let's maintain fragments counter */ 1223c9de560dSAlex Tomas if (start != 0) 1224c9de560dSAlex Tomas mlen = !mb_test_bit(start - 1, EXT4_MB_BITMAP(e4b)); 1225c9de560dSAlex Tomas if (start + len < EXT4_SB(e4b->bd_sb)->s_mb_maxs[0]) 1226c9de560dSAlex Tomas max = !mb_test_bit(start + len, EXT4_MB_BITMAP(e4b)); 1227c9de560dSAlex Tomas if (mlen && max) 1228c9de560dSAlex Tomas e4b->bd_info->bb_fragments++; 1229c9de560dSAlex Tomas else if (!mlen && !max) 1230c9de560dSAlex Tomas e4b->bd_info->bb_fragments--; 1231c9de560dSAlex Tomas 1232c9de560dSAlex Tomas /* let's maintain buddy itself */ 1233c9de560dSAlex Tomas while (len) { 1234c9de560dSAlex Tomas ord = mb_find_order_for_block(e4b, start); 1235c9de560dSAlex Tomas 1236c9de560dSAlex Tomas if (((start >> ord) << ord) == start && len >= (1 << ord)) { 1237c9de560dSAlex Tomas /* the whole chunk may be allocated at once! */ 1238c9de560dSAlex Tomas mlen = 1 << ord; 1239c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, ord, &max); 1240c9de560dSAlex Tomas BUG_ON((start >> ord) >= max); 1241c9de560dSAlex Tomas mb_set_bit(start >> ord, buddy); 1242c9de560dSAlex Tomas e4b->bd_info->bb_counters[ord]--; 1243c9de560dSAlex Tomas start += mlen; 1244c9de560dSAlex Tomas len -= mlen; 1245c9de560dSAlex Tomas BUG_ON(len < 0); 1246c9de560dSAlex Tomas continue; 1247c9de560dSAlex Tomas } 1248c9de560dSAlex Tomas 1249c9de560dSAlex Tomas /* store for history */ 1250c9de560dSAlex Tomas if (ret == 0) 1251c9de560dSAlex Tomas ret = len | (ord << 16); 1252c9de560dSAlex Tomas 1253c9de560dSAlex Tomas /* we have to split large buddy */ 1254c9de560dSAlex Tomas BUG_ON(ord <= 0); 1255c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, ord, &max); 1256c9de560dSAlex Tomas mb_set_bit(start >> ord, buddy); 1257c9de560dSAlex Tomas e4b->bd_info->bb_counters[ord]--; 1258c9de560dSAlex Tomas 1259c9de560dSAlex Tomas ord--; 1260c9de560dSAlex Tomas cur = (start >> ord) & ~1U; 1261c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, ord, &max); 1262c9de560dSAlex Tomas mb_clear_bit(cur, buddy); 1263c9de560dSAlex Tomas mb_clear_bit(cur + 1, buddy); 1264c9de560dSAlex Tomas e4b->bd_info->bb_counters[ord]++; 1265c9de560dSAlex Tomas e4b->bd_info->bb_counters[ord]++; 1266c9de560dSAlex Tomas } 1267c9de560dSAlex Tomas 1268c9de560dSAlex Tomas mb_set_bits(sb_bgl_lock(EXT4_SB(e4b->bd_sb), ex->fe_group), 1269c9de560dSAlex Tomas EXT4_MB_BITMAP(e4b), ex->fe_start, len0); 1270c9de560dSAlex Tomas mb_check_buddy(e4b); 1271c9de560dSAlex Tomas 1272c9de560dSAlex Tomas return ret; 1273c9de560dSAlex Tomas } 1274c9de560dSAlex Tomas 1275c9de560dSAlex Tomas /* 1276c9de560dSAlex Tomas * Must be called under group lock! 1277c9de560dSAlex Tomas */ 1278c9de560dSAlex Tomas static void ext4_mb_use_best_found(struct ext4_allocation_context *ac, 1279c9de560dSAlex Tomas struct ext4_buddy *e4b) 1280c9de560dSAlex Tomas { 1281c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); 1282c9de560dSAlex Tomas int ret; 1283c9de560dSAlex Tomas 1284c9de560dSAlex Tomas BUG_ON(ac->ac_b_ex.fe_group != e4b->bd_group); 1285c9de560dSAlex Tomas BUG_ON(ac->ac_status == AC_STATUS_FOUND); 1286c9de560dSAlex Tomas 1287c9de560dSAlex Tomas ac->ac_b_ex.fe_len = min(ac->ac_b_ex.fe_len, ac->ac_g_ex.fe_len); 1288c9de560dSAlex Tomas ac->ac_b_ex.fe_logical = ac->ac_g_ex.fe_logical; 1289c9de560dSAlex Tomas ret = mb_mark_used(e4b, &ac->ac_b_ex); 1290c9de560dSAlex Tomas 1291c9de560dSAlex Tomas /* preallocation can change ac_b_ex, thus we store actually 1292c9de560dSAlex Tomas * allocated blocks for history */ 1293c9de560dSAlex Tomas ac->ac_f_ex = ac->ac_b_ex; 1294c9de560dSAlex Tomas 1295c9de560dSAlex Tomas ac->ac_status = AC_STATUS_FOUND; 1296c9de560dSAlex Tomas ac->ac_tail = ret & 0xffff; 1297c9de560dSAlex Tomas ac->ac_buddy = ret >> 16; 1298c9de560dSAlex Tomas 1299c9de560dSAlex Tomas /* XXXXXXX: SUCH A HORRIBLE **CK */ 1300c9de560dSAlex Tomas /*FIXME!! Why ? */ 1301c9de560dSAlex Tomas ac->ac_bitmap_page = e4b->bd_bitmap_page; 1302c9de560dSAlex Tomas get_page(ac->ac_bitmap_page); 1303c9de560dSAlex Tomas ac->ac_buddy_page = e4b->bd_buddy_page; 1304c9de560dSAlex Tomas get_page(ac->ac_buddy_page); 1305c9de560dSAlex Tomas 1306c9de560dSAlex Tomas /* store last allocated for subsequent stream allocation */ 1307c9de560dSAlex Tomas if ((ac->ac_flags & EXT4_MB_HINT_DATA)) { 1308c9de560dSAlex Tomas spin_lock(&sbi->s_md_lock); 1309c9de560dSAlex Tomas sbi->s_mb_last_group = ac->ac_f_ex.fe_group; 1310c9de560dSAlex Tomas sbi->s_mb_last_start = ac->ac_f_ex.fe_start; 1311c9de560dSAlex Tomas spin_unlock(&sbi->s_md_lock); 1312c9de560dSAlex Tomas } 1313c9de560dSAlex Tomas } 1314c9de560dSAlex Tomas 1315c9de560dSAlex Tomas /* 1316c9de560dSAlex Tomas * regular allocator, for general purposes allocation 1317c9de560dSAlex Tomas */ 1318c9de560dSAlex Tomas 1319c9de560dSAlex Tomas static void ext4_mb_check_limits(struct ext4_allocation_context *ac, 1320c9de560dSAlex Tomas struct ext4_buddy *e4b, 1321c9de560dSAlex Tomas int finish_group) 1322c9de560dSAlex Tomas { 1323c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); 1324c9de560dSAlex Tomas struct ext4_free_extent *bex = &ac->ac_b_ex; 1325c9de560dSAlex Tomas struct ext4_free_extent *gex = &ac->ac_g_ex; 1326c9de560dSAlex Tomas struct ext4_free_extent ex; 1327c9de560dSAlex Tomas int max; 1328c9de560dSAlex Tomas 1329c9de560dSAlex Tomas /* 1330c9de560dSAlex Tomas * We don't want to scan for a whole year 1331c9de560dSAlex Tomas */ 1332c9de560dSAlex Tomas if (ac->ac_found > sbi->s_mb_max_to_scan && 1333c9de560dSAlex Tomas !(ac->ac_flags & EXT4_MB_HINT_FIRST)) { 1334c9de560dSAlex Tomas ac->ac_status = AC_STATUS_BREAK; 1335c9de560dSAlex Tomas return; 1336c9de560dSAlex Tomas } 1337c9de560dSAlex Tomas 1338c9de560dSAlex Tomas /* 1339c9de560dSAlex Tomas * Haven't found good chunk so far, let's continue 1340c9de560dSAlex Tomas */ 1341c9de560dSAlex Tomas if (bex->fe_len < gex->fe_len) 1342c9de560dSAlex Tomas return; 1343c9de560dSAlex Tomas 1344c9de560dSAlex Tomas if ((finish_group || ac->ac_found > sbi->s_mb_min_to_scan) 1345c9de560dSAlex Tomas && bex->fe_group == e4b->bd_group) { 1346c9de560dSAlex Tomas /* recheck chunk's availability - we don't know 1347c9de560dSAlex Tomas * when it was found (within this lock-unlock 1348c9de560dSAlex Tomas * period or not) */ 1349c9de560dSAlex Tomas max = mb_find_extent(e4b, 0, bex->fe_start, gex->fe_len, &ex); 1350c9de560dSAlex Tomas if (max >= gex->fe_len) { 1351c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1352c9de560dSAlex Tomas return; 1353c9de560dSAlex Tomas } 1354c9de560dSAlex Tomas } 1355c9de560dSAlex Tomas } 1356c9de560dSAlex Tomas 1357c9de560dSAlex Tomas /* 1358c9de560dSAlex Tomas * The routine checks whether found extent is good enough. If it is, 1359c9de560dSAlex Tomas * then the extent gets marked used and flag is set to the context 1360c9de560dSAlex Tomas * to stop scanning. Otherwise, the extent is compared with the 1361c9de560dSAlex Tomas * previous found extent and if new one is better, then it's stored 1362c9de560dSAlex Tomas * in the context. Later, the best found extent will be used, if 1363c9de560dSAlex Tomas * mballoc can't find good enough extent. 1364c9de560dSAlex Tomas * 1365c9de560dSAlex Tomas * FIXME: real allocation policy is to be designed yet! 1366c9de560dSAlex Tomas */ 1367c9de560dSAlex Tomas static void ext4_mb_measure_extent(struct ext4_allocation_context *ac, 1368c9de560dSAlex Tomas struct ext4_free_extent *ex, 1369c9de560dSAlex Tomas struct ext4_buddy *e4b) 1370c9de560dSAlex Tomas { 1371c9de560dSAlex Tomas struct ext4_free_extent *bex = &ac->ac_b_ex; 1372c9de560dSAlex Tomas struct ext4_free_extent *gex = &ac->ac_g_ex; 1373c9de560dSAlex Tomas 1374c9de560dSAlex Tomas BUG_ON(ex->fe_len <= 0); 1375c9de560dSAlex Tomas BUG_ON(ex->fe_len >= EXT4_BLOCKS_PER_GROUP(ac->ac_sb)); 1376c9de560dSAlex Tomas BUG_ON(ex->fe_start >= EXT4_BLOCKS_PER_GROUP(ac->ac_sb)); 1377c9de560dSAlex Tomas BUG_ON(ac->ac_status != AC_STATUS_CONTINUE); 1378c9de560dSAlex Tomas 1379c9de560dSAlex Tomas ac->ac_found++; 1380c9de560dSAlex Tomas 1381c9de560dSAlex Tomas /* 1382c9de560dSAlex Tomas * The special case - take what you catch first 1383c9de560dSAlex Tomas */ 1384c9de560dSAlex Tomas if (unlikely(ac->ac_flags & EXT4_MB_HINT_FIRST)) { 1385c9de560dSAlex Tomas *bex = *ex; 1386c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1387c9de560dSAlex Tomas return; 1388c9de560dSAlex Tomas } 1389c9de560dSAlex Tomas 1390c9de560dSAlex Tomas /* 1391c9de560dSAlex Tomas * Let's check whether the chuck is good enough 1392c9de560dSAlex Tomas */ 1393c9de560dSAlex Tomas if (ex->fe_len == gex->fe_len) { 1394c9de560dSAlex Tomas *bex = *ex; 1395c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1396c9de560dSAlex Tomas return; 1397c9de560dSAlex Tomas } 1398c9de560dSAlex Tomas 1399c9de560dSAlex Tomas /* 1400c9de560dSAlex Tomas * If this is first found extent, just store it in the context 1401c9de560dSAlex Tomas */ 1402c9de560dSAlex Tomas if (bex->fe_len == 0) { 1403c9de560dSAlex Tomas *bex = *ex; 1404c9de560dSAlex Tomas return; 1405c9de560dSAlex Tomas } 1406c9de560dSAlex Tomas 1407c9de560dSAlex Tomas /* 1408c9de560dSAlex Tomas * If new found extent is better, store it in the context 1409c9de560dSAlex Tomas */ 1410c9de560dSAlex Tomas if (bex->fe_len < gex->fe_len) { 1411c9de560dSAlex Tomas /* if the request isn't satisfied, any found extent 1412c9de560dSAlex Tomas * larger than previous best one is better */ 1413c9de560dSAlex Tomas if (ex->fe_len > bex->fe_len) 1414c9de560dSAlex Tomas *bex = *ex; 1415c9de560dSAlex Tomas } else if (ex->fe_len > gex->fe_len) { 1416c9de560dSAlex Tomas /* if the request is satisfied, then we try to find 1417c9de560dSAlex Tomas * an extent that still satisfy the request, but is 1418c9de560dSAlex Tomas * smaller than previous one */ 1419c9de560dSAlex Tomas if (ex->fe_len < bex->fe_len) 1420c9de560dSAlex Tomas *bex = *ex; 1421c9de560dSAlex Tomas } 1422c9de560dSAlex Tomas 1423c9de560dSAlex Tomas ext4_mb_check_limits(ac, e4b, 0); 1424c9de560dSAlex Tomas } 1425c9de560dSAlex Tomas 1426c9de560dSAlex Tomas static int ext4_mb_try_best_found(struct ext4_allocation_context *ac, 1427c9de560dSAlex Tomas struct ext4_buddy *e4b) 1428c9de560dSAlex Tomas { 1429c9de560dSAlex Tomas struct ext4_free_extent ex = ac->ac_b_ex; 1430c9de560dSAlex Tomas ext4_group_t group = ex.fe_group; 1431c9de560dSAlex Tomas int max; 1432c9de560dSAlex Tomas int err; 1433c9de560dSAlex Tomas 1434c9de560dSAlex Tomas BUG_ON(ex.fe_len <= 0); 1435c9de560dSAlex Tomas err = ext4_mb_load_buddy(ac->ac_sb, group, e4b); 1436c9de560dSAlex Tomas if (err) 1437c9de560dSAlex Tomas return err; 1438c9de560dSAlex Tomas 1439c9de560dSAlex Tomas ext4_lock_group(ac->ac_sb, group); 1440c9de560dSAlex Tomas max = mb_find_extent(e4b, 0, ex.fe_start, ex.fe_len, &ex); 1441c9de560dSAlex Tomas 1442c9de560dSAlex Tomas if (max > 0) { 1443c9de560dSAlex Tomas ac->ac_b_ex = ex; 1444c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1445c9de560dSAlex Tomas } 1446c9de560dSAlex Tomas 1447c9de560dSAlex Tomas ext4_unlock_group(ac->ac_sb, group); 1448c9de560dSAlex Tomas ext4_mb_release_desc(e4b); 1449c9de560dSAlex Tomas 1450c9de560dSAlex Tomas return 0; 1451c9de560dSAlex Tomas } 1452c9de560dSAlex Tomas 1453c9de560dSAlex Tomas static int ext4_mb_find_by_goal(struct ext4_allocation_context *ac, 1454c9de560dSAlex Tomas struct ext4_buddy *e4b) 1455c9de560dSAlex Tomas { 1456c9de560dSAlex Tomas ext4_group_t group = ac->ac_g_ex.fe_group; 1457c9de560dSAlex Tomas int max; 1458c9de560dSAlex Tomas int err; 1459c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); 1460c9de560dSAlex Tomas struct ext4_super_block *es = sbi->s_es; 1461c9de560dSAlex Tomas struct ext4_free_extent ex; 1462c9de560dSAlex Tomas 1463c9de560dSAlex Tomas if (!(ac->ac_flags & EXT4_MB_HINT_TRY_GOAL)) 1464c9de560dSAlex Tomas return 0; 1465c9de560dSAlex Tomas 1466c9de560dSAlex Tomas err = ext4_mb_load_buddy(ac->ac_sb, group, e4b); 1467c9de560dSAlex Tomas if (err) 1468c9de560dSAlex Tomas return err; 1469c9de560dSAlex Tomas 1470c9de560dSAlex Tomas ext4_lock_group(ac->ac_sb, group); 1471c9de560dSAlex Tomas max = mb_find_extent(e4b, 0, ac->ac_g_ex.fe_start, 1472c9de560dSAlex Tomas ac->ac_g_ex.fe_len, &ex); 1473c9de560dSAlex Tomas 1474c9de560dSAlex Tomas if (max >= ac->ac_g_ex.fe_len && ac->ac_g_ex.fe_len == sbi->s_stripe) { 1475c9de560dSAlex Tomas ext4_fsblk_t start; 1476c9de560dSAlex Tomas 1477c9de560dSAlex Tomas start = (e4b->bd_group * EXT4_BLOCKS_PER_GROUP(ac->ac_sb)) + 1478c9de560dSAlex Tomas ex.fe_start + le32_to_cpu(es->s_first_data_block); 1479c9de560dSAlex Tomas /* use do_div to get remainder (would be 64-bit modulo) */ 1480c9de560dSAlex Tomas if (do_div(start, sbi->s_stripe) == 0) { 1481c9de560dSAlex Tomas ac->ac_found++; 1482c9de560dSAlex Tomas ac->ac_b_ex = ex; 1483c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1484c9de560dSAlex Tomas } 1485c9de560dSAlex Tomas } else if (max >= ac->ac_g_ex.fe_len) { 1486c9de560dSAlex Tomas BUG_ON(ex.fe_len <= 0); 1487c9de560dSAlex Tomas BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group); 1488c9de560dSAlex Tomas BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start); 1489c9de560dSAlex Tomas ac->ac_found++; 1490c9de560dSAlex Tomas ac->ac_b_ex = ex; 1491c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1492c9de560dSAlex Tomas } else if (max > 0 && (ac->ac_flags & EXT4_MB_HINT_MERGE)) { 1493c9de560dSAlex Tomas /* Sometimes, caller may want to merge even small 1494c9de560dSAlex Tomas * number of blocks to an existing extent */ 1495c9de560dSAlex Tomas BUG_ON(ex.fe_len <= 0); 1496c9de560dSAlex Tomas BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group); 1497c9de560dSAlex Tomas BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start); 1498c9de560dSAlex Tomas ac->ac_found++; 1499c9de560dSAlex Tomas ac->ac_b_ex = ex; 1500c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1501c9de560dSAlex Tomas } 1502c9de560dSAlex Tomas ext4_unlock_group(ac->ac_sb, group); 1503c9de560dSAlex Tomas ext4_mb_release_desc(e4b); 1504c9de560dSAlex Tomas 1505c9de560dSAlex Tomas return 0; 1506c9de560dSAlex Tomas } 1507c9de560dSAlex Tomas 1508c9de560dSAlex Tomas /* 1509c9de560dSAlex Tomas * The routine scans buddy structures (not bitmap!) from given order 1510c9de560dSAlex Tomas * to max order and tries to find big enough chunk to satisfy the req 1511c9de560dSAlex Tomas */ 1512c9de560dSAlex Tomas static void ext4_mb_simple_scan_group(struct ext4_allocation_context *ac, 1513c9de560dSAlex Tomas struct ext4_buddy *e4b) 1514c9de560dSAlex Tomas { 1515c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 1516c9de560dSAlex Tomas struct ext4_group_info *grp = e4b->bd_info; 1517c9de560dSAlex Tomas void *buddy; 1518c9de560dSAlex Tomas int i; 1519c9de560dSAlex Tomas int k; 1520c9de560dSAlex Tomas int max; 1521c9de560dSAlex Tomas 1522c9de560dSAlex Tomas BUG_ON(ac->ac_2order <= 0); 1523c9de560dSAlex Tomas for (i = ac->ac_2order; i <= sb->s_blocksize_bits + 1; i++) { 1524c9de560dSAlex Tomas if (grp->bb_counters[i] == 0) 1525c9de560dSAlex Tomas continue; 1526c9de560dSAlex Tomas 1527c9de560dSAlex Tomas buddy = mb_find_buddy(e4b, i, &max); 1528c9de560dSAlex Tomas BUG_ON(buddy == NULL); 1529c9de560dSAlex Tomas 1530ffad0a44SAneesh Kumar K.V k = mb_find_next_zero_bit(buddy, max, 0); 1531c9de560dSAlex Tomas BUG_ON(k >= max); 1532c9de560dSAlex Tomas 1533c9de560dSAlex Tomas ac->ac_found++; 1534c9de560dSAlex Tomas 1535c9de560dSAlex Tomas ac->ac_b_ex.fe_len = 1 << i; 1536c9de560dSAlex Tomas ac->ac_b_ex.fe_start = k << i; 1537c9de560dSAlex Tomas ac->ac_b_ex.fe_group = e4b->bd_group; 1538c9de560dSAlex Tomas 1539c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1540c9de560dSAlex Tomas 1541c9de560dSAlex Tomas BUG_ON(ac->ac_b_ex.fe_len != ac->ac_g_ex.fe_len); 1542c9de560dSAlex Tomas 1543c9de560dSAlex Tomas if (EXT4_SB(sb)->s_mb_stats) 1544c9de560dSAlex Tomas atomic_inc(&EXT4_SB(sb)->s_bal_2orders); 1545c9de560dSAlex Tomas 1546c9de560dSAlex Tomas break; 1547c9de560dSAlex Tomas } 1548c9de560dSAlex Tomas } 1549c9de560dSAlex Tomas 1550c9de560dSAlex Tomas /* 1551c9de560dSAlex Tomas * The routine scans the group and measures all found extents. 1552c9de560dSAlex Tomas * In order to optimize scanning, caller must pass number of 1553c9de560dSAlex Tomas * free blocks in the group, so the routine can know upper limit. 1554c9de560dSAlex Tomas */ 1555c9de560dSAlex Tomas static void ext4_mb_complex_scan_group(struct ext4_allocation_context *ac, 1556c9de560dSAlex Tomas struct ext4_buddy *e4b) 1557c9de560dSAlex Tomas { 1558c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 1559c9de560dSAlex Tomas void *bitmap = EXT4_MB_BITMAP(e4b); 1560c9de560dSAlex Tomas struct ext4_free_extent ex; 1561c9de560dSAlex Tomas int i; 1562c9de560dSAlex Tomas int free; 1563c9de560dSAlex Tomas 1564c9de560dSAlex Tomas free = e4b->bd_info->bb_free; 1565c9de560dSAlex Tomas BUG_ON(free <= 0); 1566c9de560dSAlex Tomas 1567c9de560dSAlex Tomas i = e4b->bd_info->bb_first_free; 1568c9de560dSAlex Tomas 1569c9de560dSAlex Tomas while (free && ac->ac_status == AC_STATUS_CONTINUE) { 1570ffad0a44SAneesh Kumar K.V i = mb_find_next_zero_bit(bitmap, 1571c9de560dSAlex Tomas EXT4_BLOCKS_PER_GROUP(sb), i); 1572c9de560dSAlex Tomas if (i >= EXT4_BLOCKS_PER_GROUP(sb)) { 157326346ff6SAneesh Kumar K.V /* 1574e56eb659SAneesh Kumar K.V * IF we have corrupt bitmap, we won't find any 157526346ff6SAneesh Kumar K.V * free blocks even though group info says we 157626346ff6SAneesh Kumar K.V * we have free blocks 157726346ff6SAneesh Kumar K.V */ 157846e665e9SHarvey Harrison ext4_error(sb, __func__, "%d free blocks as per " 157926346ff6SAneesh Kumar K.V "group info. But bitmap says 0\n", 158026346ff6SAneesh Kumar K.V free); 1581c9de560dSAlex Tomas break; 1582c9de560dSAlex Tomas } 1583c9de560dSAlex Tomas 1584c9de560dSAlex Tomas mb_find_extent(e4b, 0, i, ac->ac_g_ex.fe_len, &ex); 1585c9de560dSAlex Tomas BUG_ON(ex.fe_len <= 0); 158626346ff6SAneesh Kumar K.V if (free < ex.fe_len) { 158746e665e9SHarvey Harrison ext4_error(sb, __func__, "%d free blocks as per " 158826346ff6SAneesh Kumar K.V "group info. But got %d blocks\n", 158926346ff6SAneesh Kumar K.V free, ex.fe_len); 1590e56eb659SAneesh Kumar K.V /* 1591e56eb659SAneesh Kumar K.V * The number of free blocks differs. This mostly 1592e56eb659SAneesh Kumar K.V * indicate that the bitmap is corrupt. So exit 1593e56eb659SAneesh Kumar K.V * without claiming the space. 1594e56eb659SAneesh Kumar K.V */ 1595e56eb659SAneesh Kumar K.V break; 159626346ff6SAneesh Kumar K.V } 1597c9de560dSAlex Tomas 1598c9de560dSAlex Tomas ext4_mb_measure_extent(ac, &ex, e4b); 1599c9de560dSAlex Tomas 1600c9de560dSAlex Tomas i += ex.fe_len; 1601c9de560dSAlex Tomas free -= ex.fe_len; 1602c9de560dSAlex Tomas } 1603c9de560dSAlex Tomas 1604c9de560dSAlex Tomas ext4_mb_check_limits(ac, e4b, 1); 1605c9de560dSAlex Tomas } 1606c9de560dSAlex Tomas 1607c9de560dSAlex Tomas /* 1608c9de560dSAlex Tomas * This is a special case for storages like raid5 1609c9de560dSAlex Tomas * we try to find stripe-aligned chunks for stripe-size requests 1610c9de560dSAlex Tomas * XXX should do so at least for multiples of stripe size as well 1611c9de560dSAlex Tomas */ 1612c9de560dSAlex Tomas static void ext4_mb_scan_aligned(struct ext4_allocation_context *ac, 1613c9de560dSAlex Tomas struct ext4_buddy *e4b) 1614c9de560dSAlex Tomas { 1615c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 1616c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 1617c9de560dSAlex Tomas void *bitmap = EXT4_MB_BITMAP(e4b); 1618c9de560dSAlex Tomas struct ext4_free_extent ex; 1619c9de560dSAlex Tomas ext4_fsblk_t first_group_block; 1620c9de560dSAlex Tomas ext4_fsblk_t a; 1621c9de560dSAlex Tomas ext4_grpblk_t i; 1622c9de560dSAlex Tomas int max; 1623c9de560dSAlex Tomas 1624c9de560dSAlex Tomas BUG_ON(sbi->s_stripe == 0); 1625c9de560dSAlex Tomas 1626c9de560dSAlex Tomas /* find first stripe-aligned block in group */ 1627c9de560dSAlex Tomas first_group_block = e4b->bd_group * EXT4_BLOCKS_PER_GROUP(sb) 1628c9de560dSAlex Tomas + le32_to_cpu(sbi->s_es->s_first_data_block); 1629c9de560dSAlex Tomas a = first_group_block + sbi->s_stripe - 1; 1630c9de560dSAlex Tomas do_div(a, sbi->s_stripe); 1631c9de560dSAlex Tomas i = (a * sbi->s_stripe) - first_group_block; 1632c9de560dSAlex Tomas 1633c9de560dSAlex Tomas while (i < EXT4_BLOCKS_PER_GROUP(sb)) { 1634c9de560dSAlex Tomas if (!mb_test_bit(i, bitmap)) { 1635c9de560dSAlex Tomas max = mb_find_extent(e4b, 0, i, sbi->s_stripe, &ex); 1636c9de560dSAlex Tomas if (max >= sbi->s_stripe) { 1637c9de560dSAlex Tomas ac->ac_found++; 1638c9de560dSAlex Tomas ac->ac_b_ex = ex; 1639c9de560dSAlex Tomas ext4_mb_use_best_found(ac, e4b); 1640c9de560dSAlex Tomas break; 1641c9de560dSAlex Tomas } 1642c9de560dSAlex Tomas } 1643c9de560dSAlex Tomas i += sbi->s_stripe; 1644c9de560dSAlex Tomas } 1645c9de560dSAlex Tomas } 1646c9de560dSAlex Tomas 1647c9de560dSAlex Tomas static int ext4_mb_good_group(struct ext4_allocation_context *ac, 1648c9de560dSAlex Tomas ext4_group_t group, int cr) 1649c9de560dSAlex Tomas { 1650c9de560dSAlex Tomas unsigned free, fragments; 1651c9de560dSAlex Tomas unsigned i, bits; 1652c9de560dSAlex Tomas struct ext4_group_desc *desc; 1653c9de560dSAlex Tomas struct ext4_group_info *grp = ext4_get_group_info(ac->ac_sb, group); 1654c9de560dSAlex Tomas 1655c9de560dSAlex Tomas BUG_ON(cr < 0 || cr >= 4); 1656c9de560dSAlex Tomas BUG_ON(EXT4_MB_GRP_NEED_INIT(grp)); 1657c9de560dSAlex Tomas 1658c9de560dSAlex Tomas free = grp->bb_free; 1659c9de560dSAlex Tomas fragments = grp->bb_fragments; 1660c9de560dSAlex Tomas if (free == 0) 1661c9de560dSAlex Tomas return 0; 1662c9de560dSAlex Tomas if (fragments == 0) 1663c9de560dSAlex Tomas return 0; 1664c9de560dSAlex Tomas 1665c9de560dSAlex Tomas switch (cr) { 1666c9de560dSAlex Tomas case 0: 1667c9de560dSAlex Tomas BUG_ON(ac->ac_2order == 0); 1668c9de560dSAlex Tomas /* If this group is uninitialized, skip it initially */ 1669c9de560dSAlex Tomas desc = ext4_get_group_desc(ac->ac_sb, group, NULL); 1670c9de560dSAlex Tomas if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) 1671c9de560dSAlex Tomas return 0; 1672c9de560dSAlex Tomas 1673c9de560dSAlex Tomas bits = ac->ac_sb->s_blocksize_bits + 1; 1674c9de560dSAlex Tomas for (i = ac->ac_2order; i <= bits; i++) 1675c9de560dSAlex Tomas if (grp->bb_counters[i] > 0) 1676c9de560dSAlex Tomas return 1; 1677c9de560dSAlex Tomas break; 1678c9de560dSAlex Tomas case 1: 1679c9de560dSAlex Tomas if ((free / fragments) >= ac->ac_g_ex.fe_len) 1680c9de560dSAlex Tomas return 1; 1681c9de560dSAlex Tomas break; 1682c9de560dSAlex Tomas case 2: 1683c9de560dSAlex Tomas if (free >= ac->ac_g_ex.fe_len) 1684c9de560dSAlex Tomas return 1; 1685c9de560dSAlex Tomas break; 1686c9de560dSAlex Tomas case 3: 1687c9de560dSAlex Tomas return 1; 1688c9de560dSAlex Tomas default: 1689c9de560dSAlex Tomas BUG(); 1690c9de560dSAlex Tomas } 1691c9de560dSAlex Tomas 1692c9de560dSAlex Tomas return 0; 1693c9de560dSAlex Tomas } 1694c9de560dSAlex Tomas 16954ddfef7bSEric Sandeen static noinline_for_stack int 16964ddfef7bSEric Sandeen ext4_mb_regular_allocator(struct ext4_allocation_context *ac) 1697c9de560dSAlex Tomas { 1698c9de560dSAlex Tomas ext4_group_t group; 1699c9de560dSAlex Tomas ext4_group_t i; 1700c9de560dSAlex Tomas int cr; 1701c9de560dSAlex Tomas int err = 0; 1702c9de560dSAlex Tomas int bsbits; 1703c9de560dSAlex Tomas struct ext4_sb_info *sbi; 1704c9de560dSAlex Tomas struct super_block *sb; 1705c9de560dSAlex Tomas struct ext4_buddy e4b; 1706c9de560dSAlex Tomas loff_t size, isize; 1707c9de560dSAlex Tomas 1708c9de560dSAlex Tomas sb = ac->ac_sb; 1709c9de560dSAlex Tomas sbi = EXT4_SB(sb); 1710c9de560dSAlex Tomas BUG_ON(ac->ac_status == AC_STATUS_FOUND); 1711c9de560dSAlex Tomas 1712c9de560dSAlex Tomas /* first, try the goal */ 1713c9de560dSAlex Tomas err = ext4_mb_find_by_goal(ac, &e4b); 1714c9de560dSAlex Tomas if (err || ac->ac_status == AC_STATUS_FOUND) 1715c9de560dSAlex Tomas goto out; 1716c9de560dSAlex Tomas 1717c9de560dSAlex Tomas if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) 1718c9de560dSAlex Tomas goto out; 1719c9de560dSAlex Tomas 1720c9de560dSAlex Tomas /* 1721c9de560dSAlex Tomas * ac->ac2_order is set only if the fe_len is a power of 2 1722c9de560dSAlex Tomas * if ac2_order is set we also set criteria to 0 so that we 1723c9de560dSAlex Tomas * try exact allocation using buddy. 1724c9de560dSAlex Tomas */ 1725c9de560dSAlex Tomas i = fls(ac->ac_g_ex.fe_len); 1726c9de560dSAlex Tomas ac->ac_2order = 0; 1727c9de560dSAlex Tomas /* 1728c9de560dSAlex Tomas * We search using buddy data only if the order of the request 1729c9de560dSAlex Tomas * is greater than equal to the sbi_s_mb_order2_reqs 1730c9de560dSAlex Tomas * You can tune it via /proc/fs/ext4/<partition>/order2_req 1731c9de560dSAlex Tomas */ 1732c9de560dSAlex Tomas if (i >= sbi->s_mb_order2_reqs) { 1733c9de560dSAlex Tomas /* 1734c9de560dSAlex Tomas * This should tell if fe_len is exactly power of 2 1735c9de560dSAlex Tomas */ 1736c9de560dSAlex Tomas if ((ac->ac_g_ex.fe_len & (~(1 << (i - 1)))) == 0) 1737c9de560dSAlex Tomas ac->ac_2order = i - 1; 1738c9de560dSAlex Tomas } 1739c9de560dSAlex Tomas 1740c9de560dSAlex Tomas bsbits = ac->ac_sb->s_blocksize_bits; 1741c9de560dSAlex Tomas /* if stream allocation is enabled, use global goal */ 1742c9de560dSAlex Tomas size = ac->ac_o_ex.fe_logical + ac->ac_o_ex.fe_len; 1743c9de560dSAlex Tomas isize = i_size_read(ac->ac_inode) >> bsbits; 1744c9de560dSAlex Tomas if (size < isize) 1745c9de560dSAlex Tomas size = isize; 1746c9de560dSAlex Tomas 1747c9de560dSAlex Tomas if (size < sbi->s_mb_stream_request && 1748c9de560dSAlex Tomas (ac->ac_flags & EXT4_MB_HINT_DATA)) { 1749c9de560dSAlex Tomas /* TBD: may be hot point */ 1750c9de560dSAlex Tomas spin_lock(&sbi->s_md_lock); 1751c9de560dSAlex Tomas ac->ac_g_ex.fe_group = sbi->s_mb_last_group; 1752c9de560dSAlex Tomas ac->ac_g_ex.fe_start = sbi->s_mb_last_start; 1753c9de560dSAlex Tomas spin_unlock(&sbi->s_md_lock); 1754c9de560dSAlex Tomas } 1755c9de560dSAlex Tomas /* Let's just scan groups to find more-less suitable blocks */ 1756c9de560dSAlex Tomas cr = ac->ac_2order ? 0 : 1; 1757c9de560dSAlex Tomas /* 1758c9de560dSAlex Tomas * cr == 0 try to get exact allocation, 1759c9de560dSAlex Tomas * cr == 3 try to get anything 1760c9de560dSAlex Tomas */ 1761c9de560dSAlex Tomas repeat: 1762c9de560dSAlex Tomas for (; cr < 4 && ac->ac_status == AC_STATUS_CONTINUE; cr++) { 1763c9de560dSAlex Tomas ac->ac_criteria = cr; 1764ed8f9c75SAneesh Kumar K.V /* 1765ed8f9c75SAneesh Kumar K.V * searching for the right group start 1766ed8f9c75SAneesh Kumar K.V * from the goal value specified 1767ed8f9c75SAneesh Kumar K.V */ 1768ed8f9c75SAneesh Kumar K.V group = ac->ac_g_ex.fe_group; 1769ed8f9c75SAneesh Kumar K.V 1770c9de560dSAlex Tomas for (i = 0; i < EXT4_SB(sb)->s_groups_count; group++, i++) { 1771c9de560dSAlex Tomas struct ext4_group_info *grp; 1772c9de560dSAlex Tomas struct ext4_group_desc *desc; 1773c9de560dSAlex Tomas 1774c9de560dSAlex Tomas if (group == EXT4_SB(sb)->s_groups_count) 1775c9de560dSAlex Tomas group = 0; 1776c9de560dSAlex Tomas 1777c9de560dSAlex Tomas /* quick check to skip empty groups */ 1778c9de560dSAlex Tomas grp = ext4_get_group_info(ac->ac_sb, group); 1779c9de560dSAlex Tomas if (grp->bb_free == 0) 1780c9de560dSAlex Tomas continue; 1781c9de560dSAlex Tomas 1782c9de560dSAlex Tomas /* 1783c9de560dSAlex Tomas * if the group is already init we check whether it is 1784c9de560dSAlex Tomas * a good group and if not we don't load the buddy 1785c9de560dSAlex Tomas */ 1786c9de560dSAlex Tomas if (EXT4_MB_GRP_NEED_INIT(grp)) { 1787c9de560dSAlex Tomas /* 1788c9de560dSAlex Tomas * we need full data about the group 1789c9de560dSAlex Tomas * to make a good selection 1790c9de560dSAlex Tomas */ 1791c9de560dSAlex Tomas err = ext4_mb_load_buddy(sb, group, &e4b); 1792c9de560dSAlex Tomas if (err) 1793c9de560dSAlex Tomas goto out; 1794c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 1795c9de560dSAlex Tomas } 1796c9de560dSAlex Tomas 1797c9de560dSAlex Tomas /* 1798c9de560dSAlex Tomas * If the particular group doesn't satisfy our 1799c9de560dSAlex Tomas * criteria we continue with the next group 1800c9de560dSAlex Tomas */ 1801c9de560dSAlex Tomas if (!ext4_mb_good_group(ac, group, cr)) 1802c9de560dSAlex Tomas continue; 1803c9de560dSAlex Tomas 1804c9de560dSAlex Tomas err = ext4_mb_load_buddy(sb, group, &e4b); 1805c9de560dSAlex Tomas if (err) 1806c9de560dSAlex Tomas goto out; 1807c9de560dSAlex Tomas 1808c9de560dSAlex Tomas ext4_lock_group(sb, group); 1809c9de560dSAlex Tomas if (!ext4_mb_good_group(ac, group, cr)) { 1810c9de560dSAlex Tomas /* someone did allocation from this group */ 1811c9de560dSAlex Tomas ext4_unlock_group(sb, group); 1812c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 1813c9de560dSAlex Tomas continue; 1814c9de560dSAlex Tomas } 1815c9de560dSAlex Tomas 1816c9de560dSAlex Tomas ac->ac_groups_scanned++; 1817c9de560dSAlex Tomas desc = ext4_get_group_desc(sb, group, NULL); 1818c9de560dSAlex Tomas if (cr == 0 || (desc->bg_flags & 1819c9de560dSAlex Tomas cpu_to_le16(EXT4_BG_BLOCK_UNINIT) && 1820c9de560dSAlex Tomas ac->ac_2order != 0)) 1821c9de560dSAlex Tomas ext4_mb_simple_scan_group(ac, &e4b); 1822c9de560dSAlex Tomas else if (cr == 1 && 1823c9de560dSAlex Tomas ac->ac_g_ex.fe_len == sbi->s_stripe) 1824c9de560dSAlex Tomas ext4_mb_scan_aligned(ac, &e4b); 1825c9de560dSAlex Tomas else 1826c9de560dSAlex Tomas ext4_mb_complex_scan_group(ac, &e4b); 1827c9de560dSAlex Tomas 1828c9de560dSAlex Tomas ext4_unlock_group(sb, group); 1829c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 1830c9de560dSAlex Tomas 1831c9de560dSAlex Tomas if (ac->ac_status != AC_STATUS_CONTINUE) 1832c9de560dSAlex Tomas break; 1833c9de560dSAlex Tomas } 1834c9de560dSAlex Tomas } 1835c9de560dSAlex Tomas 1836c9de560dSAlex Tomas if (ac->ac_b_ex.fe_len > 0 && ac->ac_status != AC_STATUS_FOUND && 1837c9de560dSAlex Tomas !(ac->ac_flags & EXT4_MB_HINT_FIRST)) { 1838c9de560dSAlex Tomas /* 1839c9de560dSAlex Tomas * We've been searching too long. Let's try to allocate 1840c9de560dSAlex Tomas * the best chunk we've found so far 1841c9de560dSAlex Tomas */ 1842c9de560dSAlex Tomas 1843c9de560dSAlex Tomas ext4_mb_try_best_found(ac, &e4b); 1844c9de560dSAlex Tomas if (ac->ac_status != AC_STATUS_FOUND) { 1845c9de560dSAlex Tomas /* 1846c9de560dSAlex Tomas * Someone more lucky has already allocated it. 1847c9de560dSAlex Tomas * The only thing we can do is just take first 1848c9de560dSAlex Tomas * found block(s) 1849c9de560dSAlex Tomas printk(KERN_DEBUG "EXT4-fs: someone won our chunk\n"); 1850c9de560dSAlex Tomas */ 1851c9de560dSAlex Tomas ac->ac_b_ex.fe_group = 0; 1852c9de560dSAlex Tomas ac->ac_b_ex.fe_start = 0; 1853c9de560dSAlex Tomas ac->ac_b_ex.fe_len = 0; 1854c9de560dSAlex Tomas ac->ac_status = AC_STATUS_CONTINUE; 1855c9de560dSAlex Tomas ac->ac_flags |= EXT4_MB_HINT_FIRST; 1856c9de560dSAlex Tomas cr = 3; 1857c9de560dSAlex Tomas atomic_inc(&sbi->s_mb_lost_chunks); 1858c9de560dSAlex Tomas goto repeat; 1859c9de560dSAlex Tomas } 1860c9de560dSAlex Tomas } 1861c9de560dSAlex Tomas out: 1862c9de560dSAlex Tomas return err; 1863c9de560dSAlex Tomas } 1864c9de560dSAlex Tomas 1865c9de560dSAlex Tomas #ifdef EXT4_MB_HISTORY 1866c9de560dSAlex Tomas struct ext4_mb_proc_session { 1867c9de560dSAlex Tomas struct ext4_mb_history *history; 1868c9de560dSAlex Tomas struct super_block *sb; 1869c9de560dSAlex Tomas int start; 1870c9de560dSAlex Tomas int max; 1871c9de560dSAlex Tomas }; 1872c9de560dSAlex Tomas 1873c9de560dSAlex Tomas static void *ext4_mb_history_skip_empty(struct ext4_mb_proc_session *s, 1874c9de560dSAlex Tomas struct ext4_mb_history *hs, 1875c9de560dSAlex Tomas int first) 1876c9de560dSAlex Tomas { 1877c9de560dSAlex Tomas if (hs == s->history + s->max) 1878c9de560dSAlex Tomas hs = s->history; 1879c9de560dSAlex Tomas if (!first && hs == s->history + s->start) 1880c9de560dSAlex Tomas return NULL; 1881c9de560dSAlex Tomas while (hs->orig.fe_len == 0) { 1882c9de560dSAlex Tomas hs++; 1883c9de560dSAlex Tomas if (hs == s->history + s->max) 1884c9de560dSAlex Tomas hs = s->history; 1885c9de560dSAlex Tomas if (hs == s->history + s->start) 1886c9de560dSAlex Tomas return NULL; 1887c9de560dSAlex Tomas } 1888c9de560dSAlex Tomas return hs; 1889c9de560dSAlex Tomas } 1890c9de560dSAlex Tomas 1891c9de560dSAlex Tomas static void *ext4_mb_seq_history_start(struct seq_file *seq, loff_t *pos) 1892c9de560dSAlex Tomas { 1893c9de560dSAlex Tomas struct ext4_mb_proc_session *s = seq->private; 1894c9de560dSAlex Tomas struct ext4_mb_history *hs; 1895c9de560dSAlex Tomas int l = *pos; 1896c9de560dSAlex Tomas 1897c9de560dSAlex Tomas if (l == 0) 1898c9de560dSAlex Tomas return SEQ_START_TOKEN; 1899c9de560dSAlex Tomas hs = ext4_mb_history_skip_empty(s, s->history + s->start, 1); 1900c9de560dSAlex Tomas if (!hs) 1901c9de560dSAlex Tomas return NULL; 1902c9de560dSAlex Tomas while (--l && (hs = ext4_mb_history_skip_empty(s, ++hs, 0)) != NULL); 1903c9de560dSAlex Tomas return hs; 1904c9de560dSAlex Tomas } 1905c9de560dSAlex Tomas 1906c9de560dSAlex Tomas static void *ext4_mb_seq_history_next(struct seq_file *seq, void *v, 1907c9de560dSAlex Tomas loff_t *pos) 1908c9de560dSAlex Tomas { 1909c9de560dSAlex Tomas struct ext4_mb_proc_session *s = seq->private; 1910c9de560dSAlex Tomas struct ext4_mb_history *hs = v; 1911c9de560dSAlex Tomas 1912c9de560dSAlex Tomas ++*pos; 1913c9de560dSAlex Tomas if (v == SEQ_START_TOKEN) 1914c9de560dSAlex Tomas return ext4_mb_history_skip_empty(s, s->history + s->start, 1); 1915c9de560dSAlex Tomas else 1916c9de560dSAlex Tomas return ext4_mb_history_skip_empty(s, ++hs, 0); 1917c9de560dSAlex Tomas } 1918c9de560dSAlex Tomas 1919c9de560dSAlex Tomas static int ext4_mb_seq_history_show(struct seq_file *seq, void *v) 1920c9de560dSAlex Tomas { 1921c9de560dSAlex Tomas char buf[25], buf2[25], buf3[25], *fmt; 1922c9de560dSAlex Tomas struct ext4_mb_history *hs = v; 1923c9de560dSAlex Tomas 1924c9de560dSAlex Tomas if (v == SEQ_START_TOKEN) { 1925c9de560dSAlex Tomas seq_printf(seq, "%-5s %-8s %-23s %-23s %-23s %-5s " 1926c9de560dSAlex Tomas "%-5s %-2s %-5s %-5s %-5s %-6s\n", 1927c9de560dSAlex Tomas "pid", "inode", "original", "goal", "result", "found", 1928c9de560dSAlex Tomas "grps", "cr", "flags", "merge", "tail", "broken"); 1929c9de560dSAlex Tomas return 0; 1930c9de560dSAlex Tomas } 1931c9de560dSAlex Tomas 1932c9de560dSAlex Tomas if (hs->op == EXT4_MB_HISTORY_ALLOC) { 1933c9de560dSAlex Tomas fmt = "%-5u %-8u %-23s %-23s %-23s %-5u %-5u %-2u " 1934c9de560dSAlex Tomas "%-5u %-5s %-5u %-6u\n"; 1935c9de560dSAlex Tomas sprintf(buf2, "%lu/%d/%u@%u", hs->result.fe_group, 1936c9de560dSAlex Tomas hs->result.fe_start, hs->result.fe_len, 1937c9de560dSAlex Tomas hs->result.fe_logical); 1938c9de560dSAlex Tomas sprintf(buf, "%lu/%d/%u@%u", hs->orig.fe_group, 1939c9de560dSAlex Tomas hs->orig.fe_start, hs->orig.fe_len, 1940c9de560dSAlex Tomas hs->orig.fe_logical); 1941c9de560dSAlex Tomas sprintf(buf3, "%lu/%d/%u@%u", hs->goal.fe_group, 1942c9de560dSAlex Tomas hs->goal.fe_start, hs->goal.fe_len, 1943c9de560dSAlex Tomas hs->goal.fe_logical); 1944c9de560dSAlex Tomas seq_printf(seq, fmt, hs->pid, hs->ino, buf, buf3, buf2, 1945c9de560dSAlex Tomas hs->found, hs->groups, hs->cr, hs->flags, 1946c9de560dSAlex Tomas hs->merged ? "M" : "", hs->tail, 1947c9de560dSAlex Tomas hs->buddy ? 1 << hs->buddy : 0); 1948c9de560dSAlex Tomas } else if (hs->op == EXT4_MB_HISTORY_PREALLOC) { 1949c9de560dSAlex Tomas fmt = "%-5u %-8u %-23s %-23s %-23s\n"; 1950c9de560dSAlex Tomas sprintf(buf2, "%lu/%d/%u@%u", hs->result.fe_group, 1951c9de560dSAlex Tomas hs->result.fe_start, hs->result.fe_len, 1952c9de560dSAlex Tomas hs->result.fe_logical); 1953c9de560dSAlex Tomas sprintf(buf, "%lu/%d/%u@%u", hs->orig.fe_group, 1954c9de560dSAlex Tomas hs->orig.fe_start, hs->orig.fe_len, 1955c9de560dSAlex Tomas hs->orig.fe_logical); 1956c9de560dSAlex Tomas seq_printf(seq, fmt, hs->pid, hs->ino, buf, "", buf2); 1957c9de560dSAlex Tomas } else if (hs->op == EXT4_MB_HISTORY_DISCARD) { 1958c9de560dSAlex Tomas sprintf(buf2, "%lu/%d/%u", hs->result.fe_group, 1959c9de560dSAlex Tomas hs->result.fe_start, hs->result.fe_len); 1960c9de560dSAlex Tomas seq_printf(seq, "%-5u %-8u %-23s discard\n", 1961c9de560dSAlex Tomas hs->pid, hs->ino, buf2); 1962c9de560dSAlex Tomas } else if (hs->op == EXT4_MB_HISTORY_FREE) { 1963c9de560dSAlex Tomas sprintf(buf2, "%lu/%d/%u", hs->result.fe_group, 1964c9de560dSAlex Tomas hs->result.fe_start, hs->result.fe_len); 1965c9de560dSAlex Tomas seq_printf(seq, "%-5u %-8u %-23s free\n", 1966c9de560dSAlex Tomas hs->pid, hs->ino, buf2); 1967c9de560dSAlex Tomas } 1968c9de560dSAlex Tomas return 0; 1969c9de560dSAlex Tomas } 1970c9de560dSAlex Tomas 1971c9de560dSAlex Tomas static void ext4_mb_seq_history_stop(struct seq_file *seq, void *v) 1972c9de560dSAlex Tomas { 1973c9de560dSAlex Tomas } 1974c9de560dSAlex Tomas 1975c9de560dSAlex Tomas static struct seq_operations ext4_mb_seq_history_ops = { 1976c9de560dSAlex Tomas .start = ext4_mb_seq_history_start, 1977c9de560dSAlex Tomas .next = ext4_mb_seq_history_next, 1978c9de560dSAlex Tomas .stop = ext4_mb_seq_history_stop, 1979c9de560dSAlex Tomas .show = ext4_mb_seq_history_show, 1980c9de560dSAlex Tomas }; 1981c9de560dSAlex Tomas 1982c9de560dSAlex Tomas static int ext4_mb_seq_history_open(struct inode *inode, struct file *file) 1983c9de560dSAlex Tomas { 1984c9de560dSAlex Tomas struct super_block *sb = PDE(inode)->data; 1985c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 1986c9de560dSAlex Tomas struct ext4_mb_proc_session *s; 1987c9de560dSAlex Tomas int rc; 1988c9de560dSAlex Tomas int size; 1989c9de560dSAlex Tomas 199074767c5aSShen Feng if (unlikely(sbi->s_mb_history == NULL)) 199174767c5aSShen Feng return -ENOMEM; 1992c9de560dSAlex Tomas s = kmalloc(sizeof(*s), GFP_KERNEL); 1993c9de560dSAlex Tomas if (s == NULL) 1994c9de560dSAlex Tomas return -ENOMEM; 1995c9de560dSAlex Tomas s->sb = sb; 1996c9de560dSAlex Tomas size = sizeof(struct ext4_mb_history) * sbi->s_mb_history_max; 1997c9de560dSAlex Tomas s->history = kmalloc(size, GFP_KERNEL); 1998c9de560dSAlex Tomas if (s->history == NULL) { 1999c9de560dSAlex Tomas kfree(s); 2000c9de560dSAlex Tomas return -ENOMEM; 2001c9de560dSAlex Tomas } 2002c9de560dSAlex Tomas 2003c9de560dSAlex Tomas spin_lock(&sbi->s_mb_history_lock); 2004c9de560dSAlex Tomas memcpy(s->history, sbi->s_mb_history, size); 2005c9de560dSAlex Tomas s->max = sbi->s_mb_history_max; 2006c9de560dSAlex Tomas s->start = sbi->s_mb_history_cur % s->max; 2007c9de560dSAlex Tomas spin_unlock(&sbi->s_mb_history_lock); 2008c9de560dSAlex Tomas 2009c9de560dSAlex Tomas rc = seq_open(file, &ext4_mb_seq_history_ops); 2010c9de560dSAlex Tomas if (rc == 0) { 2011c9de560dSAlex Tomas struct seq_file *m = (struct seq_file *)file->private_data; 2012c9de560dSAlex Tomas m->private = s; 2013c9de560dSAlex Tomas } else { 2014c9de560dSAlex Tomas kfree(s->history); 2015c9de560dSAlex Tomas kfree(s); 2016c9de560dSAlex Tomas } 2017c9de560dSAlex Tomas return rc; 2018c9de560dSAlex Tomas 2019c9de560dSAlex Tomas } 2020c9de560dSAlex Tomas 2021c9de560dSAlex Tomas static int ext4_mb_seq_history_release(struct inode *inode, struct file *file) 2022c9de560dSAlex Tomas { 2023c9de560dSAlex Tomas struct seq_file *seq = (struct seq_file *)file->private_data; 2024c9de560dSAlex Tomas struct ext4_mb_proc_session *s = seq->private; 2025c9de560dSAlex Tomas kfree(s->history); 2026c9de560dSAlex Tomas kfree(s); 2027c9de560dSAlex Tomas return seq_release(inode, file); 2028c9de560dSAlex Tomas } 2029c9de560dSAlex Tomas 2030c9de560dSAlex Tomas static ssize_t ext4_mb_seq_history_write(struct file *file, 2031c9de560dSAlex Tomas const char __user *buffer, 2032c9de560dSAlex Tomas size_t count, loff_t *ppos) 2033c9de560dSAlex Tomas { 2034c9de560dSAlex Tomas struct seq_file *seq = (struct seq_file *)file->private_data; 2035c9de560dSAlex Tomas struct ext4_mb_proc_session *s = seq->private; 2036c9de560dSAlex Tomas struct super_block *sb = s->sb; 2037c9de560dSAlex Tomas char str[32]; 2038c9de560dSAlex Tomas int value; 2039c9de560dSAlex Tomas 2040c9de560dSAlex Tomas if (count >= sizeof(str)) { 2041c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: %s string too long, max %u bytes\n", 2042c9de560dSAlex Tomas "mb_history", (int)sizeof(str)); 2043c9de560dSAlex Tomas return -EOVERFLOW; 2044c9de560dSAlex Tomas } 2045c9de560dSAlex Tomas 2046c9de560dSAlex Tomas if (copy_from_user(str, buffer, count)) 2047c9de560dSAlex Tomas return -EFAULT; 2048c9de560dSAlex Tomas 2049c9de560dSAlex Tomas value = simple_strtol(str, NULL, 0); 2050c9de560dSAlex Tomas if (value < 0) 2051c9de560dSAlex Tomas return -ERANGE; 2052c9de560dSAlex Tomas EXT4_SB(sb)->s_mb_history_filter = value; 2053c9de560dSAlex Tomas 2054c9de560dSAlex Tomas return count; 2055c9de560dSAlex Tomas } 2056c9de560dSAlex Tomas 2057c9de560dSAlex Tomas static struct file_operations ext4_mb_seq_history_fops = { 2058c9de560dSAlex Tomas .owner = THIS_MODULE, 2059c9de560dSAlex Tomas .open = ext4_mb_seq_history_open, 2060c9de560dSAlex Tomas .read = seq_read, 2061c9de560dSAlex Tomas .write = ext4_mb_seq_history_write, 2062c9de560dSAlex Tomas .llseek = seq_lseek, 2063c9de560dSAlex Tomas .release = ext4_mb_seq_history_release, 2064c9de560dSAlex Tomas }; 2065c9de560dSAlex Tomas 2066c9de560dSAlex Tomas static void *ext4_mb_seq_groups_start(struct seq_file *seq, loff_t *pos) 2067c9de560dSAlex Tomas { 2068c9de560dSAlex Tomas struct super_block *sb = seq->private; 2069c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2070c9de560dSAlex Tomas ext4_group_t group; 2071c9de560dSAlex Tomas 2072c9de560dSAlex Tomas if (*pos < 0 || *pos >= sbi->s_groups_count) 2073c9de560dSAlex Tomas return NULL; 2074c9de560dSAlex Tomas 2075c9de560dSAlex Tomas group = *pos + 1; 2076c9de560dSAlex Tomas return (void *) group; 2077c9de560dSAlex Tomas } 2078c9de560dSAlex Tomas 2079c9de560dSAlex Tomas static void *ext4_mb_seq_groups_next(struct seq_file *seq, void *v, loff_t *pos) 2080c9de560dSAlex Tomas { 2081c9de560dSAlex Tomas struct super_block *sb = seq->private; 2082c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2083c9de560dSAlex Tomas ext4_group_t group; 2084c9de560dSAlex Tomas 2085c9de560dSAlex Tomas ++*pos; 2086c9de560dSAlex Tomas if (*pos < 0 || *pos >= sbi->s_groups_count) 2087c9de560dSAlex Tomas return NULL; 2088c9de560dSAlex Tomas group = *pos + 1; 2089c9de560dSAlex Tomas return (void *) group;; 2090c9de560dSAlex Tomas } 2091c9de560dSAlex Tomas 2092c9de560dSAlex Tomas static int ext4_mb_seq_groups_show(struct seq_file *seq, void *v) 2093c9de560dSAlex Tomas { 2094c9de560dSAlex Tomas struct super_block *sb = seq->private; 2095c9de560dSAlex Tomas long group = (long) v; 2096c9de560dSAlex Tomas int i; 2097c9de560dSAlex Tomas int err; 2098c9de560dSAlex Tomas struct ext4_buddy e4b; 2099c9de560dSAlex Tomas struct sg { 2100c9de560dSAlex Tomas struct ext4_group_info info; 2101c9de560dSAlex Tomas unsigned short counters[16]; 2102c9de560dSAlex Tomas } sg; 2103c9de560dSAlex Tomas 2104c9de560dSAlex Tomas group--; 2105c9de560dSAlex Tomas if (group == 0) 2106c9de560dSAlex Tomas seq_printf(seq, "#%-5s: %-5s %-5s %-5s " 2107c9de560dSAlex Tomas "[ %-5s %-5s %-5s %-5s %-5s %-5s %-5s " 2108c9de560dSAlex Tomas "%-5s %-5s %-5s %-5s %-5s %-5s %-5s ]\n", 2109c9de560dSAlex Tomas "group", "free", "frags", "first", 2110c9de560dSAlex Tomas "2^0", "2^1", "2^2", "2^3", "2^4", "2^5", "2^6", 2111c9de560dSAlex Tomas "2^7", "2^8", "2^9", "2^10", "2^11", "2^12", "2^13"); 2112c9de560dSAlex Tomas 2113c9de560dSAlex Tomas i = (sb->s_blocksize_bits + 2) * sizeof(sg.info.bb_counters[0]) + 2114c9de560dSAlex Tomas sizeof(struct ext4_group_info); 2115c9de560dSAlex Tomas err = ext4_mb_load_buddy(sb, group, &e4b); 2116c9de560dSAlex Tomas if (err) { 2117c9de560dSAlex Tomas seq_printf(seq, "#%-5lu: I/O error\n", group); 2118c9de560dSAlex Tomas return 0; 2119c9de560dSAlex Tomas } 2120c9de560dSAlex Tomas ext4_lock_group(sb, group); 2121c9de560dSAlex Tomas memcpy(&sg, ext4_get_group_info(sb, group), i); 2122c9de560dSAlex Tomas ext4_unlock_group(sb, group); 2123c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 2124c9de560dSAlex Tomas 2125c9de560dSAlex Tomas seq_printf(seq, "#%-5lu: %-5u %-5u %-5u [", group, sg.info.bb_free, 2126c9de560dSAlex Tomas sg.info.bb_fragments, sg.info.bb_first_free); 2127c9de560dSAlex Tomas for (i = 0; i <= 13; i++) 2128c9de560dSAlex Tomas seq_printf(seq, " %-5u", i <= sb->s_blocksize_bits + 1 ? 2129c9de560dSAlex Tomas sg.info.bb_counters[i] : 0); 2130c9de560dSAlex Tomas seq_printf(seq, " ]\n"); 2131c9de560dSAlex Tomas 2132c9de560dSAlex Tomas return 0; 2133c9de560dSAlex Tomas } 2134c9de560dSAlex Tomas 2135c9de560dSAlex Tomas static void ext4_mb_seq_groups_stop(struct seq_file *seq, void *v) 2136c9de560dSAlex Tomas { 2137c9de560dSAlex Tomas } 2138c9de560dSAlex Tomas 2139c9de560dSAlex Tomas static struct seq_operations ext4_mb_seq_groups_ops = { 2140c9de560dSAlex Tomas .start = ext4_mb_seq_groups_start, 2141c9de560dSAlex Tomas .next = ext4_mb_seq_groups_next, 2142c9de560dSAlex Tomas .stop = ext4_mb_seq_groups_stop, 2143c9de560dSAlex Tomas .show = ext4_mb_seq_groups_show, 2144c9de560dSAlex Tomas }; 2145c9de560dSAlex Tomas 2146c9de560dSAlex Tomas static int ext4_mb_seq_groups_open(struct inode *inode, struct file *file) 2147c9de560dSAlex Tomas { 2148c9de560dSAlex Tomas struct super_block *sb = PDE(inode)->data; 2149c9de560dSAlex Tomas int rc; 2150c9de560dSAlex Tomas 2151c9de560dSAlex Tomas rc = seq_open(file, &ext4_mb_seq_groups_ops); 2152c9de560dSAlex Tomas if (rc == 0) { 2153c9de560dSAlex Tomas struct seq_file *m = (struct seq_file *)file->private_data; 2154c9de560dSAlex Tomas m->private = sb; 2155c9de560dSAlex Tomas } 2156c9de560dSAlex Tomas return rc; 2157c9de560dSAlex Tomas 2158c9de560dSAlex Tomas } 2159c9de560dSAlex Tomas 2160c9de560dSAlex Tomas static struct file_operations ext4_mb_seq_groups_fops = { 2161c9de560dSAlex Tomas .owner = THIS_MODULE, 2162c9de560dSAlex Tomas .open = ext4_mb_seq_groups_open, 2163c9de560dSAlex Tomas .read = seq_read, 2164c9de560dSAlex Tomas .llseek = seq_lseek, 2165c9de560dSAlex Tomas .release = seq_release, 2166c9de560dSAlex Tomas }; 2167c9de560dSAlex Tomas 2168c9de560dSAlex Tomas static void ext4_mb_history_release(struct super_block *sb) 2169c9de560dSAlex Tomas { 2170c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2171c9de560dSAlex Tomas 21729f6200bbSTheodore Ts'o if (sbi->s_proc != NULL) { 21739f6200bbSTheodore Ts'o remove_proc_entry("mb_groups", sbi->s_proc); 21749f6200bbSTheodore Ts'o remove_proc_entry("mb_history", sbi->s_proc); 21759f6200bbSTheodore Ts'o } 2176c9de560dSAlex Tomas kfree(sbi->s_mb_history); 2177c9de560dSAlex Tomas } 2178c9de560dSAlex Tomas 2179c9de560dSAlex Tomas static void ext4_mb_history_init(struct super_block *sb) 2180c9de560dSAlex Tomas { 2181c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2182c9de560dSAlex Tomas int i; 2183c9de560dSAlex Tomas 21849f6200bbSTheodore Ts'o if (sbi->s_proc != NULL) { 21859f6200bbSTheodore Ts'o proc_create_data("mb_history", S_IRUGO, sbi->s_proc, 218646fe74f2SDenis V. Lunev &ext4_mb_seq_history_fops, sb); 21879f6200bbSTheodore Ts'o proc_create_data("mb_groups", S_IRUGO, sbi->s_proc, 218846fe74f2SDenis V. Lunev &ext4_mb_seq_groups_fops, sb); 2189c9de560dSAlex Tomas } 2190c9de560dSAlex Tomas 2191c9de560dSAlex Tomas sbi->s_mb_history_max = 1000; 2192c9de560dSAlex Tomas sbi->s_mb_history_cur = 0; 2193c9de560dSAlex Tomas spin_lock_init(&sbi->s_mb_history_lock); 2194c9de560dSAlex Tomas i = sbi->s_mb_history_max * sizeof(struct ext4_mb_history); 219574767c5aSShen Feng sbi->s_mb_history = kzalloc(i, GFP_KERNEL); 2196c9de560dSAlex Tomas /* if we can't allocate history, then we simple won't use it */ 2197c9de560dSAlex Tomas } 2198c9de560dSAlex Tomas 21994ddfef7bSEric Sandeen static noinline_for_stack void 22004ddfef7bSEric Sandeen ext4_mb_store_history(struct ext4_allocation_context *ac) 2201c9de560dSAlex Tomas { 2202c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); 2203c9de560dSAlex Tomas struct ext4_mb_history h; 2204c9de560dSAlex Tomas 2205c9de560dSAlex Tomas if (unlikely(sbi->s_mb_history == NULL)) 2206c9de560dSAlex Tomas return; 2207c9de560dSAlex Tomas 2208c9de560dSAlex Tomas if (!(ac->ac_op & sbi->s_mb_history_filter)) 2209c9de560dSAlex Tomas return; 2210c9de560dSAlex Tomas 2211c9de560dSAlex Tomas h.op = ac->ac_op; 2212c9de560dSAlex Tomas h.pid = current->pid; 2213c9de560dSAlex Tomas h.ino = ac->ac_inode ? ac->ac_inode->i_ino : 0; 2214c9de560dSAlex Tomas h.orig = ac->ac_o_ex; 2215c9de560dSAlex Tomas h.result = ac->ac_b_ex; 2216c9de560dSAlex Tomas h.flags = ac->ac_flags; 2217c9de560dSAlex Tomas h.found = ac->ac_found; 2218c9de560dSAlex Tomas h.groups = ac->ac_groups_scanned; 2219c9de560dSAlex Tomas h.cr = ac->ac_criteria; 2220c9de560dSAlex Tomas h.tail = ac->ac_tail; 2221c9de560dSAlex Tomas h.buddy = ac->ac_buddy; 2222c9de560dSAlex Tomas h.merged = 0; 2223c9de560dSAlex Tomas if (ac->ac_op == EXT4_MB_HISTORY_ALLOC) { 2224c9de560dSAlex Tomas if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start && 2225c9de560dSAlex Tomas ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group) 2226c9de560dSAlex Tomas h.merged = 1; 2227c9de560dSAlex Tomas h.goal = ac->ac_g_ex; 2228c9de560dSAlex Tomas h.result = ac->ac_f_ex; 2229c9de560dSAlex Tomas } 2230c9de560dSAlex Tomas 2231c9de560dSAlex Tomas spin_lock(&sbi->s_mb_history_lock); 2232c9de560dSAlex Tomas memcpy(sbi->s_mb_history + sbi->s_mb_history_cur, &h, sizeof(h)); 2233c9de560dSAlex Tomas if (++sbi->s_mb_history_cur >= sbi->s_mb_history_max) 2234c9de560dSAlex Tomas sbi->s_mb_history_cur = 0; 2235c9de560dSAlex Tomas spin_unlock(&sbi->s_mb_history_lock); 2236c9de560dSAlex Tomas } 2237c9de560dSAlex Tomas 2238c9de560dSAlex Tomas #else 2239c9de560dSAlex Tomas #define ext4_mb_history_release(sb) 2240c9de560dSAlex Tomas #define ext4_mb_history_init(sb) 2241c9de560dSAlex Tomas #endif 2242c9de560dSAlex Tomas 22435f21b0e6SFrederic Bohe 22445f21b0e6SFrederic Bohe /* Create and initialize ext4_group_info data for the given group. */ 22455f21b0e6SFrederic Bohe int ext4_mb_add_groupinfo(struct super_block *sb, ext4_group_t group, 22465f21b0e6SFrederic Bohe struct ext4_group_desc *desc) 22475f21b0e6SFrederic Bohe { 22485f21b0e6SFrederic Bohe int i, len; 22495f21b0e6SFrederic Bohe int metalen = 0; 22505f21b0e6SFrederic Bohe struct ext4_sb_info *sbi = EXT4_SB(sb); 22515f21b0e6SFrederic Bohe struct ext4_group_info **meta_group_info; 22525f21b0e6SFrederic Bohe 22535f21b0e6SFrederic Bohe /* 22545f21b0e6SFrederic Bohe * First check if this group is the first of a reserved block. 22555f21b0e6SFrederic Bohe * If it's true, we have to allocate a new table of pointers 22565f21b0e6SFrederic Bohe * to ext4_group_info structures 22575f21b0e6SFrederic Bohe */ 22585f21b0e6SFrederic Bohe if (group % EXT4_DESC_PER_BLOCK(sb) == 0) { 22595f21b0e6SFrederic Bohe metalen = sizeof(*meta_group_info) << 22605f21b0e6SFrederic Bohe EXT4_DESC_PER_BLOCK_BITS(sb); 22615f21b0e6SFrederic Bohe meta_group_info = kmalloc(metalen, GFP_KERNEL); 22625f21b0e6SFrederic Bohe if (meta_group_info == NULL) { 22635f21b0e6SFrederic Bohe printk(KERN_ERR "EXT4-fs: can't allocate mem for a " 22645f21b0e6SFrederic Bohe "buddy group\n"); 22655f21b0e6SFrederic Bohe goto exit_meta_group_info; 22665f21b0e6SFrederic Bohe } 22675f21b0e6SFrederic Bohe sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)] = 22685f21b0e6SFrederic Bohe meta_group_info; 22695f21b0e6SFrederic Bohe } 22705f21b0e6SFrederic Bohe 22715f21b0e6SFrederic Bohe /* 22725f21b0e6SFrederic Bohe * calculate needed size. if change bb_counters size, 22735f21b0e6SFrederic Bohe * don't forget about ext4_mb_generate_buddy() 22745f21b0e6SFrederic Bohe */ 22755f21b0e6SFrederic Bohe len = offsetof(typeof(**meta_group_info), 22765f21b0e6SFrederic Bohe bb_counters[sb->s_blocksize_bits + 2]); 22775f21b0e6SFrederic Bohe 22785f21b0e6SFrederic Bohe meta_group_info = 22795f21b0e6SFrederic Bohe sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)]; 22805f21b0e6SFrederic Bohe i = group & (EXT4_DESC_PER_BLOCK(sb) - 1); 22815f21b0e6SFrederic Bohe 22825f21b0e6SFrederic Bohe meta_group_info[i] = kzalloc(len, GFP_KERNEL); 22835f21b0e6SFrederic Bohe if (meta_group_info[i] == NULL) { 22845f21b0e6SFrederic Bohe printk(KERN_ERR "EXT4-fs: can't allocate buddy mem\n"); 22855f21b0e6SFrederic Bohe goto exit_group_info; 22865f21b0e6SFrederic Bohe } 22875f21b0e6SFrederic Bohe set_bit(EXT4_GROUP_INFO_NEED_INIT_BIT, 22885f21b0e6SFrederic Bohe &(meta_group_info[i]->bb_state)); 22895f21b0e6SFrederic Bohe 22905f21b0e6SFrederic Bohe /* 22915f21b0e6SFrederic Bohe * initialize bb_free to be able to skip 22925f21b0e6SFrederic Bohe * empty groups without initialization 22935f21b0e6SFrederic Bohe */ 22945f21b0e6SFrederic Bohe if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { 22955f21b0e6SFrederic Bohe meta_group_info[i]->bb_free = 22965f21b0e6SFrederic Bohe ext4_free_blocks_after_init(sb, group, desc); 22975f21b0e6SFrederic Bohe } else { 22985f21b0e6SFrederic Bohe meta_group_info[i]->bb_free = 22995f21b0e6SFrederic Bohe le16_to_cpu(desc->bg_free_blocks_count); 23005f21b0e6SFrederic Bohe } 23015f21b0e6SFrederic Bohe 23025f21b0e6SFrederic Bohe INIT_LIST_HEAD(&meta_group_info[i]->bb_prealloc_list); 2303c894058dSAneesh Kumar K.V meta_group_info[i]->bb_free_root.rb_node = NULL;; 23045f21b0e6SFrederic Bohe 23055f21b0e6SFrederic Bohe #ifdef DOUBLE_CHECK 23065f21b0e6SFrederic Bohe { 23075f21b0e6SFrederic Bohe struct buffer_head *bh; 23085f21b0e6SFrederic Bohe meta_group_info[i]->bb_bitmap = 23095f21b0e6SFrederic Bohe kmalloc(sb->s_blocksize, GFP_KERNEL); 23105f21b0e6SFrederic Bohe BUG_ON(meta_group_info[i]->bb_bitmap == NULL); 23115f21b0e6SFrederic Bohe bh = ext4_read_block_bitmap(sb, group); 23125f21b0e6SFrederic Bohe BUG_ON(bh == NULL); 23135f21b0e6SFrederic Bohe memcpy(meta_group_info[i]->bb_bitmap, bh->b_data, 23145f21b0e6SFrederic Bohe sb->s_blocksize); 23155f21b0e6SFrederic Bohe put_bh(bh); 23165f21b0e6SFrederic Bohe } 23175f21b0e6SFrederic Bohe #endif 23185f21b0e6SFrederic Bohe 23195f21b0e6SFrederic Bohe return 0; 23205f21b0e6SFrederic Bohe 23215f21b0e6SFrederic Bohe exit_group_info: 23225f21b0e6SFrederic Bohe /* If a meta_group_info table has been allocated, release it now */ 23235f21b0e6SFrederic Bohe if (group % EXT4_DESC_PER_BLOCK(sb) == 0) 23245f21b0e6SFrederic Bohe kfree(sbi->s_group_info[group >> EXT4_DESC_PER_BLOCK_BITS(sb)]); 23255f21b0e6SFrederic Bohe exit_meta_group_info: 23265f21b0e6SFrederic Bohe return -ENOMEM; 23275f21b0e6SFrederic Bohe } /* ext4_mb_add_groupinfo */ 23285f21b0e6SFrederic Bohe 23295f21b0e6SFrederic Bohe /* 23305f21b0e6SFrederic Bohe * Add a group to the existing groups. 23315f21b0e6SFrederic Bohe * This function is used for online resize 23325f21b0e6SFrederic Bohe */ 23335f21b0e6SFrederic Bohe int ext4_mb_add_more_groupinfo(struct super_block *sb, ext4_group_t group, 23345f21b0e6SFrederic Bohe struct ext4_group_desc *desc) 23355f21b0e6SFrederic Bohe { 23365f21b0e6SFrederic Bohe struct ext4_sb_info *sbi = EXT4_SB(sb); 23375f21b0e6SFrederic Bohe struct inode *inode = sbi->s_buddy_cache; 23385f21b0e6SFrederic Bohe int blocks_per_page; 23395f21b0e6SFrederic Bohe int block; 23405f21b0e6SFrederic Bohe int pnum; 23415f21b0e6SFrederic Bohe struct page *page; 23425f21b0e6SFrederic Bohe int err; 23435f21b0e6SFrederic Bohe 23445f21b0e6SFrederic Bohe /* Add group based on group descriptor*/ 23455f21b0e6SFrederic Bohe err = ext4_mb_add_groupinfo(sb, group, desc); 23465f21b0e6SFrederic Bohe if (err) 23475f21b0e6SFrederic Bohe return err; 23485f21b0e6SFrederic Bohe 23495f21b0e6SFrederic Bohe /* 23505f21b0e6SFrederic Bohe * Cache pages containing dynamic mb_alloc datas (buddy and bitmap 23515f21b0e6SFrederic Bohe * datas) are set not up to date so that they will be re-initilaized 23525f21b0e6SFrederic Bohe * during the next call to ext4_mb_load_buddy 23535f21b0e6SFrederic Bohe */ 23545f21b0e6SFrederic Bohe 23555f21b0e6SFrederic Bohe /* Set buddy page as not up to date */ 23565f21b0e6SFrederic Bohe blocks_per_page = PAGE_CACHE_SIZE / sb->s_blocksize; 23575f21b0e6SFrederic Bohe block = group * 2; 23585f21b0e6SFrederic Bohe pnum = block / blocks_per_page; 23595f21b0e6SFrederic Bohe page = find_get_page(inode->i_mapping, pnum); 23605f21b0e6SFrederic Bohe if (page != NULL) { 23615f21b0e6SFrederic Bohe ClearPageUptodate(page); 23625f21b0e6SFrederic Bohe page_cache_release(page); 23635f21b0e6SFrederic Bohe } 23645f21b0e6SFrederic Bohe 23655f21b0e6SFrederic Bohe /* Set bitmap page as not up to date */ 23665f21b0e6SFrederic Bohe block++; 23675f21b0e6SFrederic Bohe pnum = block / blocks_per_page; 23685f21b0e6SFrederic Bohe page = find_get_page(inode->i_mapping, pnum); 23695f21b0e6SFrederic Bohe if (page != NULL) { 23705f21b0e6SFrederic Bohe ClearPageUptodate(page); 23715f21b0e6SFrederic Bohe page_cache_release(page); 23725f21b0e6SFrederic Bohe } 23735f21b0e6SFrederic Bohe 23745f21b0e6SFrederic Bohe return 0; 23755f21b0e6SFrederic Bohe } 23765f21b0e6SFrederic Bohe 23775f21b0e6SFrederic Bohe /* 23785f21b0e6SFrederic Bohe * Update an existing group. 23795f21b0e6SFrederic Bohe * This function is used for online resize 23805f21b0e6SFrederic Bohe */ 23815f21b0e6SFrederic Bohe void ext4_mb_update_group_info(struct ext4_group_info *grp, ext4_grpblk_t add) 23825f21b0e6SFrederic Bohe { 23835f21b0e6SFrederic Bohe grp->bb_free += add; 23845f21b0e6SFrederic Bohe } 23855f21b0e6SFrederic Bohe 2386c9de560dSAlex Tomas static int ext4_mb_init_backend(struct super_block *sb) 2387c9de560dSAlex Tomas { 2388c9de560dSAlex Tomas ext4_group_t i; 23895f21b0e6SFrederic Bohe int metalen; 2390c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 23915f21b0e6SFrederic Bohe struct ext4_super_block *es = sbi->s_es; 23925f21b0e6SFrederic Bohe int num_meta_group_infos; 23935f21b0e6SFrederic Bohe int num_meta_group_infos_max; 23945f21b0e6SFrederic Bohe int array_size; 2395c9de560dSAlex Tomas struct ext4_group_info **meta_group_info; 23965f21b0e6SFrederic Bohe struct ext4_group_desc *desc; 2397c9de560dSAlex Tomas 23985f21b0e6SFrederic Bohe /* This is the number of blocks used by GDT */ 23995f21b0e6SFrederic Bohe num_meta_group_infos = (sbi->s_groups_count + EXT4_DESC_PER_BLOCK(sb) - 24005f21b0e6SFrederic Bohe 1) >> EXT4_DESC_PER_BLOCK_BITS(sb); 24015f21b0e6SFrederic Bohe 24025f21b0e6SFrederic Bohe /* 24035f21b0e6SFrederic Bohe * This is the total number of blocks used by GDT including 24045f21b0e6SFrederic Bohe * the number of reserved blocks for GDT. 24055f21b0e6SFrederic Bohe * The s_group_info array is allocated with this value 24065f21b0e6SFrederic Bohe * to allow a clean online resize without a complex 24075f21b0e6SFrederic Bohe * manipulation of pointer. 24085f21b0e6SFrederic Bohe * The drawback is the unused memory when no resize 24095f21b0e6SFrederic Bohe * occurs but it's very low in terms of pages 24105f21b0e6SFrederic Bohe * (see comments below) 24115f21b0e6SFrederic Bohe * Need to handle this properly when META_BG resizing is allowed 24125f21b0e6SFrederic Bohe */ 24135f21b0e6SFrederic Bohe num_meta_group_infos_max = num_meta_group_infos + 24145f21b0e6SFrederic Bohe le16_to_cpu(es->s_reserved_gdt_blocks); 24155f21b0e6SFrederic Bohe 24165f21b0e6SFrederic Bohe /* 24175f21b0e6SFrederic Bohe * array_size is the size of s_group_info array. We round it 24185f21b0e6SFrederic Bohe * to the next power of two because this approximation is done 24195f21b0e6SFrederic Bohe * internally by kmalloc so we can have some more memory 24205f21b0e6SFrederic Bohe * for free here (e.g. may be used for META_BG resize). 24215f21b0e6SFrederic Bohe */ 24225f21b0e6SFrederic Bohe array_size = 1; 24235f21b0e6SFrederic Bohe while (array_size < sizeof(*sbi->s_group_info) * 24245f21b0e6SFrederic Bohe num_meta_group_infos_max) 24255f21b0e6SFrederic Bohe array_size = array_size << 1; 2426c9de560dSAlex Tomas /* An 8TB filesystem with 64-bit pointers requires a 4096 byte 2427c9de560dSAlex Tomas * kmalloc. A 128kb malloc should suffice for a 256TB filesystem. 2428c9de560dSAlex Tomas * So a two level scheme suffices for now. */ 24295f21b0e6SFrederic Bohe sbi->s_group_info = kmalloc(array_size, GFP_KERNEL); 2430c9de560dSAlex Tomas if (sbi->s_group_info == NULL) { 2431c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: can't allocate buddy meta group\n"); 2432c9de560dSAlex Tomas return -ENOMEM; 2433c9de560dSAlex Tomas } 2434c9de560dSAlex Tomas sbi->s_buddy_cache = new_inode(sb); 2435c9de560dSAlex Tomas if (sbi->s_buddy_cache == NULL) { 2436c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: can't get new inode\n"); 2437c9de560dSAlex Tomas goto err_freesgi; 2438c9de560dSAlex Tomas } 2439c9de560dSAlex Tomas EXT4_I(sbi->s_buddy_cache)->i_disksize = 0; 2440c9de560dSAlex Tomas 2441c9de560dSAlex Tomas metalen = sizeof(*meta_group_info) << EXT4_DESC_PER_BLOCK_BITS(sb); 2442c9de560dSAlex Tomas for (i = 0; i < num_meta_group_infos; i++) { 2443c9de560dSAlex Tomas if ((i + 1) == num_meta_group_infos) 2444c9de560dSAlex Tomas metalen = sizeof(*meta_group_info) * 2445c9de560dSAlex Tomas (sbi->s_groups_count - 2446c9de560dSAlex Tomas (i << EXT4_DESC_PER_BLOCK_BITS(sb))); 2447c9de560dSAlex Tomas meta_group_info = kmalloc(metalen, GFP_KERNEL); 2448c9de560dSAlex Tomas if (meta_group_info == NULL) { 2449c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: can't allocate mem for a " 2450c9de560dSAlex Tomas "buddy group\n"); 2451c9de560dSAlex Tomas goto err_freemeta; 2452c9de560dSAlex Tomas } 2453c9de560dSAlex Tomas sbi->s_group_info[i] = meta_group_info; 2454c9de560dSAlex Tomas } 2455c9de560dSAlex Tomas 2456c9de560dSAlex Tomas for (i = 0; i < sbi->s_groups_count; i++) { 2457c9de560dSAlex Tomas desc = ext4_get_group_desc(sb, i, NULL); 2458c9de560dSAlex Tomas if (desc == NULL) { 2459c9de560dSAlex Tomas printk(KERN_ERR 2460c9de560dSAlex Tomas "EXT4-fs: can't read descriptor %lu\n", i); 2461c9de560dSAlex Tomas goto err_freebuddy; 2462c9de560dSAlex Tomas } 24635f21b0e6SFrederic Bohe if (ext4_mb_add_groupinfo(sb, i, desc) != 0) 24645f21b0e6SFrederic Bohe goto err_freebuddy; 2465c9de560dSAlex Tomas } 2466c9de560dSAlex Tomas 2467c9de560dSAlex Tomas return 0; 2468c9de560dSAlex Tomas 2469c9de560dSAlex Tomas err_freebuddy: 2470f1fa3342SRoel Kluin while (i-- > 0) 2471c9de560dSAlex Tomas kfree(ext4_get_group_info(sb, i)); 2472c9de560dSAlex Tomas i = num_meta_group_infos; 2473c9de560dSAlex Tomas err_freemeta: 2474f1fa3342SRoel Kluin while (i-- > 0) 2475c9de560dSAlex Tomas kfree(sbi->s_group_info[i]); 2476c9de560dSAlex Tomas iput(sbi->s_buddy_cache); 2477c9de560dSAlex Tomas err_freesgi: 2478c9de560dSAlex Tomas kfree(sbi->s_group_info); 2479c9de560dSAlex Tomas return -ENOMEM; 2480c9de560dSAlex Tomas } 2481c9de560dSAlex Tomas 2482c9de560dSAlex Tomas int ext4_mb_init(struct super_block *sb, int needs_recovery) 2483c9de560dSAlex Tomas { 2484c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 24856be2ded1SAneesh Kumar K.V unsigned i, j; 2486c9de560dSAlex Tomas unsigned offset; 2487c9de560dSAlex Tomas unsigned max; 248874767c5aSShen Feng int ret; 2489c9de560dSAlex Tomas 2490c9de560dSAlex Tomas i = (sb->s_blocksize_bits + 2) * sizeof(unsigned short); 2491c9de560dSAlex Tomas 2492c9de560dSAlex Tomas sbi->s_mb_offsets = kmalloc(i, GFP_KERNEL); 2493c9de560dSAlex Tomas if (sbi->s_mb_offsets == NULL) { 2494c9de560dSAlex Tomas return -ENOMEM; 2495c9de560dSAlex Tomas } 2496c9de560dSAlex Tomas sbi->s_mb_maxs = kmalloc(i, GFP_KERNEL); 2497c9de560dSAlex Tomas if (sbi->s_mb_maxs == NULL) { 2498c9de560dSAlex Tomas kfree(sbi->s_mb_maxs); 2499c9de560dSAlex Tomas return -ENOMEM; 2500c9de560dSAlex Tomas } 2501c9de560dSAlex Tomas 2502c9de560dSAlex Tomas /* order 0 is regular bitmap */ 2503c9de560dSAlex Tomas sbi->s_mb_maxs[0] = sb->s_blocksize << 3; 2504c9de560dSAlex Tomas sbi->s_mb_offsets[0] = 0; 2505c9de560dSAlex Tomas 2506c9de560dSAlex Tomas i = 1; 2507c9de560dSAlex Tomas offset = 0; 2508c9de560dSAlex Tomas max = sb->s_blocksize << 2; 2509c9de560dSAlex Tomas do { 2510c9de560dSAlex Tomas sbi->s_mb_offsets[i] = offset; 2511c9de560dSAlex Tomas sbi->s_mb_maxs[i] = max; 2512c9de560dSAlex Tomas offset += 1 << (sb->s_blocksize_bits - i); 2513c9de560dSAlex Tomas max = max >> 1; 2514c9de560dSAlex Tomas i++; 2515c9de560dSAlex Tomas } while (i <= sb->s_blocksize_bits + 1); 2516c9de560dSAlex Tomas 2517c9de560dSAlex Tomas /* init file for buddy data */ 251874767c5aSShen Feng ret = ext4_mb_init_backend(sb); 251974767c5aSShen Feng if (ret != 0) { 2520c9de560dSAlex Tomas kfree(sbi->s_mb_offsets); 2521c9de560dSAlex Tomas kfree(sbi->s_mb_maxs); 252274767c5aSShen Feng return ret; 2523c9de560dSAlex Tomas } 2524c9de560dSAlex Tomas 2525c9de560dSAlex Tomas spin_lock_init(&sbi->s_md_lock); 2526c9de560dSAlex Tomas spin_lock_init(&sbi->s_bal_lock); 2527c9de560dSAlex Tomas 2528c9de560dSAlex Tomas sbi->s_mb_max_to_scan = MB_DEFAULT_MAX_TO_SCAN; 2529c9de560dSAlex Tomas sbi->s_mb_min_to_scan = MB_DEFAULT_MIN_TO_SCAN; 2530c9de560dSAlex Tomas sbi->s_mb_stats = MB_DEFAULT_STATS; 2531c9de560dSAlex Tomas sbi->s_mb_stream_request = MB_DEFAULT_STREAM_THRESHOLD; 2532c9de560dSAlex Tomas sbi->s_mb_order2_reqs = MB_DEFAULT_ORDER2_REQS; 2533c9de560dSAlex Tomas sbi->s_mb_history_filter = EXT4_MB_HISTORY_DEFAULT; 2534c9de560dSAlex Tomas sbi->s_mb_group_prealloc = MB_DEFAULT_GROUP_PREALLOC; 2535c9de560dSAlex Tomas 2536730c213cSEric Sandeen sbi->s_locality_groups = alloc_percpu(struct ext4_locality_group); 2537c9de560dSAlex Tomas if (sbi->s_locality_groups == NULL) { 2538c9de560dSAlex Tomas kfree(sbi->s_mb_offsets); 2539c9de560dSAlex Tomas kfree(sbi->s_mb_maxs); 2540c9de560dSAlex Tomas return -ENOMEM; 2541c9de560dSAlex Tomas } 2542730c213cSEric Sandeen for_each_possible_cpu(i) { 2543c9de560dSAlex Tomas struct ext4_locality_group *lg; 2544730c213cSEric Sandeen lg = per_cpu_ptr(sbi->s_locality_groups, i); 2545c9de560dSAlex Tomas mutex_init(&lg->lg_mutex); 25466be2ded1SAneesh Kumar K.V for (j = 0; j < PREALLOC_TB_SIZE; j++) 25476be2ded1SAneesh Kumar K.V INIT_LIST_HEAD(&lg->lg_prealloc_list[j]); 2548c9de560dSAlex Tomas spin_lock_init(&lg->lg_prealloc_lock); 2549c9de560dSAlex Tomas } 2550c9de560dSAlex Tomas 2551c9de560dSAlex Tomas ext4_mb_init_per_dev_proc(sb); 2552c9de560dSAlex Tomas ext4_mb_history_init(sb); 2553c9de560dSAlex Tomas 25543e624fc7STheodore Ts'o sbi->s_journal->j_commit_callback = release_blocks_on_commit; 25553e624fc7STheodore Ts'o 25564776004fSTheodore Ts'o printk(KERN_INFO "EXT4-fs: mballoc enabled\n"); 2557c9de560dSAlex Tomas return 0; 2558c9de560dSAlex Tomas } 2559c9de560dSAlex Tomas 2560c9de560dSAlex Tomas /* need to called with ext4 group lock (ext4_lock_group) */ 2561c9de560dSAlex Tomas static void ext4_mb_cleanup_pa(struct ext4_group_info *grp) 2562c9de560dSAlex Tomas { 2563c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 2564c9de560dSAlex Tomas struct list_head *cur, *tmp; 2565c9de560dSAlex Tomas int count = 0; 2566c9de560dSAlex Tomas 2567c9de560dSAlex Tomas list_for_each_safe(cur, tmp, &grp->bb_prealloc_list) { 2568c9de560dSAlex Tomas pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); 2569c9de560dSAlex Tomas list_del(&pa->pa_group_list); 2570c9de560dSAlex Tomas count++; 2571688f05a0SAneesh Kumar K.V kmem_cache_free(ext4_pspace_cachep, pa); 2572c9de560dSAlex Tomas } 2573c9de560dSAlex Tomas if (count) 2574c9de560dSAlex Tomas mb_debug("mballoc: %u PAs left\n", count); 2575c9de560dSAlex Tomas 2576c9de560dSAlex Tomas } 2577c9de560dSAlex Tomas 2578c9de560dSAlex Tomas int ext4_mb_release(struct super_block *sb) 2579c9de560dSAlex Tomas { 2580c9de560dSAlex Tomas ext4_group_t i; 2581c9de560dSAlex Tomas int num_meta_group_infos; 2582c9de560dSAlex Tomas struct ext4_group_info *grinfo; 2583c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2584c9de560dSAlex Tomas 2585c9de560dSAlex Tomas if (sbi->s_group_info) { 2586c9de560dSAlex Tomas for (i = 0; i < sbi->s_groups_count; i++) { 2587c9de560dSAlex Tomas grinfo = ext4_get_group_info(sb, i); 2588c9de560dSAlex Tomas #ifdef DOUBLE_CHECK 2589c9de560dSAlex Tomas kfree(grinfo->bb_bitmap); 2590c9de560dSAlex Tomas #endif 2591c9de560dSAlex Tomas ext4_lock_group(sb, i); 2592c9de560dSAlex Tomas ext4_mb_cleanup_pa(grinfo); 2593c9de560dSAlex Tomas ext4_unlock_group(sb, i); 2594c9de560dSAlex Tomas kfree(grinfo); 2595c9de560dSAlex Tomas } 2596c9de560dSAlex Tomas num_meta_group_infos = (sbi->s_groups_count + 2597c9de560dSAlex Tomas EXT4_DESC_PER_BLOCK(sb) - 1) >> 2598c9de560dSAlex Tomas EXT4_DESC_PER_BLOCK_BITS(sb); 2599c9de560dSAlex Tomas for (i = 0; i < num_meta_group_infos; i++) 2600c9de560dSAlex Tomas kfree(sbi->s_group_info[i]); 2601c9de560dSAlex Tomas kfree(sbi->s_group_info); 2602c9de560dSAlex Tomas } 2603c9de560dSAlex Tomas kfree(sbi->s_mb_offsets); 2604c9de560dSAlex Tomas kfree(sbi->s_mb_maxs); 2605c9de560dSAlex Tomas if (sbi->s_buddy_cache) 2606c9de560dSAlex Tomas iput(sbi->s_buddy_cache); 2607c9de560dSAlex Tomas if (sbi->s_mb_stats) { 2608c9de560dSAlex Tomas printk(KERN_INFO 2609c9de560dSAlex Tomas "EXT4-fs: mballoc: %u blocks %u reqs (%u success)\n", 2610c9de560dSAlex Tomas atomic_read(&sbi->s_bal_allocated), 2611c9de560dSAlex Tomas atomic_read(&sbi->s_bal_reqs), 2612c9de560dSAlex Tomas atomic_read(&sbi->s_bal_success)); 2613c9de560dSAlex Tomas printk(KERN_INFO 2614c9de560dSAlex Tomas "EXT4-fs: mballoc: %u extents scanned, %u goal hits, " 2615c9de560dSAlex Tomas "%u 2^N hits, %u breaks, %u lost\n", 2616c9de560dSAlex Tomas atomic_read(&sbi->s_bal_ex_scanned), 2617c9de560dSAlex Tomas atomic_read(&sbi->s_bal_goals), 2618c9de560dSAlex Tomas atomic_read(&sbi->s_bal_2orders), 2619c9de560dSAlex Tomas atomic_read(&sbi->s_bal_breaks), 2620c9de560dSAlex Tomas atomic_read(&sbi->s_mb_lost_chunks)); 2621c9de560dSAlex Tomas printk(KERN_INFO 2622c9de560dSAlex Tomas "EXT4-fs: mballoc: %lu generated and it took %Lu\n", 2623c9de560dSAlex Tomas sbi->s_mb_buddies_generated++, 2624c9de560dSAlex Tomas sbi->s_mb_generation_time); 2625c9de560dSAlex Tomas printk(KERN_INFO 2626c9de560dSAlex Tomas "EXT4-fs: mballoc: %u preallocated, %u discarded\n", 2627c9de560dSAlex Tomas atomic_read(&sbi->s_mb_preallocated), 2628c9de560dSAlex Tomas atomic_read(&sbi->s_mb_discarded)); 2629c9de560dSAlex Tomas } 2630c9de560dSAlex Tomas 2631730c213cSEric Sandeen free_percpu(sbi->s_locality_groups); 2632c9de560dSAlex Tomas ext4_mb_history_release(sb); 2633c9de560dSAlex Tomas ext4_mb_destroy_per_dev_proc(sb); 2634c9de560dSAlex Tomas 2635c9de560dSAlex Tomas return 0; 2636c9de560dSAlex Tomas } 2637c9de560dSAlex Tomas 26383e624fc7STheodore Ts'o /* 26393e624fc7STheodore Ts'o * This function is called by the jbd2 layer once the commit has finished, 26403e624fc7STheodore Ts'o * so we know we can free the blocks that were released with that commit. 26413e624fc7STheodore Ts'o */ 26423e624fc7STheodore Ts'o static void release_blocks_on_commit(journal_t *journal, transaction_t *txn) 2643c9de560dSAlex Tomas { 26443e624fc7STheodore Ts'o struct super_block *sb = journal->j_private; 2645c9de560dSAlex Tomas struct ext4_buddy e4b; 2646c894058dSAneesh Kumar K.V struct ext4_group_info *db; 2647c894058dSAneesh Kumar K.V int err, count = 0, count2 = 0; 2648c894058dSAneesh Kumar K.V struct ext4_free_data *entry; 26498a0aba73STheodore Ts'o ext4_fsblk_t discard_block; 26503e624fc7STheodore Ts'o struct list_head *l, *ltmp; 2651c9de560dSAlex Tomas 26523e624fc7STheodore Ts'o list_for_each_safe(l, ltmp, &txn->t_private_list) { 26533e624fc7STheodore Ts'o entry = list_entry(l, struct ext4_free_data, list); 2654c9de560dSAlex Tomas 2655c9de560dSAlex Tomas mb_debug("gonna free %u blocks in group %lu (0x%p):", 2656c894058dSAneesh Kumar K.V entry->count, entry->group, entry); 2657c9de560dSAlex Tomas 2658c894058dSAneesh Kumar K.V err = ext4_mb_load_buddy(sb, entry->group, &e4b); 2659c9de560dSAlex Tomas /* we expect to find existing buddy because it's pinned */ 2660c9de560dSAlex Tomas BUG_ON(err != 0); 2661c9de560dSAlex Tomas 2662c894058dSAneesh Kumar K.V db = e4b.bd_info; 2663c9de560dSAlex Tomas /* there are blocks to put in buddy to make them really free */ 2664c894058dSAneesh Kumar K.V count += entry->count; 2665c9de560dSAlex Tomas count2++; 2666c894058dSAneesh Kumar K.V ext4_lock_group(sb, entry->group); 2667c894058dSAneesh Kumar K.V /* Take it out of per group rb tree */ 2668c894058dSAneesh Kumar K.V rb_erase(&entry->node, &(db->bb_free_root)); 2669c894058dSAneesh Kumar K.V mb_free_blocks(NULL, &e4b, entry->start_blk, entry->count); 2670c9de560dSAlex Tomas 2671c894058dSAneesh Kumar K.V if (!db->bb_free_root.rb_node) { 2672c894058dSAneesh Kumar K.V /* No more items in the per group rb tree 2673c894058dSAneesh Kumar K.V * balance refcounts from ext4_mb_free_metadata() 2674c894058dSAneesh Kumar K.V */ 2675c9de560dSAlex Tomas page_cache_release(e4b.bd_buddy_page); 2676c9de560dSAlex Tomas page_cache_release(e4b.bd_bitmap_page); 2677c894058dSAneesh Kumar K.V } 2678c894058dSAneesh Kumar K.V ext4_unlock_group(sb, entry->group); 26798a0aba73STheodore Ts'o discard_block = (ext4_fsblk_t) entry->group * EXT4_BLOCKS_PER_GROUP(sb) 26808a0aba73STheodore Ts'o + entry->start_blk 26818a0aba73STheodore Ts'o + le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block); 26828a0aba73STheodore Ts'o trace_mark(ext4_discard_blocks, "dev %s blk %llu count %u", sb->s_id, 26838a0aba73STheodore Ts'o (unsigned long long) discard_block, entry->count); 26848a0aba73STheodore Ts'o sb_issue_discard(sb, discard_block, entry->count); 2685c9de560dSAlex Tomas 2686c894058dSAneesh Kumar K.V kmem_cache_free(ext4_free_ext_cachep, entry); 2687c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 26883e624fc7STheodore Ts'o } 2689c9de560dSAlex Tomas 2690c9de560dSAlex Tomas mb_debug("freed %u blocks in %u structures\n", count, count2); 2691c9de560dSAlex Tomas } 2692c9de560dSAlex Tomas 2693c9de560dSAlex Tomas #define EXT4_MB_STATS_NAME "stats" 2694c9de560dSAlex Tomas #define EXT4_MB_MAX_TO_SCAN_NAME "max_to_scan" 2695c9de560dSAlex Tomas #define EXT4_MB_MIN_TO_SCAN_NAME "min_to_scan" 2696c9de560dSAlex Tomas #define EXT4_MB_ORDER2_REQ "order2_req" 2697c9de560dSAlex Tomas #define EXT4_MB_STREAM_REQ "stream_req" 2698c9de560dSAlex Tomas #define EXT4_MB_GROUP_PREALLOC "group_prealloc" 2699c9de560dSAlex Tomas 2700c9de560dSAlex Tomas static int ext4_mb_init_per_dev_proc(struct super_block *sb) 2701c9de560dSAlex Tomas { 27020b09923eSManish Katiyar #ifdef CONFIG_PROC_FS 2703c9de560dSAlex Tomas mode_t mode = S_IFREG | S_IRUGO | S_IWUSR; 2704c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2705c9de560dSAlex Tomas struct proc_dir_entry *proc; 2706c9de560dSAlex Tomas 27079f6200bbSTheodore Ts'o if (sbi->s_proc == NULL) 2708cfbe7e4fSShen Feng return -EINVAL; 2709c9de560dSAlex Tomas 27105e8814f2STheodore Ts'o EXT4_PROC_HANDLER(EXT4_MB_STATS_NAME, mb_stats); 27115e8814f2STheodore Ts'o EXT4_PROC_HANDLER(EXT4_MB_MAX_TO_SCAN_NAME, mb_max_to_scan); 27125e8814f2STheodore Ts'o EXT4_PROC_HANDLER(EXT4_MB_MIN_TO_SCAN_NAME, mb_min_to_scan); 27135e8814f2STheodore Ts'o EXT4_PROC_HANDLER(EXT4_MB_ORDER2_REQ, mb_order2_reqs); 27145e8814f2STheodore Ts'o EXT4_PROC_HANDLER(EXT4_MB_STREAM_REQ, mb_stream_request); 27155e8814f2STheodore Ts'o EXT4_PROC_HANDLER(EXT4_MB_GROUP_PREALLOC, mb_group_prealloc); 2716c9de560dSAlex Tomas return 0; 2717c9de560dSAlex Tomas 2718c9de560dSAlex Tomas err_out: 27199f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_GROUP_PREALLOC, sbi->s_proc); 27209f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_STREAM_REQ, sbi->s_proc); 27219f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_ORDER2_REQ, sbi->s_proc); 27229f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_MIN_TO_SCAN_NAME, sbi->s_proc); 27239f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_MAX_TO_SCAN_NAME, sbi->s_proc); 27249f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_STATS_NAME, sbi->s_proc); 2725c9de560dSAlex Tomas return -ENOMEM; 27260b09923eSManish Katiyar #else 27270b09923eSManish Katiyar return 0; 27280b09923eSManish Katiyar #endif 2729c9de560dSAlex Tomas } 2730c9de560dSAlex Tomas 2731c9de560dSAlex Tomas static int ext4_mb_destroy_per_dev_proc(struct super_block *sb) 2732c9de560dSAlex Tomas { 27330b09923eSManish Katiyar #ifdef CONFIG_PROC_FS 2734c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 2735c9de560dSAlex Tomas 27369f6200bbSTheodore Ts'o if (sbi->s_proc == NULL) 2737c9de560dSAlex Tomas return -EINVAL; 2738c9de560dSAlex Tomas 27399f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_GROUP_PREALLOC, sbi->s_proc); 27409f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_STREAM_REQ, sbi->s_proc); 27419f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_ORDER2_REQ, sbi->s_proc); 27429f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_MIN_TO_SCAN_NAME, sbi->s_proc); 27439f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_MAX_TO_SCAN_NAME, sbi->s_proc); 27449f6200bbSTheodore Ts'o remove_proc_entry(EXT4_MB_STATS_NAME, sbi->s_proc); 27450b09923eSManish Katiyar #endif 2746c9de560dSAlex Tomas return 0; 2747c9de560dSAlex Tomas } 2748c9de560dSAlex Tomas 2749c9de560dSAlex Tomas int __init init_ext4_mballoc(void) 2750c9de560dSAlex Tomas { 2751c9de560dSAlex Tomas ext4_pspace_cachep = 2752c9de560dSAlex Tomas kmem_cache_create("ext4_prealloc_space", 2753c9de560dSAlex Tomas sizeof(struct ext4_prealloc_space), 2754c9de560dSAlex Tomas 0, SLAB_RECLAIM_ACCOUNT, NULL); 2755c9de560dSAlex Tomas if (ext4_pspace_cachep == NULL) 2756c9de560dSAlex Tomas return -ENOMEM; 2757c9de560dSAlex Tomas 2758256bdb49SEric Sandeen ext4_ac_cachep = 2759256bdb49SEric Sandeen kmem_cache_create("ext4_alloc_context", 2760256bdb49SEric Sandeen sizeof(struct ext4_allocation_context), 2761256bdb49SEric Sandeen 0, SLAB_RECLAIM_ACCOUNT, NULL); 2762256bdb49SEric Sandeen if (ext4_ac_cachep == NULL) { 2763256bdb49SEric Sandeen kmem_cache_destroy(ext4_pspace_cachep); 2764256bdb49SEric Sandeen return -ENOMEM; 2765256bdb49SEric Sandeen } 2766c894058dSAneesh Kumar K.V 2767c894058dSAneesh Kumar K.V ext4_free_ext_cachep = 2768c894058dSAneesh Kumar K.V kmem_cache_create("ext4_free_block_extents", 2769c894058dSAneesh Kumar K.V sizeof(struct ext4_free_data), 2770c894058dSAneesh Kumar K.V 0, SLAB_RECLAIM_ACCOUNT, NULL); 2771c894058dSAneesh Kumar K.V if (ext4_free_ext_cachep == NULL) { 2772c894058dSAneesh Kumar K.V kmem_cache_destroy(ext4_pspace_cachep); 2773c894058dSAneesh Kumar K.V kmem_cache_destroy(ext4_ac_cachep); 2774c894058dSAneesh Kumar K.V return -ENOMEM; 2775c894058dSAneesh Kumar K.V } 2776c9de560dSAlex Tomas return 0; 2777c9de560dSAlex Tomas } 2778c9de560dSAlex Tomas 2779c9de560dSAlex Tomas void exit_ext4_mballoc(void) 2780c9de560dSAlex Tomas { 2781c9de560dSAlex Tomas /* XXX: synchronize_rcu(); */ 2782c9de560dSAlex Tomas kmem_cache_destroy(ext4_pspace_cachep); 2783256bdb49SEric Sandeen kmem_cache_destroy(ext4_ac_cachep); 2784c894058dSAneesh Kumar K.V kmem_cache_destroy(ext4_free_ext_cachep); 2785c9de560dSAlex Tomas } 2786c9de560dSAlex Tomas 2787c9de560dSAlex Tomas 2788c9de560dSAlex Tomas /* 2789c9de560dSAlex Tomas * Check quota and mark choosed space (ac->ac_b_ex) non-free in bitmaps 2790c9de560dSAlex Tomas * Returns 0 if success or error code 2791c9de560dSAlex Tomas */ 27924ddfef7bSEric Sandeen static noinline_for_stack int 27934ddfef7bSEric Sandeen ext4_mb_mark_diskspace_used(struct ext4_allocation_context *ac, 27946bc6e63fSAneesh Kumar K.V handle_t *handle, unsigned long reserv_blks) 2795c9de560dSAlex Tomas { 2796c9de560dSAlex Tomas struct buffer_head *bitmap_bh = NULL; 2797c9de560dSAlex Tomas struct ext4_super_block *es; 2798c9de560dSAlex Tomas struct ext4_group_desc *gdp; 2799c9de560dSAlex Tomas struct buffer_head *gdp_bh; 2800c9de560dSAlex Tomas struct ext4_sb_info *sbi; 2801c9de560dSAlex Tomas struct super_block *sb; 2802c9de560dSAlex Tomas ext4_fsblk_t block; 2803519deca0SAneesh Kumar K.V int err, len; 2804c9de560dSAlex Tomas 2805c9de560dSAlex Tomas BUG_ON(ac->ac_status != AC_STATUS_FOUND); 2806c9de560dSAlex Tomas BUG_ON(ac->ac_b_ex.fe_len <= 0); 2807c9de560dSAlex Tomas 2808c9de560dSAlex Tomas sb = ac->ac_sb; 2809c9de560dSAlex Tomas sbi = EXT4_SB(sb); 2810c9de560dSAlex Tomas es = sbi->s_es; 2811c9de560dSAlex Tomas 2812c9de560dSAlex Tomas 2813c9de560dSAlex Tomas err = -EIO; 2814574ca174STheodore Ts'o bitmap_bh = ext4_read_block_bitmap(sb, ac->ac_b_ex.fe_group); 2815c9de560dSAlex Tomas if (!bitmap_bh) 2816c9de560dSAlex Tomas goto out_err; 2817c9de560dSAlex Tomas 2818c9de560dSAlex Tomas err = ext4_journal_get_write_access(handle, bitmap_bh); 2819c9de560dSAlex Tomas if (err) 2820c9de560dSAlex Tomas goto out_err; 2821c9de560dSAlex Tomas 2822c9de560dSAlex Tomas err = -EIO; 2823c9de560dSAlex Tomas gdp = ext4_get_group_desc(sb, ac->ac_b_ex.fe_group, &gdp_bh); 2824c9de560dSAlex Tomas if (!gdp) 2825c9de560dSAlex Tomas goto out_err; 2826c9de560dSAlex Tomas 282703cddb80SAneesh Kumar K.V ext4_debug("using block group %lu(%d)\n", ac->ac_b_ex.fe_group, 282803cddb80SAneesh Kumar K.V gdp->bg_free_blocks_count); 282903cddb80SAneesh Kumar K.V 2830c9de560dSAlex Tomas err = ext4_journal_get_write_access(handle, gdp_bh); 2831c9de560dSAlex Tomas if (err) 2832c9de560dSAlex Tomas goto out_err; 2833c9de560dSAlex Tomas 2834c9de560dSAlex Tomas block = ac->ac_b_ex.fe_group * EXT4_BLOCKS_PER_GROUP(sb) 2835c9de560dSAlex Tomas + ac->ac_b_ex.fe_start 2836c9de560dSAlex Tomas + le32_to_cpu(es->s_first_data_block); 2837c9de560dSAlex Tomas 2838519deca0SAneesh Kumar K.V len = ac->ac_b_ex.fe_len; 2839519deca0SAneesh Kumar K.V if (in_range(ext4_block_bitmap(sb, gdp), block, len) || 2840519deca0SAneesh Kumar K.V in_range(ext4_inode_bitmap(sb, gdp), block, len) || 2841c9de560dSAlex Tomas in_range(block, ext4_inode_table(sb, gdp), 2842519deca0SAneesh Kumar K.V EXT4_SB(sb)->s_itb_per_group) || 2843519deca0SAneesh Kumar K.V in_range(block + len - 1, ext4_inode_table(sb, gdp), 2844c9de560dSAlex Tomas EXT4_SB(sb)->s_itb_per_group)) { 284546e665e9SHarvey Harrison ext4_error(sb, __func__, 2846c9de560dSAlex Tomas "Allocating block in system zone - block = %llu", 2847c9de560dSAlex Tomas block); 2848519deca0SAneesh Kumar K.V /* File system mounted not to panic on error 2849519deca0SAneesh Kumar K.V * Fix the bitmap and repeat the block allocation 2850519deca0SAneesh Kumar K.V * We leak some of the blocks here. 2851519deca0SAneesh Kumar K.V */ 2852519deca0SAneesh Kumar K.V mb_set_bits(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group), 2853519deca0SAneesh Kumar K.V bitmap_bh->b_data, ac->ac_b_ex.fe_start, 2854519deca0SAneesh Kumar K.V ac->ac_b_ex.fe_len); 2855519deca0SAneesh Kumar K.V err = ext4_journal_dirty_metadata(handle, bitmap_bh); 2856519deca0SAneesh Kumar K.V if (!err) 2857519deca0SAneesh Kumar K.V err = -EAGAIN; 2858519deca0SAneesh Kumar K.V goto out_err; 2859c9de560dSAlex Tomas } 2860c9de560dSAlex Tomas #ifdef AGGRESSIVE_CHECK 2861c9de560dSAlex Tomas { 2862c9de560dSAlex Tomas int i; 2863c9de560dSAlex Tomas for (i = 0; i < ac->ac_b_ex.fe_len; i++) { 2864c9de560dSAlex Tomas BUG_ON(mb_test_bit(ac->ac_b_ex.fe_start + i, 2865c9de560dSAlex Tomas bitmap_bh->b_data)); 2866c9de560dSAlex Tomas } 2867c9de560dSAlex Tomas } 2868c9de560dSAlex Tomas #endif 2869c9de560dSAlex Tomas mb_set_bits(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group), bitmap_bh->b_data, 2870c9de560dSAlex Tomas ac->ac_b_ex.fe_start, ac->ac_b_ex.fe_len); 2871c9de560dSAlex Tomas 2872c9de560dSAlex Tomas spin_lock(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group)); 2873c9de560dSAlex Tomas if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { 2874c9de560dSAlex Tomas gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT); 2875c9de560dSAlex Tomas gdp->bg_free_blocks_count = 2876c9de560dSAlex Tomas cpu_to_le16(ext4_free_blocks_after_init(sb, 2877c9de560dSAlex Tomas ac->ac_b_ex.fe_group, 2878c9de560dSAlex Tomas gdp)); 2879c9de560dSAlex Tomas } 2880e8546d06SMarcin Slusarz le16_add_cpu(&gdp->bg_free_blocks_count, -ac->ac_b_ex.fe_len); 2881c9de560dSAlex Tomas gdp->bg_checksum = ext4_group_desc_csum(sbi, ac->ac_b_ex.fe_group, gdp); 2882c9de560dSAlex Tomas spin_unlock(sb_bgl_lock(sbi, ac->ac_b_ex.fe_group)); 28836bc6e63fSAneesh Kumar K.V percpu_counter_sub(&sbi->s_freeblocks_counter, ac->ac_b_ex.fe_len); 2884d2a17637SMingming Cao /* 28856bc6e63fSAneesh Kumar K.V * Now reduce the dirty block count also. Should not go negative 2886d2a17637SMingming Cao */ 28876bc6e63fSAneesh Kumar K.V if (!(ac->ac_flags & EXT4_MB_DELALLOC_RESERVED)) 28886bc6e63fSAneesh Kumar K.V /* release all the reserved blocks if non delalloc */ 28896bc6e63fSAneesh Kumar K.V percpu_counter_sub(&sbi->s_dirtyblocks_counter, reserv_blks); 28906bc6e63fSAneesh Kumar K.V else 28916bc6e63fSAneesh Kumar K.V percpu_counter_sub(&sbi->s_dirtyblocks_counter, 28926bc6e63fSAneesh Kumar K.V ac->ac_b_ex.fe_len); 2893c9de560dSAlex Tomas 2894772cb7c8SJose R. Santos if (sbi->s_log_groups_per_flex) { 2895772cb7c8SJose R. Santos ext4_group_t flex_group = ext4_flex_group(sbi, 2896772cb7c8SJose R. Santos ac->ac_b_ex.fe_group); 2897772cb7c8SJose R. Santos spin_lock(sb_bgl_lock(sbi, flex_group)); 2898772cb7c8SJose R. Santos sbi->s_flex_groups[flex_group].free_blocks -= ac->ac_b_ex.fe_len; 2899772cb7c8SJose R. Santos spin_unlock(sb_bgl_lock(sbi, flex_group)); 2900772cb7c8SJose R. Santos } 2901772cb7c8SJose R. Santos 2902c9de560dSAlex Tomas err = ext4_journal_dirty_metadata(handle, bitmap_bh); 2903c9de560dSAlex Tomas if (err) 2904c9de560dSAlex Tomas goto out_err; 2905c9de560dSAlex Tomas err = ext4_journal_dirty_metadata(handle, gdp_bh); 2906c9de560dSAlex Tomas 2907c9de560dSAlex Tomas out_err: 2908c9de560dSAlex Tomas sb->s_dirt = 1; 290942a10addSAneesh Kumar K.V brelse(bitmap_bh); 2910c9de560dSAlex Tomas return err; 2911c9de560dSAlex Tomas } 2912c9de560dSAlex Tomas 2913c9de560dSAlex Tomas /* 2914c9de560dSAlex Tomas * here we normalize request for locality group 2915c9de560dSAlex Tomas * Group request are normalized to s_strip size if we set the same via mount 2916c9de560dSAlex Tomas * option. If not we set it to s_mb_group_prealloc which can be configured via 2917c9de560dSAlex Tomas * /proc/fs/ext4/<partition>/group_prealloc 2918c9de560dSAlex Tomas * 2919c9de560dSAlex Tomas * XXX: should we try to preallocate more than the group has now? 2920c9de560dSAlex Tomas */ 2921c9de560dSAlex Tomas static void ext4_mb_normalize_group_request(struct ext4_allocation_context *ac) 2922c9de560dSAlex Tomas { 2923c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 2924c9de560dSAlex Tomas struct ext4_locality_group *lg = ac->ac_lg; 2925c9de560dSAlex Tomas 2926c9de560dSAlex Tomas BUG_ON(lg == NULL); 2927c9de560dSAlex Tomas if (EXT4_SB(sb)->s_stripe) 2928c9de560dSAlex Tomas ac->ac_g_ex.fe_len = EXT4_SB(sb)->s_stripe; 2929c9de560dSAlex Tomas else 2930c9de560dSAlex Tomas ac->ac_g_ex.fe_len = EXT4_SB(sb)->s_mb_group_prealloc; 293160bd63d1SSolofo Ramangalahy mb_debug("#%u: goal %u blocks for locality group\n", 2932c9de560dSAlex Tomas current->pid, ac->ac_g_ex.fe_len); 2933c9de560dSAlex Tomas } 2934c9de560dSAlex Tomas 2935c9de560dSAlex Tomas /* 2936c9de560dSAlex Tomas * Normalization means making request better in terms of 2937c9de560dSAlex Tomas * size and alignment 2938c9de560dSAlex Tomas */ 29394ddfef7bSEric Sandeen static noinline_for_stack void 29404ddfef7bSEric Sandeen ext4_mb_normalize_request(struct ext4_allocation_context *ac, 2941c9de560dSAlex Tomas struct ext4_allocation_request *ar) 2942c9de560dSAlex Tomas { 2943c9de560dSAlex Tomas int bsbits, max; 2944c9de560dSAlex Tomas ext4_lblk_t end; 2945c9de560dSAlex Tomas loff_t size, orig_size, start_off; 2946c9de560dSAlex Tomas ext4_lblk_t start, orig_start; 2947c9de560dSAlex Tomas struct ext4_inode_info *ei = EXT4_I(ac->ac_inode); 29489a0762c5SAneesh Kumar K.V struct ext4_prealloc_space *pa; 2949c9de560dSAlex Tomas 2950c9de560dSAlex Tomas /* do normalize only data requests, metadata requests 2951c9de560dSAlex Tomas do not need preallocation */ 2952c9de560dSAlex Tomas if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) 2953c9de560dSAlex Tomas return; 2954c9de560dSAlex Tomas 2955c9de560dSAlex Tomas /* sometime caller may want exact blocks */ 2956c9de560dSAlex Tomas if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) 2957c9de560dSAlex Tomas return; 2958c9de560dSAlex Tomas 2959c9de560dSAlex Tomas /* caller may indicate that preallocation isn't 2960c9de560dSAlex Tomas * required (it's a tail, for example) */ 2961c9de560dSAlex Tomas if (ac->ac_flags & EXT4_MB_HINT_NOPREALLOC) 2962c9de560dSAlex Tomas return; 2963c9de560dSAlex Tomas 2964c9de560dSAlex Tomas if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) { 2965c9de560dSAlex Tomas ext4_mb_normalize_group_request(ac); 2966c9de560dSAlex Tomas return ; 2967c9de560dSAlex Tomas } 2968c9de560dSAlex Tomas 2969c9de560dSAlex Tomas bsbits = ac->ac_sb->s_blocksize_bits; 2970c9de560dSAlex Tomas 2971c9de560dSAlex Tomas /* first, let's learn actual file size 2972c9de560dSAlex Tomas * given current request is allocated */ 2973c9de560dSAlex Tomas size = ac->ac_o_ex.fe_logical + ac->ac_o_ex.fe_len; 2974c9de560dSAlex Tomas size = size << bsbits; 2975c9de560dSAlex Tomas if (size < i_size_read(ac->ac_inode)) 2976c9de560dSAlex Tomas size = i_size_read(ac->ac_inode); 2977c9de560dSAlex Tomas 29781930479cSValerie Clement /* max size of free chunks */ 29791930479cSValerie Clement max = 2 << bsbits; 2980c9de560dSAlex Tomas 29811930479cSValerie Clement #define NRL_CHECK_SIZE(req, size, max, chunk_size) \ 29821930479cSValerie Clement (req <= (size) || max <= (chunk_size)) 2983c9de560dSAlex Tomas 2984c9de560dSAlex Tomas /* first, try to predict filesize */ 2985c9de560dSAlex Tomas /* XXX: should this table be tunable? */ 2986c9de560dSAlex Tomas start_off = 0; 2987c9de560dSAlex Tomas if (size <= 16 * 1024) { 2988c9de560dSAlex Tomas size = 16 * 1024; 2989c9de560dSAlex Tomas } else if (size <= 32 * 1024) { 2990c9de560dSAlex Tomas size = 32 * 1024; 2991c9de560dSAlex Tomas } else if (size <= 64 * 1024) { 2992c9de560dSAlex Tomas size = 64 * 1024; 2993c9de560dSAlex Tomas } else if (size <= 128 * 1024) { 2994c9de560dSAlex Tomas size = 128 * 1024; 2995c9de560dSAlex Tomas } else if (size <= 256 * 1024) { 2996c9de560dSAlex Tomas size = 256 * 1024; 2997c9de560dSAlex Tomas } else if (size <= 512 * 1024) { 2998c9de560dSAlex Tomas size = 512 * 1024; 2999c9de560dSAlex Tomas } else if (size <= 1024 * 1024) { 3000c9de560dSAlex Tomas size = 1024 * 1024; 30011930479cSValerie Clement } else if (NRL_CHECK_SIZE(size, 4 * 1024 * 1024, max, 2 * 1024)) { 3002c9de560dSAlex Tomas start_off = ((loff_t)ac->ac_o_ex.fe_logical >> 30031930479cSValerie Clement (21 - bsbits)) << 21; 30041930479cSValerie Clement size = 2 * 1024 * 1024; 30051930479cSValerie Clement } else if (NRL_CHECK_SIZE(size, 8 * 1024 * 1024, max, 4 * 1024)) { 3006c9de560dSAlex Tomas start_off = ((loff_t)ac->ac_o_ex.fe_logical >> 3007c9de560dSAlex Tomas (22 - bsbits)) << 22; 3008c9de560dSAlex Tomas size = 4 * 1024 * 1024; 3009c9de560dSAlex Tomas } else if (NRL_CHECK_SIZE(ac->ac_o_ex.fe_len, 30101930479cSValerie Clement (8<<20)>>bsbits, max, 8 * 1024)) { 3011c9de560dSAlex Tomas start_off = ((loff_t)ac->ac_o_ex.fe_logical >> 3012c9de560dSAlex Tomas (23 - bsbits)) << 23; 3013c9de560dSAlex Tomas size = 8 * 1024 * 1024; 3014c9de560dSAlex Tomas } else { 3015c9de560dSAlex Tomas start_off = (loff_t)ac->ac_o_ex.fe_logical << bsbits; 3016c9de560dSAlex Tomas size = ac->ac_o_ex.fe_len << bsbits; 3017c9de560dSAlex Tomas } 3018c9de560dSAlex Tomas orig_size = size = size >> bsbits; 3019c9de560dSAlex Tomas orig_start = start = start_off >> bsbits; 3020c9de560dSAlex Tomas 3021c9de560dSAlex Tomas /* don't cover already allocated blocks in selected range */ 3022c9de560dSAlex Tomas if (ar->pleft && start <= ar->lleft) { 3023c9de560dSAlex Tomas size -= ar->lleft + 1 - start; 3024c9de560dSAlex Tomas start = ar->lleft + 1; 3025c9de560dSAlex Tomas } 3026c9de560dSAlex Tomas if (ar->pright && start + size - 1 >= ar->lright) 3027c9de560dSAlex Tomas size -= start + size - ar->lright; 3028c9de560dSAlex Tomas 3029c9de560dSAlex Tomas end = start + size; 3030c9de560dSAlex Tomas 3031c9de560dSAlex Tomas /* check we don't cross already preallocated blocks */ 3032c9de560dSAlex Tomas rcu_read_lock(); 30339a0762c5SAneesh Kumar K.V list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { 3034c9de560dSAlex Tomas unsigned long pa_end; 3035c9de560dSAlex Tomas 3036c9de560dSAlex Tomas if (pa->pa_deleted) 3037c9de560dSAlex Tomas continue; 3038c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3039c9de560dSAlex Tomas if (pa->pa_deleted) { 3040c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3041c9de560dSAlex Tomas continue; 3042c9de560dSAlex Tomas } 3043c9de560dSAlex Tomas 3044c9de560dSAlex Tomas pa_end = pa->pa_lstart + pa->pa_len; 3045c9de560dSAlex Tomas 3046c9de560dSAlex Tomas /* PA must not overlap original request */ 3047c9de560dSAlex Tomas BUG_ON(!(ac->ac_o_ex.fe_logical >= pa_end || 3048c9de560dSAlex Tomas ac->ac_o_ex.fe_logical < pa->pa_lstart)); 3049c9de560dSAlex Tomas 3050c9de560dSAlex Tomas /* skip PA normalized request doesn't overlap with */ 3051c9de560dSAlex Tomas if (pa->pa_lstart >= end) { 3052c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3053c9de560dSAlex Tomas continue; 3054c9de560dSAlex Tomas } 3055c9de560dSAlex Tomas if (pa_end <= start) { 3056c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3057c9de560dSAlex Tomas continue; 3058c9de560dSAlex Tomas } 3059c9de560dSAlex Tomas BUG_ON(pa->pa_lstart <= start && pa_end >= end); 3060c9de560dSAlex Tomas 3061c9de560dSAlex Tomas if (pa_end <= ac->ac_o_ex.fe_logical) { 3062c9de560dSAlex Tomas BUG_ON(pa_end < start); 3063c9de560dSAlex Tomas start = pa_end; 3064c9de560dSAlex Tomas } 3065c9de560dSAlex Tomas 3066c9de560dSAlex Tomas if (pa->pa_lstart > ac->ac_o_ex.fe_logical) { 3067c9de560dSAlex Tomas BUG_ON(pa->pa_lstart > end); 3068c9de560dSAlex Tomas end = pa->pa_lstart; 3069c9de560dSAlex Tomas } 3070c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3071c9de560dSAlex Tomas } 3072c9de560dSAlex Tomas rcu_read_unlock(); 3073c9de560dSAlex Tomas size = end - start; 3074c9de560dSAlex Tomas 3075c9de560dSAlex Tomas /* XXX: extra loop to check we really don't overlap preallocations */ 3076c9de560dSAlex Tomas rcu_read_lock(); 30779a0762c5SAneesh Kumar K.V list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { 3078c9de560dSAlex Tomas unsigned long pa_end; 3079c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3080c9de560dSAlex Tomas if (pa->pa_deleted == 0) { 3081c9de560dSAlex Tomas pa_end = pa->pa_lstart + pa->pa_len; 3082c9de560dSAlex Tomas BUG_ON(!(start >= pa_end || end <= pa->pa_lstart)); 3083c9de560dSAlex Tomas } 3084c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3085c9de560dSAlex Tomas } 3086c9de560dSAlex Tomas rcu_read_unlock(); 3087c9de560dSAlex Tomas 3088c9de560dSAlex Tomas if (start + size <= ac->ac_o_ex.fe_logical && 3089c9de560dSAlex Tomas start > ac->ac_o_ex.fe_logical) { 3090c9de560dSAlex Tomas printk(KERN_ERR "start %lu, size %lu, fe_logical %lu\n", 3091c9de560dSAlex Tomas (unsigned long) start, (unsigned long) size, 3092c9de560dSAlex Tomas (unsigned long) ac->ac_o_ex.fe_logical); 3093c9de560dSAlex Tomas } 3094c9de560dSAlex Tomas BUG_ON(start + size <= ac->ac_o_ex.fe_logical && 3095c9de560dSAlex Tomas start > ac->ac_o_ex.fe_logical); 3096c9de560dSAlex Tomas BUG_ON(size <= 0 || size >= EXT4_BLOCKS_PER_GROUP(ac->ac_sb)); 3097c9de560dSAlex Tomas 3098c9de560dSAlex Tomas /* now prepare goal request */ 3099c9de560dSAlex Tomas 3100c9de560dSAlex Tomas /* XXX: is it better to align blocks WRT to logical 3101c9de560dSAlex Tomas * placement or satisfy big request as is */ 3102c9de560dSAlex Tomas ac->ac_g_ex.fe_logical = start; 3103c9de560dSAlex Tomas ac->ac_g_ex.fe_len = size; 3104c9de560dSAlex Tomas 3105c9de560dSAlex Tomas /* define goal start in order to merge */ 3106c9de560dSAlex Tomas if (ar->pright && (ar->lright == (start + size))) { 3107c9de560dSAlex Tomas /* merge to the right */ 3108c9de560dSAlex Tomas ext4_get_group_no_and_offset(ac->ac_sb, ar->pright - size, 3109c9de560dSAlex Tomas &ac->ac_f_ex.fe_group, 3110c9de560dSAlex Tomas &ac->ac_f_ex.fe_start); 3111c9de560dSAlex Tomas ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL; 3112c9de560dSAlex Tomas } 3113c9de560dSAlex Tomas if (ar->pleft && (ar->lleft + 1 == start)) { 3114c9de560dSAlex Tomas /* merge to the left */ 3115c9de560dSAlex Tomas ext4_get_group_no_and_offset(ac->ac_sb, ar->pleft + 1, 3116c9de560dSAlex Tomas &ac->ac_f_ex.fe_group, 3117c9de560dSAlex Tomas &ac->ac_f_ex.fe_start); 3118c9de560dSAlex Tomas ac->ac_flags |= EXT4_MB_HINT_TRY_GOAL; 3119c9de560dSAlex Tomas } 3120c9de560dSAlex Tomas 3121c9de560dSAlex Tomas mb_debug("goal: %u(was %u) blocks at %u\n", (unsigned) size, 3122c9de560dSAlex Tomas (unsigned) orig_size, (unsigned) start); 3123c9de560dSAlex Tomas } 3124c9de560dSAlex Tomas 3125c9de560dSAlex Tomas static void ext4_mb_collect_stats(struct ext4_allocation_context *ac) 3126c9de560dSAlex Tomas { 3127c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); 3128c9de560dSAlex Tomas 3129c9de560dSAlex Tomas if (sbi->s_mb_stats && ac->ac_g_ex.fe_len > 1) { 3130c9de560dSAlex Tomas atomic_inc(&sbi->s_bal_reqs); 3131c9de560dSAlex Tomas atomic_add(ac->ac_b_ex.fe_len, &sbi->s_bal_allocated); 3132c9de560dSAlex Tomas if (ac->ac_o_ex.fe_len >= ac->ac_g_ex.fe_len) 3133c9de560dSAlex Tomas atomic_inc(&sbi->s_bal_success); 3134c9de560dSAlex Tomas atomic_add(ac->ac_found, &sbi->s_bal_ex_scanned); 3135c9de560dSAlex Tomas if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start && 3136c9de560dSAlex Tomas ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group) 3137c9de560dSAlex Tomas atomic_inc(&sbi->s_bal_goals); 3138c9de560dSAlex Tomas if (ac->ac_found > sbi->s_mb_max_to_scan) 3139c9de560dSAlex Tomas atomic_inc(&sbi->s_bal_breaks); 3140c9de560dSAlex Tomas } 3141c9de560dSAlex Tomas 3142c9de560dSAlex Tomas ext4_mb_store_history(ac); 3143c9de560dSAlex Tomas } 3144c9de560dSAlex Tomas 3145c9de560dSAlex Tomas /* 3146c9de560dSAlex Tomas * use blocks preallocated to inode 3147c9de560dSAlex Tomas */ 3148c9de560dSAlex Tomas static void ext4_mb_use_inode_pa(struct ext4_allocation_context *ac, 3149c9de560dSAlex Tomas struct ext4_prealloc_space *pa) 3150c9de560dSAlex Tomas { 3151c9de560dSAlex Tomas ext4_fsblk_t start; 3152c9de560dSAlex Tomas ext4_fsblk_t end; 3153c9de560dSAlex Tomas int len; 3154c9de560dSAlex Tomas 3155c9de560dSAlex Tomas /* found preallocated blocks, use them */ 3156c9de560dSAlex Tomas start = pa->pa_pstart + (ac->ac_o_ex.fe_logical - pa->pa_lstart); 3157c9de560dSAlex Tomas end = min(pa->pa_pstart + pa->pa_len, start + ac->ac_o_ex.fe_len); 3158c9de560dSAlex Tomas len = end - start; 3159c9de560dSAlex Tomas ext4_get_group_no_and_offset(ac->ac_sb, start, &ac->ac_b_ex.fe_group, 3160c9de560dSAlex Tomas &ac->ac_b_ex.fe_start); 3161c9de560dSAlex Tomas ac->ac_b_ex.fe_len = len; 3162c9de560dSAlex Tomas ac->ac_status = AC_STATUS_FOUND; 3163c9de560dSAlex Tomas ac->ac_pa = pa; 3164c9de560dSAlex Tomas 3165c9de560dSAlex Tomas BUG_ON(start < pa->pa_pstart); 3166c9de560dSAlex Tomas BUG_ON(start + len > pa->pa_pstart + pa->pa_len); 3167c9de560dSAlex Tomas BUG_ON(pa->pa_free < len); 3168c9de560dSAlex Tomas pa->pa_free -= len; 3169c9de560dSAlex Tomas 317060bd63d1SSolofo Ramangalahy mb_debug("use %llu/%u from inode pa %p\n", start, len, pa); 3171c9de560dSAlex Tomas } 3172c9de560dSAlex Tomas 3173c9de560dSAlex Tomas /* 3174c9de560dSAlex Tomas * use blocks preallocated to locality group 3175c9de560dSAlex Tomas */ 3176c9de560dSAlex Tomas static void ext4_mb_use_group_pa(struct ext4_allocation_context *ac, 3177c9de560dSAlex Tomas struct ext4_prealloc_space *pa) 3178c9de560dSAlex Tomas { 317903cddb80SAneesh Kumar K.V unsigned int len = ac->ac_o_ex.fe_len; 31806be2ded1SAneesh Kumar K.V 3181c9de560dSAlex Tomas ext4_get_group_no_and_offset(ac->ac_sb, pa->pa_pstart, 3182c9de560dSAlex Tomas &ac->ac_b_ex.fe_group, 3183c9de560dSAlex Tomas &ac->ac_b_ex.fe_start); 3184c9de560dSAlex Tomas ac->ac_b_ex.fe_len = len; 3185c9de560dSAlex Tomas ac->ac_status = AC_STATUS_FOUND; 3186c9de560dSAlex Tomas ac->ac_pa = pa; 3187c9de560dSAlex Tomas 3188c9de560dSAlex Tomas /* we don't correct pa_pstart or pa_plen here to avoid 318926346ff6SAneesh Kumar K.V * possible race when the group is being loaded concurrently 3190c9de560dSAlex Tomas * instead we correct pa later, after blocks are marked 319126346ff6SAneesh Kumar K.V * in on-disk bitmap -- see ext4_mb_release_context() 319226346ff6SAneesh Kumar K.V * Other CPUs are prevented from allocating from this pa by lg_mutex 3193c9de560dSAlex Tomas */ 3194c9de560dSAlex Tomas mb_debug("use %u/%u from group pa %p\n", pa->pa_lstart-len, len, pa); 3195c9de560dSAlex Tomas } 3196c9de560dSAlex Tomas 3197c9de560dSAlex Tomas /* 31985e745b04SAneesh Kumar K.V * Return the prealloc space that have minimal distance 31995e745b04SAneesh Kumar K.V * from the goal block. @cpa is the prealloc 32005e745b04SAneesh Kumar K.V * space that is having currently known minimal distance 32015e745b04SAneesh Kumar K.V * from the goal block. 32025e745b04SAneesh Kumar K.V */ 32035e745b04SAneesh Kumar K.V static struct ext4_prealloc_space * 32045e745b04SAneesh Kumar K.V ext4_mb_check_group_pa(ext4_fsblk_t goal_block, 32055e745b04SAneesh Kumar K.V struct ext4_prealloc_space *pa, 32065e745b04SAneesh Kumar K.V struct ext4_prealloc_space *cpa) 32075e745b04SAneesh Kumar K.V { 32085e745b04SAneesh Kumar K.V ext4_fsblk_t cur_distance, new_distance; 32095e745b04SAneesh Kumar K.V 32105e745b04SAneesh Kumar K.V if (cpa == NULL) { 32115e745b04SAneesh Kumar K.V atomic_inc(&pa->pa_count); 32125e745b04SAneesh Kumar K.V return pa; 32135e745b04SAneesh Kumar K.V } 32145e745b04SAneesh Kumar K.V cur_distance = abs(goal_block - cpa->pa_pstart); 32155e745b04SAneesh Kumar K.V new_distance = abs(goal_block - pa->pa_pstart); 32165e745b04SAneesh Kumar K.V 32175e745b04SAneesh Kumar K.V if (cur_distance < new_distance) 32185e745b04SAneesh Kumar K.V return cpa; 32195e745b04SAneesh Kumar K.V 32205e745b04SAneesh Kumar K.V /* drop the previous reference */ 32215e745b04SAneesh Kumar K.V atomic_dec(&cpa->pa_count); 32225e745b04SAneesh Kumar K.V atomic_inc(&pa->pa_count); 32235e745b04SAneesh Kumar K.V return pa; 32245e745b04SAneesh Kumar K.V } 32255e745b04SAneesh Kumar K.V 32265e745b04SAneesh Kumar K.V /* 3227c9de560dSAlex Tomas * search goal blocks in preallocated space 3228c9de560dSAlex Tomas */ 32294ddfef7bSEric Sandeen static noinline_for_stack int 32304ddfef7bSEric Sandeen ext4_mb_use_preallocated(struct ext4_allocation_context *ac) 3231c9de560dSAlex Tomas { 32326be2ded1SAneesh Kumar K.V int order, i; 3233c9de560dSAlex Tomas struct ext4_inode_info *ei = EXT4_I(ac->ac_inode); 3234c9de560dSAlex Tomas struct ext4_locality_group *lg; 32355e745b04SAneesh Kumar K.V struct ext4_prealloc_space *pa, *cpa = NULL; 32365e745b04SAneesh Kumar K.V ext4_fsblk_t goal_block; 3237c9de560dSAlex Tomas 3238c9de560dSAlex Tomas /* only data can be preallocated */ 3239c9de560dSAlex Tomas if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) 3240c9de560dSAlex Tomas return 0; 3241c9de560dSAlex Tomas 3242c9de560dSAlex Tomas /* first, try per-file preallocation */ 3243c9de560dSAlex Tomas rcu_read_lock(); 32449a0762c5SAneesh Kumar K.V list_for_each_entry_rcu(pa, &ei->i_prealloc_list, pa_inode_list) { 3245c9de560dSAlex Tomas 3246c9de560dSAlex Tomas /* all fields in this condition don't change, 3247c9de560dSAlex Tomas * so we can skip locking for them */ 3248c9de560dSAlex Tomas if (ac->ac_o_ex.fe_logical < pa->pa_lstart || 3249c9de560dSAlex Tomas ac->ac_o_ex.fe_logical >= pa->pa_lstart + pa->pa_len) 3250c9de560dSAlex Tomas continue; 3251c9de560dSAlex Tomas 3252c9de560dSAlex Tomas /* found preallocated blocks, use them */ 3253c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3254c9de560dSAlex Tomas if (pa->pa_deleted == 0 && pa->pa_free) { 3255c9de560dSAlex Tomas atomic_inc(&pa->pa_count); 3256c9de560dSAlex Tomas ext4_mb_use_inode_pa(ac, pa); 3257c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3258c9de560dSAlex Tomas ac->ac_criteria = 10; 3259c9de560dSAlex Tomas rcu_read_unlock(); 3260c9de560dSAlex Tomas return 1; 3261c9de560dSAlex Tomas } 3262c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3263c9de560dSAlex Tomas } 3264c9de560dSAlex Tomas rcu_read_unlock(); 3265c9de560dSAlex Tomas 3266c9de560dSAlex Tomas /* can we use group allocation? */ 3267c9de560dSAlex Tomas if (!(ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC)) 3268c9de560dSAlex Tomas return 0; 3269c9de560dSAlex Tomas 3270c9de560dSAlex Tomas /* inode may have no locality group for some reason */ 3271c9de560dSAlex Tomas lg = ac->ac_lg; 3272c9de560dSAlex Tomas if (lg == NULL) 3273c9de560dSAlex Tomas return 0; 32746be2ded1SAneesh Kumar K.V order = fls(ac->ac_o_ex.fe_len) - 1; 32756be2ded1SAneesh Kumar K.V if (order > PREALLOC_TB_SIZE - 1) 32766be2ded1SAneesh Kumar K.V /* The max size of hash table is PREALLOC_TB_SIZE */ 32776be2ded1SAneesh Kumar K.V order = PREALLOC_TB_SIZE - 1; 3278c9de560dSAlex Tomas 32795e745b04SAneesh Kumar K.V goal_block = ac->ac_g_ex.fe_group * EXT4_BLOCKS_PER_GROUP(ac->ac_sb) + 32805e745b04SAneesh Kumar K.V ac->ac_g_ex.fe_start + 32815e745b04SAneesh Kumar K.V le32_to_cpu(EXT4_SB(ac->ac_sb)->s_es->s_first_data_block); 32825e745b04SAneesh Kumar K.V /* 32835e745b04SAneesh Kumar K.V * search for the prealloc space that is having 32845e745b04SAneesh Kumar K.V * minimal distance from the goal block. 32855e745b04SAneesh Kumar K.V */ 32866be2ded1SAneesh Kumar K.V for (i = order; i < PREALLOC_TB_SIZE; i++) { 3287c9de560dSAlex Tomas rcu_read_lock(); 32886be2ded1SAneesh Kumar K.V list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[i], 32896be2ded1SAneesh Kumar K.V pa_inode_list) { 3290c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 32916be2ded1SAneesh Kumar K.V if (pa->pa_deleted == 0 && 32926be2ded1SAneesh Kumar K.V pa->pa_free >= ac->ac_o_ex.fe_len) { 32935e745b04SAneesh Kumar K.V 32945e745b04SAneesh Kumar K.V cpa = ext4_mb_check_group_pa(goal_block, 32955e745b04SAneesh Kumar K.V pa, cpa); 32965e745b04SAneesh Kumar K.V } 3297c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 32985e745b04SAneesh Kumar K.V } 32995e745b04SAneesh Kumar K.V rcu_read_unlock(); 33005e745b04SAneesh Kumar K.V } 33015e745b04SAneesh Kumar K.V if (cpa) { 33025e745b04SAneesh Kumar K.V ext4_mb_use_group_pa(ac, cpa); 3303c9de560dSAlex Tomas ac->ac_criteria = 20; 3304c9de560dSAlex Tomas return 1; 3305c9de560dSAlex Tomas } 3306c9de560dSAlex Tomas return 0; 3307c9de560dSAlex Tomas } 3308c9de560dSAlex Tomas 3309c9de560dSAlex Tomas /* 3310c9de560dSAlex Tomas * the function goes through all preallocation in this group and marks them 3311c9de560dSAlex Tomas * used in in-core bitmap. buddy must be generated from this bitmap 3312c9de560dSAlex Tomas * Need to be called with ext4 group lock (ext4_lock_group) 3313c9de560dSAlex Tomas */ 3314c9de560dSAlex Tomas static void ext4_mb_generate_from_pa(struct super_block *sb, void *bitmap, 3315c9de560dSAlex Tomas ext4_group_t group) 3316c9de560dSAlex Tomas { 3317c9de560dSAlex Tomas struct ext4_group_info *grp = ext4_get_group_info(sb, group); 3318c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 3319c9de560dSAlex Tomas struct list_head *cur; 3320c9de560dSAlex Tomas ext4_group_t groupnr; 3321c9de560dSAlex Tomas ext4_grpblk_t start; 3322c9de560dSAlex Tomas int preallocated = 0; 3323c9de560dSAlex Tomas int count = 0; 3324c9de560dSAlex Tomas int len; 3325c9de560dSAlex Tomas 3326c9de560dSAlex Tomas /* all form of preallocation discards first load group, 3327c9de560dSAlex Tomas * so the only competing code is preallocation use. 3328c9de560dSAlex Tomas * we don't need any locking here 3329c9de560dSAlex Tomas * notice we do NOT ignore preallocations with pa_deleted 3330c9de560dSAlex Tomas * otherwise we could leave used blocks available for 3331c9de560dSAlex Tomas * allocation in buddy when concurrent ext4_mb_put_pa() 3332c9de560dSAlex Tomas * is dropping preallocation 3333c9de560dSAlex Tomas */ 3334c9de560dSAlex Tomas list_for_each(cur, &grp->bb_prealloc_list) { 3335c9de560dSAlex Tomas pa = list_entry(cur, struct ext4_prealloc_space, pa_group_list); 3336c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3337c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, pa->pa_pstart, 3338c9de560dSAlex Tomas &groupnr, &start); 3339c9de560dSAlex Tomas len = pa->pa_len; 3340c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3341c9de560dSAlex Tomas if (unlikely(len == 0)) 3342c9de560dSAlex Tomas continue; 3343c9de560dSAlex Tomas BUG_ON(groupnr != group); 3344c9de560dSAlex Tomas mb_set_bits(sb_bgl_lock(EXT4_SB(sb), group), 3345c9de560dSAlex Tomas bitmap, start, len); 3346c9de560dSAlex Tomas preallocated += len; 3347c9de560dSAlex Tomas count++; 3348c9de560dSAlex Tomas } 3349c9de560dSAlex Tomas mb_debug("prellocated %u for group %lu\n", preallocated, group); 3350c9de560dSAlex Tomas } 3351c9de560dSAlex Tomas 3352c9de560dSAlex Tomas static void ext4_mb_pa_callback(struct rcu_head *head) 3353c9de560dSAlex Tomas { 3354c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 3355c9de560dSAlex Tomas pa = container_of(head, struct ext4_prealloc_space, u.pa_rcu); 3356c9de560dSAlex Tomas kmem_cache_free(ext4_pspace_cachep, pa); 3357c9de560dSAlex Tomas } 3358c9de560dSAlex Tomas 3359c9de560dSAlex Tomas /* 3360c9de560dSAlex Tomas * drops a reference to preallocated space descriptor 3361c9de560dSAlex Tomas * if this was the last reference and the space is consumed 3362c9de560dSAlex Tomas */ 3363c9de560dSAlex Tomas static void ext4_mb_put_pa(struct ext4_allocation_context *ac, 3364c9de560dSAlex Tomas struct super_block *sb, struct ext4_prealloc_space *pa) 3365c9de560dSAlex Tomas { 3366c9de560dSAlex Tomas unsigned long grp; 3367c9de560dSAlex Tomas 3368c9de560dSAlex Tomas if (!atomic_dec_and_test(&pa->pa_count) || pa->pa_free != 0) 3369c9de560dSAlex Tomas return; 3370c9de560dSAlex Tomas 3371c9de560dSAlex Tomas /* in this short window concurrent discard can set pa_deleted */ 3372c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3373c9de560dSAlex Tomas if (pa->pa_deleted == 1) { 3374c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3375c9de560dSAlex Tomas return; 3376c9de560dSAlex Tomas } 3377c9de560dSAlex Tomas 3378c9de560dSAlex Tomas pa->pa_deleted = 1; 3379c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3380c9de560dSAlex Tomas 3381c9de560dSAlex Tomas /* -1 is to protect from crossing allocation group */ 3382c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, pa->pa_pstart - 1, &grp, NULL); 3383c9de560dSAlex Tomas 3384c9de560dSAlex Tomas /* 3385c9de560dSAlex Tomas * possible race: 3386c9de560dSAlex Tomas * 3387c9de560dSAlex Tomas * P1 (buddy init) P2 (regular allocation) 3388c9de560dSAlex Tomas * find block B in PA 3389c9de560dSAlex Tomas * copy on-disk bitmap to buddy 3390c9de560dSAlex Tomas * mark B in on-disk bitmap 3391c9de560dSAlex Tomas * drop PA from group 3392c9de560dSAlex Tomas * mark all PAs in buddy 3393c9de560dSAlex Tomas * 3394c9de560dSAlex Tomas * thus, P1 initializes buddy with B available. to prevent this 3395c9de560dSAlex Tomas * we make "copy" and "mark all PAs" atomic and serialize "drop PA" 3396c9de560dSAlex Tomas * against that pair 3397c9de560dSAlex Tomas */ 3398c9de560dSAlex Tomas ext4_lock_group(sb, grp); 3399c9de560dSAlex Tomas list_del(&pa->pa_group_list); 3400c9de560dSAlex Tomas ext4_unlock_group(sb, grp); 3401c9de560dSAlex Tomas 3402c9de560dSAlex Tomas spin_lock(pa->pa_obj_lock); 3403c9de560dSAlex Tomas list_del_rcu(&pa->pa_inode_list); 3404c9de560dSAlex Tomas spin_unlock(pa->pa_obj_lock); 3405c9de560dSAlex Tomas 3406c9de560dSAlex Tomas call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); 3407c9de560dSAlex Tomas } 3408c9de560dSAlex Tomas 3409c9de560dSAlex Tomas /* 3410c9de560dSAlex Tomas * creates new preallocated space for given inode 3411c9de560dSAlex Tomas */ 34124ddfef7bSEric Sandeen static noinline_for_stack int 34134ddfef7bSEric Sandeen ext4_mb_new_inode_pa(struct ext4_allocation_context *ac) 3414c9de560dSAlex Tomas { 3415c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 3416c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 3417c9de560dSAlex Tomas struct ext4_group_info *grp; 3418c9de560dSAlex Tomas struct ext4_inode_info *ei; 3419c9de560dSAlex Tomas 3420c9de560dSAlex Tomas /* preallocate only when found space is larger then requested */ 3421c9de560dSAlex Tomas BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len); 3422c9de560dSAlex Tomas BUG_ON(ac->ac_status != AC_STATUS_FOUND); 3423c9de560dSAlex Tomas BUG_ON(!S_ISREG(ac->ac_inode->i_mode)); 3424c9de560dSAlex Tomas 3425c9de560dSAlex Tomas pa = kmem_cache_alloc(ext4_pspace_cachep, GFP_NOFS); 3426c9de560dSAlex Tomas if (pa == NULL) 3427c9de560dSAlex Tomas return -ENOMEM; 3428c9de560dSAlex Tomas 3429c9de560dSAlex Tomas if (ac->ac_b_ex.fe_len < ac->ac_g_ex.fe_len) { 3430c9de560dSAlex Tomas int winl; 3431c9de560dSAlex Tomas int wins; 3432c9de560dSAlex Tomas int win; 3433c9de560dSAlex Tomas int offs; 3434c9de560dSAlex Tomas 3435c9de560dSAlex Tomas /* we can't allocate as much as normalizer wants. 3436c9de560dSAlex Tomas * so, found space must get proper lstart 3437c9de560dSAlex Tomas * to cover original request */ 3438c9de560dSAlex Tomas BUG_ON(ac->ac_g_ex.fe_logical > ac->ac_o_ex.fe_logical); 3439c9de560dSAlex Tomas BUG_ON(ac->ac_g_ex.fe_len < ac->ac_o_ex.fe_len); 3440c9de560dSAlex Tomas 3441c9de560dSAlex Tomas /* we're limited by original request in that 3442c9de560dSAlex Tomas * logical block must be covered any way 3443c9de560dSAlex Tomas * winl is window we can move our chunk within */ 3444c9de560dSAlex Tomas winl = ac->ac_o_ex.fe_logical - ac->ac_g_ex.fe_logical; 3445c9de560dSAlex Tomas 3446c9de560dSAlex Tomas /* also, we should cover whole original request */ 3447c9de560dSAlex Tomas wins = ac->ac_b_ex.fe_len - ac->ac_o_ex.fe_len; 3448c9de560dSAlex Tomas 3449c9de560dSAlex Tomas /* the smallest one defines real window */ 3450c9de560dSAlex Tomas win = min(winl, wins); 3451c9de560dSAlex Tomas 3452c9de560dSAlex Tomas offs = ac->ac_o_ex.fe_logical % ac->ac_b_ex.fe_len; 3453c9de560dSAlex Tomas if (offs && offs < win) 3454c9de560dSAlex Tomas win = offs; 3455c9de560dSAlex Tomas 3456c9de560dSAlex Tomas ac->ac_b_ex.fe_logical = ac->ac_o_ex.fe_logical - win; 3457c9de560dSAlex Tomas BUG_ON(ac->ac_o_ex.fe_logical < ac->ac_b_ex.fe_logical); 3458c9de560dSAlex Tomas BUG_ON(ac->ac_o_ex.fe_len > ac->ac_b_ex.fe_len); 3459c9de560dSAlex Tomas } 3460c9de560dSAlex Tomas 3461c9de560dSAlex Tomas /* preallocation can change ac_b_ex, thus we store actually 3462c9de560dSAlex Tomas * allocated blocks for history */ 3463c9de560dSAlex Tomas ac->ac_f_ex = ac->ac_b_ex; 3464c9de560dSAlex Tomas 3465c9de560dSAlex Tomas pa->pa_lstart = ac->ac_b_ex.fe_logical; 3466c9de560dSAlex Tomas pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); 3467c9de560dSAlex Tomas pa->pa_len = ac->ac_b_ex.fe_len; 3468c9de560dSAlex Tomas pa->pa_free = pa->pa_len; 3469c9de560dSAlex Tomas atomic_set(&pa->pa_count, 1); 3470c9de560dSAlex Tomas spin_lock_init(&pa->pa_lock); 3471c9de560dSAlex Tomas pa->pa_deleted = 0; 3472c9de560dSAlex Tomas pa->pa_linear = 0; 3473c9de560dSAlex Tomas 3474c9de560dSAlex Tomas mb_debug("new inode pa %p: %llu/%u for %u\n", pa, 3475c9de560dSAlex Tomas pa->pa_pstart, pa->pa_len, pa->pa_lstart); 3476c9de560dSAlex Tomas 3477c9de560dSAlex Tomas ext4_mb_use_inode_pa(ac, pa); 3478c9de560dSAlex Tomas atomic_add(pa->pa_free, &EXT4_SB(sb)->s_mb_preallocated); 3479c9de560dSAlex Tomas 3480c9de560dSAlex Tomas ei = EXT4_I(ac->ac_inode); 3481c9de560dSAlex Tomas grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group); 3482c9de560dSAlex Tomas 3483c9de560dSAlex Tomas pa->pa_obj_lock = &ei->i_prealloc_lock; 3484c9de560dSAlex Tomas pa->pa_inode = ac->ac_inode; 3485c9de560dSAlex Tomas 3486c9de560dSAlex Tomas ext4_lock_group(sb, ac->ac_b_ex.fe_group); 3487c9de560dSAlex Tomas list_add(&pa->pa_group_list, &grp->bb_prealloc_list); 3488c9de560dSAlex Tomas ext4_unlock_group(sb, ac->ac_b_ex.fe_group); 3489c9de560dSAlex Tomas 3490c9de560dSAlex Tomas spin_lock(pa->pa_obj_lock); 3491c9de560dSAlex Tomas list_add_rcu(&pa->pa_inode_list, &ei->i_prealloc_list); 3492c9de560dSAlex Tomas spin_unlock(pa->pa_obj_lock); 3493c9de560dSAlex Tomas 3494c9de560dSAlex Tomas return 0; 3495c9de560dSAlex Tomas } 3496c9de560dSAlex Tomas 3497c9de560dSAlex Tomas /* 3498c9de560dSAlex Tomas * creates new preallocated space for locality group inodes belongs to 3499c9de560dSAlex Tomas */ 35004ddfef7bSEric Sandeen static noinline_for_stack int 35014ddfef7bSEric Sandeen ext4_mb_new_group_pa(struct ext4_allocation_context *ac) 3502c9de560dSAlex Tomas { 3503c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 3504c9de560dSAlex Tomas struct ext4_locality_group *lg; 3505c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 3506c9de560dSAlex Tomas struct ext4_group_info *grp; 3507c9de560dSAlex Tomas 3508c9de560dSAlex Tomas /* preallocate only when found space is larger then requested */ 3509c9de560dSAlex Tomas BUG_ON(ac->ac_o_ex.fe_len >= ac->ac_b_ex.fe_len); 3510c9de560dSAlex Tomas BUG_ON(ac->ac_status != AC_STATUS_FOUND); 3511c9de560dSAlex Tomas BUG_ON(!S_ISREG(ac->ac_inode->i_mode)); 3512c9de560dSAlex Tomas 3513c9de560dSAlex Tomas BUG_ON(ext4_pspace_cachep == NULL); 3514c9de560dSAlex Tomas pa = kmem_cache_alloc(ext4_pspace_cachep, GFP_NOFS); 3515c9de560dSAlex Tomas if (pa == NULL) 3516c9de560dSAlex Tomas return -ENOMEM; 3517c9de560dSAlex Tomas 3518c9de560dSAlex Tomas /* preallocation can change ac_b_ex, thus we store actually 3519c9de560dSAlex Tomas * allocated blocks for history */ 3520c9de560dSAlex Tomas ac->ac_f_ex = ac->ac_b_ex; 3521c9de560dSAlex Tomas 3522c9de560dSAlex Tomas pa->pa_pstart = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); 3523c9de560dSAlex Tomas pa->pa_lstart = pa->pa_pstart; 3524c9de560dSAlex Tomas pa->pa_len = ac->ac_b_ex.fe_len; 3525c9de560dSAlex Tomas pa->pa_free = pa->pa_len; 3526c9de560dSAlex Tomas atomic_set(&pa->pa_count, 1); 3527c9de560dSAlex Tomas spin_lock_init(&pa->pa_lock); 35286be2ded1SAneesh Kumar K.V INIT_LIST_HEAD(&pa->pa_inode_list); 3529c9de560dSAlex Tomas pa->pa_deleted = 0; 3530c9de560dSAlex Tomas pa->pa_linear = 1; 3531c9de560dSAlex Tomas 3532c9de560dSAlex Tomas mb_debug("new group pa %p: %llu/%u for %u\n", pa, 3533c9de560dSAlex Tomas pa->pa_pstart, pa->pa_len, pa->pa_lstart); 3534c9de560dSAlex Tomas 3535c9de560dSAlex Tomas ext4_mb_use_group_pa(ac, pa); 3536c9de560dSAlex Tomas atomic_add(pa->pa_free, &EXT4_SB(sb)->s_mb_preallocated); 3537c9de560dSAlex Tomas 3538c9de560dSAlex Tomas grp = ext4_get_group_info(sb, ac->ac_b_ex.fe_group); 3539c9de560dSAlex Tomas lg = ac->ac_lg; 3540c9de560dSAlex Tomas BUG_ON(lg == NULL); 3541c9de560dSAlex Tomas 3542c9de560dSAlex Tomas pa->pa_obj_lock = &lg->lg_prealloc_lock; 3543c9de560dSAlex Tomas pa->pa_inode = NULL; 3544c9de560dSAlex Tomas 3545c9de560dSAlex Tomas ext4_lock_group(sb, ac->ac_b_ex.fe_group); 3546c9de560dSAlex Tomas list_add(&pa->pa_group_list, &grp->bb_prealloc_list); 3547c9de560dSAlex Tomas ext4_unlock_group(sb, ac->ac_b_ex.fe_group); 3548c9de560dSAlex Tomas 35496be2ded1SAneesh Kumar K.V /* 35506be2ded1SAneesh Kumar K.V * We will later add the new pa to the right bucket 35516be2ded1SAneesh Kumar K.V * after updating the pa_free in ext4_mb_release_context 35526be2ded1SAneesh Kumar K.V */ 3553c9de560dSAlex Tomas return 0; 3554c9de560dSAlex Tomas } 3555c9de560dSAlex Tomas 3556c9de560dSAlex Tomas static int ext4_mb_new_preallocation(struct ext4_allocation_context *ac) 3557c9de560dSAlex Tomas { 3558c9de560dSAlex Tomas int err; 3559c9de560dSAlex Tomas 3560c9de560dSAlex Tomas if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) 3561c9de560dSAlex Tomas err = ext4_mb_new_group_pa(ac); 3562c9de560dSAlex Tomas else 3563c9de560dSAlex Tomas err = ext4_mb_new_inode_pa(ac); 3564c9de560dSAlex Tomas return err; 3565c9de560dSAlex Tomas } 3566c9de560dSAlex Tomas 3567c9de560dSAlex Tomas /* 3568c9de560dSAlex Tomas * finds all unused blocks in on-disk bitmap, frees them in 3569c9de560dSAlex Tomas * in-core bitmap and buddy. 3570c9de560dSAlex Tomas * @pa must be unlinked from inode and group lists, so that 3571c9de560dSAlex Tomas * nobody else can find/use it. 3572c9de560dSAlex Tomas * the caller MUST hold group/inode locks. 3573c9de560dSAlex Tomas * TODO: optimize the case when there are no in-core structures yet 3574c9de560dSAlex Tomas */ 35754ddfef7bSEric Sandeen static noinline_for_stack int 35764ddfef7bSEric Sandeen ext4_mb_release_inode_pa(struct ext4_buddy *e4b, struct buffer_head *bitmap_bh, 3577c83617dbSAneesh Kumar K.V struct ext4_prealloc_space *pa, 3578c83617dbSAneesh Kumar K.V struct ext4_allocation_context *ac) 3579c9de560dSAlex Tomas { 3580c9de560dSAlex Tomas struct super_block *sb = e4b->bd_sb; 3581c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 3582c9de560dSAlex Tomas unsigned long end; 3583c9de560dSAlex Tomas unsigned long next; 3584c9de560dSAlex Tomas ext4_group_t group; 3585c9de560dSAlex Tomas ext4_grpblk_t bit; 3586c9de560dSAlex Tomas sector_t start; 3587c9de560dSAlex Tomas int err = 0; 3588c9de560dSAlex Tomas int free = 0; 3589c9de560dSAlex Tomas 3590c9de560dSAlex Tomas BUG_ON(pa->pa_deleted == 0); 3591c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit); 3592c9de560dSAlex Tomas BUG_ON(group != e4b->bd_group && pa->pa_len != 0); 3593c9de560dSAlex Tomas end = bit + pa->pa_len; 3594c9de560dSAlex Tomas 3595256bdb49SEric Sandeen if (ac) { 3596256bdb49SEric Sandeen ac->ac_sb = sb; 3597256bdb49SEric Sandeen ac->ac_inode = pa->pa_inode; 3598256bdb49SEric Sandeen ac->ac_op = EXT4_MB_HISTORY_DISCARD; 3599256bdb49SEric Sandeen } 3600c9de560dSAlex Tomas 3601c9de560dSAlex Tomas while (bit < end) { 3602ffad0a44SAneesh Kumar K.V bit = mb_find_next_zero_bit(bitmap_bh->b_data, end, bit); 3603c9de560dSAlex Tomas if (bit >= end) 3604c9de560dSAlex Tomas break; 3605ffad0a44SAneesh Kumar K.V next = mb_find_next_bit(bitmap_bh->b_data, end, bit); 3606c9de560dSAlex Tomas start = group * EXT4_BLOCKS_PER_GROUP(sb) + bit + 3607c9de560dSAlex Tomas le32_to_cpu(sbi->s_es->s_first_data_block); 3608c9de560dSAlex Tomas mb_debug(" free preallocated %u/%u in group %u\n", 3609c9de560dSAlex Tomas (unsigned) start, (unsigned) next - bit, 3610c9de560dSAlex Tomas (unsigned) group); 3611c9de560dSAlex Tomas free += next - bit; 3612c9de560dSAlex Tomas 3613256bdb49SEric Sandeen if (ac) { 3614256bdb49SEric Sandeen ac->ac_b_ex.fe_group = group; 3615256bdb49SEric Sandeen ac->ac_b_ex.fe_start = bit; 3616256bdb49SEric Sandeen ac->ac_b_ex.fe_len = next - bit; 3617256bdb49SEric Sandeen ac->ac_b_ex.fe_logical = 0; 3618256bdb49SEric Sandeen ext4_mb_store_history(ac); 3619256bdb49SEric Sandeen } 3620c9de560dSAlex Tomas 3621c9de560dSAlex Tomas mb_free_blocks(pa->pa_inode, e4b, bit, next - bit); 3622c9de560dSAlex Tomas bit = next + 1; 3623c9de560dSAlex Tomas } 3624c9de560dSAlex Tomas if (free != pa->pa_free) { 362526346ff6SAneesh Kumar K.V printk(KERN_CRIT "pa %p: logic %lu, phys. %lu, len %lu\n", 3626c9de560dSAlex Tomas pa, (unsigned long) pa->pa_lstart, 3627c9de560dSAlex Tomas (unsigned long) pa->pa_pstart, 3628c9de560dSAlex Tomas (unsigned long) pa->pa_len); 362946e665e9SHarvey Harrison ext4_error(sb, __func__, "free %u, pa_free %u\n", 363026346ff6SAneesh Kumar K.V free, pa->pa_free); 3631e56eb659SAneesh Kumar K.V /* 3632e56eb659SAneesh Kumar K.V * pa is already deleted so we use the value obtained 3633e56eb659SAneesh Kumar K.V * from the bitmap and continue. 3634e56eb659SAneesh Kumar K.V */ 3635c9de560dSAlex Tomas } 3636c9de560dSAlex Tomas atomic_add(free, &sbi->s_mb_discarded); 3637c9de560dSAlex Tomas 3638c9de560dSAlex Tomas return err; 3639c9de560dSAlex Tomas } 3640c9de560dSAlex Tomas 36414ddfef7bSEric Sandeen static noinline_for_stack int 36424ddfef7bSEric Sandeen ext4_mb_release_group_pa(struct ext4_buddy *e4b, 3643c83617dbSAneesh Kumar K.V struct ext4_prealloc_space *pa, 3644c83617dbSAneesh Kumar K.V struct ext4_allocation_context *ac) 3645c9de560dSAlex Tomas { 3646c9de560dSAlex Tomas struct super_block *sb = e4b->bd_sb; 3647c9de560dSAlex Tomas ext4_group_t group; 3648c9de560dSAlex Tomas ext4_grpblk_t bit; 3649c9de560dSAlex Tomas 3650256bdb49SEric Sandeen if (ac) 3651256bdb49SEric Sandeen ac->ac_op = EXT4_MB_HISTORY_DISCARD; 3652c9de560dSAlex Tomas 3653c9de560dSAlex Tomas BUG_ON(pa->pa_deleted == 0); 3654c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, &bit); 3655c9de560dSAlex Tomas BUG_ON(group != e4b->bd_group && pa->pa_len != 0); 3656c9de560dSAlex Tomas mb_free_blocks(pa->pa_inode, e4b, bit, pa->pa_len); 3657c9de560dSAlex Tomas atomic_add(pa->pa_len, &EXT4_SB(sb)->s_mb_discarded); 3658c9de560dSAlex Tomas 3659256bdb49SEric Sandeen if (ac) { 3660256bdb49SEric Sandeen ac->ac_sb = sb; 3661256bdb49SEric Sandeen ac->ac_inode = NULL; 3662256bdb49SEric Sandeen ac->ac_b_ex.fe_group = group; 3663256bdb49SEric Sandeen ac->ac_b_ex.fe_start = bit; 3664256bdb49SEric Sandeen ac->ac_b_ex.fe_len = pa->pa_len; 3665256bdb49SEric Sandeen ac->ac_b_ex.fe_logical = 0; 3666256bdb49SEric Sandeen ext4_mb_store_history(ac); 3667256bdb49SEric Sandeen } 3668c9de560dSAlex Tomas 3669c9de560dSAlex Tomas return 0; 3670c9de560dSAlex Tomas } 3671c9de560dSAlex Tomas 3672c9de560dSAlex Tomas /* 3673c9de560dSAlex Tomas * releases all preallocations in given group 3674c9de560dSAlex Tomas * 3675c9de560dSAlex Tomas * first, we need to decide discard policy: 3676c9de560dSAlex Tomas * - when do we discard 3677c9de560dSAlex Tomas * 1) ENOSPC 3678c9de560dSAlex Tomas * - how many do we discard 3679c9de560dSAlex Tomas * 1) how many requested 3680c9de560dSAlex Tomas */ 36814ddfef7bSEric Sandeen static noinline_for_stack int 36824ddfef7bSEric Sandeen ext4_mb_discard_group_preallocations(struct super_block *sb, 3683c9de560dSAlex Tomas ext4_group_t group, int needed) 3684c9de560dSAlex Tomas { 3685c9de560dSAlex Tomas struct ext4_group_info *grp = ext4_get_group_info(sb, group); 3686c9de560dSAlex Tomas struct buffer_head *bitmap_bh = NULL; 3687c9de560dSAlex Tomas struct ext4_prealloc_space *pa, *tmp; 3688c83617dbSAneesh Kumar K.V struct ext4_allocation_context *ac; 3689c9de560dSAlex Tomas struct list_head list; 3690c9de560dSAlex Tomas struct ext4_buddy e4b; 3691c9de560dSAlex Tomas int err; 3692c9de560dSAlex Tomas int busy = 0; 3693c9de560dSAlex Tomas int free = 0; 3694c9de560dSAlex Tomas 3695c9de560dSAlex Tomas mb_debug("discard preallocation for group %lu\n", group); 3696c9de560dSAlex Tomas 3697c9de560dSAlex Tomas if (list_empty(&grp->bb_prealloc_list)) 3698c9de560dSAlex Tomas return 0; 3699c9de560dSAlex Tomas 3700574ca174STheodore Ts'o bitmap_bh = ext4_read_block_bitmap(sb, group); 3701c9de560dSAlex Tomas if (bitmap_bh == NULL) { 3702ce89f46cSAneesh Kumar K.V ext4_error(sb, __func__, "Error in reading block " 3703ce89f46cSAneesh Kumar K.V "bitmap for %lu\n", group); 3704ce89f46cSAneesh Kumar K.V return 0; 3705c9de560dSAlex Tomas } 3706c9de560dSAlex Tomas 3707c9de560dSAlex Tomas err = ext4_mb_load_buddy(sb, group, &e4b); 3708ce89f46cSAneesh Kumar K.V if (err) { 3709ce89f46cSAneesh Kumar K.V ext4_error(sb, __func__, "Error in loading buddy " 3710ce89f46cSAneesh Kumar K.V "information for %lu\n", group); 3711ce89f46cSAneesh Kumar K.V put_bh(bitmap_bh); 3712ce89f46cSAneesh Kumar K.V return 0; 3713ce89f46cSAneesh Kumar K.V } 3714c9de560dSAlex Tomas 3715c9de560dSAlex Tomas if (needed == 0) 3716c9de560dSAlex Tomas needed = EXT4_BLOCKS_PER_GROUP(sb) + 1; 3717c9de560dSAlex Tomas 3718c9de560dSAlex Tomas INIT_LIST_HEAD(&list); 3719c83617dbSAneesh Kumar K.V ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); 3720c9de560dSAlex Tomas repeat: 3721c9de560dSAlex Tomas ext4_lock_group(sb, group); 3722c9de560dSAlex Tomas list_for_each_entry_safe(pa, tmp, 3723c9de560dSAlex Tomas &grp->bb_prealloc_list, pa_group_list) { 3724c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3725c9de560dSAlex Tomas if (atomic_read(&pa->pa_count)) { 3726c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3727c9de560dSAlex Tomas busy = 1; 3728c9de560dSAlex Tomas continue; 3729c9de560dSAlex Tomas } 3730c9de560dSAlex Tomas if (pa->pa_deleted) { 3731c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3732c9de560dSAlex Tomas continue; 3733c9de560dSAlex Tomas } 3734c9de560dSAlex Tomas 3735c9de560dSAlex Tomas /* seems this one can be freed ... */ 3736c9de560dSAlex Tomas pa->pa_deleted = 1; 3737c9de560dSAlex Tomas 3738c9de560dSAlex Tomas /* we can trust pa_free ... */ 3739c9de560dSAlex Tomas free += pa->pa_free; 3740c9de560dSAlex Tomas 3741c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3742c9de560dSAlex Tomas 3743c9de560dSAlex Tomas list_del(&pa->pa_group_list); 3744c9de560dSAlex Tomas list_add(&pa->u.pa_tmp_list, &list); 3745c9de560dSAlex Tomas } 3746c9de560dSAlex Tomas 3747c9de560dSAlex Tomas /* if we still need more blocks and some PAs were used, try again */ 3748c9de560dSAlex Tomas if (free < needed && busy) { 3749c9de560dSAlex Tomas busy = 0; 3750c9de560dSAlex Tomas ext4_unlock_group(sb, group); 3751c9de560dSAlex Tomas /* 3752c9de560dSAlex Tomas * Yield the CPU here so that we don't get soft lockup 3753c9de560dSAlex Tomas * in non preempt case. 3754c9de560dSAlex Tomas */ 3755c9de560dSAlex Tomas yield(); 3756c9de560dSAlex Tomas goto repeat; 3757c9de560dSAlex Tomas } 3758c9de560dSAlex Tomas 3759c9de560dSAlex Tomas /* found anything to free? */ 3760c9de560dSAlex Tomas if (list_empty(&list)) { 3761c9de560dSAlex Tomas BUG_ON(free != 0); 3762c9de560dSAlex Tomas goto out; 3763c9de560dSAlex Tomas } 3764c9de560dSAlex Tomas 3765c9de560dSAlex Tomas /* now free all selected PAs */ 3766c9de560dSAlex Tomas list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) { 3767c9de560dSAlex Tomas 3768c9de560dSAlex Tomas /* remove from object (inode or locality group) */ 3769c9de560dSAlex Tomas spin_lock(pa->pa_obj_lock); 3770c9de560dSAlex Tomas list_del_rcu(&pa->pa_inode_list); 3771c9de560dSAlex Tomas spin_unlock(pa->pa_obj_lock); 3772c9de560dSAlex Tomas 3773c9de560dSAlex Tomas if (pa->pa_linear) 3774c83617dbSAneesh Kumar K.V ext4_mb_release_group_pa(&e4b, pa, ac); 3775c9de560dSAlex Tomas else 3776c83617dbSAneesh Kumar K.V ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa, ac); 3777c9de560dSAlex Tomas 3778c9de560dSAlex Tomas list_del(&pa->u.pa_tmp_list); 3779c9de560dSAlex Tomas call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); 3780c9de560dSAlex Tomas } 3781c9de560dSAlex Tomas 3782c9de560dSAlex Tomas out: 3783c9de560dSAlex Tomas ext4_unlock_group(sb, group); 3784c83617dbSAneesh Kumar K.V if (ac) 3785c83617dbSAneesh Kumar K.V kmem_cache_free(ext4_ac_cachep, ac); 3786c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 3787c9de560dSAlex Tomas put_bh(bitmap_bh); 3788c9de560dSAlex Tomas return free; 3789c9de560dSAlex Tomas } 3790c9de560dSAlex Tomas 3791c9de560dSAlex Tomas /* 3792c9de560dSAlex Tomas * releases all non-used preallocated blocks for given inode 3793c9de560dSAlex Tomas * 3794c9de560dSAlex Tomas * It's important to discard preallocations under i_data_sem 3795c9de560dSAlex Tomas * We don't want another block to be served from the prealloc 3796c9de560dSAlex Tomas * space when we are discarding the inode prealloc space. 3797c9de560dSAlex Tomas * 3798c9de560dSAlex Tomas * FIXME!! Make sure it is valid at all the call sites 3799c9de560dSAlex Tomas */ 3800c2ea3fdeSTheodore Ts'o void ext4_discard_preallocations(struct inode *inode) 3801c9de560dSAlex Tomas { 3802c9de560dSAlex Tomas struct ext4_inode_info *ei = EXT4_I(inode); 3803c9de560dSAlex Tomas struct super_block *sb = inode->i_sb; 3804c9de560dSAlex Tomas struct buffer_head *bitmap_bh = NULL; 3805c9de560dSAlex Tomas struct ext4_prealloc_space *pa, *tmp; 3806c83617dbSAneesh Kumar K.V struct ext4_allocation_context *ac; 3807c9de560dSAlex Tomas ext4_group_t group = 0; 3808c9de560dSAlex Tomas struct list_head list; 3809c9de560dSAlex Tomas struct ext4_buddy e4b; 3810c9de560dSAlex Tomas int err; 3811c9de560dSAlex Tomas 3812c2ea3fdeSTheodore Ts'o if (!S_ISREG(inode->i_mode)) { 3813c9de560dSAlex Tomas /*BUG_ON(!list_empty(&ei->i_prealloc_list));*/ 3814c9de560dSAlex Tomas return; 3815c9de560dSAlex Tomas } 3816c9de560dSAlex Tomas 3817c9de560dSAlex Tomas mb_debug("discard preallocation for inode %lu\n", inode->i_ino); 3818c9de560dSAlex Tomas 3819c9de560dSAlex Tomas INIT_LIST_HEAD(&list); 3820c9de560dSAlex Tomas 3821c83617dbSAneesh Kumar K.V ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); 3822c9de560dSAlex Tomas repeat: 3823c9de560dSAlex Tomas /* first, collect all pa's in the inode */ 3824c9de560dSAlex Tomas spin_lock(&ei->i_prealloc_lock); 3825c9de560dSAlex Tomas while (!list_empty(&ei->i_prealloc_list)) { 3826c9de560dSAlex Tomas pa = list_entry(ei->i_prealloc_list.next, 3827c9de560dSAlex Tomas struct ext4_prealloc_space, pa_inode_list); 3828c9de560dSAlex Tomas BUG_ON(pa->pa_obj_lock != &ei->i_prealloc_lock); 3829c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3830c9de560dSAlex Tomas if (atomic_read(&pa->pa_count)) { 3831c9de560dSAlex Tomas /* this shouldn't happen often - nobody should 3832c9de560dSAlex Tomas * use preallocation while we're discarding it */ 3833c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3834c9de560dSAlex Tomas spin_unlock(&ei->i_prealloc_lock); 3835c9de560dSAlex Tomas printk(KERN_ERR "uh-oh! used pa while discarding\n"); 3836c9de560dSAlex Tomas WARN_ON(1); 3837c9de560dSAlex Tomas schedule_timeout_uninterruptible(HZ); 3838c9de560dSAlex Tomas goto repeat; 3839c9de560dSAlex Tomas 3840c9de560dSAlex Tomas } 3841c9de560dSAlex Tomas if (pa->pa_deleted == 0) { 3842c9de560dSAlex Tomas pa->pa_deleted = 1; 3843c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3844c9de560dSAlex Tomas list_del_rcu(&pa->pa_inode_list); 3845c9de560dSAlex Tomas list_add(&pa->u.pa_tmp_list, &list); 3846c9de560dSAlex Tomas continue; 3847c9de560dSAlex Tomas } 3848c9de560dSAlex Tomas 3849c9de560dSAlex Tomas /* someone is deleting pa right now */ 3850c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3851c9de560dSAlex Tomas spin_unlock(&ei->i_prealloc_lock); 3852c9de560dSAlex Tomas 3853c9de560dSAlex Tomas /* we have to wait here because pa_deleted 3854c9de560dSAlex Tomas * doesn't mean pa is already unlinked from 3855c9de560dSAlex Tomas * the list. as we might be called from 3856c9de560dSAlex Tomas * ->clear_inode() the inode will get freed 3857c9de560dSAlex Tomas * and concurrent thread which is unlinking 3858c9de560dSAlex Tomas * pa from inode's list may access already 3859c9de560dSAlex Tomas * freed memory, bad-bad-bad */ 3860c9de560dSAlex Tomas 3861c9de560dSAlex Tomas /* XXX: if this happens too often, we can 3862c9de560dSAlex Tomas * add a flag to force wait only in case 3863c9de560dSAlex Tomas * of ->clear_inode(), but not in case of 3864c9de560dSAlex Tomas * regular truncate */ 3865c9de560dSAlex Tomas schedule_timeout_uninterruptible(HZ); 3866c9de560dSAlex Tomas goto repeat; 3867c9de560dSAlex Tomas } 3868c9de560dSAlex Tomas spin_unlock(&ei->i_prealloc_lock); 3869c9de560dSAlex Tomas 3870c9de560dSAlex Tomas list_for_each_entry_safe(pa, tmp, &list, u.pa_tmp_list) { 3871c9de560dSAlex Tomas BUG_ON(pa->pa_linear != 0); 3872c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, NULL); 3873c9de560dSAlex Tomas 3874c9de560dSAlex Tomas err = ext4_mb_load_buddy(sb, group, &e4b); 3875ce89f46cSAneesh Kumar K.V if (err) { 3876ce89f46cSAneesh Kumar K.V ext4_error(sb, __func__, "Error in loading buddy " 3877ce89f46cSAneesh Kumar K.V "information for %lu\n", group); 3878ce89f46cSAneesh Kumar K.V continue; 3879ce89f46cSAneesh Kumar K.V } 3880c9de560dSAlex Tomas 3881574ca174STheodore Ts'o bitmap_bh = ext4_read_block_bitmap(sb, group); 3882c9de560dSAlex Tomas if (bitmap_bh == NULL) { 3883ce89f46cSAneesh Kumar K.V ext4_error(sb, __func__, "Error in reading block " 3884ce89f46cSAneesh Kumar K.V "bitmap for %lu\n", group); 3885c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 3886ce89f46cSAneesh Kumar K.V continue; 3887c9de560dSAlex Tomas } 3888c9de560dSAlex Tomas 3889c9de560dSAlex Tomas ext4_lock_group(sb, group); 3890c9de560dSAlex Tomas list_del(&pa->pa_group_list); 3891c83617dbSAneesh Kumar K.V ext4_mb_release_inode_pa(&e4b, bitmap_bh, pa, ac); 3892c9de560dSAlex Tomas ext4_unlock_group(sb, group); 3893c9de560dSAlex Tomas 3894c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 3895c9de560dSAlex Tomas put_bh(bitmap_bh); 3896c9de560dSAlex Tomas 3897c9de560dSAlex Tomas list_del(&pa->u.pa_tmp_list); 3898c9de560dSAlex Tomas call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); 3899c9de560dSAlex Tomas } 3900c83617dbSAneesh Kumar K.V if (ac) 3901c83617dbSAneesh Kumar K.V kmem_cache_free(ext4_ac_cachep, ac); 3902c9de560dSAlex Tomas } 3903c9de560dSAlex Tomas 3904c9de560dSAlex Tomas /* 3905c9de560dSAlex Tomas * finds all preallocated spaces and return blocks being freed to them 3906c9de560dSAlex Tomas * if preallocated space becomes full (no block is used from the space) 3907c9de560dSAlex Tomas * then the function frees space in buddy 3908c9de560dSAlex Tomas * XXX: at the moment, truncate (which is the only way to free blocks) 3909c9de560dSAlex Tomas * discards all preallocations 3910c9de560dSAlex Tomas */ 3911c9de560dSAlex Tomas static void ext4_mb_return_to_preallocation(struct inode *inode, 3912c9de560dSAlex Tomas struct ext4_buddy *e4b, 3913c9de560dSAlex Tomas sector_t block, int count) 3914c9de560dSAlex Tomas { 3915c9de560dSAlex Tomas BUG_ON(!list_empty(&EXT4_I(inode)->i_prealloc_list)); 3916c9de560dSAlex Tomas } 3917c9de560dSAlex Tomas #ifdef MB_DEBUG 3918c9de560dSAlex Tomas static void ext4_mb_show_ac(struct ext4_allocation_context *ac) 3919c9de560dSAlex Tomas { 3920c9de560dSAlex Tomas struct super_block *sb = ac->ac_sb; 3921c9de560dSAlex Tomas ext4_group_t i; 3922c9de560dSAlex Tomas 3923c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: Can't allocate:" 3924c9de560dSAlex Tomas " Allocation context details:\n"); 3925c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: status %d flags %d\n", 3926c9de560dSAlex Tomas ac->ac_status, ac->ac_flags); 3927c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: orig %lu/%lu/%lu@%lu, goal %lu/%lu/%lu@%lu, " 3928c9de560dSAlex Tomas "best %lu/%lu/%lu@%lu cr %d\n", 3929c9de560dSAlex Tomas (unsigned long)ac->ac_o_ex.fe_group, 3930c9de560dSAlex Tomas (unsigned long)ac->ac_o_ex.fe_start, 3931c9de560dSAlex Tomas (unsigned long)ac->ac_o_ex.fe_len, 3932c9de560dSAlex Tomas (unsigned long)ac->ac_o_ex.fe_logical, 3933c9de560dSAlex Tomas (unsigned long)ac->ac_g_ex.fe_group, 3934c9de560dSAlex Tomas (unsigned long)ac->ac_g_ex.fe_start, 3935c9de560dSAlex Tomas (unsigned long)ac->ac_g_ex.fe_len, 3936c9de560dSAlex Tomas (unsigned long)ac->ac_g_ex.fe_logical, 3937c9de560dSAlex Tomas (unsigned long)ac->ac_b_ex.fe_group, 3938c9de560dSAlex Tomas (unsigned long)ac->ac_b_ex.fe_start, 3939c9de560dSAlex Tomas (unsigned long)ac->ac_b_ex.fe_len, 3940c9de560dSAlex Tomas (unsigned long)ac->ac_b_ex.fe_logical, 3941c9de560dSAlex Tomas (int)ac->ac_criteria); 3942c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: %lu scanned, %d found\n", ac->ac_ex_scanned, 3943c9de560dSAlex Tomas ac->ac_found); 3944c9de560dSAlex Tomas printk(KERN_ERR "EXT4-fs: groups: \n"); 3945c9de560dSAlex Tomas for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) { 3946c9de560dSAlex Tomas struct ext4_group_info *grp = ext4_get_group_info(sb, i); 3947c9de560dSAlex Tomas struct ext4_prealloc_space *pa; 3948c9de560dSAlex Tomas ext4_grpblk_t start; 3949c9de560dSAlex Tomas struct list_head *cur; 3950c9de560dSAlex Tomas ext4_lock_group(sb, i); 3951c9de560dSAlex Tomas list_for_each(cur, &grp->bb_prealloc_list) { 3952c9de560dSAlex Tomas pa = list_entry(cur, struct ext4_prealloc_space, 3953c9de560dSAlex Tomas pa_group_list); 3954c9de560dSAlex Tomas spin_lock(&pa->pa_lock); 3955c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, pa->pa_pstart, 3956c9de560dSAlex Tomas NULL, &start); 3957c9de560dSAlex Tomas spin_unlock(&pa->pa_lock); 3958c9de560dSAlex Tomas printk(KERN_ERR "PA:%lu:%d:%u \n", i, 3959c9de560dSAlex Tomas start, pa->pa_len); 3960c9de560dSAlex Tomas } 396160bd63d1SSolofo Ramangalahy ext4_unlock_group(sb, i); 3962c9de560dSAlex Tomas 3963c9de560dSAlex Tomas if (grp->bb_free == 0) 3964c9de560dSAlex Tomas continue; 3965c9de560dSAlex Tomas printk(KERN_ERR "%lu: %d/%d \n", 3966c9de560dSAlex Tomas i, grp->bb_free, grp->bb_fragments); 3967c9de560dSAlex Tomas } 3968c9de560dSAlex Tomas printk(KERN_ERR "\n"); 3969c9de560dSAlex Tomas } 3970c9de560dSAlex Tomas #else 3971c9de560dSAlex Tomas static inline void ext4_mb_show_ac(struct ext4_allocation_context *ac) 3972c9de560dSAlex Tomas { 3973c9de560dSAlex Tomas return; 3974c9de560dSAlex Tomas } 3975c9de560dSAlex Tomas #endif 3976c9de560dSAlex Tomas 3977c9de560dSAlex Tomas /* 3978c9de560dSAlex Tomas * We use locality group preallocation for small size file. The size of the 3979c9de560dSAlex Tomas * file is determined by the current size or the resulting size after 3980c9de560dSAlex Tomas * allocation which ever is larger 3981c9de560dSAlex Tomas * 3982c9de560dSAlex Tomas * One can tune this size via /proc/fs/ext4/<partition>/stream_req 3983c9de560dSAlex Tomas */ 3984c9de560dSAlex Tomas static void ext4_mb_group_or_file(struct ext4_allocation_context *ac) 3985c9de560dSAlex Tomas { 3986c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(ac->ac_sb); 3987c9de560dSAlex Tomas int bsbits = ac->ac_sb->s_blocksize_bits; 3988c9de560dSAlex Tomas loff_t size, isize; 3989c9de560dSAlex Tomas 3990c9de560dSAlex Tomas if (!(ac->ac_flags & EXT4_MB_HINT_DATA)) 3991c9de560dSAlex Tomas return; 3992c9de560dSAlex Tomas 3993c9de560dSAlex Tomas size = ac->ac_o_ex.fe_logical + ac->ac_o_ex.fe_len; 3994c9de560dSAlex Tomas isize = i_size_read(ac->ac_inode) >> bsbits; 3995c9de560dSAlex Tomas size = max(size, isize); 3996c9de560dSAlex Tomas 3997c9de560dSAlex Tomas /* don't use group allocation for large files */ 3998c9de560dSAlex Tomas if (size >= sbi->s_mb_stream_request) 3999c9de560dSAlex Tomas return; 4000c9de560dSAlex Tomas 4001c9de560dSAlex Tomas if (unlikely(ac->ac_flags & EXT4_MB_HINT_GOAL_ONLY)) 4002c9de560dSAlex Tomas return; 4003c9de560dSAlex Tomas 4004c9de560dSAlex Tomas BUG_ON(ac->ac_lg != NULL); 4005c9de560dSAlex Tomas /* 4006c9de560dSAlex Tomas * locality group prealloc space are per cpu. The reason for having 4007c9de560dSAlex Tomas * per cpu locality group is to reduce the contention between block 4008c9de560dSAlex Tomas * request from multiple CPUs. 4009c9de560dSAlex Tomas */ 4010730c213cSEric Sandeen ac->ac_lg = per_cpu_ptr(sbi->s_locality_groups, raw_smp_processor_id()); 4011c9de560dSAlex Tomas 4012c9de560dSAlex Tomas /* we're going to use group allocation */ 4013c9de560dSAlex Tomas ac->ac_flags |= EXT4_MB_HINT_GROUP_ALLOC; 4014c9de560dSAlex Tomas 4015c9de560dSAlex Tomas /* serialize all allocations in the group */ 4016c9de560dSAlex Tomas mutex_lock(&ac->ac_lg->lg_mutex); 4017c9de560dSAlex Tomas } 4018c9de560dSAlex Tomas 40194ddfef7bSEric Sandeen static noinline_for_stack int 40204ddfef7bSEric Sandeen ext4_mb_initialize_context(struct ext4_allocation_context *ac, 4021c9de560dSAlex Tomas struct ext4_allocation_request *ar) 4022c9de560dSAlex Tomas { 4023c9de560dSAlex Tomas struct super_block *sb = ar->inode->i_sb; 4024c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 4025c9de560dSAlex Tomas struct ext4_super_block *es = sbi->s_es; 4026c9de560dSAlex Tomas ext4_group_t group; 4027c9de560dSAlex Tomas unsigned long len; 4028c9de560dSAlex Tomas unsigned long goal; 4029c9de560dSAlex Tomas ext4_grpblk_t block; 4030c9de560dSAlex Tomas 4031c9de560dSAlex Tomas /* we can't allocate > group size */ 4032c9de560dSAlex Tomas len = ar->len; 4033c9de560dSAlex Tomas 4034c9de560dSAlex Tomas /* just a dirty hack to filter too big requests */ 4035c9de560dSAlex Tomas if (len >= EXT4_BLOCKS_PER_GROUP(sb) - 10) 4036c9de560dSAlex Tomas len = EXT4_BLOCKS_PER_GROUP(sb) - 10; 4037c9de560dSAlex Tomas 4038c9de560dSAlex Tomas /* start searching from the goal */ 4039c9de560dSAlex Tomas goal = ar->goal; 4040c9de560dSAlex Tomas if (goal < le32_to_cpu(es->s_first_data_block) || 4041c9de560dSAlex Tomas goal >= ext4_blocks_count(es)) 4042c9de560dSAlex Tomas goal = le32_to_cpu(es->s_first_data_block); 4043c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, goal, &group, &block); 4044c9de560dSAlex Tomas 4045c9de560dSAlex Tomas /* set up allocation goals */ 4046c9de560dSAlex Tomas ac->ac_b_ex.fe_logical = ar->logical; 4047c9de560dSAlex Tomas ac->ac_b_ex.fe_group = 0; 4048c9de560dSAlex Tomas ac->ac_b_ex.fe_start = 0; 4049c9de560dSAlex Tomas ac->ac_b_ex.fe_len = 0; 4050c9de560dSAlex Tomas ac->ac_status = AC_STATUS_CONTINUE; 4051c9de560dSAlex Tomas ac->ac_groups_scanned = 0; 4052c9de560dSAlex Tomas ac->ac_ex_scanned = 0; 4053c9de560dSAlex Tomas ac->ac_found = 0; 4054c9de560dSAlex Tomas ac->ac_sb = sb; 4055c9de560dSAlex Tomas ac->ac_inode = ar->inode; 4056c9de560dSAlex Tomas ac->ac_o_ex.fe_logical = ar->logical; 4057c9de560dSAlex Tomas ac->ac_o_ex.fe_group = group; 4058c9de560dSAlex Tomas ac->ac_o_ex.fe_start = block; 4059c9de560dSAlex Tomas ac->ac_o_ex.fe_len = len; 4060c9de560dSAlex Tomas ac->ac_g_ex.fe_logical = ar->logical; 4061c9de560dSAlex Tomas ac->ac_g_ex.fe_group = group; 4062c9de560dSAlex Tomas ac->ac_g_ex.fe_start = block; 4063c9de560dSAlex Tomas ac->ac_g_ex.fe_len = len; 4064c9de560dSAlex Tomas ac->ac_f_ex.fe_len = 0; 4065c9de560dSAlex Tomas ac->ac_flags = ar->flags; 4066c9de560dSAlex Tomas ac->ac_2order = 0; 4067c9de560dSAlex Tomas ac->ac_criteria = 0; 4068c9de560dSAlex Tomas ac->ac_pa = NULL; 4069c9de560dSAlex Tomas ac->ac_bitmap_page = NULL; 4070c9de560dSAlex Tomas ac->ac_buddy_page = NULL; 4071c9de560dSAlex Tomas ac->ac_lg = NULL; 4072c9de560dSAlex Tomas 4073c9de560dSAlex Tomas /* we have to define context: we'll we work with a file or 4074c9de560dSAlex Tomas * locality group. this is a policy, actually */ 4075c9de560dSAlex Tomas ext4_mb_group_or_file(ac); 4076c9de560dSAlex Tomas 4077c9de560dSAlex Tomas mb_debug("init ac: %u blocks @ %u, goal %u, flags %x, 2^%d, " 4078c9de560dSAlex Tomas "left: %u/%u, right %u/%u to %swritable\n", 4079c9de560dSAlex Tomas (unsigned) ar->len, (unsigned) ar->logical, 4080c9de560dSAlex Tomas (unsigned) ar->goal, ac->ac_flags, ac->ac_2order, 4081c9de560dSAlex Tomas (unsigned) ar->lleft, (unsigned) ar->pleft, 4082c9de560dSAlex Tomas (unsigned) ar->lright, (unsigned) ar->pright, 4083c9de560dSAlex Tomas atomic_read(&ar->inode->i_writecount) ? "" : "non-"); 4084c9de560dSAlex Tomas return 0; 4085c9de560dSAlex Tomas 4086c9de560dSAlex Tomas } 4087c9de560dSAlex Tomas 40886be2ded1SAneesh Kumar K.V static noinline_for_stack void 40896be2ded1SAneesh Kumar K.V ext4_mb_discard_lg_preallocations(struct super_block *sb, 40906be2ded1SAneesh Kumar K.V struct ext4_locality_group *lg, 40916be2ded1SAneesh Kumar K.V int order, int total_entries) 40926be2ded1SAneesh Kumar K.V { 40936be2ded1SAneesh Kumar K.V ext4_group_t group = 0; 40946be2ded1SAneesh Kumar K.V struct ext4_buddy e4b; 40956be2ded1SAneesh Kumar K.V struct list_head discard_list; 40966be2ded1SAneesh Kumar K.V struct ext4_prealloc_space *pa, *tmp; 40976be2ded1SAneesh Kumar K.V struct ext4_allocation_context *ac; 40986be2ded1SAneesh Kumar K.V 40996be2ded1SAneesh Kumar K.V mb_debug("discard locality group preallocation\n"); 41006be2ded1SAneesh Kumar K.V 41016be2ded1SAneesh Kumar K.V INIT_LIST_HEAD(&discard_list); 41026be2ded1SAneesh Kumar K.V ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); 41036be2ded1SAneesh Kumar K.V 41046be2ded1SAneesh Kumar K.V spin_lock(&lg->lg_prealloc_lock); 41056be2ded1SAneesh Kumar K.V list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[order], 41066be2ded1SAneesh Kumar K.V pa_inode_list) { 41076be2ded1SAneesh Kumar K.V spin_lock(&pa->pa_lock); 41086be2ded1SAneesh Kumar K.V if (atomic_read(&pa->pa_count)) { 41096be2ded1SAneesh Kumar K.V /* 41106be2ded1SAneesh Kumar K.V * This is the pa that we just used 41116be2ded1SAneesh Kumar K.V * for block allocation. So don't 41126be2ded1SAneesh Kumar K.V * free that 41136be2ded1SAneesh Kumar K.V */ 41146be2ded1SAneesh Kumar K.V spin_unlock(&pa->pa_lock); 41156be2ded1SAneesh Kumar K.V continue; 41166be2ded1SAneesh Kumar K.V } 41176be2ded1SAneesh Kumar K.V if (pa->pa_deleted) { 41186be2ded1SAneesh Kumar K.V spin_unlock(&pa->pa_lock); 41196be2ded1SAneesh Kumar K.V continue; 41206be2ded1SAneesh Kumar K.V } 41216be2ded1SAneesh Kumar K.V /* only lg prealloc space */ 41226be2ded1SAneesh Kumar K.V BUG_ON(!pa->pa_linear); 41236be2ded1SAneesh Kumar K.V 41246be2ded1SAneesh Kumar K.V /* seems this one can be freed ... */ 41256be2ded1SAneesh Kumar K.V pa->pa_deleted = 1; 41266be2ded1SAneesh Kumar K.V spin_unlock(&pa->pa_lock); 41276be2ded1SAneesh Kumar K.V 41286be2ded1SAneesh Kumar K.V list_del_rcu(&pa->pa_inode_list); 41296be2ded1SAneesh Kumar K.V list_add(&pa->u.pa_tmp_list, &discard_list); 41306be2ded1SAneesh Kumar K.V 41316be2ded1SAneesh Kumar K.V total_entries--; 41326be2ded1SAneesh Kumar K.V if (total_entries <= 5) { 41336be2ded1SAneesh Kumar K.V /* 41346be2ded1SAneesh Kumar K.V * we want to keep only 5 entries 41356be2ded1SAneesh Kumar K.V * allowing it to grow to 8. This 41366be2ded1SAneesh Kumar K.V * mak sure we don't call discard 41376be2ded1SAneesh Kumar K.V * soon for this list. 41386be2ded1SAneesh Kumar K.V */ 41396be2ded1SAneesh Kumar K.V break; 41406be2ded1SAneesh Kumar K.V } 41416be2ded1SAneesh Kumar K.V } 41426be2ded1SAneesh Kumar K.V spin_unlock(&lg->lg_prealloc_lock); 41436be2ded1SAneesh Kumar K.V 41446be2ded1SAneesh Kumar K.V list_for_each_entry_safe(pa, tmp, &discard_list, u.pa_tmp_list) { 41456be2ded1SAneesh Kumar K.V 41466be2ded1SAneesh Kumar K.V ext4_get_group_no_and_offset(sb, pa->pa_pstart, &group, NULL); 41476be2ded1SAneesh Kumar K.V if (ext4_mb_load_buddy(sb, group, &e4b)) { 41486be2ded1SAneesh Kumar K.V ext4_error(sb, __func__, "Error in loading buddy " 41496be2ded1SAneesh Kumar K.V "information for %lu\n", group); 41506be2ded1SAneesh Kumar K.V continue; 41516be2ded1SAneesh Kumar K.V } 41526be2ded1SAneesh Kumar K.V ext4_lock_group(sb, group); 41536be2ded1SAneesh Kumar K.V list_del(&pa->pa_group_list); 41546be2ded1SAneesh Kumar K.V ext4_mb_release_group_pa(&e4b, pa, ac); 41556be2ded1SAneesh Kumar K.V ext4_unlock_group(sb, group); 41566be2ded1SAneesh Kumar K.V 41576be2ded1SAneesh Kumar K.V ext4_mb_release_desc(&e4b); 41586be2ded1SAneesh Kumar K.V list_del(&pa->u.pa_tmp_list); 41596be2ded1SAneesh Kumar K.V call_rcu(&(pa)->u.pa_rcu, ext4_mb_pa_callback); 41606be2ded1SAneesh Kumar K.V } 41616be2ded1SAneesh Kumar K.V if (ac) 41626be2ded1SAneesh Kumar K.V kmem_cache_free(ext4_ac_cachep, ac); 41636be2ded1SAneesh Kumar K.V } 41646be2ded1SAneesh Kumar K.V 41656be2ded1SAneesh Kumar K.V /* 41666be2ded1SAneesh Kumar K.V * We have incremented pa_count. So it cannot be freed at this 41676be2ded1SAneesh Kumar K.V * point. Also we hold lg_mutex. So no parallel allocation is 41686be2ded1SAneesh Kumar K.V * possible from this lg. That means pa_free cannot be updated. 41696be2ded1SAneesh Kumar K.V * 41706be2ded1SAneesh Kumar K.V * A parallel ext4_mb_discard_group_preallocations is possible. 41716be2ded1SAneesh Kumar K.V * which can cause the lg_prealloc_list to be updated. 41726be2ded1SAneesh Kumar K.V */ 41736be2ded1SAneesh Kumar K.V 41746be2ded1SAneesh Kumar K.V static void ext4_mb_add_n_trim(struct ext4_allocation_context *ac) 41756be2ded1SAneesh Kumar K.V { 41766be2ded1SAneesh Kumar K.V int order, added = 0, lg_prealloc_count = 1; 41776be2ded1SAneesh Kumar K.V struct super_block *sb = ac->ac_sb; 41786be2ded1SAneesh Kumar K.V struct ext4_locality_group *lg = ac->ac_lg; 41796be2ded1SAneesh Kumar K.V struct ext4_prealloc_space *tmp_pa, *pa = ac->ac_pa; 41806be2ded1SAneesh Kumar K.V 41816be2ded1SAneesh Kumar K.V order = fls(pa->pa_free) - 1; 41826be2ded1SAneesh Kumar K.V if (order > PREALLOC_TB_SIZE - 1) 41836be2ded1SAneesh Kumar K.V /* The max size of hash table is PREALLOC_TB_SIZE */ 41846be2ded1SAneesh Kumar K.V order = PREALLOC_TB_SIZE - 1; 41856be2ded1SAneesh Kumar K.V /* Add the prealloc space to lg */ 41866be2ded1SAneesh Kumar K.V rcu_read_lock(); 41876be2ded1SAneesh Kumar K.V list_for_each_entry_rcu(tmp_pa, &lg->lg_prealloc_list[order], 41886be2ded1SAneesh Kumar K.V pa_inode_list) { 41896be2ded1SAneesh Kumar K.V spin_lock(&tmp_pa->pa_lock); 41906be2ded1SAneesh Kumar K.V if (tmp_pa->pa_deleted) { 41916be2ded1SAneesh Kumar K.V spin_unlock(&pa->pa_lock); 41926be2ded1SAneesh Kumar K.V continue; 41936be2ded1SAneesh Kumar K.V } 41946be2ded1SAneesh Kumar K.V if (!added && pa->pa_free < tmp_pa->pa_free) { 41956be2ded1SAneesh Kumar K.V /* Add to the tail of the previous entry */ 41966be2ded1SAneesh Kumar K.V list_add_tail_rcu(&pa->pa_inode_list, 41976be2ded1SAneesh Kumar K.V &tmp_pa->pa_inode_list); 41986be2ded1SAneesh Kumar K.V added = 1; 41996be2ded1SAneesh Kumar K.V /* 42006be2ded1SAneesh Kumar K.V * we want to count the total 42016be2ded1SAneesh Kumar K.V * number of entries in the list 42026be2ded1SAneesh Kumar K.V */ 42036be2ded1SAneesh Kumar K.V } 42046be2ded1SAneesh Kumar K.V spin_unlock(&tmp_pa->pa_lock); 42056be2ded1SAneesh Kumar K.V lg_prealloc_count++; 42066be2ded1SAneesh Kumar K.V } 42076be2ded1SAneesh Kumar K.V if (!added) 42086be2ded1SAneesh Kumar K.V list_add_tail_rcu(&pa->pa_inode_list, 42096be2ded1SAneesh Kumar K.V &lg->lg_prealloc_list[order]); 42106be2ded1SAneesh Kumar K.V rcu_read_unlock(); 42116be2ded1SAneesh Kumar K.V 42126be2ded1SAneesh Kumar K.V /* Now trim the list to be not more than 8 elements */ 42136be2ded1SAneesh Kumar K.V if (lg_prealloc_count > 8) { 42146be2ded1SAneesh Kumar K.V ext4_mb_discard_lg_preallocations(sb, lg, 42156be2ded1SAneesh Kumar K.V order, lg_prealloc_count); 42166be2ded1SAneesh Kumar K.V return; 42176be2ded1SAneesh Kumar K.V } 42186be2ded1SAneesh Kumar K.V return ; 42196be2ded1SAneesh Kumar K.V } 42206be2ded1SAneesh Kumar K.V 4221c9de560dSAlex Tomas /* 4222c9de560dSAlex Tomas * release all resource we used in allocation 4223c9de560dSAlex Tomas */ 4224c9de560dSAlex Tomas static int ext4_mb_release_context(struct ext4_allocation_context *ac) 4225c9de560dSAlex Tomas { 42266be2ded1SAneesh Kumar K.V struct ext4_prealloc_space *pa = ac->ac_pa; 42276be2ded1SAneesh Kumar K.V if (pa) { 42286be2ded1SAneesh Kumar K.V if (pa->pa_linear) { 4229c9de560dSAlex Tomas /* see comment in ext4_mb_use_group_pa() */ 42306be2ded1SAneesh Kumar K.V spin_lock(&pa->pa_lock); 42316be2ded1SAneesh Kumar K.V pa->pa_pstart += ac->ac_b_ex.fe_len; 42326be2ded1SAneesh Kumar K.V pa->pa_lstart += ac->ac_b_ex.fe_len; 42336be2ded1SAneesh Kumar K.V pa->pa_free -= ac->ac_b_ex.fe_len; 42346be2ded1SAneesh Kumar K.V pa->pa_len -= ac->ac_b_ex.fe_len; 42356be2ded1SAneesh Kumar K.V spin_unlock(&pa->pa_lock); 42366be2ded1SAneesh Kumar K.V /* 42376be2ded1SAneesh Kumar K.V * We want to add the pa to the right bucket. 42386be2ded1SAneesh Kumar K.V * Remove it from the list and while adding 42396be2ded1SAneesh Kumar K.V * make sure the list to which we are adding 42406be2ded1SAneesh Kumar K.V * doesn't grow big. 42416be2ded1SAneesh Kumar K.V */ 42426be2ded1SAneesh Kumar K.V if (likely(pa->pa_free)) { 42436be2ded1SAneesh Kumar K.V spin_lock(pa->pa_obj_lock); 42446be2ded1SAneesh Kumar K.V list_del_rcu(&pa->pa_inode_list); 42456be2ded1SAneesh Kumar K.V spin_unlock(pa->pa_obj_lock); 42466be2ded1SAneesh Kumar K.V ext4_mb_add_n_trim(ac); 4247c9de560dSAlex Tomas } 42486be2ded1SAneesh Kumar K.V } 42496be2ded1SAneesh Kumar K.V ext4_mb_put_pa(ac, ac->ac_sb, pa); 4250c9de560dSAlex Tomas } 4251c9de560dSAlex Tomas if (ac->ac_bitmap_page) 4252c9de560dSAlex Tomas page_cache_release(ac->ac_bitmap_page); 4253c9de560dSAlex Tomas if (ac->ac_buddy_page) 4254c9de560dSAlex Tomas page_cache_release(ac->ac_buddy_page); 4255c9de560dSAlex Tomas if (ac->ac_flags & EXT4_MB_HINT_GROUP_ALLOC) 4256c9de560dSAlex Tomas mutex_unlock(&ac->ac_lg->lg_mutex); 4257c9de560dSAlex Tomas ext4_mb_collect_stats(ac); 4258c9de560dSAlex Tomas return 0; 4259c9de560dSAlex Tomas } 4260c9de560dSAlex Tomas 4261c9de560dSAlex Tomas static int ext4_mb_discard_preallocations(struct super_block *sb, int needed) 4262c9de560dSAlex Tomas { 4263c9de560dSAlex Tomas ext4_group_t i; 4264c9de560dSAlex Tomas int ret; 4265c9de560dSAlex Tomas int freed = 0; 4266c9de560dSAlex Tomas 4267c9de560dSAlex Tomas for (i = 0; i < EXT4_SB(sb)->s_groups_count && needed > 0; i++) { 4268c9de560dSAlex Tomas ret = ext4_mb_discard_group_preallocations(sb, i, needed); 4269c9de560dSAlex Tomas freed += ret; 4270c9de560dSAlex Tomas needed -= ret; 4271c9de560dSAlex Tomas } 4272c9de560dSAlex Tomas 4273c9de560dSAlex Tomas return freed; 4274c9de560dSAlex Tomas } 4275c9de560dSAlex Tomas 4276c9de560dSAlex Tomas /* 4277c9de560dSAlex Tomas * Main entry point into mballoc to allocate blocks 4278c9de560dSAlex Tomas * it tries to use preallocation first, then falls back 4279c9de560dSAlex Tomas * to usual allocation 4280c9de560dSAlex Tomas */ 4281c9de560dSAlex Tomas ext4_fsblk_t ext4_mb_new_blocks(handle_t *handle, 4282c9de560dSAlex Tomas struct ext4_allocation_request *ar, int *errp) 4283c9de560dSAlex Tomas { 42846bc6e63fSAneesh Kumar K.V int freed; 4285256bdb49SEric Sandeen struct ext4_allocation_context *ac = NULL; 4286c9de560dSAlex Tomas struct ext4_sb_info *sbi; 4287c9de560dSAlex Tomas struct super_block *sb; 4288c9de560dSAlex Tomas ext4_fsblk_t block = 0; 42896bc6e63fSAneesh Kumar K.V unsigned long inquota; 42906bc6e63fSAneesh Kumar K.V unsigned long reserv_blks = 0; 4291c9de560dSAlex Tomas 4292c9de560dSAlex Tomas sb = ar->inode->i_sb; 4293c9de560dSAlex Tomas sbi = EXT4_SB(sb); 4294c9de560dSAlex Tomas 4295d2a17637SMingming Cao if (!EXT4_I(ar->inode)->i_delalloc_reserved_flag) { 4296d2a17637SMingming Cao /* 4297d2a17637SMingming Cao * With delalloc we already reserved the blocks 4298d2a17637SMingming Cao */ 4299030ba6bcSAneesh Kumar K.V while (ar->len && ext4_claim_free_blocks(sbi, ar->len)) { 4300030ba6bcSAneesh Kumar K.V /* let others to free the space */ 4301030ba6bcSAneesh Kumar K.V yield(); 4302030ba6bcSAneesh Kumar K.V ar->len = ar->len >> 1; 4303030ba6bcSAneesh Kumar K.V } 4304030ba6bcSAneesh Kumar K.V if (!ar->len) { 430507031431SMingming Cao *errp = -ENOSPC; 430607031431SMingming Cao return 0; 430707031431SMingming Cao } 43086bc6e63fSAneesh Kumar K.V reserv_blks = ar->len; 4309a30d542aSAneesh Kumar K.V } 4310c9de560dSAlex Tomas while (ar->len && DQUOT_ALLOC_BLOCK(ar->inode, ar->len)) { 4311c9de560dSAlex Tomas ar->flags |= EXT4_MB_HINT_NOPREALLOC; 4312c9de560dSAlex Tomas ar->len--; 4313c9de560dSAlex Tomas } 4314c9de560dSAlex Tomas if (ar->len == 0) { 4315c9de560dSAlex Tomas *errp = -EDQUOT; 4316c9de560dSAlex Tomas return 0; 4317c9de560dSAlex Tomas } 4318c9de560dSAlex Tomas inquota = ar->len; 4319c9de560dSAlex Tomas 4320d2a17637SMingming Cao if (EXT4_I(ar->inode)->i_delalloc_reserved_flag) 4321d2a17637SMingming Cao ar->flags |= EXT4_MB_DELALLOC_RESERVED; 4322d2a17637SMingming Cao 4323256bdb49SEric Sandeen ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); 4324256bdb49SEric Sandeen if (!ac) { 4325363d4251SShen Feng ar->len = 0; 4326256bdb49SEric Sandeen *errp = -ENOMEM; 4327363d4251SShen Feng goto out1; 4328256bdb49SEric Sandeen } 4329256bdb49SEric Sandeen 4330256bdb49SEric Sandeen *errp = ext4_mb_initialize_context(ac, ar); 4331c9de560dSAlex Tomas if (*errp) { 4332c9de560dSAlex Tomas ar->len = 0; 4333363d4251SShen Feng goto out2; 4334c9de560dSAlex Tomas } 4335c9de560dSAlex Tomas 4336256bdb49SEric Sandeen ac->ac_op = EXT4_MB_HISTORY_PREALLOC; 4337256bdb49SEric Sandeen if (!ext4_mb_use_preallocated(ac)) { 4338256bdb49SEric Sandeen ac->ac_op = EXT4_MB_HISTORY_ALLOC; 4339256bdb49SEric Sandeen ext4_mb_normalize_request(ac, ar); 4340c9de560dSAlex Tomas repeat: 4341c9de560dSAlex Tomas /* allocate space in core */ 4342256bdb49SEric Sandeen ext4_mb_regular_allocator(ac); 4343c9de560dSAlex Tomas 4344c9de560dSAlex Tomas /* as we've just preallocated more space than 4345c9de560dSAlex Tomas * user requested orinally, we store allocated 4346c9de560dSAlex Tomas * space in a special descriptor */ 4347256bdb49SEric Sandeen if (ac->ac_status == AC_STATUS_FOUND && 4348256bdb49SEric Sandeen ac->ac_o_ex.fe_len < ac->ac_b_ex.fe_len) 4349256bdb49SEric Sandeen ext4_mb_new_preallocation(ac); 4350c9de560dSAlex Tomas } 4351c9de560dSAlex Tomas 4352256bdb49SEric Sandeen if (likely(ac->ac_status == AC_STATUS_FOUND)) { 43536bc6e63fSAneesh Kumar K.V *errp = ext4_mb_mark_diskspace_used(ac, handle, reserv_blks); 4354519deca0SAneesh Kumar K.V if (*errp == -EAGAIN) { 4355519deca0SAneesh Kumar K.V ac->ac_b_ex.fe_group = 0; 4356519deca0SAneesh Kumar K.V ac->ac_b_ex.fe_start = 0; 4357519deca0SAneesh Kumar K.V ac->ac_b_ex.fe_len = 0; 4358519deca0SAneesh Kumar K.V ac->ac_status = AC_STATUS_CONTINUE; 4359519deca0SAneesh Kumar K.V goto repeat; 4360519deca0SAneesh Kumar K.V } else if (*errp) { 4361519deca0SAneesh Kumar K.V ac->ac_b_ex.fe_len = 0; 4362519deca0SAneesh Kumar K.V ar->len = 0; 4363519deca0SAneesh Kumar K.V ext4_mb_show_ac(ac); 4364519deca0SAneesh Kumar K.V } else { 4365256bdb49SEric Sandeen block = ext4_grp_offs_to_block(sb, &ac->ac_b_ex); 4366256bdb49SEric Sandeen ar->len = ac->ac_b_ex.fe_len; 4367519deca0SAneesh Kumar K.V } 4368c9de560dSAlex Tomas } else { 4369256bdb49SEric Sandeen freed = ext4_mb_discard_preallocations(sb, ac->ac_o_ex.fe_len); 4370c9de560dSAlex Tomas if (freed) 4371c9de560dSAlex Tomas goto repeat; 4372c9de560dSAlex Tomas *errp = -ENOSPC; 4373256bdb49SEric Sandeen ac->ac_b_ex.fe_len = 0; 4374c9de560dSAlex Tomas ar->len = 0; 4375256bdb49SEric Sandeen ext4_mb_show_ac(ac); 4376c9de560dSAlex Tomas } 4377c9de560dSAlex Tomas 4378256bdb49SEric Sandeen ext4_mb_release_context(ac); 4379c9de560dSAlex Tomas 4380363d4251SShen Feng out2: 4381363d4251SShen Feng kmem_cache_free(ext4_ac_cachep, ac); 4382363d4251SShen Feng out1: 4383c9de560dSAlex Tomas if (ar->len < inquota) 4384c9de560dSAlex Tomas DQUOT_FREE_BLOCK(ar->inode, inquota - ar->len); 4385c9de560dSAlex Tomas 4386c9de560dSAlex Tomas return block; 4387c9de560dSAlex Tomas } 4388c9de560dSAlex Tomas 4389c894058dSAneesh Kumar K.V /* 4390c894058dSAneesh Kumar K.V * We can merge two free data extents only if the physical blocks 4391c894058dSAneesh Kumar K.V * are contiguous, AND the extents were freed by the same transaction, 4392c894058dSAneesh Kumar K.V * AND the blocks are associated with the same group. 4393c894058dSAneesh Kumar K.V */ 4394c894058dSAneesh Kumar K.V static int can_merge(struct ext4_free_data *entry1, 4395c894058dSAneesh Kumar K.V struct ext4_free_data *entry2) 4396c894058dSAneesh Kumar K.V { 4397c894058dSAneesh Kumar K.V if ((entry1->t_tid == entry2->t_tid) && 4398c894058dSAneesh Kumar K.V (entry1->group == entry2->group) && 4399c894058dSAneesh Kumar K.V ((entry1->start_blk + entry1->count) == entry2->start_blk)) 4400c894058dSAneesh Kumar K.V return 1; 4401c894058dSAneesh Kumar K.V return 0; 4402c894058dSAneesh Kumar K.V } 4403c894058dSAneesh Kumar K.V 44044ddfef7bSEric Sandeen static noinline_for_stack int 44054ddfef7bSEric Sandeen ext4_mb_free_metadata(handle_t *handle, struct ext4_buddy *e4b, 4406c9de560dSAlex Tomas ext4_group_t group, ext4_grpblk_t block, int count) 4407c9de560dSAlex Tomas { 4408c9de560dSAlex Tomas struct ext4_group_info *db = e4b->bd_info; 4409c9de560dSAlex Tomas struct super_block *sb = e4b->bd_sb; 4410c9de560dSAlex Tomas struct ext4_sb_info *sbi = EXT4_SB(sb); 4411c894058dSAneesh Kumar K.V struct ext4_free_data *entry, *new_entry; 4412c894058dSAneesh Kumar K.V struct rb_node **n = &db->bb_free_root.rb_node, *node; 4413c894058dSAneesh Kumar K.V struct rb_node *parent = NULL, *new_node; 4414c894058dSAneesh Kumar K.V 4415c9de560dSAlex Tomas 4416c9de560dSAlex Tomas BUG_ON(e4b->bd_bitmap_page == NULL); 4417c9de560dSAlex Tomas BUG_ON(e4b->bd_buddy_page == NULL); 4418c9de560dSAlex Tomas 4419c894058dSAneesh Kumar K.V new_entry = kmem_cache_alloc(ext4_free_ext_cachep, GFP_NOFS); 4420c894058dSAneesh Kumar K.V new_entry->start_blk = block; 4421c894058dSAneesh Kumar K.V new_entry->group = group; 4422c894058dSAneesh Kumar K.V new_entry->count = count; 4423c894058dSAneesh Kumar K.V new_entry->t_tid = handle->h_transaction->t_tid; 4424c894058dSAneesh Kumar K.V new_node = &new_entry->node; 4425c9de560dSAlex Tomas 4426c9de560dSAlex Tomas ext4_lock_group(sb, group); 4427c894058dSAneesh Kumar K.V if (!*n) { 4428c894058dSAneesh Kumar K.V /* first free block exent. We need to 4429c894058dSAneesh Kumar K.V protect buddy cache from being freed, 4430c9de560dSAlex Tomas * otherwise we'll refresh it from 4431c9de560dSAlex Tomas * on-disk bitmap and lose not-yet-available 4432c9de560dSAlex Tomas * blocks */ 4433c9de560dSAlex Tomas page_cache_get(e4b->bd_buddy_page); 4434c9de560dSAlex Tomas page_cache_get(e4b->bd_bitmap_page); 4435c894058dSAneesh Kumar K.V } 4436c894058dSAneesh Kumar K.V while (*n) { 4437c894058dSAneesh Kumar K.V parent = *n; 4438c894058dSAneesh Kumar K.V entry = rb_entry(parent, struct ext4_free_data, node); 4439c894058dSAneesh Kumar K.V if (block < entry->start_blk) 4440c894058dSAneesh Kumar K.V n = &(*n)->rb_left; 4441c894058dSAneesh Kumar K.V else if (block >= (entry->start_blk + entry->count)) 4442c894058dSAneesh Kumar K.V n = &(*n)->rb_right; 4443c894058dSAneesh Kumar K.V else { 4444ae2d9fb1SAneesh Kumar K.V ext4_unlock_group(sb, group); 4445c894058dSAneesh Kumar K.V ext4_error(sb, __func__, 4446c894058dSAneesh Kumar K.V "Double free of blocks %d (%d %d)\n", 4447c894058dSAneesh Kumar K.V block, entry->start_blk, entry->count); 4448c894058dSAneesh Kumar K.V return 0; 4449c9de560dSAlex Tomas } 4450c9de560dSAlex Tomas } 4451c9de560dSAlex Tomas 4452c894058dSAneesh Kumar K.V rb_link_node(new_node, parent, n); 4453c894058dSAneesh Kumar K.V rb_insert_color(new_node, &db->bb_free_root); 4454c894058dSAneesh Kumar K.V 4455c894058dSAneesh Kumar K.V /* Now try to see the extent can be merged to left and right */ 4456c894058dSAneesh Kumar K.V node = rb_prev(new_node); 4457c894058dSAneesh Kumar K.V if (node) { 4458c894058dSAneesh Kumar K.V entry = rb_entry(node, struct ext4_free_data, node); 4459c894058dSAneesh Kumar K.V if (can_merge(entry, new_entry)) { 4460c894058dSAneesh Kumar K.V new_entry->start_blk = entry->start_blk; 4461c894058dSAneesh Kumar K.V new_entry->count += entry->count; 4462c894058dSAneesh Kumar K.V rb_erase(node, &(db->bb_free_root)); 4463c894058dSAneesh Kumar K.V spin_lock(&sbi->s_md_lock); 4464c894058dSAneesh Kumar K.V list_del(&entry->list); 4465c894058dSAneesh Kumar K.V spin_unlock(&sbi->s_md_lock); 4466c894058dSAneesh Kumar K.V kmem_cache_free(ext4_free_ext_cachep, entry); 4467c9de560dSAlex Tomas } 4468c9de560dSAlex Tomas } 4469c894058dSAneesh Kumar K.V 4470c894058dSAneesh Kumar K.V node = rb_next(new_node); 4471c894058dSAneesh Kumar K.V if (node) { 4472c894058dSAneesh Kumar K.V entry = rb_entry(node, struct ext4_free_data, node); 4473c894058dSAneesh Kumar K.V if (can_merge(new_entry, entry)) { 4474c894058dSAneesh Kumar K.V new_entry->count += entry->count; 4475c894058dSAneesh Kumar K.V rb_erase(node, &(db->bb_free_root)); 4476c894058dSAneesh Kumar K.V spin_lock(&sbi->s_md_lock); 4477c894058dSAneesh Kumar K.V list_del(&entry->list); 4478c894058dSAneesh Kumar K.V spin_unlock(&sbi->s_md_lock); 4479c894058dSAneesh Kumar K.V kmem_cache_free(ext4_free_ext_cachep, entry); 4480c894058dSAneesh Kumar K.V } 4481c894058dSAneesh Kumar K.V } 44823e624fc7STheodore Ts'o /* Add the extent to transaction's private list */ 4483c894058dSAneesh Kumar K.V spin_lock(&sbi->s_md_lock); 44843e624fc7STheodore Ts'o list_add(&new_entry->list, &handle->h_transaction->t_private_list); 4485c894058dSAneesh Kumar K.V spin_unlock(&sbi->s_md_lock); 4486c9de560dSAlex Tomas ext4_unlock_group(sb, group); 4487c9de560dSAlex Tomas return 0; 4488c9de560dSAlex Tomas } 4489c9de560dSAlex Tomas 4490c9de560dSAlex Tomas /* 4491c9de560dSAlex Tomas * Main entry point into mballoc to free blocks 4492c9de560dSAlex Tomas */ 4493c9de560dSAlex Tomas void ext4_mb_free_blocks(handle_t *handle, struct inode *inode, 4494c9de560dSAlex Tomas unsigned long block, unsigned long count, 4495c9de560dSAlex Tomas int metadata, unsigned long *freed) 4496c9de560dSAlex Tomas { 449726346ff6SAneesh Kumar K.V struct buffer_head *bitmap_bh = NULL; 4498c9de560dSAlex Tomas struct super_block *sb = inode->i_sb; 4499256bdb49SEric Sandeen struct ext4_allocation_context *ac = NULL; 4500c9de560dSAlex Tomas struct ext4_group_desc *gdp; 4501c9de560dSAlex Tomas struct ext4_super_block *es; 4502c9de560dSAlex Tomas unsigned long overflow; 4503c9de560dSAlex Tomas ext4_grpblk_t bit; 4504c9de560dSAlex Tomas struct buffer_head *gd_bh; 4505c9de560dSAlex Tomas ext4_group_t block_group; 4506c9de560dSAlex Tomas struct ext4_sb_info *sbi; 4507c9de560dSAlex Tomas struct ext4_buddy e4b; 4508c9de560dSAlex Tomas int err = 0; 4509c9de560dSAlex Tomas int ret; 4510c9de560dSAlex Tomas 4511c9de560dSAlex Tomas *freed = 0; 4512c9de560dSAlex Tomas 4513c9de560dSAlex Tomas sbi = EXT4_SB(sb); 4514c9de560dSAlex Tomas es = EXT4_SB(sb)->s_es; 4515c9de560dSAlex Tomas if (block < le32_to_cpu(es->s_first_data_block) || 4516c9de560dSAlex Tomas block + count < block || 4517c9de560dSAlex Tomas block + count > ext4_blocks_count(es)) { 451846e665e9SHarvey Harrison ext4_error(sb, __func__, 4519c9de560dSAlex Tomas "Freeing blocks not in datazone - " 4520c9de560dSAlex Tomas "block = %lu, count = %lu", block, count); 4521c9de560dSAlex Tomas goto error_return; 4522c9de560dSAlex Tomas } 4523c9de560dSAlex Tomas 4524c9de560dSAlex Tomas ext4_debug("freeing block %lu\n", block); 4525c9de560dSAlex Tomas 4526256bdb49SEric Sandeen ac = kmem_cache_alloc(ext4_ac_cachep, GFP_NOFS); 4527256bdb49SEric Sandeen if (ac) { 4528256bdb49SEric Sandeen ac->ac_op = EXT4_MB_HISTORY_FREE; 4529256bdb49SEric Sandeen ac->ac_inode = inode; 4530256bdb49SEric Sandeen ac->ac_sb = sb; 4531256bdb49SEric Sandeen } 4532c9de560dSAlex Tomas 4533c9de560dSAlex Tomas do_more: 4534c9de560dSAlex Tomas overflow = 0; 4535c9de560dSAlex Tomas ext4_get_group_no_and_offset(sb, block, &block_group, &bit); 4536c9de560dSAlex Tomas 4537c9de560dSAlex Tomas /* 4538c9de560dSAlex Tomas * Check to see if we are freeing blocks across a group 4539c9de560dSAlex Tomas * boundary. 4540c9de560dSAlex Tomas */ 4541c9de560dSAlex Tomas if (bit + count > EXT4_BLOCKS_PER_GROUP(sb)) { 4542c9de560dSAlex Tomas overflow = bit + count - EXT4_BLOCKS_PER_GROUP(sb); 4543c9de560dSAlex Tomas count -= overflow; 4544c9de560dSAlex Tomas } 4545574ca174STheodore Ts'o bitmap_bh = ext4_read_block_bitmap(sb, block_group); 4546ce89f46cSAneesh Kumar K.V if (!bitmap_bh) { 4547ce89f46cSAneesh Kumar K.V err = -EIO; 4548c9de560dSAlex Tomas goto error_return; 4549ce89f46cSAneesh Kumar K.V } 4550c9de560dSAlex Tomas gdp = ext4_get_group_desc(sb, block_group, &gd_bh); 4551ce89f46cSAneesh Kumar K.V if (!gdp) { 4552ce89f46cSAneesh Kumar K.V err = -EIO; 4553c9de560dSAlex Tomas goto error_return; 4554ce89f46cSAneesh Kumar K.V } 4555c9de560dSAlex Tomas 4556c9de560dSAlex Tomas if (in_range(ext4_block_bitmap(sb, gdp), block, count) || 4557c9de560dSAlex Tomas in_range(ext4_inode_bitmap(sb, gdp), block, count) || 4558c9de560dSAlex Tomas in_range(block, ext4_inode_table(sb, gdp), 4559c9de560dSAlex Tomas EXT4_SB(sb)->s_itb_per_group) || 4560c9de560dSAlex Tomas in_range(block + count - 1, ext4_inode_table(sb, gdp), 4561c9de560dSAlex Tomas EXT4_SB(sb)->s_itb_per_group)) { 4562c9de560dSAlex Tomas 456346e665e9SHarvey Harrison ext4_error(sb, __func__, 4564c9de560dSAlex Tomas "Freeing blocks in system zone - " 4565c9de560dSAlex Tomas "Block = %lu, count = %lu", block, count); 4566519deca0SAneesh Kumar K.V /* err = 0. ext4_std_error should be a no op */ 4567519deca0SAneesh Kumar K.V goto error_return; 4568c9de560dSAlex Tomas } 4569c9de560dSAlex Tomas 4570c9de560dSAlex Tomas BUFFER_TRACE(bitmap_bh, "getting write access"); 4571c9de560dSAlex Tomas err = ext4_journal_get_write_access(handle, bitmap_bh); 4572c9de560dSAlex Tomas if (err) 4573c9de560dSAlex Tomas goto error_return; 4574c9de560dSAlex Tomas 4575c9de560dSAlex Tomas /* 4576c9de560dSAlex Tomas * We are about to modify some metadata. Call the journal APIs 4577c9de560dSAlex Tomas * to unshare ->b_data if a currently-committing transaction is 4578c9de560dSAlex Tomas * using it 4579c9de560dSAlex Tomas */ 4580c9de560dSAlex Tomas BUFFER_TRACE(gd_bh, "get_write_access"); 4581c9de560dSAlex Tomas err = ext4_journal_get_write_access(handle, gd_bh); 4582c9de560dSAlex Tomas if (err) 4583c9de560dSAlex Tomas goto error_return; 4584c9de560dSAlex Tomas 4585c9de560dSAlex Tomas err = ext4_mb_load_buddy(sb, block_group, &e4b); 4586c9de560dSAlex Tomas if (err) 4587c9de560dSAlex Tomas goto error_return; 4588c9de560dSAlex Tomas 4589c9de560dSAlex Tomas #ifdef AGGRESSIVE_CHECK 4590c9de560dSAlex Tomas { 4591c9de560dSAlex Tomas int i; 4592c9de560dSAlex Tomas for (i = 0; i < count; i++) 4593c9de560dSAlex Tomas BUG_ON(!mb_test_bit(bit + i, bitmap_bh->b_data)); 4594c9de560dSAlex Tomas } 4595c9de560dSAlex Tomas #endif 4596c9de560dSAlex Tomas mb_clear_bits(sb_bgl_lock(sbi, block_group), bitmap_bh->b_data, 4597c9de560dSAlex Tomas bit, count); 4598c9de560dSAlex Tomas 4599c9de560dSAlex Tomas /* We dirtied the bitmap block */ 4600c9de560dSAlex Tomas BUFFER_TRACE(bitmap_bh, "dirtied bitmap block"); 4601c9de560dSAlex Tomas err = ext4_journal_dirty_metadata(handle, bitmap_bh); 4602c9de560dSAlex Tomas 4603256bdb49SEric Sandeen if (ac) { 4604256bdb49SEric Sandeen ac->ac_b_ex.fe_group = block_group; 4605256bdb49SEric Sandeen ac->ac_b_ex.fe_start = bit; 4606256bdb49SEric Sandeen ac->ac_b_ex.fe_len = count; 4607256bdb49SEric Sandeen ext4_mb_store_history(ac); 4608256bdb49SEric Sandeen } 4609c9de560dSAlex Tomas 4610c9de560dSAlex Tomas if (metadata) { 4611c9de560dSAlex Tomas /* blocks being freed are metadata. these blocks shouldn't 4612c9de560dSAlex Tomas * be used until this transaction is committed */ 4613c9de560dSAlex Tomas ext4_mb_free_metadata(handle, &e4b, block_group, bit, count); 4614c9de560dSAlex Tomas } else { 4615c9de560dSAlex Tomas ext4_lock_group(sb, block_group); 46167e5a8cddSShen Feng mb_free_blocks(inode, &e4b, bit, count); 4617c9de560dSAlex Tomas ext4_mb_return_to_preallocation(inode, &e4b, block, count); 4618c9de560dSAlex Tomas ext4_unlock_group(sb, block_group); 4619c9de560dSAlex Tomas } 4620c9de560dSAlex Tomas 4621c9de560dSAlex Tomas spin_lock(sb_bgl_lock(sbi, block_group)); 4622e8546d06SMarcin Slusarz le16_add_cpu(&gdp->bg_free_blocks_count, count); 4623c9de560dSAlex Tomas gdp->bg_checksum = ext4_group_desc_csum(sbi, block_group, gdp); 4624c9de560dSAlex Tomas spin_unlock(sb_bgl_lock(sbi, block_group)); 4625c9de560dSAlex Tomas percpu_counter_add(&sbi->s_freeblocks_counter, count); 4626c9de560dSAlex Tomas 4627772cb7c8SJose R. Santos if (sbi->s_log_groups_per_flex) { 4628772cb7c8SJose R. Santos ext4_group_t flex_group = ext4_flex_group(sbi, block_group); 4629772cb7c8SJose R. Santos spin_lock(sb_bgl_lock(sbi, flex_group)); 4630772cb7c8SJose R. Santos sbi->s_flex_groups[flex_group].free_blocks += count; 4631772cb7c8SJose R. Santos spin_unlock(sb_bgl_lock(sbi, flex_group)); 4632772cb7c8SJose R. Santos } 4633772cb7c8SJose R. Santos 4634c9de560dSAlex Tomas ext4_mb_release_desc(&e4b); 4635c9de560dSAlex Tomas 4636c9de560dSAlex Tomas *freed += count; 4637c9de560dSAlex Tomas 4638c9de560dSAlex Tomas /* And the group descriptor block */ 4639c9de560dSAlex Tomas BUFFER_TRACE(gd_bh, "dirtied group descriptor block"); 4640c9de560dSAlex Tomas ret = ext4_journal_dirty_metadata(handle, gd_bh); 4641c9de560dSAlex Tomas if (!err) 4642c9de560dSAlex Tomas err = ret; 4643c9de560dSAlex Tomas 4644c9de560dSAlex Tomas if (overflow && !err) { 4645c9de560dSAlex Tomas block += count; 4646c9de560dSAlex Tomas count = overflow; 4647c9de560dSAlex Tomas put_bh(bitmap_bh); 4648c9de560dSAlex Tomas goto do_more; 4649c9de560dSAlex Tomas } 4650c9de560dSAlex Tomas sb->s_dirt = 1; 4651c9de560dSAlex Tomas error_return: 4652c9de560dSAlex Tomas brelse(bitmap_bh); 4653c9de560dSAlex Tomas ext4_std_error(sb, err); 4654256bdb49SEric Sandeen if (ac) 4655256bdb49SEric Sandeen kmem_cache_free(ext4_ac_cachep, ac); 4656c9de560dSAlex Tomas return; 4657c9de560dSAlex Tomas } 4658