Whamcloud - gitweb
Branch b1_8
[fs/lustre-release.git] / ldiskfs / kernel_patches / patches / ext3-mballoc3-core.patch
1 Index: linux-2.6.22.19/include/linux/ext3_fs.h
2 ===================================================================
3 --- linux-2.6.22.19.orig/include/linux/ext3_fs.h
4 +++ linux-2.6.22.19/include/linux/ext3_fs.h
5 @@ -54,6 +54,31 @@
6  #define ext3_debug(f, a...)    do {} while (0)
7  #endif
8  
9 +#define EXT3_MULTIBLOCK_ALLOCATOR      1
10 +
11 +#define EXT3_MB_HINT_MERGE             1       /* prefer goal again. length */
12 +#define EXT3_MB_HINT_RESERVED          2       /* blocks already reserved */
13 +#define EXT3_MB_HINT_METADATA          4       /* metadata is being allocated */
14 +#define EXT3_MB_HINT_FIRST             8       /* first blocks in the file */
15 +#define EXT3_MB_HINT_BEST              16      /* search for the best chunk */
16 +#define EXT3_MB_HINT_DATA              32      /* data is being allocated */
17 +#define EXT3_MB_HINT_NOPREALLOC                64      /* don't preallocate (for tails) */
18 +#define EXT3_MB_HINT_GROUP_ALLOC       128     /* allocate for locality group */
19 +#define EXT3_MB_HINT_GOAL_ONLY         256     /* allocate goal blocks or none */
20 +#define EXT3_MB_HINT_TRY_GOAL          512     /* goal is meaningful */
21 +
22 +struct ext3_allocation_request {
23 +       struct inode *inode;    /* target inode for block we're allocating */
24 +       unsigned long logical;  /* logical block in target inode */
25 +       unsigned long goal;     /* phys. target (a hint) */
26 +       unsigned long lleft;    /* the closest logical allocated block to the left */
27 +       unsigned long pleft;    /* phys. block for ^^^ */
28 +       unsigned long lright;   /* the closest logical allocated block to the right */
29 +       unsigned long pright;   /* phys. block for ^^^ */
30 +       unsigned long len;      /* how many blocks we want to allocate */
31 +       unsigned long flags;    /* flags. see above EXT3_MB_HINT_* */
32 +};
33 +
34  /*
35   * Special inodes numbers
36   */
37 @@ -412,6 +437,14 @@ struct ext3_inode {
38  #define ext3_find_first_zero_bit       ext2_find_first_zero_bit
39  #define ext3_find_next_zero_bit                ext2_find_next_zero_bit
40  
41 +#ifndef ext2_find_next_le_bit
42 +#ifdef __LITTLE_ENDIAN
43 +#define ext2_find_next_le_bit(addr, size, off) find_next_bit((addr), (size), (off))
44 +#else
45 +#error "mballoc needs a patch for big-endian systems - CFS bug 10634"
46 +#endif /* __LITTLE_ENDIAN */
47 +#endif /* !ext2_find_next_le_bit */
48 +
49  /*
50   * Maximal mount counts between two filesystem checks
51   */
52 @@ -813,6 +846,20 @@ extern unsigned long ext3_count_dirs (st
53  extern void ext3_check_inodes_bitmap (struct super_block *);
54  extern unsigned long ext3_count_free (struct buffer_head *, unsigned);
55  
56 +/* mballoc.c */
57 +extern long ext3_mb_stats;
58 +extern long ext3_mb_max_to_scan;
59 +extern int ext3_mb_init(struct super_block *, int);
60 +extern int ext3_mb_release(struct super_block *);
61 +extern unsigned long ext3_mb_new_blocks(handle_t *, struct ext3_allocation_request *, int *);
62 +extern int ext3_mb_reserve_blocks(struct super_block *, int);
63 +extern void ext3_mb_release_blocks(struct super_block *, int);
64 +extern void ext3_mb_release_blocks(struct super_block *, int);
65 +extern void ext3_mb_discard_inode_preallocations(struct inode *);
66 +extern int __init init_ext3_mb_proc(void);
67 +extern void exit_ext3_mb_proc(void);
68 +extern void ext3_mb_free_blocks(handle_t *, struct inode *, unsigned long, unsigned long, int, int *);
69 +
70  
71  /* inode.c */
72  int ext3_forget(handle_t *handle, int is_metadata, struct inode *inode,
73 @@ -859,6 +906,10 @@ extern int ext3_group_extend(struct supe
74                                 ext3_fsblk_t n_blocks_count);
75  
76  /* super.c */
77 +extern struct proc_dir_entry *proc_root_ext3;
78 +extern int __init init_ext3_proc(void);
79 +extern void exit_ext3_proc(void);
80 +
81  extern void ext3_error (struct super_block *, const char *, const char *, ...)
82         __attribute__ ((format (printf, 3, 4)));
83  extern void __ext3_std_error (struct super_block *, const char *, int);
84 Index: linux-2.6.22.19/include/linux/ext3_fs_sb.h
85 ===================================================================
86 --- linux-2.6.22.19.orig/include/linux/ext3_fs_sb.h
87 +++ linux-2.6.22.19/include/linux/ext3_fs_sb.h
88 @@ -88,6 +88,68 @@ struct ext3_sb_info {
89         unsigned long s_ext_blocks;
90         unsigned long s_ext_extents;
91  #endif
92 +
93 +       /* for buddy allocator */
94 +       struct ext3_group_info ***s_group_info;
95 +       struct inode *s_buddy_cache;
96 +       long s_blocks_reserved;
97 +       spinlock_t s_reserve_lock;
98 +       struct list_head s_active_transaction;
99 +       struct list_head s_closed_transaction;
100 +       struct list_head s_committed_transaction;
101 +       spinlock_t s_md_lock;
102 +       tid_t s_last_transaction;
103 +       unsigned short *s_mb_offsets, *s_mb_maxs;
104 +
105 +       /* tunables */
106 +       unsigned long s_mb_factor;
107 +       unsigned long s_stripe;
108 +       unsigned long s_mb_small_req;
109 +       unsigned long s_mb_large_req;
110 +       unsigned long s_mb_max_to_scan;
111 +       unsigned long s_mb_min_to_scan;
112 +       unsigned long s_mb_max_groups_to_scan;
113 +       unsigned long s_mb_stats;
114 +       unsigned long s_mb_order2_reqs;
115 +       unsigned long *s_mb_prealloc_table;
116 +       unsigned long s_mb_prealloc_table_size;
117 +       unsigned long s_mb_group_prealloc;
118 +       /* where last allocation was done - for stream allocation */
119 +       unsigned long s_mb_last_group;
120 +       unsigned long s_mb_last_start;
121 +
122 +       /* history to debug policy */
123 +       struct ext3_mb_history *s_mb_history;
124 +       int s_mb_history_cur;
125 +       int s_mb_history_max;
126 +       int s_mb_history_num;
127 +       struct proc_dir_entry *s_dev_proc;
128 +       spinlock_t s_mb_history_lock;
129 +       int s_mb_history_filter;
130 +
131 +       /* stats for buddy allocator */
132 +       spinlock_t s_mb_pa_lock;
133 +       atomic_t s_bal_reqs;    /* number of reqs with len > 1 */
134 +       atomic_t s_bal_success; /* we found long enough chunks */
135 +       atomic_t s_bal_allocated;       /* in blocks */
136 +       atomic_t s_bal_ex_scanned;      /* total extents scanned */
137 +       atomic_t s_bal_goals;   /* goal hits */
138 +       atomic_t s_bal_breaks;  /* too long searches */
139 +       atomic_t s_bal_2orders; /* 2^order hits */
140 +       spinlock_t s_bal_lock;
141 +       unsigned long s_mb_buddies_generated;
142 +       unsigned long long s_mb_generation_time;
143 +       atomic_t s_mb_lost_chunks;
144 +       atomic_t s_mb_preallocated;
145 +       atomic_t s_mb_discarded;
146 +
147 +       /* locality groups */
148 +       struct ext3_locality_group *s_locality_groups;
149 +
150  };
151  
152 +#define EXT3_GROUP_INFO(sb, group)                                        \
153 +       EXT3_SB(sb)->s_group_info[(group) >> EXT3_DESC_PER_BLOCK_BITS(sb)] \
154 +                                [(group) & (EXT3_DESC_PER_BLOCK(sb) - 1)]
155 +
156  #endif /* _LINUX_EXT3_FS_SB */
157 Index: linux-2.6.22.19/fs/ext3/super.c
158 ===================================================================
159 --- linux-2.6.22.19.orig/fs/ext3/super.c
160 +++ linux-2.6.22.19/fs/ext3/super.c
161 @@ -392,6 +392,7 @@ static void ext3_put_super (struct super
162         struct ext3_super_block *es = sbi->s_es;
163         int i;
164  
165 +       ext3_mb_release(sb);
166         ext3_ext_release(sb);
167         ext3_xattr_put_super(sb);
168         journal_destroy(sbi->s_journal);
169 @@ -434,6 +435,10 @@ static void ext3_put_super (struct super
170                 invalidate_bdev(sbi->journal_bdev);
171                 ext3_blkdev_remove(sbi);
172         }
173 +       if (sbi->s_dev_proc) {
174 +               remove_proc_entry(sbi->s_dev_proc->name, proc_root_ext3);
175 +               sbi->s_dev_proc = NULL;
176 +       }
177         sb->s_fs_info = NULL;
178         kfree(sbi);
179         return;
180 @@ -459,6 +464,8 @@ static struct inode *ext3_alloc_inode(st
181         ei->vfs_inode.i_version = 1;
182  
183         memset(&ei->i_cached_extent, 0, sizeof(ei->i_cached_extent));
184 +       INIT_LIST_HEAD(&ei->i_prealloc_list);
185 +       spin_lock_init(&ei->i_prealloc_lock);
186         return &ei->vfs_inode;
187  }
188  
189 @@ -1434,6 +1441,7 @@ static int ext3_fill_super (struct super
190         unsigned long journal_devnum = 0;
191         unsigned long def_mount_opts;
192         struct inode *root;
193 +       char *devname;
194         int blocksize;
195         int hblock;
196         int db_count;
197 @@ -1448,6 +1456,22 @@ static int ext3_fill_super (struct super
198         sbi->s_mount_opt = 0;
199         sbi->s_resuid = EXT3_DEF_RESUID;
200         sbi->s_resgid = EXT3_DEF_RESGID;
201 +       devname = kstrdup(sb->s_id, GFP_KERNEL);
202 +       if (devname) {
203 +               char *p = devname;
204 +               while ((p = strchr(p, '/')))
205 +                       *p = '!';
206 +               sbi->s_dev_proc = proc_mkdir(devname, proc_root_ext3);
207 +               if (sbi->s_dev_proc == NULL)
208 +                       printk(KERN_WARNING "EXT3-fs warning: unable to create "
209 +                                           "procfs entry for %s(%s)\n",
210 +                                           sb->s_id, devname);
211 +               kfree(devname);
212 +       } else {
213 +               printk(KERN_WARNING "EXT3-fs warning: cannot allocate memory "
214 +                                   "to create procfs entry for %s\n",
215 +                                   sb->s_id);
216 +       }
217  
218         unlock_kernel();
219  
220 @@ -1857,6 +1881,10 @@ failed_mount:
221         ext3_blkdev_remove(sbi);
222         brelse(bh);
223  out_fail:
224 +       if (sbi->s_dev_proc) {
225 +               remove_proc_entry(sbi->s_dev_proc->name, proc_root_ext3);
226 +               sbi->s_dev_proc = NULL;
227 +       }
228         sb->s_fs_info = NULL;
229         kfree(sbi);
230         lock_kernel();
231 @@ -2787,9 +2815,46 @@ static struct file_system_type ext3_fs_t
232         .fs_flags       = FS_REQUIRES_DEV,
233  };
234  
235 +#define EXT3_ROOT "ext3"
236 +struct proc_dir_entry *proc_root_ext3;
237 +
238 +int __init init_ext3_proc(void)
239 +{
240 +       int ret;
241 +
242 +       if ((ret = init_ext3_mb_proc()))
243 +               goto out;
244 +
245 +       proc_root_ext3 = proc_mkdir(EXT3_ROOT, proc_root_fs);
246 +       if (proc_root_ext3 == NULL) {
247 +               printk(KERN_ERR "EXT3-fs: Unable to create %s\n", EXT3_ROOT);
248 +               ret = -ENOMEM;
249 +               goto out_mb_proc;
250 +       }
251 +
252 +       return 0;
253 +
254 +out_mb_proc:
255 +       exit_ext3_mb_proc();
256 +out:
257 +       return ret;
258 +}
259 +
260 +void exit_ext3_proc(void)
261 +{
262 +       exit_ext3_mb_proc();
263 +       remove_proc_entry(EXT3_ROOT, proc_root_fs);
264 +}
265 +
266  static int __init init_ext3_fs(void)
267  {
268 -       int err = init_ext3_xattr();
269 +       int err;
270 +
271 +       err = init_ext3_proc();
272 +       if (err)
273 +               return err;
274 +
275 +       err = init_ext3_xattr();
276         if (err)
277                 return err;
278         err = init_inodecache();
279 @@ -2811,6 +2876,7 @@ static void __exit exit_ext3_fs(void)
280         unregister_filesystem(&ext3_fs_type);
281         destroy_inodecache();
282         exit_ext3_xattr();
283 +       exit_ext3_proc();
284  }
285  
286  int ext3_map_inode_page(struct inode *inode, struct page *page,
287 Index: linux-2.6.22.19/fs/ext3/mballoc.c
288 ===================================================================
289 --- /dev/null
290 +++ linux-2.6.22.19/fs/ext3/mballoc.c
291 @@ -0,0 +1,4483 @@
292 +/*
293 + * Copyright 2009 Sun Microsystems, Inc.
294 + * Written by Alex Zhuravlev <alex.zhuravlev@sun.com>
295 + *
296 + * This program is free software; you can redistribute it and/or modify
297 + * it under the terms of the GNU General Public License version 2 as
298 + * published by the Free Software Foundation.
299 + *
300 + * This program is distributed in the hope that it will be useful,
301 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
302 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
303 + * GNU General Public License for more details.
304 + *
305 + * You should have received a copy of the GNU General Public Licens
306 + * along with this program; if not, write to the Free Software
307 + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-
308 + */
309 +
310 +
311 +/*
312 + * mballoc.c contains the multiblocks allocation routines
313 + */
314 +
315 +#include <linux/time.h>
316 +#include <linux/fs.h>
317 +#include <linux/namei.h>
318 +#include <linux/ext3_jbd.h>
319 +#include <linux/jbd.h>
320 +#include <linux/ext3_fs.h>
321 +#include <linux/quotaops.h>
322 +#include <linux/buffer_head.h>
323 +#include <linux/module.h>
324 +#include <linux/swap.h>
325 +#include <linux/proc_fs.h>
326 +#include <linux/pagemap.h>
327 +#include <linux/seq_file.h>
328 +#include <linux/version.h>
329 +
330 +/*
331 + * MUSTDO:
332 + *   - test ext3_ext_search_left() and ext3_ext_search_right()
333 + *   - search for metadata in few groups
334 + *
335 + * TODO v4:
336 + *   - normalization should take into account whether file is still open
337 + *   - discard preallocations if no free space left (policy?)
338 + *   - don't normalize tails
339 + *   - quota
340 + *   - reservation for superuser
341 + *
342 + * TODO v3:
343 + *   - bitmap read-ahead (proposed by Oleg Drokin aka green)
344 + *   - track min/max extents in each group for better group selection
345 + *   - mb_mark_used() may allocate chunk right after splitting buddy
346 + *   - tree of groups sorted by number of free blocks
347 + *   - error handling
348 + */
349 +
350 +/*
351 + * mballoc operates on the following data:
352 + *  - on-disk bitmap
353 + *  - in-core buddy (actually includes buddy and bitmap)
354 + *  - preallocation descriptors (PAs)
355 + *
356 + * there are two types of preallocations:
357 + *  - inode
358 + *    assiged to specific inode and can be used for this inode only.
359 + *    it describes part of inode's space preallocated to specific
360 + *    physical blocks. any block from that preallocated can be used
361 + *    independent. the descriptor just tracks number of blocks left
362 + *    unused. so, before taking some block from descriptor, one must
363 + *    make sure corresponded logical block isn't allocated yet. this
364 + *    also means that freeing any block within descriptor's range
365 + *    must discard all preallocated blocks.
366 + *  - locality group
367 + *    assigned to specific locality group which does not translate to
368 + *    permanent set of inodes: inode can join and leave group. space
369 + *    from this type of preallocation can be used for any inode. thus
370 + *    it's consumed from the beginning to the end.
371 + *
372 + * relation between them can be expressed as:
373 + *    in-core buddy = on-disk bitmap + preallocation descriptors
374 + *
375 + * this mean blocks mballoc considers used are:
376 + *  - allocated blocks (persistent)
377 + *  - preallocated blocks (non-persistent)
378 + *
379 + * consistency in mballoc world means that at any time a block is either
380 + * free or used in ALL structures. notice: "any time" should not be read
381 + * literally -- time is discrete and delimited by locks.
382 + *
383 + *  to keep it simple, we don't use block numbers, instead we count number of
384 + *  blocks: how many blocks marked used/free in on-disk bitmap, buddy and PA.
385 + *
386 + * all operations can be expressed as:
387 + *  - init buddy:                      buddy = on-disk + PAs
388 + *  - new PA:                          buddy += N; PA = N
389 + *  - use inode PA:                    on-disk += N; PA -= N
390 + *  - discard inode PA                 buddy -= on-disk - PA; PA = 0
391 + *  - use locality group PA            on-disk += N; PA -= N
392 + *  - discard locality group PA                buddy -= PA; PA = 0
393 + *  note: 'buddy -= on-disk - PA' is used to show that on-disk bitmap
394 + *        is used in real operation because we can't know actual used
395 + *        bits from PA, only from on-disk bitmap
396 + *
397 + * if we follow this strict logic, then all operations above should be atomic.
398 + * given some of them can block, we'd have to use something like semaphores
399 + * killing performance on high-end SMP hardware. let's try to relax it using
400 + * the following knowledge:
401 + *  1) if buddy is referenced, it's already initialized
402 + *  2) while block is used in buddy and the buddy is referenced,
403 + *     nobody can re-allocate that block
404 + *  3) we work on bitmaps and '+' actually means 'set bits'. if on-disk has
405 + *     bit set and PA claims same block, it's OK. IOW, one can set bit in
406 + *     on-disk bitmap if buddy has same bit set or/and PA covers corresponded
407 + *     block
408 + *
409 + * so, now we're building a concurrency table:
410 + *  - init buddy vs.
411 + *    - new PA
412 + *      blocks for PA are allocated in the buddy, buddy must be referenced
413 + *      until PA is linked to allocation group to avoid concurrent buddy init
414 + *    - use inode PA
415 + *      we need to make sure that either on-disk bitmap or PA has uptodate data
416 + *      given (3) we care that PA-=N operation doesn't interfere with init
417 + *    - discard inode PA
418 + *      the simplest way would be to have buddy initialized by the discard
419 + *    - use locality group PA
420 + *      again PA-=N must be serialized with init
421 + *    - discard locality group PA
422 + *      the simplest way would be to have buddy initialized by the discard
423 + *  - new PA vs.
424 + *    - use inode PA
425 + *      i_truncate_mutex serializes them
426 + *    - discard inode PA
427 + *      discard process must wait until PA isn't used by another process
428 + *    - use locality group PA
429 + *      some mutex should serialize them
430 + *    - discard locality group PA
431 + *      discard process must wait until PA isn't used by another process
432 + *  - use inode PA
433 + *    - use inode PA
434 + *      i_truncate_mutex or another mutex should serializes them
435 + *    - discard inode PA
436 + *      discard process must wait until PA isn't used by another process
437 + *    - use locality group PA
438 + *      nothing wrong here -- they're different PAs covering different blocks
439 + *    - discard locality group PA
440 + *      discard process must wait until PA isn't used by another process
441 + *
442 + * now we're ready to make few consequences:
443 + *  - PA is referenced and while it is no discard is possible
444 + *  - PA is referenced until block isn't marked in on-disk bitmap
445 + *  - PA changes only after on-disk bitmap
446 + *  - discard must not compete with init. either init is done before
447 + *    any discard or they're serialized somehow
448 + *  - buddy init as sum of on-disk bitmap and PAs is done atomically
449 + *
450 + * a special case when we've used PA to emptiness. no need to modify buddy
451 + * in this case, but we should care about concurrent init
452 + *
453 + */
454 +
455 + /*
456 + * Logic in few words:
457 + *
458 + *  - allocation:
459 + *    load group
460 + *    find blocks
461 + *    mark bits in on-disk bitmap
462 + *    release group
463 + *
464 + *  - use preallocation:
465 + *    find proper PA (per-inode or group)
466 + *    load group
467 + *    mark bits in on-disk bitmap
468 + *    release group
469 + *    release PA
470 + *
471 + *  - free:
472 + *    load group
473 + *    mark bits in on-disk bitmap
474 + *    release group
475 + *
476 + *  - discard preallocations in group:
477 + *    mark PAs deleted
478 + *    move them onto local list
479 + *    load on-disk bitmap
480 + *    load group
481 + *    remove PA from object (inode or locality group)
482 + *    mark free blocks in-core
483 + *
484 + *  - discard inode's preallocations:
485 + */
486 +
487 +/*
488 + * Locking rules
489 + *
490 + * Locks:
491 + *  - bitlock on a group       (group)
492 + *  - object (inode/locality)  (object)
493 + *  - per-pa lock              (pa)
494 + *
495 + * Paths:
496 + *  - new pa
497 + *    object
498 + *    group
499 + *
500 + *  - find and use pa:
501 + *    pa
502 + *
503 + *  - release consumed pa:
504 + *    pa
505 + *    group
506 + *    object
507 + *
508 + *  - generate in-core bitmap:
509 + *    group
510 + *        pa
511 + *
512 + *  - discard all for given object (inode, locality group):
513 + *    object
514 + *        pa
515 + *    group
516 + *
517 + *  - discard all for given group:
518 + *    group
519 + *        pa
520 + *    group
521 + *        object
522 + *
523 + */
524 +
525 +/*
526 + * with AGGRESSIVE_CHECK allocator runs consistency checks over
527 + * structures. these checks slow things down a lot
528 + */
529 +#define AGGRESSIVE_CHECK__
530 +
531 +/*
532 + * with DOUBLE_CHECK defined mballoc creates persistent in-core
533 + * bitmaps, maintains and uses them to check for double allocations
534 + */
535 +#define DOUBLE_CHECK__
536 +
537 +/*
538 + */
539 +#define MB_DEBUG__
540 +#ifdef MB_DEBUG
541 +#define mb_debug(fmt,a...)     printk(fmt, ##a)
542 +#else
543 +#define mb_debug(fmt,a...)
544 +#endif
545 +
546 +/*
547 + * with EXT3_MB_HISTORY mballoc stores last N allocations in memory
548 + * and you can monitor it in /proc/fs/ext3/<dev>/mb_history
549 + */
550 +#define EXT3_MB_HISTORY
551 +#define EXT3_MB_HISTORY_ALLOC          1       /* allocation */
552 +#define EXT3_MB_HISTORY_PREALLOC       2       /* preallocated blocks used */
553 +#define EXT3_MB_HISTORY_DISCARD                4       /* preallocation discarded */
554 +#define EXT3_MB_HISTORY_FREE           8       /* free */
555 +
556 +#define EXT3_MB_HISTORY_DEFAULT                (EXT3_MB_HISTORY_ALLOC | \
557 +                                        EXT3_MB_HISTORY_PREALLOC | \
558 +                                        EXT3_MB_HISTORY_DISCARD | \
559 +                                        EXT3_MB_HISTORY_FREE)
560 +
561 +/*
562 + * How long mballoc can look for a best extent (in found extents)
563 + */
564 +#define MB_DEFAULT_MAX_TO_SCAN         200
565 +
566 +/*
567 + * How long mballoc must look for a best extent
568 + */
569 +#define MB_DEFAULT_MIN_TO_SCAN         10
570 +
571 +/*
572 + * How many groups mballoc will scan looking for the best chunk
573 + */
574 +#define MB_DEFAULT_MAX_GROUPS_TO_SCAN  5
575 +
576 +/*
577 + * with 'ext3_mb_stats' allocator will collect stats that will be
578 + * shown at umount. The collecting costs though!
579 + */
580 +#define MB_DEFAULT_STATS               1
581 +
582 +/*
583 + * files smaller than MB_DEFAULT_STREAM_THRESHOLD are served
584 + * by the stream allocator, which purpose is to pack requests
585 + * as close each to other as possible to produce smooth I/O traffic
586 + */
587 +#define MB_DEFAULT_STREAM_THRESHOLD    16      /* 64K */
588 +
589 +/*
590 + * for which requests use 2^N search using buddies
591 + */
592 +#define MB_DEFAULT_ORDER2_REQS         8
593 +
594 +/*
595 + * default stripe size = 1MB
596 + */
597 +#define MB_DEFAULT_STRIPE              256
598 +
599 +static kmem_cache_t *ext3_pspace_cachep = NULL;
600 +
601 +#ifdef EXT3_BB_MAX_BLOCKS
602 +#undef EXT3_BB_MAX_BLOCKS
603 +#endif
604 +#define EXT3_BB_MAX_BLOCKS     30
605 +
606 +struct ext3_free_metadata {
607 +       unsigned group;
608 +       unsigned short num;
609 +       unsigned short blocks[EXT3_BB_MAX_BLOCKS];
610 +       struct list_head list;
611 +};
612 +
613 +struct ext3_group_info {
614 +       unsigned long   bb_state;
615 +       unsigned long   bb_tid;
616 +       struct ext3_free_metadata *bb_md_cur;
617 +       unsigned short  bb_first_free;
618 +       unsigned short  bb_free;
619 +       unsigned short  bb_fragments;
620 +       struct          list_head bb_prealloc_list;
621 +       unsigned long   bb_prealloc_nr;
622 +#ifdef DOUBLE_CHECK
623 +       void            *bb_bitmap;
624 +#endif
625 +       unsigned short  bb_counters[];
626 +};
627 +
628 +#define EXT3_GROUP_INFO_NEED_INIT_BIT  0
629 +#define EXT3_GROUP_INFO_LOCKED_BIT     1
630 +
631 +#define EXT3_MB_GRP_NEED_INIT(grp)     \
632 +       (test_bit(EXT3_GROUP_INFO_NEED_INIT_BIT, &(grp)->bb_state))
633 +
634 +
635 +struct ext3_prealloc_space {
636 +       struct list_head        pa_inode_list;
637 +       struct list_head        pa_group_list;
638 +       union {
639 +               struct list_head pa_tmp_list;
640 +               struct rcu_head pa_rcu;
641 +       } u;
642 +       spinlock_t              pa_lock;
643 +       atomic_t                pa_count;
644 +       unsigned                pa_deleted;
645 +       unsigned long           pa_pstart;      /* phys. block */
646 +       unsigned long           pa_lstart;      /* log. block */
647 +       unsigned short          pa_len;         /* len of preallocated chunk */
648 +       unsigned short          pa_free;        /* how many blocks are free */
649 +       unsigned short          pa_linear;      /* consumed in one direction
650 +                                                * strictly, for group prealloc */
651 +       spinlock_t              *pa_obj_lock;
652 +       struct inode            *pa_inode;      /* hack, for history only */
653 +};
654 +
655 +
656 +struct ext3_free_extent {
657 +       unsigned long fe_logical;
658 +       unsigned long fe_start;
659 +       unsigned long fe_group;
660 +       unsigned long fe_len;
661 +};
662 +
663 +/*
664 + * Locality group:
665 + *   we try to group all related changes together
666 + *   so that writeback can flush/allocate them together as well
667 + */
668 +struct ext3_locality_group {
669 +       /* for allocator */
670 +       struct semaphore        lg_sem;         /* to serialize allocates */
671 +       struct list_head        lg_prealloc_list;/* list of preallocations */
672 +       spinlock_t              lg_prealloc_lock;
673 +};
674 +
675 +struct ext3_allocation_context {
676 +       struct inode *ac_inode;
677 +       struct super_block *ac_sb;
678 +
679 +       /* original request */
680 +       struct ext3_free_extent ac_o_ex;
681 +
682 +       /* goal request (after normalization) */
683 +       struct ext3_free_extent ac_g_ex;
684 +
685 +       /* the best found extent */
686 +       struct ext3_free_extent ac_b_ex;
687 +
688 +       /* copy of the bext found extent taken before preallocation efforts */
689 +       struct ext3_free_extent ac_f_ex;
690 +
691 +       /* number of iterations done. we have to track to limit searching */
692 +       unsigned long ac_ex_scanned;
693 +       __u16 ac_groups_scanned;
694 +       __u16 ac_found;
695 +       __u16 ac_tail;
696 +       __u16 ac_buddy;
697 +       __u16 ac_flags;         /* allocation hints */
698 +       __u8 ac_status;
699 +       __u8 ac_criteria;
700 +       __u8 ac_repeats;
701 +       __u8 ac_2order;         /* if request is to allocate 2^N blocks and
702 +                                * N > 0, the field stores N, otherwise 0 */
703 +       __u8 ac_op;             /* operation, for history only */
704 +       struct page *ac_bitmap_page;
705 +       struct page *ac_buddy_page;
706 +       struct ext3_prealloc_space *ac_pa;
707 +       struct ext3_locality_group *ac_lg;
708 +};
709 +
710 +#define AC_STATUS_CONTINUE     1
711 +#define AC_STATUS_FOUND                2
712 +#define AC_STATUS_BREAK                3
713 +
714 +struct ext3_mb_history {
715 +       struct ext3_free_extent orig;   /* orig allocation */
716 +       struct ext3_free_extent goal;   /* goal allocation */
717 +       struct ext3_free_extent result; /* result allocation */
718 +       unsigned pid;
719 +       unsigned ino;
720 +       __u16 found;    /* how many extents have been found */
721 +       __u16 groups;   /* how many groups have been scanned */
722 +       __u16 tail;     /* what tail broke some buddy */
723 +       __u16 buddy;    /* buddy the tail ^^^ broke */
724 +       __u16 flags;
725 +       __u8 cr:8;      /* which phase the result extent was found at */
726 +       __u8 op:4;
727 +       __u8 merged:1;
728 +};
729 +
730 +struct ext3_buddy {
731 +       struct page *bd_buddy_page;
732 +       void *bd_buddy;
733 +       struct page *bd_bitmap_page;
734 +       void *bd_bitmap;
735 +       struct ext3_group_info *bd_info;
736 +       struct super_block *bd_sb;
737 +       unsigned bd_group;
738 +       unsigned bd_blkbits;
739 +};
740 +#define EXT3_MB_BITMAP(e3b)    ((e3b)->bd_bitmap)
741 +#define EXT3_MB_BUDDY(e3b)     ((e3b)->bd_buddy)
742 +
743 +#ifndef EXT3_MB_HISTORY
744 +#define ext3_mb_store_history(ac)
745 +#else
746 +static void ext3_mb_store_history(struct ext3_allocation_context *ac);
747 +#endif
748 +
749 +#define in_range(b, first, len)        ((b) >= (first) && (b) <= (first) + (len) - 1)
750 +
751 +int ext3_create (struct inode *, struct dentry *, int, struct nameidata *);
752 +struct buffer_head * read_block_bitmap(struct super_block *, unsigned int);
753 +unsigned long ext3_new_blocks_old(handle_t *handle, struct inode *inode,
754 +                       unsigned long goal, unsigned long *count, int *errp);
755 +void ext3_mb_release_blocks(struct super_block *, int);
756 +void ext3_mb_poll_new_transaction(struct super_block *, handle_t *);
757 +void ext3_mb_free_committed_blocks(struct super_block *);
758 +int ext3_mb_generate_from_pa(struct super_block *sb, void *bitmap, int group);
759 +void ext3_mb_free_consumed_preallocations(struct ext3_allocation_context *ac);
760 +void ext3_mb_return_to_preallocation(struct inode *inode, struct ext3_buddy *e3b,
761 +                                       sector_t block, int count);
762 +void ext3_mb_show_ac(struct ext3_allocation_context *ac);
763 +void ext3_mb_check_with_pa(struct ext3_buddy *e3b, int first, int count);
764 +void ext3_mb_put_pa(struct ext3_allocation_context *, struct super_block *, struct ext3_prealloc_space *pa);
765 +int ext3_mb_init_per_dev_proc(struct super_block *sb);
766 +int ext3_mb_destroy_per_dev_proc(struct super_block *sb);
767 +
768 +/*
769 + * Calculate the block group number and offset, given a block number
770 + */
771 +static void ext3_get_group_no_and_offset(struct super_block *sb,
772 +                                       unsigned long blocknr,
773 +                                       unsigned long *blockgrpp,
774 +                                       unsigned long *offsetp)
775 +{
776 +       struct ext3_super_block *es = EXT3_SB(sb)->s_es;
777 +       unsigned long offset;
778 +
779 +       blocknr = blocknr - le32_to_cpu(es->s_first_data_block);
780 +       offset = blocknr % EXT3_BLOCKS_PER_GROUP(sb);
781 +       blocknr = blocknr / EXT3_BLOCKS_PER_GROUP(sb);
782 +       if (offsetp)
783 +               *offsetp = offset;
784 +       if (blockgrpp)
785 +               *blockgrpp = blocknr;
786 +
787 +}
788 +
789 +static inline void
790 +ext3_lock_group(struct super_block *sb, int group)
791 +{
792 +       bit_spin_lock(EXT3_GROUP_INFO_LOCKED_BIT,
793 +                     &EXT3_GROUP_INFO(sb, group)->bb_state);
794 +}
795 +
796 +static inline void
797 +ext3_unlock_group(struct super_block *sb, int group)
798 +{
799 +       bit_spin_unlock(EXT3_GROUP_INFO_LOCKED_BIT,
800 +                       &EXT3_GROUP_INFO(sb, group)->bb_state);
801 +}
802 +
803 +static inline int
804 +ext3_is_group_locked(struct super_block *sb, int group)
805 +{
806 +       return bit_spin_is_locked(EXT3_GROUP_INFO_LOCKED_BIT,
807 +                                       &EXT3_GROUP_INFO(sb, group)->bb_state);
808 +}
809 +
810 +unsigned long ext3_grp_offs_to_block(struct super_block *sb,
811 +                                       struct ext3_free_extent *fex)
812 +{
813 +       unsigned long block;
814 +
815 +       block = (unsigned long) fex->fe_group * EXT3_BLOCKS_PER_GROUP(sb)
816 +                       + fex->fe_start
817 +                       + le32_to_cpu(EXT3_SB(sb)->s_es->s_first_data_block);
818 +       return block;
819 +}
820 +
821 +#if BITS_PER_LONG == 64
822 +#define mb_correct_addr_and_bit(bit,addr)              \
823 +{                                                      \
824 +       bit += ((unsigned long) addr & 7UL) << 3;       \
825 +       addr = (void *) ((unsigned long) addr & ~7UL);  \
826 +}
827 +#elif BITS_PER_LONG == 32
828 +#define mb_correct_addr_and_bit(bit,addr)              \
829 +{                                                      \
830 +       bit += ((unsigned long) addr & 3UL) << 3;       \
831 +       addr = (void *) ((unsigned long) addr & ~3UL);  \
832 +}
833 +#else
834 +#error "how many bits you are?!"
835 +#endif
836 +
837 +static inline int mb_test_bit(int bit, void *addr)
838 +{
839 +       mb_correct_addr_and_bit(bit,addr);
840 +       return ext2_test_bit(bit, addr);
841 +}
842 +
843 +static inline void mb_set_bit(int bit, void *addr)
844 +{
845 +       mb_correct_addr_and_bit(bit,addr);
846 +       ext2_set_bit(bit, addr);
847 +}
848 +
849 +static inline void mb_set_bit_atomic(spinlock_t *lock, int bit, void *addr)
850 +{
851 +       mb_correct_addr_and_bit(bit,addr);
852 +       ext2_set_bit_atomic(lock, bit, addr);
853 +}
854 +
855 +static inline void mb_clear_bit(int bit, void *addr)
856 +{
857 +       mb_correct_addr_and_bit(bit,addr);
858 +       ext2_clear_bit(bit, addr);
859 +}
860 +
861 +static inline void mb_clear_bit_atomic(spinlock_t *lock, int bit, void *addr)
862 +{
863 +       mb_correct_addr_and_bit(bit,addr);
864 +       ext2_clear_bit_atomic(lock, bit, addr);
865 +}
866 +
867 +static inline int mb_find_next_zero_bit(void *addr, int max, int start)
868 +{
869 +       int fix;
870 +#if BITS_PER_LONG == 64
871 +       fix = ((unsigned long) addr & 7UL) << 3;
872 +       addr = (void *) ((unsigned long) addr & ~7UL);
873 +#elif BITS_PER_LONG == 32
874 +       fix = ((unsigned long) addr & 3UL) << 3;
875 +       addr = (void *) ((unsigned long) addr & ~3UL);
876 +#else
877 +#error "how many bits you are?!"
878 +#endif
879 +       max += fix;
880 +       start += fix;
881 +       return ext2_find_next_zero_bit(addr, max, start) - fix;
882 +}
883 +
884 +static inline int mb_find_next_bit(void *addr, int max, int start)
885 +{
886 +       int fix;
887 +#if BITS_PER_LONG == 64
888 +       fix = ((unsigned long) addr & 7UL) << 3;
889 +       addr = (void *) ((unsigned long) addr & ~7UL);
890 +#elif BITS_PER_LONG == 32
891 +       fix = ((unsigned long) addr & 3UL) << 3;
892 +       addr = (void *) ((unsigned long) addr & ~3UL);
893 +#else
894 +#error "how many bits you are?!"
895 +#endif
896 +       max += fix;
897 +       start += fix;
898 +
899 +#ifdef __BIG_ENDIAN
900 +#else
901 +       return find_next_bit(addr, max, start) - fix;
902 +#endif
903 +}
904 +
905 +static inline void *mb_find_buddy(struct ext3_buddy *e3b, int order, int *max)
906 +{
907 +       char *bb;
908 +
909 +       BUG_ON(EXT3_MB_BITMAP(e3b) == EXT3_MB_BUDDY(e3b));
910 +       BUG_ON(max == NULL);
911 +
912 +       if (order > e3b->bd_blkbits + 1) {
913 +               *max = 0;
914 +               return NULL;
915 +       }
916 +
917 +       /* at order 0 we see each particular block */
918 +       *max = 1 << (e3b->bd_blkbits + 3);
919 +       if (order == 0)
920 +               return EXT3_MB_BITMAP(e3b);
921 +
922 +       bb = EXT3_MB_BUDDY(e3b) + EXT3_SB(e3b->bd_sb)->s_mb_offsets[order];
923 +       *max = EXT3_SB(e3b->bd_sb)->s_mb_maxs[order];
924 +
925 +       return bb;
926 +}
927 +
928 +#ifdef DOUBLE_CHECK
929 +void mb_free_blocks_double(struct inode *inode, struct ext3_buddy *e3b,
930 +                          int first, int count)
931 +{
932 +       int i;
933 +       struct super_block *sb = e3b->bd_sb;
934 +
935 +       if (unlikely(e3b->bd_info->bb_bitmap == NULL))
936 +               return;
937 +       BUG_ON(!ext3_is_group_locked(sb, e3b->bd_group));
938 +       for (i = 0; i < count; i++) {
939 +               if (!mb_test_bit(first + i, e3b->bd_info->bb_bitmap)) {
940 +                       unsigned long blocknr;
941 +                       blocknr = e3b->bd_group * EXT3_BLOCKS_PER_GROUP(sb);
942 +                       blocknr += first + i;
943 +                       blocknr +=
944 +                           le32_to_cpu(EXT3_SB(sb)->s_es->s_first_data_block);
945 +
946 +                       ext3_error(sb, __FUNCTION__, "double-free of inode"
947 +                                  " %lu's block %lu(bit %u in group %u)\n",
948 +                                  inode ? inode->i_ino : 0, blocknr,
949 +                                  first + i, e3b->bd_group);
950 +               }
951 +               mb_clear_bit(first + i, e3b->bd_info->bb_bitmap);
952 +       }
953 +}
954 +
955 +void mb_mark_used_double(struct ext3_buddy *e3b, int first, int count)
956 +{
957 +       int i;
958 +       if (unlikely(e3b->bd_info->bb_bitmap == NULL))
959 +               return;
960 +       BUG_ON(!ext3_is_group_locked(e3b->bd_sb, e3b->bd_group));
961 +       for (i = 0; i < count; i++) {
962 +               BUG_ON(mb_test_bit(first + i, e3b->bd_info->bb_bitmap));
963 +               mb_set_bit(first + i, e3b->bd_info->bb_bitmap);
964 +       }
965 +}
966 +
967 +void mb_cmp_bitmaps(struct ext3_buddy *e3b, void *bitmap)
968 +{
969 +       if (memcmp(e3b->bd_info->bb_bitmap, bitmap, e3b->bd_sb->s_blocksize)) {
970 +               unsigned char *b1, *b2;
971 +               int i;
972 +               b1 = (unsigned char *) e3b->bd_info->bb_bitmap;
973 +               b2 = (unsigned char *) bitmap;
974 +               for (i = 0; i < e3b->bd_sb->s_blocksize; i++) {
975 +                       if (b1[i] != b2[i]) {
976 +                               printk("corruption in group %u at byte %u(%u): "
977 +                                      "%x in copy != %x on disk/prealloc\n",
978 +                                       e3b->bd_group, i, i * 8, b1[i], b2[i]);
979 +                               BUG();
980 +                       }
981 +               }
982 +       }
983 +}
984 +
985 +#else
986 +#define mb_free_blocks_double(a,b,c,d)
987 +#define mb_mark_used_double(a,b,c)
988 +#define mb_cmp_bitmaps(a,b)
989 +#endif
990 +
991 +#ifdef AGGRESSIVE_CHECK
992 +
993 +#define MB_CHECK_ASSERT(assert)                                                \
994 +do {                                                                   \
995 +       if (!(assert)) {                                                \
996 +               printk (KERN_EMERG                                      \
997 +                       "Assertion failure in %s() at %s:%d: \"%s\"\n", \
998 +                       function, file, line, # assert);                \
999 +               BUG();                                                  \
1000 +       }                                                               \
1001 +} while (0)
1002 +
1003 +static int __mb_check_buddy(struct ext3_buddy *e3b, char *file,
1004 +                               const char *function, int line)
1005 +{
1006 +       struct super_block *sb = e3b->bd_sb;
1007 +       int order = e3b->bd_blkbits + 1;
1008 +       int max, max2, i, j, k, count;
1009 +       struct ext3_group_info *grp;
1010 +       int fragments = 0, fstart;
1011 +       struct list_head *cur;
1012 +       void *buddy, *buddy2;
1013 +
1014 +       if (!test_opt(sb, MBALLOC))
1015 +               return 0;
1016 +
1017 +       {
1018 +               static int mb_check_counter = 0;
1019 +               if (mb_check_counter++ % 100 != 0)
1020 +                       return 0;
1021 +       }
1022 +
1023 +       while (order > 1) {
1024 +               buddy = mb_find_buddy(e3b, order, &max);
1025 +               MB_CHECK_ASSERT(buddy);
1026 +               buddy2 = mb_find_buddy(e3b, order - 1, &max2);
1027 +               MB_CHECK_ASSERT(buddy2);
1028 +               MB_CHECK_ASSERT(buddy != buddy2);
1029 +               MB_CHECK_ASSERT(max * 2 == max2);
1030 +
1031 +               count = 0;
1032 +               for (i = 0; i < max; i++) {
1033 +
1034 +                       if (mb_test_bit(i, buddy)) {
1035 +                               /* only single bit in buddy2 may be 1 */
1036 +                               if (!mb_test_bit(i << 1, buddy2))
1037 +                                       MB_CHECK_ASSERT(mb_test_bit((i<<1)+1, buddy2));
1038 +                               else if (!mb_test_bit((i << 1) + 1, buddy2))
1039 +                                       MB_CHECK_ASSERT(mb_test_bit(i << 1, buddy2));
1040 +                               continue;
1041 +                       }
1042 +
1043 +                       /* both bits in buddy2 must be 0 */
1044 +                       MB_CHECK_ASSERT(mb_test_bit(i << 1, buddy2));
1045 +                       MB_CHECK_ASSERT(mb_test_bit((i << 1) + 1, buddy2));
1046 +
1047 +                       for (j = 0; j < (1 << order); j++) {
1048 +                               k = (i * (1 << order)) + j;
1049 +                               MB_CHECK_ASSERT(!mb_test_bit(k, EXT3_MB_BITMAP(e3b)));
1050 +                       }
1051 +                       count++;
1052 +               }
1053 +               MB_CHECK_ASSERT(e3b->bd_info->bb_counters[order] == count);
1054 +               order--;
1055 +       }
1056 +
1057 +       fstart = -1;
1058 +       buddy = mb_find_buddy(e3b, 0, &max);
1059 +       for (i = 0; i < max; i++) {
1060 +               if (!mb_test_bit(i, buddy)) {
1061 +                       MB_CHECK_ASSERT(i >= e3b->bd_info->bb_first_free);
1062 +                       if (fstart == -1) {
1063 +                               fragments++;
1064 +                               fstart = i;
1065 +                       }
1066 +                       continue;
1067 +               }
1068 +               fstart = -1;
1069 +               /* check used bits only */
1070 +               for (j = 0; j < e3b->bd_blkbits + 1; j++) {
1071 +                       buddy2 = mb_find_buddy(e3b, j, &max2);
1072 +                       k = i >> j;
1073 +                       MB_CHECK_ASSERT(k < max2);
1074 +                       MB_CHECK_ASSERT(mb_test_bit(k, buddy2));
1075 +               }
1076 +       }
1077 +       MB_CHECK_ASSERT(!EXT3_MB_GRP_NEED_INIT(e3b->bd_info));
1078 +       MB_CHECK_ASSERT(e3b->bd_info->bb_fragments == fragments);
1079 +
1080 +       grp = EXT3_GROUP_INFO(sb, e3b->bd_group);
1081 +       buddy = mb_find_buddy(e3b, 0, &max);
1082 +       list_for_each(cur, &grp->bb_prealloc_list) {
1083 +               unsigned long groupnr;
1084 +               struct ext3_prealloc_space *pa;
1085 +               pa = list_entry(cur, struct ext3_prealloc_space, group_list);
1086 +               ext3_get_group_no_and_offset(sb, pa->pstart, &groupnr, &k);
1087 +               MB_CHECK_ASSERT(groupnr == e3b->bd_group);
1088 +               for (i = 0; i < pa->len; i++)
1089 +                       MB_CHECK_ASSERT(mb_test_bit(k + i, buddy));
1090 +       }
1091 +       return 0;
1092 +}
1093 +#undef MB_CHECK_ASSERT
1094 +#define mb_check_buddy(e3b) __mb_check_buddy(e3b,__FILE__,__FUNCTION__,__LINE__)
1095 +#else
1096 +#define mb_check_buddy(e3b)
1097 +#endif
1098 +
1099 +/* find most significant bit */
1100 +static int inline fmsb(unsigned short word)
1101 +{
1102 +       int order;
1103 +
1104 +       if (word > 255) {
1105 +               order = 7;
1106 +               word >>= 8;
1107 +       } else {
1108 +               order = -1;
1109 +       }
1110 +
1111 +       do {
1112 +               order++;
1113 +               word >>= 1;
1114 +       } while (word != 0);
1115 +
1116 +       return order;
1117 +}
1118 +
1119 +static void inline
1120 +ext3_mb_mark_free_simple(struct super_block *sb, void *buddy, unsigned first,
1121 +                               int len, struct ext3_group_info *grp)
1122 +{
1123 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
1124 +       unsigned short min, max, chunk, border;
1125 +
1126 +       BUG_ON(len >= EXT3_BLOCKS_PER_GROUP(sb));
1127 +
1128 +       border = 2 << sb->s_blocksize_bits;
1129 +
1130 +       while (len > 0) {
1131 +               /* find how many blocks can be covered since this position */
1132 +               max = ffs(first | border) - 1;
1133 +
1134 +               /* find how many blocks of power 2 we need to mark */
1135 +               min = fmsb(len);
1136 +
1137 +               if (max < min)
1138 +                       min = max;
1139 +               chunk = 1 << min;
1140 +
1141 +               /* mark multiblock chunks only */
1142 +               grp->bb_counters[min]++;
1143 +               if (min > 0)
1144 +                       mb_clear_bit(first >> min, buddy + sbi->s_mb_offsets[min]);
1145 +
1146 +               len -= chunk;
1147 +               first += chunk;
1148 +       }
1149 +}
1150 +
1151 +static int
1152 +ext3_mb_generate_buddy(struct super_block *sb, void *buddy, void *bitmap,
1153 +                       int group)
1154 +{
1155 +       struct ext3_group_info *grp = EXT3_GROUP_INFO(sb, group);
1156 +       unsigned short max = EXT3_BLOCKS_PER_GROUP(sb);
1157 +       unsigned short i = 0, first, len;
1158 +       unsigned free = 0, fragments = 0;
1159 +       unsigned long long period = get_cycles();
1160 +
1161 +       /* initialize buddy from bitmap which is aggregation
1162 +        * of on-disk bitmap and preallocations */
1163 +       i = mb_find_next_zero_bit(bitmap, max, 0);
1164 +       grp->bb_first_free = i;
1165 +       while (i < max) {
1166 +               fragments++;
1167 +               first = i;
1168 +               i = ext2_find_next_le_bit(bitmap, max, i);
1169 +               if (i > max)
1170 +                       i = max;
1171 +               len = i - first;
1172 +               free += len;
1173 +               if (len > 1)
1174 +                       ext3_mb_mark_free_simple(sb, buddy, first, len, grp);
1175 +               else
1176 +                       grp->bb_counters[0]++;
1177 +               if (i < max)
1178 +                       i = mb_find_next_zero_bit(bitmap, max, i);
1179 +       }
1180 +       grp->bb_fragments = fragments;
1181 +
1182 +       if (free != grp->bb_free) {
1183 +               struct ext3_group_desc *gdp;
1184 +               gdp = ext3_get_group_desc (sb, group, NULL);
1185 +               ext3_error(sb, __FUNCTION__,
1186 +                       "group %u: %u blocks in bitmap, %u in bb, "
1187 +                       "%u in gd, %lu pa's\n", group, free, grp->bb_free,
1188 +                       le16_to_cpu(gdp->bg_free_blocks_count),
1189 +                       grp->bb_prealloc_nr);
1190 +               return -EIO;
1191 +       }
1192 +
1193 +       clear_bit(EXT3_GROUP_INFO_NEED_INIT_BIT, &grp->bb_state);
1194 +
1195 +       period = get_cycles() - period;
1196 +       spin_lock(&EXT3_SB(sb)->s_bal_lock);
1197 +       EXT3_SB(sb)->s_mb_buddies_generated++;
1198 +       EXT3_SB(sb)->s_mb_generation_time += period;
1199 +       spin_unlock(&EXT3_SB(sb)->s_bal_lock);
1200 +
1201 +       return 0;
1202 +}
1203 +
1204 +static int ext3_mb_init_cache(struct page *page, char *incore)
1205 +{
1206 +       int blocksize, blocks_per_page, groups_per_page;
1207 +       int err = 0, i, first_group, first_block;
1208 +       struct super_block *sb;
1209 +       struct buffer_head *bhs;
1210 +       struct buffer_head **bh;
1211 +       struct inode *inode;
1212 +       char *data, *bitmap;
1213 +
1214 +       mb_debug("init page %lu\n", page->index);
1215 +
1216 +       inode = page->mapping->host;
1217 +       sb = inode->i_sb;
1218 +       blocksize = 1 << inode->i_blkbits;
1219 +       blocks_per_page = PAGE_CACHE_SIZE / blocksize;
1220 +
1221 +       groups_per_page = blocks_per_page >> 1;
1222 +       if (groups_per_page == 0)
1223 +               groups_per_page = 1;
1224 +
1225 +       /* allocate buffer_heads to read bitmaps */
1226 +       if (groups_per_page > 1) {
1227 +               err = -ENOMEM;
1228 +               i = sizeof(struct buffer_head *) * groups_per_page;
1229 +               bh = kmalloc(i, GFP_NOFS);
1230 +               if (bh == NULL)
1231 +                       goto out;
1232 +               memset(bh, 0, i);
1233 +       } else
1234 +               bh = &bhs;
1235 +
1236 +       first_group = page->index * blocks_per_page / 2;
1237 +
1238 +       /* read all groups the page covers into the cache */
1239 +       for (i = 0; i < groups_per_page; i++) {
1240 +               struct ext3_group_desc * desc;
1241 +
1242 +               if (first_group + i >= EXT3_SB(sb)->s_groups_count)
1243 +                       break;
1244 +
1245 +               err = -EIO;
1246 +               desc = ext3_get_group_desc(sb, first_group + i, NULL);
1247 +               if (desc == NULL)
1248 +                       goto out;
1249 +
1250 +               err = -ENOMEM;
1251 +               bh[i] = sb_getblk(sb, le32_to_cpu(desc->bg_block_bitmap));
1252 +               if (bh[i] == NULL)
1253 +                       goto out;
1254 +
1255 +               if (buffer_uptodate(bh[i]))
1256 +                       continue;
1257 +
1258 +               lock_buffer(bh[i]);
1259 +               if (buffer_uptodate(bh[i])) {
1260 +                       unlock_buffer(bh[i]);
1261 +                       continue;
1262 +               }
1263 +
1264 +               get_bh(bh[i]);
1265 +               bh[i]->b_end_io = end_buffer_read_sync;
1266 +               submit_bh(READ, bh[i]);
1267 +               mb_debug("read bitmap for group %u\n", first_group + i);
1268 +       }
1269 +
1270 +       /* wait for I/O completion */
1271 +       for (i = 0; i < groups_per_page && bh[i]; i++)
1272 +               wait_on_buffer(bh[i]);
1273 +
1274 +       err = -EIO;
1275 +       for (i = 0; i < groups_per_page && bh[i]; i++)
1276 +               if (!buffer_uptodate(bh[i]))
1277 +                       goto out;
1278 +
1279 +       err = 0;
1280 +       first_block = page->index * blocks_per_page;
1281 +       for (i = 0; i < blocks_per_page && err == 0; i++) {
1282 +               int group;
1283 +
1284 +               group = (first_block + i) >> 1;
1285 +               if (group >= EXT3_SB(sb)->s_groups_count)
1286 +                       break;
1287 +
1288 +               data = page_address(page) + (i * blocksize);
1289 +               bitmap = bh[group - first_group]->b_data;
1290 +
1291 +               if ((first_block + i) & 1) {
1292 +                       /* this is block of buddy */
1293 +                       BUG_ON(incore == NULL);
1294 +                       mb_debug("put buddy for group %u in page %lu/%x\n",
1295 +                               group, page->index, i * blocksize);
1296 +                       memset(data, 0xff, blocksize);
1297 +                       EXT3_GROUP_INFO(sb, group)->bb_fragments = 0;
1298 +                       memset(EXT3_GROUP_INFO(sb, group)->bb_counters, 0,
1299 +                              sizeof(unsigned short)*(sb->s_blocksize_bits+2));
1300 +                       err = ext3_mb_generate_buddy(sb, data, incore, group);
1301 +                       incore = NULL;
1302 +               } else {
1303 +                       /* this is block of bitmap */
1304 +                       BUG_ON(incore != NULL);
1305 +                       mb_debug("put bitmap for group %u in page %lu/%x\n",
1306 +                               group, page->index, i * blocksize);
1307 +
1308 +                       /* see comments in ext3_mb_put_pa() */
1309 +                       ext3_lock_group(sb, group);
1310 +                       memcpy(data, bitmap, blocksize);
1311 +
1312 +                       /* mark all preallocated blocks used in in-core bitmap */
1313 +                       err = ext3_mb_generate_from_pa(sb, data, group);
1314 +                       ext3_unlock_group(sb, group);
1315 +
1316 +                       incore = data;
1317 +               }
1318 +       }
1319 +       if (likely(err == 0))
1320 +               SetPageUptodate(page);
1321 +
1322 +out:
1323 +       if (bh) {
1324 +               for (i = 0; i < groups_per_page && bh[i]; i++)
1325 +                       brelse(bh[i]);
1326 +               if (bh != &bhs)
1327 +                       kfree(bh);
1328 +       }
1329 +       return err;
1330 +}
1331 +
1332 +static int ext3_mb_load_buddy(struct super_block *sb, int group,
1333 +               struct ext3_buddy *e3b)
1334 +{
1335 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
1336 +       struct inode *inode = sbi->s_buddy_cache;
1337 +       int blocks_per_page, block, pnum, poff;
1338 +       struct page *page;
1339 +
1340 +       mb_debug("load group %u\n", group);
1341 +
1342 +       blocks_per_page = PAGE_CACHE_SIZE / sb->s_blocksize;
1343 +
1344 +       e3b->bd_blkbits = sb->s_blocksize_bits;
1345 +       e3b->bd_info = EXT3_GROUP_INFO(sb, group);
1346 +       e3b->bd_sb = sb;
1347 +       e3b->bd_group = group;
1348 +       e3b->bd_buddy_page = NULL;
1349 +       e3b->bd_bitmap_page = NULL;
1350 +
1351 +       block = group * 2;
1352 +       pnum = block / blocks_per_page;
1353 +       poff = block % blocks_per_page;
1354 +
1355 +       /* we could use find_or_create_page(), but it locks page
1356 +        * what we'd like to avoid in fast path ... */
1357 +       page = find_get_page(inode->i_mapping, pnum);
1358 +       if (page == NULL || !PageUptodate(page)) {
1359 +               if (page)
1360 +                       page_cache_release(page);
1361 +               page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS);
1362 +               if (page) {
1363 +                       BUG_ON(page->mapping != inode->i_mapping);
1364 +                       if (!PageUptodate(page)) {
1365 +                               ext3_mb_init_cache(page, NULL);
1366 +                               mb_cmp_bitmaps(e3b, page_address(page) +
1367 +                                              (poff * sb->s_blocksize));
1368 +                       }
1369 +                       unlock_page(page);
1370 +               }
1371 +       }
1372 +       if (page == NULL || !PageUptodate(page))
1373 +               goto err;
1374 +       e3b->bd_bitmap_page = page;
1375 +       e3b->bd_bitmap = page_address(page) + (poff * sb->s_blocksize);
1376 +       mark_page_accessed(page);
1377 +
1378 +       block++;
1379 +       pnum = block / blocks_per_page;
1380 +       poff = block % blocks_per_page;
1381 +
1382 +       page = find_get_page(inode->i_mapping, pnum);
1383 +       if (page == NULL || !PageUptodate(page)) {
1384 +               if (page)
1385 +                       page_cache_release(page);
1386 +               page = find_or_create_page(inode->i_mapping, pnum, GFP_NOFS);
1387 +               if (page) {
1388 +                       BUG_ON(page->mapping != inode->i_mapping);
1389 +                       if (!PageUptodate(page))
1390 +                               ext3_mb_init_cache(page, e3b->bd_bitmap);
1391 +
1392 +                       unlock_page(page);
1393 +               }
1394 +       }
1395 +       if (page == NULL || !PageUptodate(page))
1396 +               goto err;
1397 +       e3b->bd_buddy_page = page;
1398 +       e3b->bd_buddy = page_address(page) + (poff * sb->s_blocksize);
1399 +       mark_page_accessed(page);
1400 +
1401 +       BUG_ON(e3b->bd_bitmap_page == NULL);
1402 +       BUG_ON(e3b->bd_buddy_page == NULL);
1403 +
1404 +       return 0;
1405 +
1406 +err:
1407 +       if (e3b->bd_bitmap_page)
1408 +               page_cache_release(e3b->bd_bitmap_page);
1409 +       if (e3b->bd_buddy_page)
1410 +               page_cache_release(e3b->bd_buddy_page);
1411 +       e3b->bd_buddy = NULL;
1412 +       e3b->bd_bitmap = NULL;
1413 +       return -EIO;
1414 +}
1415 +
1416 +static void ext3_mb_release_desc(struct ext3_buddy *e3b)
1417 +{
1418 +       if (e3b->bd_bitmap_page)
1419 +               page_cache_release(e3b->bd_bitmap_page);
1420 +       if (e3b->bd_buddy_page)
1421 +               page_cache_release(e3b->bd_buddy_page);
1422 +}
1423 +
1424 +
1425 +static int mb_find_order_for_block(struct ext3_buddy *e3b, int block)
1426 +{
1427 +       int order = 1;
1428 +       void *bb;
1429 +
1430 +       BUG_ON(EXT3_MB_BITMAP(e3b) == EXT3_MB_BUDDY(e3b));
1431 +       BUG_ON(block >= (1 << (e3b->bd_blkbits + 3)));
1432 +
1433 +       bb = EXT3_MB_BUDDY(e3b);
1434 +       while (order <= e3b->bd_blkbits + 1) {
1435 +               block = block >> 1;
1436 +               if (!mb_test_bit(block, bb)) {
1437 +                       /* this block is part of buddy of order 'order' */
1438 +                       return order;
1439 +               }
1440 +               bb += 1 << (e3b->bd_blkbits - order);
1441 +               order++;
1442 +       }
1443 +       return 0;
1444 +}
1445 +
1446 +static inline void mb_clear_bits(spinlock_t *lock, void *bm, int cur, int len)
1447 +{
1448 +       __u32 *addr;
1449 +
1450 +       len = cur + len;
1451 +       while (cur < len) {
1452 +               if ((cur & 31) == 0 && (len - cur) >= 32) {
1453 +                       /* fast path: clear whole word at once */
1454 +                       addr = bm + (cur >> 3);
1455 +                       *addr = 0;
1456 +                       cur += 32;
1457 +                       continue;
1458 +               }
1459 +               if (lock)
1460 +                       mb_clear_bit_atomic(lock, cur, bm);
1461 +               else
1462 +                       mb_clear_bit(cur, bm);
1463 +               cur++;
1464 +       }
1465 +}
1466 +
1467 +static inline void mb_set_bits(spinlock_t *lock, void *bm, int cur, int len)
1468 +{
1469 +       __u32 *addr;
1470 +
1471 +       len = cur + len;
1472 +       while (cur < len) {
1473 +               if ((cur & 31) == 0 && (len - cur) >= 32) {
1474 +                       /* fast path: clear whole word at once */
1475 +                       addr = bm + (cur >> 3);
1476 +                       *addr = 0xffffffff;
1477 +                       cur += 32;
1478 +                       continue;
1479 +               }
1480 +               if (lock)
1481 +                       mb_set_bit_atomic(lock, cur, bm);
1482 +               else
1483 +                       mb_set_bit(cur, bm);
1484 +               cur++;
1485 +       }
1486 +}
1487 +
1488 +static int mb_free_blocks(struct inode *inode, struct ext3_buddy *e3b,
1489 +                         int first, int count)
1490 +{
1491 +       int block = 0, max = 0, order;
1492 +       void *buddy, *buddy2;
1493 +       struct super_block *sb = e3b->bd_sb;
1494 +
1495 +       BUG_ON(first + count > (sb->s_blocksize << 3));
1496 +       BUG_ON(!ext3_is_group_locked(sb, e3b->bd_group));
1497 +       mb_check_buddy(e3b);
1498 +       mb_free_blocks_double(inode, e3b, first, count);
1499 +
1500 +       e3b->bd_info->bb_free += count;
1501 +       if (first < e3b->bd_info->bb_first_free)
1502 +               e3b->bd_info->bb_first_free = first;
1503 +
1504 +       /* let's maintain fragments counter */
1505 +       if (first != 0)
1506 +               block = !mb_test_bit(first - 1, EXT3_MB_BITMAP(e3b));
1507 +       if (first + count < EXT3_SB(sb)->s_mb_maxs[0])
1508 +               max = !mb_test_bit(first + count, EXT3_MB_BITMAP(e3b));
1509 +       if (block && max)
1510 +               e3b->bd_info->bb_fragments--;
1511 +       else if (!block && !max)
1512 +               e3b->bd_info->bb_fragments++;
1513 +
1514 +       /* let's maintain buddy itself */
1515 +       while (count-- > 0) {
1516 +               block = first++;
1517 +               order = 0;
1518 +
1519 +               if (!mb_test_bit(block, EXT3_MB_BITMAP(e3b))) {
1520 +                       unsigned long blocknr;
1521 +                       blocknr = e3b->bd_group * EXT3_BLOCKS_PER_GROUP(sb);
1522 +                       blocknr += block;
1523 +                       blocknr +=
1524 +                           le32_to_cpu(EXT3_SB(sb)->s_es->s_first_data_block);
1525 +
1526 +                       ext3_error(sb, __FUNCTION__, "double-free of inode"
1527 +                                  " %lu's block %lu(bit %u in group %u)\n",
1528 +                                  inode ? inode->i_ino : 0, blocknr, block,
1529 +                                  e3b->bd_group);
1530 +               }
1531 +               mb_clear_bit(block, EXT3_MB_BITMAP(e3b));
1532 +               e3b->bd_info->bb_counters[order]++;
1533 +
1534 +               /* start of the buddy */
1535 +               buddy = mb_find_buddy(e3b, order, &max);
1536 +
1537 +               do {
1538 +                       block &= ~1UL;
1539 +                       if (mb_test_bit(block, buddy) ||
1540 +                                       mb_test_bit(block + 1, buddy))
1541 +                               break;
1542 +
1543 +                       /* both the buddies are free, try to coalesce them */
1544 +                       buddy2 = mb_find_buddy(e3b, order + 1, &max);
1545 +
1546 +                       if (!buddy2)
1547 +                               break;
1548 +
1549 +                       if (order > 0) {
1550 +                               /* for special purposes, we don't set
1551 +                                * free bits in bitmap */
1552 +                               mb_set_bit(block, buddy);
1553 +                               mb_set_bit(block + 1, buddy);
1554 +                       }
1555 +                       e3b->bd_info->bb_counters[order]--;
1556 +                       e3b->bd_info->bb_counters[order]--;
1557 +
1558 +                       block = block >> 1;
1559 +                       order++;
1560 +                       e3b->bd_info->bb_counters[order]++;
1561 +
1562 +                       mb_clear_bit(block, buddy2);
1563 +                       buddy = buddy2;
1564 +               } while (1);
1565 +       }
1566 +       mb_check_buddy(e3b);
1567 +
1568 +       return 0;
1569 +}
1570 +
1571 +static int mb_find_extent(struct ext3_buddy *e3b, int order, int block,
1572 +                               int needed, struct ext3_free_extent *ex)
1573 +{
1574 +       int next = block, max, ord;
1575 +       void *buddy;
1576 +
1577 +       BUG_ON(!ext3_is_group_locked(e3b->bd_sb, e3b->bd_group));
1578 +       BUG_ON(ex == NULL);
1579 +
1580 +       buddy = mb_find_buddy(e3b, order, &max);
1581 +       BUG_ON(buddy == NULL);
1582 +       BUG_ON(block >= max);
1583 +       if (mb_test_bit(block, buddy)) {
1584 +               ex->fe_len = 0;
1585 +               ex->fe_start = 0;
1586 +               ex->fe_group = 0;
1587 +               return 0;
1588 +       }
1589 +
1590 +       if (likely(order == 0)) {
1591 +               /* find actual order */
1592 +               order = mb_find_order_for_block(e3b, block);
1593 +               block = block >> order;
1594 +       }
1595 +
1596 +       ex->fe_len = 1 << order;
1597 +       ex->fe_start = block << order;
1598 +       ex->fe_group = e3b->bd_group;
1599 +
1600 +       /* calc difference from given start */
1601 +       next = next - ex->fe_start;
1602 +       ex->fe_len -= next;
1603 +       ex->fe_start += next;
1604 +
1605 +       while (needed > ex->fe_len && (buddy = mb_find_buddy(e3b, order, &max))) {
1606 +
1607 +               if (block + 1 >= max)
1608 +                       break;
1609 +
1610 +               next = (block + 1) * (1 << order);
1611 +               if (mb_test_bit(next, EXT3_MB_BITMAP(e3b)))
1612 +                       break;
1613 +
1614 +               ord = mb_find_order_for_block(e3b, next);
1615 +
1616 +               order = ord;
1617 +               block = next >> order;
1618 +               ex->fe_len += 1 << order;
1619 +       }
1620 +
1621 +       BUG_ON(ex->fe_start + ex->fe_len > (1 << (e3b->bd_blkbits + 3)));
1622 +       return ex->fe_len;
1623 +}
1624 +
1625 +static int mb_mark_used(struct ext3_buddy *e3b, struct ext3_free_extent *ex)
1626 +{
1627 +       int ord, mlen = 0, max = 0, cur;
1628 +       int start = ex->fe_start;
1629 +       int len = ex->fe_len;
1630 +       unsigned ret = 0;
1631 +       int len0 = len;
1632 +       void *buddy;
1633 +
1634 +       BUG_ON(start + len > (e3b->bd_sb->s_blocksize << 3));
1635 +       BUG_ON(e3b->bd_group != ex->fe_group);
1636 +       BUG_ON(!ext3_is_group_locked(e3b->bd_sb, e3b->bd_group));
1637 +       spin_lock(sb_bgl_lock(EXT3_SB(e3b->bd_sb), ex->fe_group));
1638 +       mb_check_buddy(e3b);
1639 +       mb_mark_used_double(e3b, start, len);
1640 +
1641 +       e3b->bd_info->bb_free -= len;
1642 +       if (e3b->bd_info->bb_first_free == start)
1643 +               e3b->bd_info->bb_first_free += len;
1644 +
1645 +       /* let's maintain fragments counter */
1646 +       if (start != 0)
1647 +               mlen = !mb_test_bit(start - 1, EXT3_MB_BITMAP(e3b));
1648 +       if (start + len < EXT3_SB(e3b->bd_sb)->s_mb_maxs[0])
1649 +               max = !mb_test_bit(start + len, EXT3_MB_BITMAP(e3b));
1650 +       if (mlen && max)
1651 +               e3b->bd_info->bb_fragments++;
1652 +       else if (!mlen && !max)
1653 +               e3b->bd_info->bb_fragments--;
1654 +
1655 +       /* let's maintain buddy itself */
1656 +       while (len) {
1657 +               ord = mb_find_order_for_block(e3b, start);
1658 +
1659 +               if (((start >> ord) << ord) == start && len >= (1 << ord)) {
1660 +                       /* the whole chunk may be allocated at once! */
1661 +                       mlen = 1 << ord;
1662 +                       buddy = mb_find_buddy(e3b, ord, &max);
1663 +                       BUG_ON((start >> ord) >= max);
1664 +                       mb_set_bit(start >> ord, buddy);
1665 +                       e3b->bd_info->bb_counters[ord]--;
1666 +                       start += mlen;
1667 +                       len -= mlen;
1668 +                       BUG_ON(len < 0);
1669 +                       continue;
1670 +               }
1671 +
1672 +               /* store for history */
1673 +               if (ret == 0)
1674 +                       ret = len | (ord << 16);
1675 +
1676 +               /* we have to split large buddy */
1677 +               BUG_ON(ord <= 0);
1678 +               buddy = mb_find_buddy(e3b, ord, &max);
1679 +               mb_set_bit(start >> ord, buddy);
1680 +               e3b->bd_info->bb_counters[ord]--;
1681 +
1682 +               ord--;
1683 +               cur = (start >> ord) & ~1U;
1684 +               buddy = mb_find_buddy(e3b, ord, &max);
1685 +               mb_clear_bit(cur, buddy);
1686 +               mb_clear_bit(cur + 1, buddy);
1687 +               e3b->bd_info->bb_counters[ord]++;
1688 +               e3b->bd_info->bb_counters[ord]++;
1689 +       }
1690 +
1691 +       mb_set_bits(NULL, EXT3_MB_BITMAP(e3b), ex->fe_start, len0);
1692 +       mb_check_buddy(e3b);
1693 +       spin_unlock(sb_bgl_lock(EXT3_SB(e3b->bd_sb), ex->fe_group));
1694 +
1695 +       return ret;
1696 +}
1697 +
1698 +/*
1699 + * Must be called under group lock!
1700 + */
1701 +static void ext3_mb_use_best_found(struct ext3_allocation_context *ac,
1702 +                                       struct ext3_buddy *e3b)
1703 +{
1704 +       struct ext3_sb_info *sbi = EXT3_SB(ac->ac_sb);
1705 +       unsigned long ret;
1706 +
1707 +       BUG_ON(ac->ac_b_ex.fe_group != e3b->bd_group);
1708 +       BUG_ON(ac->ac_status == AC_STATUS_FOUND);
1709 +
1710 +       ac->ac_b_ex.fe_len = min(ac->ac_b_ex.fe_len, ac->ac_g_ex.fe_len);
1711 +       ac->ac_b_ex.fe_logical = ac->ac_g_ex.fe_logical;
1712 +       ret = mb_mark_used(e3b, &ac->ac_b_ex);
1713 +
1714 +       /* preallocation can change ac_b_ex, thus we store actually
1715 +        * allocated blocks for history */
1716 +       ac->ac_f_ex = ac->ac_b_ex;
1717 +
1718 +       ac->ac_status = AC_STATUS_FOUND;
1719 +       ac->ac_tail = ret & 0xffff;
1720 +       ac->ac_buddy = ret >> 16;
1721 +
1722 +       /* XXXXXXX: SUCH A HORRIBLE **CK */
1723 +       ac->ac_bitmap_page = e3b->bd_bitmap_page;
1724 +       get_page(ac->ac_bitmap_page);
1725 +       ac->ac_buddy_page = e3b->bd_buddy_page;
1726 +       get_page(ac->ac_buddy_page);
1727 +
1728 +       /* store last allocated for subsequent stream allocation */
1729 +       if ((ac->ac_flags & EXT3_MB_HINT_DATA)) {
1730 +               spin_lock(&sbi->s_md_lock);
1731 +               sbi->s_mb_last_group = ac->ac_f_ex.fe_group;
1732 +               sbi->s_mb_last_start = ac->ac_f_ex.fe_start;
1733 +               spin_unlock(&sbi->s_md_lock);
1734 +       }
1735 +}
1736 +
1737 +/*
1738 + * regular allocator, for general purposes allocation
1739 + */
1740 +
1741 +void ext3_mb_check_limits(struct ext3_allocation_context *ac,
1742 +                                       struct ext3_buddy *e3b,
1743 +                                       int finish_group)
1744 +{
1745 +       struct ext3_sb_info *sbi = EXT3_SB(ac->ac_sb);
1746 +       struct ext3_free_extent *bex = &ac->ac_b_ex;
1747 +       struct ext3_free_extent *gex = &ac->ac_g_ex;
1748 +       struct ext3_free_extent ex;
1749 +       int max;
1750 +
1751 +       /*
1752 +        * We don't want to scan for a whole year
1753 +        */
1754 +       if (ac->ac_found > sbi->s_mb_max_to_scan &&
1755 +                       !(ac->ac_flags & EXT3_MB_HINT_FIRST)) {
1756 +               ac->ac_status = AC_STATUS_BREAK;
1757 +               return;
1758 +       }
1759 +
1760 +       /*
1761 +        * Haven't found good chunk so far, let's continue
1762 +        */
1763 +       if (bex->fe_len < gex->fe_len)
1764 +               return;
1765 +
1766 +       if ((finish_group || ac->ac_found > sbi->s_mb_min_to_scan)
1767 +                       && bex->fe_group == e3b->bd_group) {
1768 +               /* recheck chunk's availability - we don't know
1769 +                * when it was found (within this lock-unlock
1770 +                * period or not) */
1771 +               max = mb_find_extent(e3b, 0, bex->fe_start, gex->fe_len, &ex);
1772 +               if (max >= gex->fe_len) {
1773 +                       ext3_mb_use_best_found(ac, e3b);
1774 +                       return;
1775 +               }
1776 +       }
1777 +}
1778 +
1779 +/*
1780 + * The routine checks whether found extent is good enough. If it is,
1781 + * then the extent gets marked used and flag is set to the context
1782 + * to stop scanning. Otherwise, the extent is compared with the
1783 + * previous found extent and if new one is better, then it's stored
1784 + * in the context. Later, the best found extent will be used, if
1785 + * mballoc can't find good enough extent.
1786 + *
1787 + * FIXME: real allocation policy is to be designed yet!
1788 + */
1789 +static void ext3_mb_measure_extent(struct ext3_allocation_context *ac,
1790 +                                       struct ext3_free_extent *ex,
1791 +                                       struct ext3_buddy *e3b)
1792 +{
1793 +       struct ext3_free_extent *bex = &ac->ac_b_ex;
1794 +       struct ext3_free_extent *gex = &ac->ac_g_ex;
1795 +
1796 +       BUG_ON(ex->fe_len <= 0);
1797 +       BUG_ON(ex->fe_len >= EXT3_BLOCKS_PER_GROUP(ac->ac_sb));
1798 +       BUG_ON(ex->fe_start >= EXT3_BLOCKS_PER_GROUP(ac->ac_sb));
1799 +       BUG_ON(ac->ac_status != AC_STATUS_CONTINUE);
1800 +
1801 +       ac->ac_found++;
1802 +
1803 +       /*
1804 +        * The special case - take what you catch first
1805 +        */
1806 +       if (unlikely(ac->ac_flags & EXT3_MB_HINT_FIRST)) {
1807 +               *bex = *ex;
1808 +               ext3_mb_use_best_found(ac, e3b);
1809 +               return;
1810 +       }
1811 +
1812 +       /*
1813 +        * Let's check whether the chuck is good enough
1814 +        */
1815 +       if (ex->fe_len == gex->fe_len) {
1816 +               *bex = *ex;
1817 +               ext3_mb_use_best_found(ac, e3b);
1818 +               return;
1819 +       }
1820 +
1821 +       /*
1822 +        * If this is first found extent, just store it in the context
1823 +        */
1824 +       if (bex->fe_len == 0) {
1825 +               *bex = *ex;
1826 +               return;
1827 +       }
1828 +
1829 +       /*
1830 +        * If new found extent is better, store it in the context
1831 +        */
1832 +       if (bex->fe_len < gex->fe_len) {
1833 +               /* if the request isn't satisfied, any found extent
1834 +                * larger than previous best one is better */
1835 +               if (ex->fe_len > bex->fe_len)
1836 +                       *bex = *ex;
1837 +       } else if (ex->fe_len > gex->fe_len) {
1838 +               /* if the request is satisfied, then we try to find
1839 +                * an extent that still satisfy the request, but is
1840 +                * smaller than previous one */
1841 +               if (ex->fe_len < bex->fe_len)
1842 +                       *bex = *ex;
1843 +       }
1844 +
1845 +       ext3_mb_check_limits(ac, e3b, 0);
1846 +}
1847 +
1848 +static int ext3_mb_try_best_found(struct ext3_allocation_context *ac,
1849 +                                       struct ext3_buddy *e3b)
1850 +{
1851 +       struct ext3_free_extent ex = ac->ac_b_ex;
1852 +       int group = ex.fe_group, max, err;
1853 +
1854 +       BUG_ON(ex.fe_len <= 0);
1855 +       err = ext3_mb_load_buddy(ac->ac_sb, group, e3b);
1856 +       if (err)
1857 +               return err;
1858 +
1859 +       ext3_lock_group(ac->ac_sb, group);
1860 +       max = mb_find_extent(e3b, 0, ex.fe_start, ex.fe_len, &ex);
1861 +
1862 +       if (max > 0) {
1863 +               ac->ac_b_ex = ex;
1864 +               ext3_mb_use_best_found(ac, e3b);
1865 +       }
1866 +
1867 +       ext3_unlock_group(ac->ac_sb, group);
1868 +       ext3_mb_release_desc(e3b);
1869 +
1870 +       return 0;
1871 +}
1872 +
1873 +static int ext3_mb_find_by_goal(struct ext3_allocation_context *ac,
1874 +                               struct ext3_buddy *e3b)
1875 +{
1876 +       int group = ac->ac_g_ex.fe_group, max, err;
1877 +       struct ext3_sb_info *sbi = EXT3_SB(ac->ac_sb);
1878 +       struct ext3_super_block *es = sbi->s_es;
1879 +       struct ext3_free_extent ex;
1880 +
1881 +       if (!(ac->ac_flags & EXT3_MB_HINT_TRY_GOAL))
1882 +               return 0;
1883 +
1884 +       err = ext3_mb_load_buddy(ac->ac_sb, group, e3b);
1885 +       if (err)
1886 +               return err;
1887 +
1888 +       ext3_lock_group(ac->ac_sb, group);
1889 +       max = mb_find_extent(e3b, 0, ac->ac_g_ex.fe_start,
1890 +                            ac->ac_g_ex.fe_len, &ex);
1891 +
1892 +       if (max >= ac->ac_g_ex.fe_len && ac->ac_g_ex.fe_len == sbi->s_stripe) {
1893 +               unsigned long start;
1894 +               start = (e3b->bd_group * EXT3_BLOCKS_PER_GROUP(ac->ac_sb) +
1895 +                       ex.fe_start + le32_to_cpu(es->s_first_data_block));
1896 +               if (start % sbi->s_stripe == 0) {
1897 +                       ac->ac_found++;
1898 +                       ac->ac_b_ex = ex;
1899 +                       ext3_mb_use_best_found(ac, e3b);
1900 +               }
1901 +       } else if (max >= ac->ac_g_ex.fe_len) {
1902 +               BUG_ON(ex.fe_len <= 0);
1903 +               BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group);
1904 +               BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start);
1905 +               ac->ac_found++;
1906 +               ac->ac_b_ex = ex;
1907 +               ext3_mb_use_best_found(ac, e3b);
1908 +       } else if (max > 0 && (ac->ac_flags & EXT3_MB_HINT_MERGE)) {
1909 +               /* Sometimes, caller may want to merge even small
1910 +                * number of blocks to an existing extent */
1911 +               BUG_ON(ex.fe_len <= 0);
1912 +               BUG_ON(ex.fe_group != ac->ac_g_ex.fe_group);
1913 +               BUG_ON(ex.fe_start != ac->ac_g_ex.fe_start);
1914 +               ac->ac_found++;
1915 +               ac->ac_b_ex = ex;
1916 +               ext3_mb_use_best_found(ac, e3b);
1917 +       }
1918 +       ext3_unlock_group(ac->ac_sb, group);
1919 +       ext3_mb_release_desc(e3b);
1920 +
1921 +       return 0;
1922 +}
1923 +
1924 +/*
1925 + * The routine scans buddy structures (not bitmap!) from given order
1926 + * to max order and tries to find big enough chunk to satisfy the req
1927 + */
1928 +static void ext3_mb_simple_scan_group(struct ext3_allocation_context *ac,
1929 +                                       struct ext3_buddy *e3b)
1930 +{
1931 +       struct super_block *sb = ac->ac_sb;
1932 +       struct ext3_group_info *grp = e3b->bd_info;
1933 +       void *buddy;
1934 +       int i, k, max;
1935 +
1936 +       BUG_ON(ac->ac_2order <= 0);
1937 +       for (i = ac->ac_2order; i <= sb->s_blocksize_bits + 1; i++) {
1938 +               if (grp->bb_counters[i] == 0)
1939 +                       continue;
1940 +
1941 +               buddy = mb_find_buddy(e3b, i, &max);
1942 +               BUG_ON(buddy == NULL);
1943 +
1944 +               k = mb_find_next_zero_bit(buddy, max, 0);
1945 +               BUG_ON(k >= max);
1946 +
1947 +               ac->ac_found++;
1948 +
1949 +               ac->ac_b_ex.fe_len = 1 << i;
1950 +               ac->ac_b_ex.fe_start = k << i;
1951 +               ac->ac_b_ex.fe_group = e3b->bd_group;
1952 +
1953 +               ext3_mb_use_best_found(ac, e3b);
1954 +
1955 +               BUG_ON(ac->ac_b_ex.fe_len != ac->ac_g_ex.fe_len);
1956 +
1957 +               if (EXT3_SB(sb)->s_mb_stats)
1958 +                       atomic_inc(&EXT3_SB(sb)->s_bal_2orders);
1959 +
1960 +               break;
1961 +       }
1962 +}
1963 +
1964 +/*
1965 + * The routine scans the group and measures all found extents.
1966 + * In order to optimize scanning, caller must pass number of
1967 + * free blocks in the group, so the routine can know upper limit.
1968 + */
1969 +static void ext3_mb_complex_scan_group(struct ext3_allocation_context *ac,
1970 +                                       struct ext3_buddy *e3b)
1971 +{
1972 +       struct super_block *sb = ac->ac_sb;
1973 +       void *bitmap = EXT3_MB_BITMAP(e3b);
1974 +       struct ext3_free_extent ex;
1975 +       int i, free;
1976 +
1977 +       free = e3b->bd_info->bb_free;
1978 +       BUG_ON(free <= 0);
1979 +
1980 +       i = e3b->bd_info->bb_first_free;
1981 +
1982 +       while (free && ac->ac_status == AC_STATUS_CONTINUE) {
1983 +               i = mb_find_next_zero_bit(bitmap, EXT3_BLOCKS_PER_GROUP(sb), i);
1984 +               if (i >= EXT3_BLOCKS_PER_GROUP(sb)) {
1985 +                       BUG_ON(free != 0);
1986 +                       break;
1987 +               }
1988 +
1989 +               mb_find_extent(e3b, 0, i, ac->ac_g_ex.fe_len, &ex);
1990 +               BUG_ON(ex.fe_len <= 0);
1991 +               BUG_ON(free < ex.fe_len);
1992 +
1993 +               ext3_mb_measure_extent(ac, &ex, e3b);
1994 +
1995 +               i += ex.fe_len;
1996 +               free -= ex.fe_len;
1997 +       }
1998 +
1999 +       ext3_mb_check_limits(ac, e3b, 1);
2000 +}
2001 +
2002 +/*
2003 + * This is a special case for storages like raid5
2004 + * we try to find stripe-aligned chunks for stripe-size requests
2005 + */
2006 +static void ext3_mb_scan_aligned(struct ext3_allocation_context *ac,
2007 +                                struct ext3_buddy *e3b)
2008 +{
2009 +       struct super_block *sb = ac->ac_sb;
2010 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2011 +       void *bitmap = EXT3_MB_BITMAP(e3b);
2012 +       struct ext3_free_extent ex;
2013 +       unsigned long i, max;
2014 +
2015 +       BUG_ON(sbi->s_stripe == 0);
2016 +
2017 +       /* find first stripe-aligned block */
2018 +       i = e3b->bd_group * EXT3_BLOCKS_PER_GROUP(sb)
2019 +               + le32_to_cpu(sbi->s_es->s_first_data_block);
2020 +       i = ((i + sbi->s_stripe - 1) / sbi->s_stripe) * sbi->s_stripe;
2021 +       i = (i - le32_to_cpu(sbi->s_es->s_first_data_block))
2022 +                       % EXT3_BLOCKS_PER_GROUP(sb);
2023 +
2024 +       while (i < EXT3_BLOCKS_PER_GROUP(sb)) {
2025 +               if (!mb_test_bit(i, bitmap)) {
2026 +                       max = mb_find_extent(e3b, 0, i, sbi->s_stripe, &ex);
2027 +                       if (max >= sbi->s_stripe) {
2028 +                               ac->ac_found++;
2029 +                               ac->ac_b_ex = ex;
2030 +                               ext3_mb_use_best_found(ac, e3b);
2031 +                               break;
2032 +                       }
2033 +               }
2034 +               i += sbi->s_stripe;
2035 +       }
2036 +}
2037 +
2038 +static int ext3_mb_good_group(struct ext3_allocation_context *ac,
2039 +                               int group, int cr)
2040 +{
2041 +       struct ext3_group_info *grp = EXT3_GROUP_INFO(ac->ac_sb, group);
2042 +       unsigned free, fragments, i, bits;
2043 +
2044 +       BUG_ON(cr < 0 || cr >= 4);
2045 +       BUG_ON(EXT3_MB_GRP_NEED_INIT(grp));
2046 +
2047 +       free = grp->bb_free;
2048 +       fragments = grp->bb_fragments;
2049 +       if (free == 0)
2050 +               return 0;
2051 +       if (fragments == 0)
2052 +               return 0;
2053 +
2054 +       switch (cr) {
2055 +               case 0:
2056 +                       BUG_ON(ac->ac_2order == 0);
2057 +                       bits = ac->ac_sb->s_blocksize_bits + 1;
2058 +                       for (i = ac->ac_2order; i <= bits; i++)
2059 +                               if (grp->bb_counters[i] > 0)
2060 +                                       return 1;
2061 +                       break;
2062 +               case 1:
2063 +                       if ((free / fragments) >= ac->ac_g_ex.fe_len)
2064 +                               return 1;
2065 +                       break;
2066 +               case 2:
2067 +                       if (free >= ac->ac_g_ex.fe_len)
2068 +                               return 1;
2069 +                       break;
2070 +               case 3:
2071 +                       return 1;
2072 +               default:
2073 +                       BUG();
2074 +       }
2075 +
2076 +       return 0;
2077 +}
2078 +
2079 +int ext3_mb_regular_allocator(struct ext3_allocation_context *ac)
2080 +{
2081 +       int group, i, cr, err = 0;
2082 +       struct ext3_sb_info *sbi;
2083 +       struct super_block *sb;
2084 +       struct ext3_buddy e3b;
2085 +
2086 +       sb = ac->ac_sb;
2087 +       sbi = EXT3_SB(sb);
2088 +       BUG_ON(ac->ac_status == AC_STATUS_FOUND);
2089 +
2090 +       /* first, try the goal */
2091 +       err = ext3_mb_find_by_goal(ac, &e3b);
2092 +       if (err || ac->ac_status == AC_STATUS_FOUND)
2093 +               goto out;
2094 +
2095 +       if (unlikely(ac->ac_flags & EXT3_MB_HINT_GOAL_ONLY))
2096 +               goto out;
2097 +
2098 +       i = ffs(ac->ac_g_ex.fe_len);
2099 +       ac->ac_2order = 0;
2100 +       if (i >= sbi->s_mb_order2_reqs) {
2101 +               i--;
2102 +               if ((ac->ac_g_ex.fe_len & (~(1 << i))) == 0)
2103 +                       ac->ac_2order = i;
2104 +       }
2105 +
2106 +       /* if stream allocation is enabled, use global goal */
2107 +       if ((ac->ac_g_ex.fe_len < sbi->s_mb_large_req) &&
2108 +                       (ac->ac_flags & EXT3_MB_HINT_DATA)) {
2109 +               /* TBD: may be hot point */
2110 +               spin_lock(&sbi->s_md_lock);
2111 +               ac->ac_g_ex.fe_group = sbi->s_mb_last_group;
2112 +               ac->ac_g_ex.fe_start = sbi->s_mb_last_start;
2113 +               spin_unlock(&sbi->s_md_lock);
2114 +       }
2115 +
2116 +       group = ac->ac_g_ex.fe_group;
2117 +
2118 +       /* Let's just scan groups to find more-less suitable blocks */
2119 +       cr = ac->ac_2order ? 0 : 1;
2120 +repeat:
2121 +       for (; cr < 4 && ac->ac_status == AC_STATUS_CONTINUE; cr++) {
2122 +               ac->ac_criteria = cr;
2123 +               for (i = 0; i < EXT3_SB(sb)->s_groups_count; group++, i++) {
2124 +                       struct ext3_group_info *grp;
2125 +
2126 +                       if (group == EXT3_SB(sb)->s_groups_count)
2127 +                               group = 0;
2128 +
2129 +                       /* quick check to skip empty groups */
2130 +                       grp = EXT3_GROUP_INFO(ac->ac_sb, group);
2131 +                       if (grp->bb_free == 0)
2132 +                               continue;
2133 +
2134 +                       if (EXT3_MB_GRP_NEED_INIT(EXT3_GROUP_INFO(sb, group))) {
2135 +                               /* we need full data about the group
2136 +                                * to make a good selection */
2137 +                               err = ext3_mb_load_buddy(sb, group, &e3b);
2138 +                               if (err)
2139 +                                       goto out;
2140 +                               ext3_mb_release_desc(&e3b);
2141 +                       }
2142 +
2143 +                       /* check is group good for our criteries */
2144 +                       if (!ext3_mb_good_group(ac, group, cr))
2145 +                               continue;
2146 +
2147 +                       err = ext3_mb_load_buddy(sb, group, &e3b);
2148 +                       if (err)
2149 +                               goto out;
2150 +
2151 +                       ext3_lock_group(sb, group);
2152 +                       if (!ext3_mb_good_group(ac, group, cr)) {
2153 +                               /* someone did allocation from this group */
2154 +                               ext3_unlock_group(sb, group);
2155 +                               ext3_mb_release_desc(&e3b);
2156 +                               continue;
2157 +                       }
2158 +
2159 +                       ac->ac_groups_scanned++;
2160 +                       if (cr == 0)
2161 +                               ext3_mb_simple_scan_group(ac, &e3b);
2162 +                       else if (cr == 1 && ac->ac_g_ex.fe_len == sbi->s_stripe)
2163 +                               ext3_mb_scan_aligned(ac, &e3b);
2164 +                       else
2165 +                               ext3_mb_complex_scan_group(ac, &e3b);
2166 +
2167 +                       ext3_unlock_group(sb, group);
2168 +                       ext3_mb_release_desc(&e3b);
2169 +
2170 +                       if (ac->ac_status != AC_STATUS_CONTINUE)
2171 +                               break;
2172 +               }
2173 +       }
2174 +
2175 +       if (ac->ac_b_ex.fe_len > 0 && ac->ac_status != AC_STATUS_FOUND &&
2176 +           !(ac->ac_flags & EXT3_MB_HINT_FIRST)) {
2177 +               /*
2178 +                * We've been searching too long. Let's try to allocate
2179 +                * the best chunk we've found so far
2180 +                */
2181 +
2182 +               ext3_mb_try_best_found(ac, &e3b);
2183 +               if (ac->ac_status != AC_STATUS_FOUND) {
2184 +                       /*
2185 +                        * Someone more lucky has already allocated it.
2186 +                        * The only thing we can do is just take first
2187 +                        * found block(s)
2188 +                       printk(KERN_DEBUG "EXT3-fs: someone won our chunk\n");
2189 +                        */
2190 +                       ac->ac_b_ex.fe_group = 0;
2191 +                       ac->ac_b_ex.fe_start = 0;
2192 +                       ac->ac_b_ex.fe_len = 0;
2193 +                       ac->ac_status = AC_STATUS_CONTINUE;
2194 +                       ac->ac_flags |= EXT3_MB_HINT_FIRST;
2195 +                       cr = 3;
2196 +                       atomic_inc(&sbi->s_mb_lost_chunks);
2197 +                       goto repeat;
2198 +               }
2199 +       }
2200 +out:
2201 +       return err;
2202 +}
2203 +
2204 +#ifdef EXT3_MB_HISTORY
2205 +struct ext3_mb_proc_session {
2206 +       struct ext3_mb_history *history;
2207 +       struct super_block *sb;
2208 +       int start;
2209 +       int max;
2210 +};
2211 +
2212 +static void *ext3_mb_history_skip_empty(struct ext3_mb_proc_session *s,
2213 +                                       struct ext3_mb_history *hs,
2214 +                                       int first)
2215 +{
2216 +       if (hs == s->history + s->max)
2217 +               hs = s->history;
2218 +       if (!first && hs == s->history + s->start)
2219 +               return NULL;
2220 +       while (hs->orig.fe_len == 0) {
2221 +               hs++;
2222 +               if (hs == s->history + s->max)
2223 +                       hs = s->history;
2224 +               if (hs == s->history + s->start)
2225 +                       return NULL;
2226 +       }
2227 +       return hs;
2228 +}
2229 +
2230 +static void *ext3_mb_seq_history_start(struct seq_file *seq, loff_t *pos)
2231 +{
2232 +       struct ext3_mb_proc_session *s = seq->private;
2233 +       struct ext3_mb_history *hs;
2234 +       int l = *pos;
2235 +
2236 +       if (l == 0)
2237 +               return SEQ_START_TOKEN;
2238 +       hs = ext3_mb_history_skip_empty(s, s->history + s->start, 1);
2239 +       if (!hs)
2240 +               return NULL;
2241 +       while (--l && (hs = ext3_mb_history_skip_empty(s, ++hs, 0)) != NULL);
2242 +       return hs;
2243 +}
2244 +
2245 +static void *ext3_mb_seq_history_next(struct seq_file *seq, void *v, loff_t *pos)
2246 +{
2247 +       struct ext3_mb_proc_session *s = seq->private;
2248 +       struct ext3_mb_history *hs = v;
2249 +
2250 +       ++*pos;
2251 +       if (v == SEQ_START_TOKEN)
2252 +               return ext3_mb_history_skip_empty(s, s->history + s->start, 1);
2253 +       else
2254 +               return ext3_mb_history_skip_empty(s, ++hs, 0);
2255 +}
2256 +
2257 +static int ext3_mb_seq_history_show(struct seq_file *seq, void *v)
2258 +{
2259 +       char buf[25], buf2[25], buf3[25], *fmt;
2260 +       struct ext3_mb_history *hs = v;
2261 +
2262 +       if (v == SEQ_START_TOKEN) {
2263 +               seq_printf(seq, "%-5s %-8s %-23s %-23s %-23s %-5s "
2264 +                               "%-5s %-2s %-5s %-5s %-5s %-6s\n",
2265 +                          "pid", "inode", "original", "goal", "result","found",
2266 +                          "grps", "cr", "flags", "merge", "tail", "broken");
2267 +               return 0;
2268 +       }
2269 +
2270 +       if (hs->op == EXT3_MB_HISTORY_ALLOC) {
2271 +               fmt = "%-5u %-8u %-23s %-23s %-23s %-5u %-5u %-2u "
2272 +                       "%-5u %-5s %-5u %-6u\n";
2273 +               sprintf(buf2, "%lu/%lu/%lu@%lu", hs->result.fe_group,
2274 +                       hs->result.fe_start, hs->result.fe_len,
2275 +                       hs->result.fe_logical);
2276 +               sprintf(buf, "%lu/%lu/%lu@%lu", hs->orig.fe_group,
2277 +                       hs->orig.fe_start, hs->orig.fe_len,
2278 +                       hs->orig.fe_logical);
2279 +               sprintf(buf3, "%lu/%lu/%lu@%lu", hs->goal.fe_group,
2280 +                       hs->goal.fe_start, hs->goal.fe_len,
2281 +                       hs->goal.fe_logical);
2282 +               seq_printf(seq, fmt, hs->pid, hs->ino, buf, buf3, buf2,
2283 +                               hs->found, hs->groups, hs->cr, hs->flags,
2284 +                               hs->merged ? "M" : "", hs->tail,
2285 +                               hs->buddy ? 1 << hs->buddy : 0);
2286 +       } else if (hs->op == EXT3_MB_HISTORY_PREALLOC) {
2287 +               fmt = "%-5u %-8u %-23s %-23s %-23s\n";
2288 +               sprintf(buf2, "%lu/%lu/%lu@%lu", hs->result.fe_group,
2289 +                       hs->result.fe_start, hs->result.fe_len,
2290 +                       hs->result.fe_logical);
2291 +               sprintf(buf, "%lu/%lu/%lu@%lu", hs->orig.fe_group,
2292 +                       hs->orig.fe_start, hs->orig.fe_len,
2293 +                       hs->orig.fe_logical);
2294 +               seq_printf(seq, fmt, hs->pid, hs->ino, buf, "", buf2);
2295 +       } else if (hs->op == EXT3_MB_HISTORY_DISCARD) {
2296 +               sprintf(buf2, "%lu/%lu/%lu", hs->result.fe_group,
2297 +                       hs->result.fe_start, hs->result.fe_len);
2298 +               seq_printf(seq, "%-5u %-8u %-23s discard\n",
2299 +                               hs->pid, hs->ino, buf2);
2300 +       } else if (hs->op == EXT3_MB_HISTORY_FREE) {
2301 +               sprintf(buf2, "%lu/%lu/%lu", hs->result.fe_group,
2302 +                       hs->result.fe_start, hs->result.fe_len);
2303 +               seq_printf(seq, "%-5u %-8u %-23s free\n",
2304 +                               hs->pid, hs->ino, buf2);
2305 +       } else {
2306 +               seq_printf(seq, "unknown op %d\n", hs->op);
2307 +       }
2308 +       return 0;
2309 +}
2310 +
2311 +static void ext3_mb_seq_history_stop(struct seq_file *seq, void *v)
2312 +{
2313 +}
2314 +
2315 +static struct seq_operations ext3_mb_seq_history_ops = {
2316 +       .start  = ext3_mb_seq_history_start,
2317 +       .next   = ext3_mb_seq_history_next,
2318 +       .stop   = ext3_mb_seq_history_stop,
2319 +       .show   = ext3_mb_seq_history_show,
2320 +};
2321 +
2322 +static int ext3_mb_seq_history_open(struct inode *inode, struct file *file)
2323 +{
2324 +       struct super_block *sb = PDE(inode)->data;
2325 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2326 +       struct ext3_mb_proc_session *s;
2327 +       int rc, size;
2328 +
2329 +       s = kmalloc(sizeof(*s), GFP_KERNEL);
2330 +       if (s == NULL)
2331 +               return -ENOMEM;
2332 +       s->sb = sb;
2333 +       size = sizeof(struct ext3_mb_history) * sbi->s_mb_history_max;
2334 +       s->history = kmalloc(size, GFP_KERNEL);
2335 +       if (s->history == NULL) {
2336 +               kfree(s);
2337 +               return -ENOMEM;
2338 +       }
2339 +
2340 +       spin_lock(&sbi->s_mb_history_lock);
2341 +       memcpy(s->history, sbi->s_mb_history, size);
2342 +       s->max = sbi->s_mb_history_max;
2343 +       s->start = sbi->s_mb_history_cur % s->max;
2344 +       spin_unlock(&sbi->s_mb_history_lock);
2345 +
2346 +       rc = seq_open(file, &ext3_mb_seq_history_ops);
2347 +       if (rc == 0) {
2348 +               struct seq_file *m = (struct seq_file *)file->private_data;
2349 +               m->private = s;
2350 +       } else {
2351 +               kfree(s->history);
2352 +               kfree(s);
2353 +       }
2354 +       return rc;
2355 +
2356 +}
2357 +
2358 +static int ext3_mb_seq_history_release(struct inode *inode, struct file *file)
2359 +{
2360 +       struct seq_file *seq = (struct seq_file *)file->private_data;
2361 +       struct ext3_mb_proc_session *s = seq->private;
2362 +       kfree(s->history);
2363 +       kfree(s);
2364 +       return seq_release(inode, file);
2365 +}
2366 +
2367 +static ssize_t ext3_mb_seq_history_write(struct file *file,
2368 +                               const char __user *buffer,
2369 +                               size_t count, loff_t *ppos)
2370 +{
2371 +       struct seq_file *seq = (struct seq_file *)file->private_data;
2372 +       struct ext3_mb_proc_session *s = seq->private;
2373 +       struct super_block *sb = s->sb;
2374 +       char str[32];
2375 +       int value;
2376 +
2377 +       if (count >= sizeof(str)) {
2378 +               printk(KERN_ERR "EXT3-fs: %s string too long, max %u bytes\n",
2379 +                               "mb_history", (int)sizeof(str));
2380 +               return -EOVERFLOW;
2381 +       }
2382 +
2383 +       if (copy_from_user(str, buffer, count))
2384 +               return -EFAULT;
2385 +
2386 +       value = simple_strtol(str, NULL, 0);
2387 +       if (value < 0)
2388 +               return -ERANGE;
2389 +       EXT3_SB(sb)->s_mb_history_filter = value;
2390 +
2391 +       return count;
2392 +}
2393 +
2394 +static struct file_operations ext3_mb_seq_history_fops = {
2395 +       .owner          = THIS_MODULE,
2396 +       .open           = ext3_mb_seq_history_open,
2397 +       .read           = seq_read,
2398 +       .write          = ext3_mb_seq_history_write,
2399 +       .llseek         = seq_lseek,
2400 +       .release        = ext3_mb_seq_history_release,
2401 +};
2402 +
2403 +static void *ext3_mb_seq_groups_start(struct seq_file *seq, loff_t *pos)
2404 +{
2405 +       struct super_block *sb = seq->private;
2406 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2407 +       long group;
2408 +
2409 +       if (*pos < 0 || *pos >= sbi->s_groups_count)
2410 +               return NULL;
2411 +
2412 +       group = *pos + 1;
2413 +       return (void *) group;
2414 +}
2415 +
2416 +static void *ext3_mb_seq_groups_next(struct seq_file *seq, void *v, loff_t *pos)
2417 +{
2418 +       struct super_block *sb = seq->private;
2419 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2420 +       long group;
2421 +
2422 +       ++*pos;
2423 +       if (*pos < 0 || *pos >= sbi->s_groups_count)
2424 +               return NULL;
2425 +       group = *pos + 1;
2426 +       return (void *) group;;
2427 +}
2428 +
2429 +static int ext3_mb_seq_groups_show(struct seq_file *seq, void *v)
2430 +{
2431 +       struct super_block *sb = seq->private;
2432 +       struct ext3_group_desc *gdp;
2433 +       long group = (long) v;
2434 +       int i, err, free = 0;
2435 +       struct ext3_buddy e3b;
2436 +       struct sg {
2437 +               struct ext3_group_info info;
2438 +               unsigned short counters[16];
2439 +       } sg;
2440 +
2441 +       group--;
2442 +       if (group == 0)
2443 +               seq_printf(seq, "#%-5s: %-5s %-5s %-5s %-5s %-5s "
2444 +                               "[ %-5s %-5s %-5s %-5s %-5s %-5s %-5s "
2445 +                                 "%-5s %-5s %-5s %-5s %-5s %-5s %-5s ]\n",
2446 +                          "group", "free", "ingd", "frags", "first", "pa",
2447 +                          "2^0", "2^1", "2^2", "2^3", "2^4", "2^5","2^6",
2448 +                          "2^7", "2^8", "2^9", "2^10", "2^11", "2^12", "2^13");
2449 +
2450 +       i = (sb->s_blocksize_bits + 2) * sizeof(sg.info.bb_counters[0]) +
2451 +               sizeof(struct ext3_group_info);
2452 +       err = ext3_mb_load_buddy(sb, group, &e3b);
2453 +       if (err) {
2454 +               seq_printf(seq, "#%-5lu: I/O error\n", group);
2455 +               return 0;
2456 +       }
2457 +
2458 +       gdp = ext3_get_group_desc(sb, group, NULL);
2459 +       if (gdp != NULL)
2460 +               free = le16_to_cpu(gdp->bg_free_blocks_count);
2461 +
2462 +       ext3_lock_group(sb, group);
2463 +       memcpy(&sg, EXT3_GROUP_INFO(sb, group), i);
2464 +       ext3_unlock_group(sb, group);
2465 +       ext3_mb_release_desc(&e3b);
2466 +
2467 +       seq_printf(seq, "#%-5lu: %-5u %-5u %-5u %-5u %-5lu [", group,
2468 +                       sg.info.bb_free, free,
2469 +                       sg.info.bb_fragments, sg.info.bb_first_free,
2470 +                       sg.info.bb_prealloc_nr);
2471 +       for (i = 0; i <= 13; i++)
2472 +               seq_printf(seq, " %-5u", i <= sb->s_blocksize_bits + 1 ?
2473 +                               sg.info.bb_counters[i] : 0);
2474 +       seq_printf(seq, " ]\n");
2475 +
2476 +       return 0;
2477 +}
2478 +
2479 +static void ext3_mb_seq_groups_stop(struct seq_file *seq, void *v)
2480 +{
2481 +}
2482 +
2483 +static struct seq_operations ext3_mb_seq_groups_ops = {
2484 +       .start  = ext3_mb_seq_groups_start,
2485 +       .next   = ext3_mb_seq_groups_next,
2486 +       .stop   = ext3_mb_seq_groups_stop,
2487 +       .show   = ext3_mb_seq_groups_show,
2488 +};
2489 +
2490 +static int ext3_mb_seq_groups_open(struct inode *inode, struct file *file)
2491 +{
2492 +       struct super_block *sb = PDE(inode)->data;
2493 +       int rc;
2494 +
2495 +       rc = seq_open(file, &ext3_mb_seq_groups_ops);
2496 +       if (rc == 0) {
2497 +               struct seq_file *m = (struct seq_file *)file->private_data;
2498 +               m->private = sb;
2499 +       }
2500 +       return rc;
2501 +
2502 +}
2503 +
2504 +static struct file_operations ext3_mb_seq_groups_fops = {
2505 +       .owner          = THIS_MODULE,
2506 +       .open           = ext3_mb_seq_groups_open,
2507 +       .read           = seq_read,
2508 +       .llseek         = seq_lseek,
2509 +       .release        = seq_release,
2510 +};
2511 +
2512 +static void ext3_mb_history_release(struct super_block *sb)
2513 +{
2514 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2515 +
2516 +       remove_proc_entry("mb_groups", sbi->s_dev_proc);
2517 +       remove_proc_entry("mb_history", sbi->s_dev_proc);
2518 +
2519 +       if (sbi->s_mb_history)
2520 +               kfree(sbi->s_mb_history);
2521 +}
2522 +
2523 +static void ext3_mb_history_init(struct super_block *sb)
2524 +{
2525 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2526 +       int i;
2527 +
2528 +       if (sbi->s_dev_proc != NULL) {
2529 +               struct proc_dir_entry *p;
2530 +               p = create_proc_entry("mb_history", S_IRUGO, sbi->s_dev_proc);
2531 +               if (p) {
2532 +                       p->proc_fops = &ext3_mb_seq_history_fops;
2533 +                       p->data = sb;
2534 +               }
2535 +               p = create_proc_entry("mb_groups", S_IRUGO, sbi->s_dev_proc);
2536 +               if (p) {
2537 +                       p->proc_fops = &ext3_mb_seq_groups_fops;
2538 +                       p->data = sb;
2539 +               }
2540 +       }
2541 +
2542 +       sbi->s_mb_history_max = 1000;
2543 +       sbi->s_mb_history_cur = 0;
2544 +       spin_lock_init(&sbi->s_mb_history_lock);
2545 +       i = sbi->s_mb_history_max * sizeof(struct ext3_mb_history);
2546 +       sbi->s_mb_history = kmalloc(i, GFP_KERNEL);
2547 +       if (likely(sbi->s_mb_history != NULL))
2548 +               memset(sbi->s_mb_history, 0, i);
2549 +       /* if we can't allocate history, then we simple won't use it */
2550 +}
2551 +
2552 +static void
2553 +ext3_mb_store_history(struct ext3_allocation_context *ac)
2554 +{
2555 +       struct ext3_sb_info *sbi = EXT3_SB(ac->ac_sb);
2556 +       struct ext3_mb_history h;
2557 +
2558 +       if (unlikely(sbi->s_mb_history == NULL))
2559 +               return;
2560 +
2561 +       if (!(ac->ac_op & sbi->s_mb_history_filter))
2562 +               return;
2563 +
2564 +       h.op = ac->ac_op;
2565 +       h.pid = current->pid;
2566 +       h.ino = ac->ac_inode ? ac->ac_inode->i_ino : 0;
2567 +       h.orig = ac->ac_o_ex;
2568 +       h.result = ac->ac_b_ex;
2569 +       h.flags = ac->ac_flags;
2570 +       h.found = ac->ac_found;
2571 +       h.groups = ac->ac_groups_scanned;
2572 +       h.cr = ac->ac_criteria;
2573 +       h.tail = ac->ac_tail;
2574 +       h.buddy = ac->ac_buddy;
2575 +       h.merged = 0;
2576 +       h.cr = ac->ac_criteria;
2577 +       if (ac->ac_op == EXT3_MB_HISTORY_ALLOC) {
2578 +               if (ac->ac_g_ex.fe_start == ac->ac_b_ex.fe_start &&
2579 +                               ac->ac_g_ex.fe_group == ac->ac_b_ex.fe_group)
2580 +                       h.merged = 1;
2581 +               h.goal = ac->ac_g_ex;
2582 +               h.result = ac->ac_f_ex;
2583 +       }
2584 +
2585 +       spin_lock(&sbi->s_mb_history_lock);
2586 +       memcpy(sbi->s_mb_history + sbi->s_mb_history_cur, &h, sizeof(h));
2587 +       if (++sbi->s_mb_history_cur >= sbi->s_mb_history_max)
2588 +               sbi->s_mb_history_cur = 0;
2589 +       spin_unlock(&sbi->s_mb_history_lock);
2590 +}
2591 +
2592 +#else
2593 +#define ext3_mb_history_release(sb)
2594 +#define ext3_mb_history_init(sb)
2595 +#endif
2596 +
2597 +int ext3_mb_init_backend(struct super_block *sb)
2598 +{
2599 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2600 +       int i, j, len, metalen;
2601 +       int num_meta_group_infos =
2602 +               (sbi->s_groups_count + EXT3_DESC_PER_BLOCK(sb) - 1) >>
2603 +                       EXT3_DESC_PER_BLOCK_BITS(sb);
2604 +       struct ext3_group_info **meta_group_info;
2605 +
2606 +       /* An 8TB filesystem with 64-bit pointers requires a 4096 byte
2607 +        * kmalloc. A 128kb malloc should suffice for a 256TB filesystem.
2608 +        * So a two level scheme suffices for now. */
2609 +       sbi->s_group_info = kmalloc(sizeof(*sbi->s_group_info) *
2610 +                                   num_meta_group_infos, GFP_KERNEL);
2611 +       if (sbi->s_group_info == NULL) {
2612 +               printk(KERN_ERR "EXT3-fs: can't allocate buddy meta group\n");
2613 +               return -ENOMEM;
2614 +       }
2615 +       sbi->s_buddy_cache = new_inode(sb);
2616 +       if (sbi->s_buddy_cache == NULL) {
2617 +               printk(KERN_ERR "EXT3-fs: can't get new inode\n");
2618 +               goto err_freesgi;
2619 +       }
2620 +       EXT3_I(sbi->s_buddy_cache)->i_disksize = 0;
2621 +
2622 +       metalen = sizeof(*meta_group_info) << EXT3_DESC_PER_BLOCK_BITS(sb);
2623 +       for (i = 0; i < num_meta_group_infos; i++) {
2624 +               if ((i + 1) == num_meta_group_infos)
2625 +                       metalen = sizeof(*meta_group_info) *
2626 +                               (sbi->s_groups_count -
2627 +                                       (i << EXT3_DESC_PER_BLOCK_BITS(sb)));
2628 +               meta_group_info = kmalloc(metalen, GFP_KERNEL);
2629 +               if (meta_group_info == NULL) {
2630 +                       printk(KERN_ERR "EXT3-fs: can't allocate mem for a "
2631 +                              "buddy group\n");
2632 +                       goto err_freemeta;
2633 +               }
2634 +               sbi->s_group_info[i] = meta_group_info;
2635 +       }
2636 +
2637 +       /*
2638 +        * calculate needed size. if change bb_counters size,
2639 +        * don't forget about ext3_mb_generate_buddy()
2640 +        */
2641 +       len = sizeof(struct ext3_group_info);
2642 +       len += sizeof(unsigned short) * (sb->s_blocksize_bits + 2);
2643 +       for (i = 0; i < sbi->s_groups_count; i++) {
2644 +               struct ext3_group_desc * desc;
2645 +
2646 +               meta_group_info =
2647 +                       sbi->s_group_info[i >> EXT3_DESC_PER_BLOCK_BITS(sb)];
2648 +               j = i & (EXT3_DESC_PER_BLOCK(sb) - 1);
2649 +
2650 +               meta_group_info[j] = kmalloc(len, GFP_KERNEL);
2651 +               if (meta_group_info[j] == NULL) {
2652 +                       printk(KERN_ERR "EXT3-fs: can't allocate buddy mem\n");
2653 +                       i--;
2654 +                       goto err_freebuddy;
2655 +               }
2656 +               desc = ext3_get_group_desc(sb, i, NULL);
2657 +               if (desc == NULL) {
2658 +                       printk(KERN_ERR"EXT3-fs: can't read descriptor %u\n",i);
2659 +                       goto err_freebuddy;
2660 +               }
2661 +               memset(meta_group_info[j], 0, len);
2662 +               set_bit(EXT3_GROUP_INFO_NEED_INIT_BIT,
2663 +                       &meta_group_info[j]->bb_state);
2664 +
2665 +               /* initialize bb_free to be able to skip
2666 +                * empty groups without initialization */
2667 +               meta_group_info[j]->bb_free =
2668 +                       le16_to_cpu(desc->bg_free_blocks_count);
2669 +
2670 +               INIT_LIST_HEAD(&meta_group_info[j]->bb_prealloc_list);
2671 +
2672 +#ifdef DOUBLE_CHECK
2673 +               {
2674 +                       struct buffer_head *bh;
2675 +                       meta_group_info[j]->bb_bitmap =
2676 +                               kmalloc(sb->s_blocksize, GFP_KERNEL);
2677 +                       BUG_ON(meta_group_info[j]->bb_bitmap == NULL);
2678 +                       bh = read_block_bitmap(sb, i);
2679 +                       BUG_ON(bh == NULL);
2680 +                       memcpy(meta_group_info[j]->bb_bitmap, bh->b_data,
2681 +                                       sb->s_blocksize);
2682 +                       brelse(bh);
2683 +               }
2684 +#endif
2685 +
2686 +       }
2687 +
2688 +       return 0;
2689 +
2690 +err_freebuddy:
2691 +       while (i >= 0) {
2692 +               kfree(EXT3_GROUP_INFO(sb, i));
2693 +               i--;
2694 +       }
2695 +       i = num_meta_group_infos;
2696 +err_freemeta:
2697 +       while (--i >= 0)
2698 +               kfree(sbi->s_group_info[i]);
2699 +       iput(sbi->s_buddy_cache);
2700 +err_freesgi:
2701 +       kfree(sbi->s_group_info);
2702 +       return -ENOMEM;
2703 +}
2704 +
2705 +static void ext3_mb_prealloc_table_add(struct ext3_sb_info *sbi, int value)
2706 +{
2707 +       int i;
2708 +
2709 +       if (value > (sbi->s_blocks_per_group - 1 - 1 - sbi->s_itb_per_group))
2710 +               return;
2711 +
2712 +       for (i = 0; i < sbi->s_mb_prealloc_table_size; i++) {
2713 +               if (sbi->s_mb_prealloc_table[i] == 0) {
2714 +                       sbi->s_mb_prealloc_table[i] = value;
2715 +                       return;
2716 +               }
2717 +
2718 +               /* they should add values in order */
2719 +               if (value <= sbi->s_mb_prealloc_table[i])
2720 +                       return;
2721 +       }
2722 +}
2723 +
2724 +int ext3_mb_init(struct super_block *sb, int needs_recovery)
2725 +{
2726 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2727 +       unsigned i, offset, max;
2728 +
2729 +       if (!test_opt(sb, MBALLOC))
2730 +               return 0;
2731 +
2732 +       i = (sb->s_blocksize_bits + 2) * sizeof(unsigned short);
2733 +
2734 +       sbi->s_mb_offsets = kmalloc(i, GFP_KERNEL);
2735 +       if (sbi->s_mb_offsets == NULL) {
2736 +               clear_opt(sbi->s_mount_opt, MBALLOC);
2737 +               return -ENOMEM;
2738 +       }
2739 +       sbi->s_mb_maxs = kmalloc(i, GFP_KERNEL);
2740 +       if (sbi->s_mb_maxs == NULL) {
2741 +               clear_opt(sbi->s_mount_opt, MBALLOC);
2742 +               kfree(sbi->s_mb_maxs);
2743 +               return -ENOMEM;
2744 +       }
2745 +
2746 +       /* order 0 is regular bitmap */
2747 +       sbi->s_mb_maxs[0] = sb->s_blocksize << 3;
2748 +       sbi->s_mb_offsets[0] = 0;
2749 +
2750 +       i = 1;
2751 +       offset = 0;
2752 +       max = sb->s_blocksize << 2;
2753 +       do {
2754 +               sbi->s_mb_offsets[i] = offset;
2755 +               sbi->s_mb_maxs[i] = max;
2756 +               offset += 1 << (sb->s_blocksize_bits - i);
2757 +               max = max >> 1;
2758 +               i++;
2759 +       } while (i <= sb->s_blocksize_bits + 1);
2760 +
2761 +       /* init file for buddy data */
2762 +       if ((i = ext3_mb_init_backend(sb))) {
2763 +               clear_opt(sbi->s_mount_opt, MBALLOC);
2764 +               kfree(sbi->s_mb_offsets);
2765 +               kfree(sbi->s_mb_maxs);
2766 +               return i;
2767 +       }
2768 +
2769 +       spin_lock_init(&sbi->s_md_lock);
2770 +       INIT_LIST_HEAD(&sbi->s_active_transaction);
2771 +       INIT_LIST_HEAD(&sbi->s_closed_transaction);
2772 +       INIT_LIST_HEAD(&sbi->s_committed_transaction);
2773 +       spin_lock_init(&sbi->s_bal_lock);
2774 +
2775 +       sbi->s_mb_max_to_scan = MB_DEFAULT_MAX_TO_SCAN;
2776 +       sbi->s_mb_min_to_scan = MB_DEFAULT_MIN_TO_SCAN;
2777 +       sbi->s_mb_max_groups_to_scan = MB_DEFAULT_MAX_GROUPS_TO_SCAN;
2778 +       sbi->s_mb_stats = MB_DEFAULT_STATS;
2779 +       sbi->s_mb_order2_reqs = MB_DEFAULT_ORDER2_REQS;
2780 +       sbi->s_mb_history_filter = EXT3_MB_HISTORY_DEFAULT;
2781 +
2782 +       if (sbi->s_stripe == 0) {
2783 +               sbi->s_mb_prealloc_table_size = 8;
2784 +               i = sbi->s_mb_prealloc_table_size * sizeof(unsigned long);
2785 +               sbi->s_mb_prealloc_table = kmalloc(i, GFP_NOFS);
2786 +               if (sbi->s_mb_prealloc_table == NULL) {
2787 +                       clear_opt(sbi->s_mount_opt, MBALLOC);
2788 +                       kfree(sbi->s_mb_offsets);
2789 +                       kfree(sbi->s_mb_maxs);
2790 +                       return -ENOMEM;
2791 +               }
2792 +               memset(sbi->s_mb_prealloc_table, 0, i);
2793 +
2794 +               ext3_mb_prealloc_table_add(sbi, 4);
2795 +               ext3_mb_prealloc_table_add(sbi, 8);
2796 +               ext3_mb_prealloc_table_add(sbi, 16);
2797 +               ext3_mb_prealloc_table_add(sbi, 32);
2798 +               ext3_mb_prealloc_table_add(sbi, 64);
2799 +               ext3_mb_prealloc_table_add(sbi, 128);
2800 +               ext3_mb_prealloc_table_add(sbi, 256);
2801 +               ext3_mb_prealloc_table_add(sbi, 512);
2802 +
2803 +               sbi->s_mb_small_req = 256;
2804 +               sbi->s_mb_large_req = 1024;
2805 +               sbi->s_mb_group_prealloc = 512;
2806 +       } else {
2807 +               sbi->s_mb_prealloc_table_size = 3;
2808 +               i = sbi->s_mb_prealloc_table_size * sizeof(unsigned long);
2809 +               sbi->s_mb_prealloc_table = kmalloc(i, GFP_NOFS);
2810 +               if (sbi->s_mb_prealloc_table == NULL) {
2811 +                       clear_opt(sbi->s_mount_opt, MBALLOC);
2812 +                       kfree(sbi->s_mb_offsets);
2813 +                       kfree(sbi->s_mb_maxs);
2814 +                       return -ENOMEM;
2815 +               }
2816 +               memset(sbi->s_mb_prealloc_table, 0, i);
2817 +
2818 +               ext3_mb_prealloc_table_add(sbi, sbi->s_stripe);
2819 +               ext3_mb_prealloc_table_add(sbi, sbi->s_stripe * 2);
2820 +               ext3_mb_prealloc_table_add(sbi, sbi->s_stripe * 4);
2821 +
2822 +               sbi->s_mb_small_req = sbi->s_stripe;
2823 +               sbi->s_mb_large_req = sbi->s_stripe * 8;
2824 +               sbi->s_mb_group_prealloc = sbi->s_stripe * 4;
2825 +       }
2826 +
2827 +       i = sizeof(struct ext3_locality_group) * num_possible_cpus();
2828 +       sbi->s_locality_groups = kmalloc(i, GFP_NOFS);
2829 +       if (sbi->s_locality_groups == NULL) {
2830 +               clear_opt(sbi->s_mount_opt, MBALLOC);
2831 +               kfree(sbi->s_mb_prealloc_table);
2832 +               kfree(sbi->s_mb_offsets);
2833 +               kfree(sbi->s_mb_maxs);
2834 +               return -ENOMEM;
2835 +       }
2836 +       for (i = 0; i < num_possible_cpus(); i++) {
2837 +               struct ext3_locality_group *lg;
2838 +               lg = &sbi->s_locality_groups[i];
2839 +               sema_init(&lg->lg_sem, 1);
2840 +               INIT_LIST_HEAD(&lg->lg_prealloc_list);
2841 +               spin_lock_init(&lg->lg_prealloc_lock);
2842 +       }
2843 +
2844 +       ext3_mb_init_per_dev_proc(sb);
2845 +       ext3_mb_history_init(sb);
2846 +
2847 +       printk("EXT3-fs: mballoc enabled\n");
2848 +       return 0;
2849 +}
2850 +
2851 +void ext3_mb_cleanup_pa(struct ext3_group_info *grp)
2852 +{
2853 +       struct ext3_prealloc_space *pa;
2854 +       struct list_head *cur, *tmp;
2855 +       int count = 0;
2856 +
2857 +       list_for_each_safe(cur, tmp, &grp->bb_prealloc_list) {
2858 +               pa = list_entry(cur, struct ext3_prealloc_space, pa_group_list);
2859 +               list_del_rcu(&pa->pa_group_list);
2860 +               count++;
2861 +               kfree(pa);
2862 +       }
2863 +       if (count)
2864 +               mb_debug("mballoc: %u PAs left\n", count);
2865 +
2866 +}
2867 +
2868 +int ext3_mb_release(struct super_block *sb)
2869 +{
2870 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2871 +       int i, num_meta_group_infos;
2872 +
2873 +       if (!test_opt(sb, MBALLOC))
2874 +               return 0;
2875 +
2876 +       /* release freed, non-committed blocks */
2877 +       spin_lock(&sbi->s_md_lock);
2878 +       list_splice_init(&sbi->s_closed_transaction,
2879 +                       &sbi->s_committed_transaction);
2880 +       list_splice_init(&sbi->s_active_transaction,
2881 +                       &sbi->s_committed_transaction);
2882 +       spin_unlock(&sbi->s_md_lock);
2883 +       ext3_mb_free_committed_blocks(sb);
2884 +
2885 +       if (sbi->s_group_info) {
2886 +               for (i = 0; i < sbi->s_groups_count; i++) {
2887 +#ifdef DOUBLE_CHECK
2888 +                       if (EXT3_GROUP_INFO(sb, i)->bb_bitmap)
2889 +                               kfree(EXT3_GROUP_INFO(sb, i)->bb_bitmap);
2890 +#endif
2891 +                       ext3_mb_cleanup_pa(EXT3_GROUP_INFO(sb, i));
2892 +                       kfree(EXT3_GROUP_INFO(sb, i));
2893 +               }
2894 +               num_meta_group_infos = (sbi->s_groups_count +
2895 +                               EXT3_DESC_PER_BLOCK(sb) - 1) >>
2896 +                       EXT3_DESC_PER_BLOCK_BITS(sb);
2897 +               for (i = 0; i < num_meta_group_infos; i++)
2898 +                       kfree(sbi->s_group_info[i]);
2899 +               kfree(sbi->s_group_info);
2900 +       }
2901 +       if (sbi->s_mb_offsets)
2902 +               kfree(sbi->s_mb_offsets);
2903 +       if (sbi->s_mb_maxs)
2904 +               kfree(sbi->s_mb_maxs);
2905 +       if (sbi->s_buddy_cache)
2906 +               iput(sbi->s_buddy_cache);
2907 +       if (sbi->s_mb_stats) {
2908 +               printk("EXT3-fs: mballoc: %u blocks %u reqs (%u success)\n",
2909 +                               atomic_read(&sbi->s_bal_allocated),
2910 +                               atomic_read(&sbi->s_bal_reqs),
2911 +                               atomic_read(&sbi->s_bal_success));
2912 +               printk("EXT3-fs: mballoc: %u extents scanned, %u goal hits, "
2913 +                               "%u 2^N hits, %u breaks, %u lost\n",
2914 +                               atomic_read(&sbi->s_bal_ex_scanned),
2915 +                               atomic_read(&sbi->s_bal_goals),
2916 +                               atomic_read(&sbi->s_bal_2orders),
2917 +                               atomic_read(&sbi->s_bal_breaks),
2918 +                               atomic_read(&sbi->s_mb_lost_chunks));
2919 +               printk("EXT3-fs: mballoc: %lu generated and it took %Lu\n",
2920 +                               sbi->s_mb_buddies_generated++,
2921 +                               sbi->s_mb_generation_time);
2922 +               printk("EXT3-fs: mballoc: %u preallocated, %u discarded\n",
2923 +                               atomic_read(&sbi->s_mb_preallocated),
2924 +                               atomic_read(&sbi->s_mb_discarded));
2925 +       }
2926 +
2927 +       if (sbi->s_locality_groups)
2928 +               kfree(sbi->s_locality_groups);
2929 +
2930 +       ext3_mb_history_release(sb);
2931 +       ext3_mb_destroy_per_dev_proc(sb);
2932 +
2933 +       return 0;
2934 +}
2935 +
2936 +void ext3_mb_free_committed_blocks(struct super_block *sb)
2937 +{
2938 +       struct ext3_sb_info *sbi = EXT3_SB(sb);
2939 +       int err, i, count = 0, count2 = 0;
2940 +       struct ext3_free_metadata *md;
2941 +       struct ext3_buddy e3b;
2942 +
2943 +       if (list_empty(&sbi->s_committed_transaction))
2944 +               return;
2945 +
2946 +       /* there is committed blocks to be freed yet */
2947 +       do {
2948 +               /* get next array of blocks */
2949 +               md = NULL;
2950 +               spin_lock(&sbi->s_md_lock);
2951 +               if (!list_empty(&sbi->s_committed_transaction)) {
2952 +                       md = list_entry(sbi->s_committed_transaction.next,
2953 +                                       struct ext3_free_metadata, list);
2954 +                       list_del(&md->list);
2955 +               }
2956 +               spin_unlock(&sbi->s_md_lock);
2957 +
2958 +               if (md == NULL)
2959 +                       break;
2960 +
2961 +               mb_debug("gonna free %u blocks in group %u (0x%p):",
2962 +                               md->num, md->group, md);
2963 +
2964 +               err = ext3_mb_load_buddy(sb, md->group, &e3b);
2965 +               /* we expect to find existing buddy because it's pinned */
2966 +               BUG_ON(err != 0);
2967 +
2968 +               /* there are blocks to put in buddy to make them really free */
2969 +               count += md->num;
2970 +               count2++;
2971 +               ext3_lock_group(sb, md->group);
2972 +               for (i = 0; i < md->num; i++) {
2973 +                       mb_debug(" %u", md->blocks[i]);
2974 +                       err = mb_free_blocks(NULL, &e3b, md->blocks[i], 1);
2975 +                       BUG_ON(err != 0);
2976 +               }
2977 +               mb_debug("\n");
2978 +               ext3_unlock_group(sb, md->group);
2979 +
2980 +               /* balance refcounts from ext3_mb_free_metadata() */
2981 +               page_cache_release(e3b.bd_buddy_page);
2982 +               page_cache_release(e3b.bd_bitmap_page);
2983 +
2984 +               kfree(md);
2985 +               ext3_mb_release_desc(&e3b);
2986 +
2987 +       } while (md);
2988 +
2989 +       mb_debug("freed %u blocks in %u structures\n", count, count2);
2990 +}
2991 +
2992 +#define EXT3_MB_STATS_NAME             "stats"
2993 +#define EXT3_MB_MAX_TO_SCAN_NAME       "max_to_scan"
2994 +#define EXT3_MB_MIN_TO_SCAN_NAME       "min_to_scan"
2995 +#define EXT3_MB_ORDER2_REQ             "order2_req"
2996 +#define EXT3_MB_SMALL_REQ              "small_req"
2997 +#define EXT3_MB_LARGE_REQ              "large_req"
2998 +#define EXT3_MB_PREALLOC_TABLE         "prealloc_table"
2999 +#define EXT3_MB_GROUP_PREALLOC         "group_prealloc"
3000 +
3001 +static int ext3_mb_read_prealloc_table(char *page, char **start, off_t off,
3002 +                                      int count, int *eof, void *data)
3003 +{
3004 +       struct ext3_sb_info *sbi = data;
3005 +       int len = 0;
3006 +       int i;
3007 +
3008 +       *eof = 1;
3009 +       if (off != 0)
3010 +               return 0;
3011 +
3012 +       for (i = 0; i < sbi->s_mb_prealloc_table_size; i++)
3013 +               len += sprintf(page + len, "%ld ",