2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2004 Poul-Henning Kamp
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * Unit number allocation functions.
33 * These functions implement a mixed run-length/bitmap management of unit
34 * number spaces in a very memory efficient manner.
36 * Allocation policy is always lowest free number first.
38 * A return value of -1 signals that no more unit numbers are available.
40 * There is no cost associated with the range of unitnumbers, so unless
41 * the resource really is finite, specify INT_MAX to new_unrhdr() and
42 * forget about checking the return value.
44 * If a mutex is not provided when the unit number space is created, a
45 * default global mutex is used. The advantage to passing a mutex in, is
46 * that the alloc_unrl() function can be called with the mutex already
47 * held (it will not be released by alloc_unrl()).
49 * The allocation function alloc_unr{l}() never sleeps (but it may block on
50 * the mutex of course).
52 * Freeing a unit number may require allocating memory, and can therefore
53 * sleep so the free_unr() function does not come in a pre-locked variant.
55 * A userland test program is included.
57 * Memory usage is a very complex function of the exact allocation
58 * pattern, but always very compact:
59 * * For the very typical case where a single unbroken run of unit
60 * numbers are allocated 44 bytes are used on i386.
61 * * For a unit number space of 1000 units and the random pattern
62 * in the usermode test program included, the worst case usage
63 * was 252 bytes on i386 for 500 allocated and 500 free units.
64 * * For a unit number space of 10000 units and the random pattern
65 * in the usermode test program included, the worst case usage
66 * was 798 bytes on i386 for 5000 allocated and 5000 free units.
67 * * The worst case is where every other unit number is allocated and
68 * the rest are free. In that case 44 + N/4 bytes are used where
69 * N is the number of the highest unit allocated.
72 #include <sys/param.h>
73 #include <sys/types.h>
74 #include <sys/_unrhdr.h>
78 #include <sys/bitstring.h>
79 #include <sys/malloc.h>
80 #include <sys/kernel.h>
81 #include <sys/systm.h>
82 #include <sys/limits.h>
84 #include <sys/mutex.h>
87 * In theory it would be smarter to allocate the individual blocks
88 * with the zone allocator, but at this time the expectation is that
89 * there will typically not even be enough allocations to fill a single
90 * page, so we stick with malloc for now.
92 static MALLOC_DEFINE(M_UNIT, "Unitno", "Unit number allocation");
94 #define Malloc(foo) malloc(foo, M_UNIT, M_WAITOK | M_ZERO)
95 #define Free(foo) free(foo, M_UNIT)
97 static struct mtx unitmtx;
99 MTX_SYSINIT(unit, &unitmtx, "unit# allocation", MTX_DEF);
103 alloc_unr64(struct unrhdr64 *unr64)
108 item = unr64->counter++;
109 mtx_unlock(&unitmtx);
114 #else /* ...USERLAND */
116 #include <bitstring.h>
125 #define KASSERT(cond, arg) \
134 #define Malloc(foo) _Malloc(foo, __LINE__)
136 _Malloc(size_t foo, int line)
139 KASSERT(no_alloc == 0, ("malloc in wrong place() line %d", line));
140 return (calloc(foo, 1));
142 #define Free(foo) free(foo)
152 mtx_lock(struct mtx *mp)
154 KASSERT(mp->state == 0, ("mutex already locked"));
159 mtx_unlock(struct mtx *mp)
161 KASSERT(mp->state == 1, ("mutex not locked"));
168 mtx_assert(struct mtx *mp, int flag)
170 if (flag == MA_OWNED) {
171 KASSERT(mp->state == 1, ("mtx_assert(MA_OWNED) not true"));
175 #define CTASSERT(foo)
176 #define WITNESS_WARN(flags, lock, fmt, ...) (void)0
178 #endif /* USERLAND */
181 * This is our basic building block.
183 * It can be used in three different ways depending on the value of the ptr
185 * If ptr is NULL, it represents a run of free items.
186 * If ptr points to the unrhdr it represents a run of allocated items.
187 * Otherwise it points to a bitstring of allocated items.
189 * For runs the len field is the length of the run.
190 * For bitmaps the len field represents the number of allocated items.
192 * The bitmap is the same size as struct unr to optimize memory management.
195 TAILQ_ENTRY(unr) list;
201 bitstr_t map[sizeof(struct unr) / sizeof(bitstr_t)];
204 CTASSERT((sizeof(struct unr) % sizeof(bitstr_t)) == 0);
206 /* Number of bits we can store in the bitmap */
207 #define NBITS (8 * sizeof(((struct unrb*)NULL)->map))
209 /* Is the unrb empty in at least the first len bits? */
211 ub_empty(struct unrb *ub, int len) {
214 bit_ffs(ub->map, len, &first_set);
215 return (first_set == -1);
218 /* Is the unrb full? That is, is the number of set elements equal to len? */
220 ub_full(struct unrb *ub, int len)
224 bit_ffc(ub->map, len, &first_clear);
225 return (first_clear == -1);
229 #if defined(DIAGNOSTIC) || !defined(_KERNEL)
231 * Consistency check function.
233 * Checks the internal consistency as well as we can.
235 * Called at all boundaries of this API.
238 check_unrhdr(struct unrhdr *uh, int line)
247 TAILQ_FOREACH(up, &uh->head, list) {
249 if (up->ptr != uh && up->ptr != NULL) {
251 KASSERT (up->len <= NBITS,
252 ("UNR inconsistency: len %u max %zd (line %d)\n",
253 up->len, NBITS, line));
256 bit_count(ub->map, 0, up->len, &w);
258 } else if (up->ptr != NULL)
261 KASSERT (y == uh->busy,
262 ("UNR inconsistency: items %u found %u (line %d)\n",
264 KASSERT (z == uh->alloc,
265 ("UNR inconsistency: chunks %u found %u (line %d)\n",
266 uh->alloc, z, line));
272 check_unrhdr(struct unrhdr *uh __unused, int line __unused)
281 * Userland memory management. Just use calloc and keep track of how
282 * many elements we have allocated for check_unrhdr().
285 static __inline void *
286 new_unr(struct unrhdr *uh, void **p1, void **p2)
291 KASSERT(*p1 != NULL || *p2 != NULL, ("Out of cached memory"));
304 delete_unr(struct unrhdr *uh, void *ptr)
310 TAILQ_INSERT_TAIL(&uh->ppfree, up, list);
314 clean_unrhdrl(struct unrhdr *uh)
318 mtx_assert(uh->mtx, MA_OWNED);
319 while ((up = TAILQ_FIRST(&uh->ppfree)) != NULL) {
320 TAILQ_REMOVE(&uh->ppfree, up, list);
329 clean_unrhdr(struct unrhdr *uh)
338 init_unrhdr(struct unrhdr *uh, int low, int high, struct mtx *mutex)
341 KASSERT(low >= 0 && low <= high,
342 ("UNR: use error: new_unrhdr(%d, %d)", low, high));
347 TAILQ_INIT(&uh->head);
348 TAILQ_INIT(&uh->ppfree);
352 uh->last = 1 + (high - low);
353 check_unrhdr(uh, __LINE__);
357 * Allocate a new unrheader set.
359 * Highest and lowest valid values given as parameters.
363 new_unrhdr(int low, int high, struct mtx *mutex)
367 uh = Malloc(sizeof *uh);
368 init_unrhdr(uh, low, high, mutex);
373 delete_unrhdr(struct unrhdr *uh)
376 check_unrhdr(uh, __LINE__);
377 KASSERT(uh->busy == 0, ("unrhdr has %u allocations", uh->busy));
378 KASSERT(uh->alloc == 0, ("UNR memory leak in delete_unrhdr"));
379 KASSERT(TAILQ_FIRST(&uh->ppfree) == NULL,
380 ("unrhdr has postponed item for free"));
385 clear_unrhdr(struct unrhdr *uh)
389 KASSERT(TAILQ_EMPTY(&uh->ppfree),
390 ("unrhdr has postponed item for free"));
391 TAILQ_FOREACH_SAFE(up, &uh->head, list, uq) {
399 init_unrhdr(uh, uh->low, uh->high, uh->mtx);
401 check_unrhdr(uh, __LINE__);
405 is_bitmap(struct unrhdr *uh, struct unr *up)
407 return (up->ptr != uh && up->ptr != NULL);
411 * Look for sequence of items which can be combined into a bitmap, if
412 * multiple are present, take the one which saves most memory.
414 * Return (1) if a sequence was found to indicate that another call
415 * might be able to do more. Return (0) if we found no suitable sequence.
417 * NB: called from alloc_unr(), no new memory allocation allowed.
420 optimize_unr(struct unrhdr *uh)
422 struct unr *up, *uf, *us;
423 struct unrb *ub, *ubf;
427 * Look for the run of items (if any) which when collapsed into
428 * a bitmap would save most memory.
432 TAILQ_FOREACH(uf, &uh->head, list) {
433 if (uf->len >= NBITS)
436 if (is_bitmap(uh, uf))
441 up = TAILQ_NEXT(up, list);
444 if ((up->len + l) > NBITS)
447 if (is_bitmap(uh, up))
460 * If the first element is not a bitmap, make it one.
461 * Trying to do so without allocating more memory complicates things
464 if (!is_bitmap(uh, us)) {
465 uf = TAILQ_NEXT(us, list);
466 TAILQ_REMOVE(&uh->head, us, list);
468 l = us->ptr == uh ? 1 : 0;
470 bit_nclear(ub->map, 0, NBITS - 1);
472 bit_nset(ub->map, 0, a);
473 if (!is_bitmap(uh, uf)) {
475 bit_nclear(ub->map, a, a + uf->len - 1);
477 bit_nset(ub->map, a, a + uf->len - 1);
483 for (l = 0; l < uf->len; l++, a++) {
484 if (bit_test(ubf->map, l))
487 bit_clear(ub->map, a);
490 delete_unr(uh, uf->ptr);
497 uf = TAILQ_NEXT(us, list);
500 if (uf->len + us->len > NBITS)
502 if (uf->ptr == NULL) {
503 bit_nclear(ub->map, us->len, us->len + uf->len - 1);
505 TAILQ_REMOVE(&uh->head, uf, list);
507 } else if (uf->ptr == uh) {
508 bit_nset(ub->map, us->len, us->len + uf->len - 1);
510 TAILQ_REMOVE(&uh->head, uf, list);
514 for (l = 0; l < uf->len; l++, us->len++) {
515 if (bit_test(ubf->map, l))
516 bit_set(ub->map, us->len);
518 bit_clear(ub->map, us->len);
520 TAILQ_REMOVE(&uh->head, uf, list);
528 * See if a given unr should be collapsed with a neighbor.
530 * NB: called from alloc_unr(), no new memory allocation allowed.
533 collapse_unr(struct unrhdr *uh, struct unr *up)
538 /* If bitmap is all set or clear, change it to runlength */
539 if (is_bitmap(uh, up)) {
541 if (ub_full(ub, up->len)) {
542 delete_unr(uh, up->ptr);
544 } else if (ub_empty(ub, up->len)) {
545 delete_unr(uh, up->ptr);
550 /* If nothing left in runlength, delete it */
552 upp = TAILQ_PREV(up, unrhd, list);
554 upp = TAILQ_NEXT(up, list);
555 TAILQ_REMOVE(&uh->head, up, list);
560 /* If we have "hot-spot" still, merge with neighbor if possible */
562 upp = TAILQ_PREV(up, unrhd, list);
563 if (upp != NULL && up->ptr == upp->ptr) {
565 TAILQ_REMOVE(&uh->head, upp, list);
568 upp = TAILQ_NEXT(up, list);
569 if (upp != NULL && up->ptr == upp->ptr) {
571 TAILQ_REMOVE(&uh->head, upp, list);
576 /* Merge into ->first if possible */
577 upp = TAILQ_FIRST(&uh->head);
578 if (upp != NULL && upp->ptr == uh) {
579 uh->first += upp->len;
580 TAILQ_REMOVE(&uh->head, upp, list);
586 /* Merge into ->last if possible */
587 upp = TAILQ_LAST(&uh->head, unrhd);
588 if (upp != NULL && upp->ptr == NULL) {
589 uh->last += upp->len;
590 TAILQ_REMOVE(&uh->head, upp, list);
596 /* Try to make bitmaps */
597 while (optimize_unr(uh))
602 * Allocate a free unr.
605 alloc_unrl(struct unrhdr *uh)
612 mtx_assert(uh->mtx, MA_OWNED);
613 check_unrhdr(uh, __LINE__);
614 x = uh->low + uh->first;
616 up = TAILQ_FIRST(&uh->head);
619 * If we have an ideal split, just adjust the first+last
621 if (up == NULL && uh->last > 0) {
629 * We can always allocate from the first list element, so if we have
630 * nothing on the list, we must have run out of unit numbers.
635 KASSERT(up->ptr != uh, ("UNR first element is allocated"));
637 if (up->ptr == NULL) { /* free run */
640 } else { /* bitmap */
642 bit_ffc(ub->map, up->len, &y);
643 KASSERT(y != -1, ("UNR corruption: No clear bit in bitmap."));
648 collapse_unr(uh, up);
653 alloc_unr(struct unrhdr *uh)
665 alloc_unr_specificl(struct unrhdr *uh, u_int item, void **p1, void **p2)
667 struct unr *up, *upn;
671 mtx_assert(uh->mtx, MA_OWNED);
673 if (item < uh->low + uh->first || item > uh->high)
676 up = TAILQ_FIRST(&uh->head);
678 if (up == NULL && item - uh->low == uh->first) {
682 check_unrhdr(uh, __LINE__);
686 i = item - uh->low - uh->first;
689 up = new_unr(uh, p1, p2);
692 TAILQ_INSERT_TAIL(&uh->head, up, list);
693 up = new_unr(uh, p1, p2);
696 TAILQ_INSERT_TAIL(&uh->head, up, list);
697 uh->last = uh->high - uh->low - i;
699 check_unrhdr(uh, __LINE__);
702 /* Find the item which contains the unit we want to allocate. */
703 TAILQ_FOREACH(up, &uh->head, list) {
712 up = new_unr(uh, p1, p2);
715 TAILQ_INSERT_TAIL(&uh->head, up, list);
717 up = new_unr(uh, p1, p2);
720 TAILQ_INSERT_TAIL(&uh->head, up, list);
724 if (is_bitmap(uh, up)) {
726 if (bit_test(ub->map, i) == 0) {
731 } else if (up->ptr == uh)
734 KASSERT(up->ptr == NULL,
735 ("alloc_unr_specificl: up->ptr != NULL (up=%p)", up));
737 /* Split off the tail end, if any. */
738 tl = up->len - (1 + i);
740 upn = new_unr(uh, p1, p2);
743 TAILQ_INSERT_AFTER(&uh->head, up, upn, list);
746 /* Split off head end, if any */
748 upn = new_unr(uh, p1, p2);
751 TAILQ_INSERT_BEFORE(up, upn, list);
757 last = uh->high - uh->low - (item - uh->low);
761 collapse_unr(uh, up);
762 check_unrhdr(uh, __LINE__);
767 alloc_unr_specific(struct unrhdr *uh, u_int item)
772 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, "alloc_unr_specific");
774 p1 = Malloc(sizeof(struct unr));
775 p2 = Malloc(sizeof(struct unr));
778 i = alloc_unr_specificl(uh, item, &p1, &p2);
792 * If we can save unrs by using a bitmap, do so.
795 free_unrl(struct unrhdr *uh, u_int item, void **p1, void **p2)
797 struct unr *up, *upp, *upn;
801 KASSERT(item >= uh->low && item <= uh->high,
802 ("UNR: free_unr(%u) out of range [%u...%u]",
803 item, uh->low, uh->high));
804 check_unrhdr(uh, __LINE__);
806 upp = TAILQ_FIRST(&uh->head);
808 * Freeing in the ideal split case
810 if (item + 1 == uh->first && upp == NULL) {
814 check_unrhdr(uh, __LINE__);
818 * Freeing in the ->first section. Create a run starting at the
819 * freed item. The code below will subdivide it.
821 if (item < uh->first) {
822 up = new_unr(uh, p1, p2);
824 up->len = uh->first - item;
825 TAILQ_INSERT_HEAD(&uh->head, up, list);
826 uh->first -= up->len;
831 /* Find the item which contains the unit we want to free */
832 TAILQ_FOREACH(up, &uh->head, list) {
838 /* Handle bitmap items */
839 if (is_bitmap(uh, up)) {
842 KASSERT(bit_test(ub->map, item) != 0,
843 ("UNR: Freeing free item %d (bitmap)\n", item));
844 bit_clear(ub->map, item);
846 collapse_unr(uh, up);
850 KASSERT(up->ptr == uh, ("UNR Freeing free item %d (run))\n", item));
852 /* Just this one left, reap it */
856 collapse_unr(uh, up);
860 /* Check if we can shift the item into the previous 'free' run */
861 upp = TAILQ_PREV(up, unrhd, list);
862 if (item == 0 && upp != NULL && upp->ptr == NULL) {
866 collapse_unr(uh, up);
870 /* Check if we can shift the item to the next 'free' run */
871 upn = TAILQ_NEXT(up, list);
872 if (item == up->len - 1 && upn != NULL && upn->ptr == NULL) {
876 collapse_unr(uh, up);
880 /* Split off the tail end, if any. */
881 pl = up->len - (1 + item);
883 upp = new_unr(uh, p1, p2);
886 TAILQ_INSERT_AFTER(&uh->head, up, upp, list);
889 /* Split off head end, if any */
891 upp = new_unr(uh, p1, p2);
894 TAILQ_INSERT_BEFORE(up, upp, list);
899 collapse_unr(uh, up);
903 free_unr(struct unrhdr *uh, u_int item)
907 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, "free_unr");
908 p1 = Malloc(sizeof(struct unr));
909 p2 = Malloc(sizeof(struct unr));
911 free_unrl(uh, item, &p1, &p2);
920 #ifndef _KERNEL /* USERLAND test driver */
923 * Simple stochastic test driver for the above functions. The code resides
924 * here so that it can access static functions and structures.
928 #define VPRINTF(...) {if (verbose) printf(__VA_ARGS__);}
931 print_unr(struct unrhdr *uh, struct unr *up)
936 printf(" %p len = %5u ", up, up->len);
939 else if (up->ptr == uh)
944 for (x = 0; x < up->len; x++) {
945 if (bit_test(ub->map, x))
955 print_unrhdr(struct unrhdr *uh)
961 "%p low = %u high = %u first = %u last = %u busy %u chunks = %u\n",
962 uh, uh->low, uh->high, uh->first, uh->last, uh->busy, uh->alloc);
963 x = uh->low + uh->first;
964 TAILQ_FOREACH(up, &uh->head, list) {
965 printf(" from = %5u", x);
967 if (up->ptr == NULL || up->ptr == uh)
975 test_alloc_unr(struct unrhdr *uh, u_int i, char a[])
980 VPRINTF("F %u\n", i);
988 VPRINTF("A %d\n", j);
995 test_alloc_unr_specific(struct unrhdr *uh, u_int i, char a[])
999 j = alloc_unr_specific(uh, i);
1001 VPRINTF("F %u\n", i);
1006 VPRINTF("A %d\n", j);
1013 printf("%s [-h] [-r REPETITIONS] [-v]\n", argv[0]);
1017 main(int argc, char **argv)
1021 long count = 10000; /* Number of unrs to test */
1028 while ((ch = getopt(argc, argv, "hr:v")) != -1) {
1032 reps = strtol(optarg, NULL, 0);
1033 if (errno == ERANGE || errno == EINVAL) {
1051 setbuf(stdout, NULL);
1052 uh = new_unrhdr(0, count - 1, NULL);
1055 a = calloc(count, sizeof(char));
1057 err(1, "calloc failed");
1060 printf("sizeof(struct unr) %zu\n", sizeof(struct unr));
1061 printf("sizeof(struct unrb) %zu\n", sizeof(struct unrb));
1062 printf("sizeof(struct unrhdr) %zu\n", sizeof(struct unrhdr));
1063 printf("NBITS %lu\n", (unsigned long)NBITS);
1064 for (m = 0; m < count * reps; m++) {
1066 i = (j >> 1) % count;
1068 if (a[i] && (j & 1))
1071 if ((random() & 1) != 0)
1072 test_alloc_unr(uh, i, a);
1074 test_alloc_unr_specific(uh, i, a);
1078 check_unrhdr(uh, __LINE__);
1080 for (i = 0; i < (u_int)count; i++) {
1083 printf("C %u\n", i);