10 #include <ccan/build_assert/build_assert.h>
11 #include <ccan/likely/likely.h>
12 #include <ccan/alignof/alignof.h>
13 #include <ccan/short_types/short_types.h>
14 #include <ccan/compiler/compiler.h>
18 Inspired by (and parts taken from) Andrew Tridgell's alloc_mmap:
19 http://samba.org/~tridge/junkcode/alloc_mmap/
21 Copyright (C) Andrew Tridgell 2007
23 This library is free software; you can redistribute it and/or
24 modify it under the terms of the GNU Lesser General Public
25 License as published by the Free Software Foundation; either
26 version 2 of the License, or (at your option) any later version.
28 This library is distributed in the hope that it will be useful,
29 but WITHOUT ANY WARRANTY; without even the implied warranty of
30 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
31 Lesser General Public License for more details.
33 You should have received a copy of the GNU Lesser General Public
34 License along with this library; if not, write to the Free Software
35 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
38 /* We divide the pool into this many large pages (nearest power of 2) */
39 #define MAX_LARGE_PAGES (256UL)
41 /* 32 small pages == 1 large page. */
42 #define BITS_FROM_SMALL_TO_LARGE_PAGE 5
44 #define MAX_SMALL_PAGES (MAX_LARGE_PAGES << BITS_FROM_SMALL_TO_LARGE_PAGE)
46 /* Smallest pool size for this scheme: 128-byte small pages. That's
47 * 9/13% overhead for 32/64 bit. */
48 #define MIN_USEFUL_SIZE (MAX_SMALL_PAGES * 128)
50 /* Every 4 buckets, we jump up a power of 2. ...8 10 12 14 16 20 24 28 32... */
51 #define INTER_BUCKET_SPACE 4
53 #define SMALL_PAGES_PER_LARGE_PAGE (1 << BITS_FROM_SMALL_TO_LARGE_PAGE)
55 /* FIXME: Figure this out properly. */
56 #define MAX_SIZE (1 << 30)
58 /* How few object to fit in a page before using a larger one? (8) */
59 #define MAX_PAGE_OBJECT_ORDER 3
61 #define BITS_PER_LONG (sizeof(long) * CHAR_BIT)
64 u32 elements_per_page;
70 /* Bitmap of which pages are large. */
71 unsigned long pagesize[MAX_LARGE_PAGES / BITS_PER_LONG];
73 /* List of unused small/large pages. */
77 /* List of huge allocs. */
80 /* This is less defined: we have two buckets for each power of 2 */
81 struct bucket_state bs[1];
85 unsigned long next, prev;
86 unsigned long off, len;
91 /* FIXME: We can just count all-0 and all-1 used[] elements. */
92 unsigned elements_used : 25;
94 unsigned long used[1]; /* One bit per element. */
98 * Every 4 buckets, the size doubles.
99 * Between buckets, sizes increase linearly.
101 * eg. bucket 40 = 2^10 = 1024
102 * bucket 41 = 2^10 + 2^10*4 = 1024 + 256
103 * bucket 42 = 2^10 + 2^10*4 = 1024 + 512
104 * bucket 43 = 2^10 + 2^10*4 = 1024 + 768
105 * bucket 45 = 2^11 = 2048
107 * Care is taken to handle low numbered buckets, at cost of overflow.
109 static unsigned long bucket_to_size(unsigned int bucket)
111 unsigned long base = 1UL << (bucket / INTER_BUCKET_SPACE);
112 return base + ((bucket % INTER_BUCKET_SPACE)
113 << (bucket / INTER_BUCKET_SPACE))
114 / INTER_BUCKET_SPACE;
119 * fls(size/2) == 3. 1 << 3 == 8, so we're 2 too large, out of a possible
120 * 8 too large. That's 1/4 of the way to the next power of 2 == 1 bucket.
122 * We make sure we round up. Note that this fails on 32 bit at size
123 * 1879048193 (around bucket 120).
125 static unsigned int size_to_bucket(unsigned long size)
127 unsigned int base = fls(size/2);
128 unsigned long overshoot;
130 overshoot = size - (1UL << base);
131 return base * INTER_BUCKET_SPACE
132 + ((overshoot * INTER_BUCKET_SPACE + (1UL << base)-1) >> base);
135 static unsigned int small_page_bits(unsigned long poolsize)
137 return fls(poolsize / MAX_SMALL_PAGES - 1);
140 static struct page_header *from_pgnum(struct header *head,
144 return (struct page_header *)((char *)head + (pgnum << sp_bits));
147 static u16 to_pgnum(struct header *head, void *p, unsigned sp_bits)
149 return ((char *)p - (char *)head) >> sp_bits;
152 static size_t used_size(unsigned int num_elements)
154 return align_up(num_elements, BITS_PER_LONG) / CHAR_BIT;
158 * We always align the first entry to the lower power of 2.
159 * eg. the 12-byte bucket gets 8-byte aligned. The 4096-byte bucket
160 * gets 4096-byte aligned.
162 static unsigned long page_header_size(unsigned int align_bits,
163 unsigned long num_elements)
167 size = sizeof(struct page_header)
168 - sizeof(((struct page_header *)0)->used)
169 + used_size(num_elements);
170 return align_up(size, 1UL << align_bits);
173 static void add_to_list(struct header *head,
174 u16 *list, struct page_header *ph, unsigned sp_bits)
176 unsigned long h = *list, offset = to_pgnum(head, ph, sp_bits);
180 struct page_header *prev = from_pgnum(head, h, sp_bits);
181 assert(prev->prev == 0);
188 static void del_from_list(struct header *head,
189 u16 *list, struct page_header *ph, unsigned sp_bits)
195 struct page_header *prev = from_pgnum(head, ph->prev, sp_bits);
196 prev->next = ph->next;
199 struct page_header *next = from_pgnum(head, ph->next, sp_bits);
200 next->prev = ph->prev;
204 static u16 pop_from_list(struct header *head,
206 unsigned int sp_bits)
209 struct page_header *ph = from_pgnum(head, h, sp_bits);
214 from_pgnum(head, *list, sp_bits)->prev = 0;
219 static void add_to_huge_list(struct header *head, struct huge_alloc *ha)
221 unsigned long h = head->huge;
222 unsigned long offset = (char *)ha - (char *)head;
226 struct huge_alloc *prev = (void *)((char *)head + h);
227 assert(prev->prev == 0);
234 static void del_from_huge(struct header *head, struct huge_alloc *ha)
238 head->huge = ha->next;
240 struct huge_alloc *prev = (void *)((char *)head + ha->prev);
241 prev->next = ha->next;
244 struct huge_alloc *next = (void *)((char *)head + ha->next);
245 next->prev = ha->prev;
249 static void add_small_page_to_freelist(struct header *head,
250 struct page_header *ph,
251 unsigned int sp_bits)
253 add_to_list(head, &head->small_free_list, ph, sp_bits);
256 static void add_large_page_to_freelist(struct header *head,
257 struct page_header *ph,
258 unsigned int sp_bits)
260 add_to_list(head, &head->large_free_list, ph, sp_bits);
263 static void add_to_bucket_list(struct header *head,
264 struct bucket_state *bs,
265 struct page_header *ph,
266 unsigned int sp_bits)
268 add_to_list(head, &bs->page_list, ph, sp_bits);
271 static void del_from_bucket_list(struct header *head,
272 struct bucket_state *bs,
273 struct page_header *ph,
274 unsigned int sp_bits)
276 del_from_list(head, &bs->page_list, ph, sp_bits);
279 static void del_from_bucket_full_list(struct header *head,
280 struct bucket_state *bs,
281 struct page_header *ph,
282 unsigned int sp_bits)
284 del_from_list(head, &bs->full_list, ph, sp_bits);
287 static void add_to_bucket_full_list(struct header *head,
288 struct bucket_state *bs,
289 struct page_header *ph,
290 unsigned int sp_bits)
292 add_to_list(head, &bs->full_list, ph, sp_bits);
295 static void clear_bit(unsigned long bitmap[], unsigned int off)
297 bitmap[off / BITS_PER_LONG] &= ~(1UL << (off % BITS_PER_LONG));
300 static bool test_bit(const unsigned long bitmap[], unsigned int off)
302 return bitmap[off / BITS_PER_LONG] & (1UL << (off % BITS_PER_LONG));
305 static void set_bit(unsigned long bitmap[], unsigned int off)
307 bitmap[off / BITS_PER_LONG] |= (1UL << (off % BITS_PER_LONG));
310 /* There must be a bit to be found. */
311 static unsigned int find_free_bit(const unsigned long bitmap[])
315 for (i = 0; bitmap[i] == -1UL; i++);
316 return (i*BITS_PER_LONG) + ffsl(~bitmap[i]) - 1;
319 /* How many elements can we fit in a page? */
320 static unsigned long elements_per_page(unsigned long align_bits,
324 unsigned long num, overhead;
326 /* First approximation: no extra room for bitmap. */
327 overhead = align_up(sizeof(struct page_header), 1UL << align_bits);
328 num = (psize - overhead) / esize;
330 while (page_header_size(align_bits, num) + esize * num > psize)
335 static bool large_page_bucket(unsigned int bucket, unsigned int sp_bits)
337 unsigned long max_smallsize;
339 /* Note: this doesn't take into account page header. */
340 max_smallsize = (1UL << sp_bits) >> MAX_PAGE_OBJECT_ORDER;
342 return bucket_to_size(bucket) > max_smallsize;
345 static unsigned int max_bucket(unsigned int lp_bits)
347 return (lp_bits - MAX_PAGE_OBJECT_ORDER) * INTER_BUCKET_SPACE;
350 void alloc_init(void *pool, unsigned long poolsize)
352 struct header *head = pool;
353 struct page_header *ph;
354 unsigned int lp_bits, sp_bits, num_buckets;
355 unsigned long header_size, i;
357 if (poolsize < MIN_USEFUL_SIZE) {
358 tiny_alloc_init(pool, poolsize);
362 /* We rely on page numbers fitting in 16 bit. */
363 BUILD_ASSERT(MAX_SMALL_PAGES < 65536);
365 sp_bits = small_page_bits(poolsize);
366 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
368 num_buckets = max_bucket(lp_bits);
371 header_size = sizeof(*head) + sizeof(head->bs) * (num_buckets-1);
373 memset(head, 0, header_size);
374 for (i = 0; i < num_buckets; i++) {
375 unsigned long pagesize;
377 if (large_page_bucket(i, sp_bits))
378 pagesize = 1UL << lp_bits;
380 pagesize = 1UL << sp_bits;
382 head->bs[i].elements_per_page
383 = elements_per_page(i / INTER_BUCKET_SPACE,
388 /* They start as all large pages. */
389 memset(head->pagesize, 0xFF, sizeof(head->pagesize));
390 /* FIXME: small pages for last bit? */
392 /* Split first page into small pages. */
393 assert(header_size < (1UL << lp_bits));
394 clear_bit(head->pagesize, 0);
396 /* Skip over page(s) used by header, add rest to free list */
397 for (i = align_up(header_size, (1UL << sp_bits)) >> sp_bits;
398 i < SMALL_PAGES_PER_LARGE_PAGE;
400 ph = from_pgnum(head, i, sp_bits);
401 ph->elements_used = 0;
402 add_small_page_to_freelist(head, ph, sp_bits);
405 /* Add the rest of the pages as large pages. */
406 i = SMALL_PAGES_PER_LARGE_PAGE;
407 while ((i << sp_bits) + (1UL << lp_bits) <= poolsize) {
408 assert(i < MAX_SMALL_PAGES);
409 ph = from_pgnum(head, i, sp_bits);
410 ph->elements_used = 0;
411 add_large_page_to_freelist(head, ph, sp_bits);
412 i += SMALL_PAGES_PER_LARGE_PAGE;
416 /* A large page worth of small pages are free: delete them from free list. */
417 static void del_large_from_small_free_list(struct header *head,
418 struct page_header *ph,
419 unsigned int sp_bits)
423 for (i = 0; i < SMALL_PAGES_PER_LARGE_PAGE; i++) {
424 del_from_list(head, &head->small_free_list,
425 (void *)ph + (i << sp_bits),
430 static bool all_empty(struct header *head,
436 for (i = 0; i < SMALL_PAGES_PER_LARGE_PAGE; i++) {
437 struct page_header *ph = from_pgnum(head, pgnum + i, sp_bits);
438 if (ph->elements_used)
444 static void recombine_small_pages(struct header *head, unsigned long poolsize,
445 unsigned int sp_bits)
448 unsigned int lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
450 /* Look for small pages to coalesce, after first large page. */
451 for (i = SMALL_PAGES_PER_LARGE_PAGE;
452 i < (poolsize >> lp_bits) << BITS_FROM_SMALL_TO_LARGE_PAGE;
453 i += SMALL_PAGES_PER_LARGE_PAGE) {
454 /* Already a large page? */
455 if (test_bit(head->pagesize, i / SMALL_PAGES_PER_LARGE_PAGE))
457 if (all_empty(head, i, sp_bits)) {
458 struct page_header *ph = from_pgnum(head, i, sp_bits);
459 set_bit(head->pagesize,
460 i / SMALL_PAGES_PER_LARGE_PAGE);
461 del_large_from_small_free_list(head, ph, sp_bits);
462 add_large_page_to_freelist(head, ph, sp_bits);
467 static u16 get_large_page(struct header *head, unsigned long poolsize,
468 unsigned int sp_bits)
470 unsigned int lp_bits, page;
472 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
474 page = pop_from_list(head, &head->large_free_list, sp_bits);
478 recombine_small_pages(head, poolsize, sp_bits);
480 return pop_from_list(head, &head->large_free_list, sp_bits);
483 /* Returns small page. */
484 static unsigned long break_up_large_page(struct header *head,
485 unsigned int sp_bits,
490 clear_bit(head->pagesize, lpage >> BITS_FROM_SMALL_TO_LARGE_PAGE);
492 for (i = 1; i < SMALL_PAGES_PER_LARGE_PAGE; i++) {
493 struct page_header *ph = from_pgnum(head, lpage + i, sp_bits);
494 /* Initialize this: huge_alloc reads it. */
495 ph->elements_used = 0;
496 add_small_page_to_freelist(head, ph, sp_bits);
502 static u16 get_small_page(struct header *head, unsigned long poolsize,
503 unsigned int sp_bits)
507 ret = pop_from_list(head, &head->small_free_list, sp_bits);
510 ret = get_large_page(head, poolsize, sp_bits);
512 ret = break_up_large_page(head, sp_bits, ret);
516 static bool huge_allocated(struct header *head, unsigned long offset)
519 struct huge_alloc *ha;
521 for (i = head->huge; i; i = ha->next) {
522 ha = (void *)((char *)head + i);
523 if (ha->off <= offset && ha->off + ha->len > offset)
529 /* They want something really big. Aim for contiguous pages (slow). */
530 static COLD void *huge_alloc(void *pool, unsigned long poolsize,
531 unsigned long size, unsigned long align)
533 struct header *head = pool;
534 struct huge_alloc *ha;
535 unsigned long i, sp_bits, lp_bits, num, header_size;
537 sp_bits = small_page_bits(poolsize);
538 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
540 /* Allocate tracking structure optimistically. */
541 ha = alloc_get(pool, poolsize, sizeof(*ha), ALIGNOF(*ha));
545 /* First search for contiguous small pages... */
546 header_size = sizeof(*head) + sizeof(head->bs) * (max_bucket(lp_bits)-1);
549 for (i = (header_size + (1UL << sp_bits) - 1) >> sp_bits;
550 i << sp_bits < poolsize;
552 struct page_header *pg;
553 unsigned long off = (i << sp_bits);
555 /* Skip over large pages. */
556 if (test_bit(head->pagesize, i >> BITS_FROM_SMALL_TO_LARGE_PAGE)) {
557 i += (1UL << BITS_FROM_SMALL_TO_LARGE_PAGE)-1;
561 /* Does this page meet alignment requirements? */
562 if (!num && off % align != 0)
565 /* FIXME: This makes us O(n^2). */
566 if (huge_allocated(head, off)) {
571 pg = (struct page_header *)((char *)head + off);
572 if (pg->elements_used) {
578 if (num << sp_bits >= size) {
581 /* Remove from free list. */
582 for (pgnum = i; pgnum > i - num; pgnum--) {
583 pg = from_pgnum(head, pgnum, sp_bits);
585 &head->small_free_list,
588 ha->off = (i - num + 1) << sp_bits;
589 ha->len = num << sp_bits;
594 /* Now search for large pages... */
595 recombine_small_pages(head, poolsize, sp_bits);
598 for (i = (header_size + (1UL << lp_bits) - 1) >> lp_bits;
599 (i << lp_bits) < poolsize; i++) {
600 struct page_header *pg;
601 unsigned long off = (i << lp_bits);
603 /* Ignore small pages. */
604 if (!test_bit(head->pagesize, i))
607 /* Does this page meet alignment requirements? */
608 if (!num && off % align != 0)
611 /* FIXME: This makes us O(n^2). */
612 if (huge_allocated(head, off)) {
617 pg = (struct page_header *)((char *)head + off);
618 if (pg->elements_used) {
624 if (num << lp_bits >= size) {
627 /* Remove from free list. */
628 for (pgnum = i; pgnum > i - num; pgnum--) {
629 pg = from_pgnum(head, pgnum, lp_bits);
631 &head->large_free_list,
634 ha->off = (i - num + 1) << lp_bits;
635 ha->len = num << lp_bits;
640 /* Unable to satisfy: free huge alloc structure. */
641 alloc_free(pool, poolsize, ha);
645 add_to_huge_list(pool, ha);
646 return (char *)pool + ha->off;
650 huge_free(struct header *head, unsigned long poolsize, void *free)
652 unsigned long i, off, pgnum, free_off = (char *)free - (char *)head;
653 unsigned int sp_bits, lp_bits;
654 struct huge_alloc *ha;
656 for (i = head->huge; i; i = ha->next) {
657 ha = (void *)((char *)head + i);
658 if (free_off == ha->off)
663 /* Free up all the pages, delete and free ha */
664 sp_bits = small_page_bits(poolsize);
665 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
666 pgnum = free_off >> sp_bits;
668 if (test_bit(head->pagesize, pgnum >> BITS_FROM_SMALL_TO_LARGE_PAGE)) {
670 off < ha->off + ha->len;
671 off += 1UL << lp_bits) {
672 add_large_page_to_freelist(head,
673 (void *)((char *)head + off),
678 off < ha->off + ha->len;
679 off += 1UL << sp_bits) {
680 add_small_page_to_freelist(head,
681 (void *)((char *)head + off),
685 del_from_huge(head, ha);
686 alloc_free(head, poolsize, ha);
689 static COLD unsigned long huge_size(struct header *head, void *p)
691 unsigned long i, off = (char *)p - (char *)head;
692 struct huge_alloc *ha;
694 for (i = head->huge; i; i = ha->next) {
695 ha = (void *)((char *)head + i);
696 if (off == ha->off) {
703 void *alloc_get(void *pool, unsigned long poolsize,
704 unsigned long size, unsigned long align)
706 struct header *head = pool;
709 struct bucket_state *bs;
710 struct page_header *ph;
711 unsigned int sp_bits;
713 if (poolsize < MIN_USEFUL_SIZE) {
714 return tiny_alloc_get(pool, poolsize, size, align);
717 size = align_up(size, align);
720 bucket = size_to_bucket(size);
722 sp_bits = small_page_bits(poolsize);
724 if (bucket >= max_bucket(sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE)) {
725 return huge_alloc(pool, poolsize, size, align);
728 bs = &head->bs[bucket];
730 if (!bs->page_list) {
731 struct page_header *ph;
733 if (large_page_bucket(bucket, sp_bits))
734 bs->page_list = get_large_page(head, poolsize,
737 bs->page_list = get_small_page(head, poolsize,
739 /* FIXME: Try large-aligned alloc? Header stuffing? */
740 if (unlikely(!bs->page_list))
742 ph = from_pgnum(head, bs->page_list, sp_bits);
744 ph->elements_used = 0;
746 memset(ph->used, 0, used_size(bs->elements_per_page));
749 ph = from_pgnum(head, bs->page_list, sp_bits);
751 i = find_free_bit(ph->used);
752 set_bit(ph->used, i);
755 /* check if this page is now full */
756 if (unlikely(ph->elements_used == bs->elements_per_page)) {
757 del_from_bucket_list(head, bs, ph, sp_bits);
758 add_to_bucket_full_list(head, bs, ph, sp_bits);
761 return (char *)ph + page_header_size(ph->bucket / INTER_BUCKET_SPACE,
762 bs->elements_per_page)
763 + i * bucket_to_size(bucket);
766 void alloc_free(void *pool, unsigned long poolsize, void *free)
768 struct header *head = pool;
769 struct bucket_state *bs;
770 unsigned int sp_bits;
771 unsigned long i, pgnum, pgoffset, offset = (char *)free - (char *)pool;
773 struct page_header *ph;
775 if (poolsize < MIN_USEFUL_SIZE) {
776 return tiny_alloc_free(pool, poolsize, free);
779 /* Get page header. */
780 sp_bits = small_page_bits(poolsize);
781 pgnum = offset >> sp_bits;
783 /* Big page? Round down further. */
784 if (test_bit(head->pagesize, pgnum >> BITS_FROM_SMALL_TO_LARGE_PAGE)) {
786 pgnum &= ~(SMALL_PAGES_PER_LARGE_PAGE - 1);
790 /* Step back to page header. */
791 ph = from_pgnum(head, pgnum, sp_bits);
792 if ((void *)ph == free) {
793 huge_free(head, poolsize, free);
797 bs = &head->bs[ph->bucket];
798 pgoffset = offset - (pgnum << sp_bits)
799 - page_header_size(ph->bucket / INTER_BUCKET_SPACE,
800 bs->elements_per_page);
802 if (unlikely(ph->elements_used == bs->elements_per_page)) {
803 del_from_bucket_full_list(head, bs, ph, sp_bits);
804 add_to_bucket_list(head, bs, ph, sp_bits);
807 /* Which element are we? */
808 i = pgoffset / bucket_to_size(ph->bucket);
809 clear_bit(ph->used, i);
812 if (unlikely(ph->elements_used == 0)) {
813 bs = &head->bs[ph->bucket];
814 del_from_bucket_list(head, bs, ph, sp_bits);
816 add_small_page_to_freelist(head, ph, sp_bits);
818 add_large_page_to_freelist(head, ph, sp_bits);
822 unsigned long alloc_size(void *pool, unsigned long poolsize, void *p)
824 struct header *head = pool;
825 unsigned int pgnum, sp_bits;
826 unsigned long offset = (char *)p - (char *)pool;
827 struct page_header *ph;
829 if (poolsize < MIN_USEFUL_SIZE)
830 return tiny_alloc_size(pool, poolsize, p);
832 /* Get page header. */
833 sp_bits = small_page_bits(poolsize);
834 pgnum = offset >> sp_bits;
836 /* Big page? Round down further. */
837 if (test_bit(head->pagesize, pgnum >> BITS_FROM_SMALL_TO_LARGE_PAGE))
838 pgnum &= ~(SMALL_PAGES_PER_LARGE_PAGE - 1);
840 /* Step back to page header. */
841 ph = from_pgnum(head, pgnum, sp_bits);
843 return huge_size(head, p);
845 return bucket_to_size(ph->bucket);
848 /* Useful for gdb breakpoints. */
849 static bool check_fail(void)
854 static unsigned long count_bits(const unsigned long bitmap[],
857 unsigned long i, count = 0;
859 while (limit >= BITS_PER_LONG) {
860 count += popcount(bitmap[0]);
862 limit -= BITS_PER_LONG;
865 for (i = 0; i < limit; i++)
866 if (test_bit(bitmap, i))
871 static bool out_of_bounds(unsigned long pgnum,
872 unsigned int sp_bits,
873 unsigned long pagesize,
874 unsigned long poolsize)
876 if (((pgnum << sp_bits) >> sp_bits) != pgnum)
879 if ((pgnum << sp_bits) > poolsize)
882 return ((pgnum << sp_bits) + pagesize > poolsize);
885 static bool check_bucket(struct header *head,
886 unsigned long poolsize,
887 unsigned long pages[],
888 struct bucket_state *bs,
892 struct page_header *ph;
893 unsigned long taken, i, prev, pagesize, sp_bits, lp_bits;
895 sp_bits = small_page_bits(poolsize);
896 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
898 lp_bucket = large_page_bucket(bindex, sp_bits);
900 pagesize = 1UL << (lp_bucket ? lp_bits : sp_bits);
902 /* This many elements fit? */
903 taken = page_header_size(bindex / INTER_BUCKET_SPACE,
904 bs->elements_per_page);
905 taken += bucket_to_size(bindex) * bs->elements_per_page;
906 if (taken > pagesize)
909 /* One more wouldn't fit? */
910 taken = page_header_size(bindex / INTER_BUCKET_SPACE,
911 bs->elements_per_page + 1);
912 taken += bucket_to_size(bindex) * (bs->elements_per_page + 1);
913 if (taken <= pagesize)
916 /* Walk used list. */
918 for (i = bs->page_list; i; i = ph->next) {
920 if (out_of_bounds(i, sp_bits, pagesize, poolsize))
922 /* Wrong size page? */
923 if (!!test_bit(head->pagesize, i >> BITS_FROM_SMALL_TO_LARGE_PAGE)
926 /* Large page not on boundary? */
927 if (lp_bucket && (i % SMALL_PAGES_PER_LARGE_PAGE) != 0)
929 ph = from_pgnum(head, i, sp_bits);
930 /* Linked list corrupt? */
931 if (ph->prev != prev)
933 /* Already seen this page? */
934 if (test_bit(pages, i))
938 if (ph->elements_used == 0)
940 if (ph->elements_used >= bs->elements_per_page)
942 /* Used bits don't agree? */
943 if (ph->elements_used != count_bits(ph->used,
944 bs->elements_per_page))
947 if (ph->bucket != bindex)
952 /* Walk full list. */
954 for (i = bs->full_list; i; i = ph->next) {
956 if (out_of_bounds(i, sp_bits, pagesize, poolsize))
958 /* Wrong size page? */
959 if (!!test_bit(head->pagesize, i >> BITS_FROM_SMALL_TO_LARGE_PAGE)
961 /* Large page not on boundary? */
962 if (lp_bucket && (i % SMALL_PAGES_PER_LARGE_PAGE) != 0)
964 ph = from_pgnum(head, i, sp_bits);
965 /* Linked list corrupt? */
966 if (ph->prev != prev)
968 /* Already seen this page? */
969 if (test_bit(pages, i))
973 if (ph->elements_used != bs->elements_per_page)
975 /* Used bits don't agree? */
976 if (ph->elements_used != count_bits(ph->used,
977 bs->elements_per_page))
980 if (ph->bucket != bindex)
987 bool alloc_check(void *pool, unsigned long poolsize)
989 struct header *head = pool;
990 unsigned long prev, i, lp_bits, sp_bits, header_size, num_buckets;
991 struct page_header *ph;
992 struct huge_alloc *ha;
993 unsigned long pages[MAX_SMALL_PAGES / BITS_PER_LONG] = { 0 };
995 if (poolsize < MIN_USEFUL_SIZE)
996 return tiny_alloc_check(pool, poolsize);
998 sp_bits = small_page_bits(poolsize);
999 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
1001 num_buckets = max_bucket(lp_bits);
1003 header_size = sizeof(*head) + sizeof(head->bs) * (num_buckets-1);
1005 /* First, set all bits taken by header. */
1006 for (i = 0; i < header_size; i += (1UL << sp_bits))
1007 set_bit(pages, i >> sp_bits);
1009 /* Check small page free list. */
1011 for (i = head->small_free_list; i; i = ph->next) {
1013 if (out_of_bounds(i, sp_bits, 1UL << sp_bits, poolsize))
1014 return check_fail();
1016 if (test_bit(head->pagesize, i >> BITS_FROM_SMALL_TO_LARGE_PAGE))
1017 return check_fail();
1018 ph = from_pgnum(head, i, sp_bits);
1019 /* Linked list corrupt? */
1020 if (ph->prev != prev)
1021 return check_fail();
1022 /* Already seen this page? */
1023 if (test_bit(pages, i))
1024 return check_fail();
1029 /* Check large page free list. */
1031 for (i = head->large_free_list; i; i = ph->next) {
1033 if (out_of_bounds(i, sp_bits, 1UL << lp_bits, poolsize))
1034 return check_fail();
1035 /* Not large page? */
1036 if (!test_bit(head->pagesize, i >> BITS_FROM_SMALL_TO_LARGE_PAGE))
1037 return check_fail();
1038 /* Not page boundary? */
1039 if ((i % SMALL_PAGES_PER_LARGE_PAGE) != 0)
1040 return check_fail();
1041 ph = from_pgnum(head, i, sp_bits);
1042 /* Linked list corrupt? */
1043 if (ph->prev != prev)
1044 return check_fail();
1045 /* Already seen this page? */
1046 if (test_bit(pages, i))
1047 return check_fail();
1052 /* Check the buckets. */
1053 for (i = 0; i < max_bucket(lp_bits); i++) {
1054 struct bucket_state *bs = &head->bs[i];
1056 if (!check_bucket(head, poolsize, pages, bs, i))
1060 /* Check the huge alloc list. */
1062 for (i = head->huge; i; i = ha->next) {
1063 unsigned long pgbits, j;
1066 if (i >= poolsize || i + sizeof(*ha) > poolsize)
1067 return check_fail();
1068 ha = (void *)((char *)head + i);
1070 /* Check contents of ha. */
1071 if (ha->off > poolsize || ha->off + ha->len > poolsize)
1072 return check_fail();
1074 /* Large or small page? */
1075 pgbits = test_bit(head->pagesize, ha->off >> lp_bits)
1076 ? lp_bits : sp_bits;
1078 /* Not page boundary? */
1079 if ((ha->off % (1UL << pgbits)) != 0)
1080 return check_fail();
1082 /* Not page length? */
1083 if ((ha->len % (1UL << pgbits)) != 0)
1084 return check_fail();
1086 /* Linked list corrupt? */
1087 if (ha->prev != prev)
1088 return check_fail();
1090 for (j = ha->off; j < ha->off + ha->len; j += (1UL<<sp_bits)) {
1091 /* Already seen this page? */
1092 if (test_bit(pages, j >> sp_bits))
1093 return check_fail();
1094 set_bit(pages, j >> sp_bits);
1100 /* Make sure every page accounted for. */
1101 for (i = 0; i < poolsize >> sp_bits; i++) {
1102 if (!test_bit(pages, i))
1103 return check_fail();
1104 if (test_bit(head->pagesize,
1105 i >> BITS_FROM_SMALL_TO_LARGE_PAGE)) {
1106 /* Large page, skip rest. */
1107 i += SMALL_PAGES_PER_LARGE_PAGE - 1;
1114 static unsigned long print_overhead(FILE *out, const char *desc,
1115 unsigned long bytes,
1116 unsigned long poolsize)
1118 fprintf(out, "Overhead (%s): %lu bytes (%.3g%%)\n",
1119 desc, bytes, 100.0 * bytes / poolsize);
1123 static unsigned long count_list(struct header *head,
1125 unsigned int sp_bits,
1126 unsigned long *total_elems)
1128 struct page_header *p;
1129 unsigned long ret = 0;
1132 p = from_pgnum(head, pgnum, sp_bits);
1134 (*total_elems) += p->elements_used;
1141 static unsigned long visualize_bucket(FILE *out, struct header *head,
1142 unsigned int bucket,
1143 unsigned long poolsize,
1144 unsigned int sp_bits)
1146 unsigned long num_full, num_partial, num_pages, page_size,
1147 elems, hdr_min, hdr_size, elems_per_page, overhead = 0;
1149 elems_per_page = head->bs[bucket].elements_per_page;
1151 /* If we used byte-based bitmaps, we could get pg hdr to: */
1152 hdr_min = sizeof(struct page_header)
1153 - sizeof(((struct page_header *)0)->used)
1154 + align_up(elems_per_page, CHAR_BIT) / CHAR_BIT;
1155 hdr_size = page_header_size(bucket / INTER_BUCKET_SPACE,
1159 num_full = count_list(head, head->bs[bucket].full_list, sp_bits,
1161 num_partial = count_list(head, head->bs[bucket].page_list, sp_bits,
1163 num_pages = num_full + num_partial;
1167 fprintf(out, "Bucket %u (%lu bytes):"
1168 " %lu full, %lu partial = %lu elements\n",
1169 bucket, bucket_to_size(bucket), num_full, num_partial, elems);
1170 /* Strict requirement of page header size. */
1171 overhead += print_overhead(out, "page headers",
1172 hdr_min * num_pages, poolsize);
1173 /* Gap between minimal page header and actual start. */
1174 overhead += print_overhead(out, "page post-header alignments",
1175 (hdr_size - hdr_min) * num_pages, poolsize);
1176 /* Between last element and end of page. */
1177 page_size = (1UL << sp_bits);
1178 if (large_page_bucket(bucket, sp_bits))
1179 page_size <<= BITS_FROM_SMALL_TO_LARGE_PAGE;
1181 overhead += print_overhead(out, "page tails",
1182 (page_size - (hdr_size
1184 * bucket_to_size(bucket))))
1185 * num_pages, poolsize);
1189 void alloc_visualize(FILE *out, void *pool, unsigned long poolsize)
1191 struct header *head = pool;
1192 unsigned long i, lp_bits, sp_bits, header_size, num_buckets, count,
1195 fprintf(out, "Pool %p size %lu: (%s allocator)\n", pool, poolsize,
1196 poolsize < MIN_USEFUL_SIZE ? "tiny" : "standard");
1198 if (poolsize < MIN_USEFUL_SIZE) {
1199 tiny_alloc_visualize(out, pool, poolsize);
1203 sp_bits = small_page_bits(poolsize);
1204 lp_bits = sp_bits + BITS_FROM_SMALL_TO_LARGE_PAGE;
1206 num_buckets = max_bucket(lp_bits);
1207 header_size = sizeof(*head) + sizeof(head->bs) * (num_buckets-1);
1209 fprintf(out, "Large page size %lu, small page size %lu.\n",
1210 1UL << lp_bits, 1UL << sp_bits);
1211 overhead += print_overhead(out, "unused pool tail",
1212 poolsize % (1UL << lp_bits), poolsize);
1213 fprintf(out, "Main header %lu bytes (%lu small pages).\n",
1214 header_size, align_up(header_size, 1UL << sp_bits) >> sp_bits);
1215 overhead += print_overhead(out, "partial header page",
1216 align_up(header_size, 1UL << sp_bits)
1217 - header_size, poolsize);
1218 /* Total large pages. */
1219 i = count_bits(head->pagesize, poolsize >> lp_bits);
1221 count = i - count_list(head, head->large_free_list, sp_bits, NULL);
1222 fprintf(out, "%lu/%lu large pages used (%.3g%%)\n",
1223 count, i, count ? 100.0 * count / i : 0.0);
1225 /* Total small pages. */
1226 i = ((poolsize >> lp_bits) - i) << BITS_FROM_SMALL_TO_LARGE_PAGE;
1228 count = i - count_list(head, head->small_free_list, sp_bits, NULL);
1229 fprintf(out, "%lu/%lu small pages used (%.3g%%)\n",
1230 count, i, count ? 100.0 * count / i : 0.0);
1232 /* Summary of each bucket. */
1233 fprintf(out, "%lu buckets:\n", num_buckets);
1234 for (i = 0; i < num_buckets; i++)
1235 overhead += visualize_bucket(out, head, i, poolsize, sp_bits);
1237 print_overhead(out, "total", overhead, poolsize);