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