2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c)2006,2007,2008,2009 YAMAMOTO Takashi,
5 * Copyright (c) 2013 EMC Corp.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * $NetBSD: vmem_impl.h,v 1.2 2013/01/29 21:26:24 para Exp $
33 * $NetBSD: subr_vmem.c,v 1.83 2013/03/06 11:20:10 yamt Exp $
38 * - Magazines and Vmem: Extending the Slab Allocator
39 * to Many CPUs and Arbitrary Resources
40 * http://www.usenix.org/event/usenix01/bonwick.html
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/kernel.h>
51 #include <sys/queue.h>
52 #include <sys/callout.h>
55 #include <sys/malloc.h>
56 #include <sys/mutex.h>
58 #include <sys/condvar.h>
59 #include <sys/sysctl.h>
60 #include <sys/taskqueue.h>
62 #include <sys/vmmeter.h>
69 #include <vm/vm_map.h>
70 #include <vm/vm_object.h>
71 #include <vm/vm_kern.h>
72 #include <vm/vm_extern.h>
73 #include <vm/vm_param.h>
74 #include <vm/vm_page.h>
75 #include <vm/vm_pageout.h>
76 #include <vm/vm_phys.h>
77 #include <vm/vm_pagequeue.h>
78 #include <vm/uma_int.h>
80 #define VMEM_OPTORDER 5
81 #define VMEM_OPTVALUE (1 << VMEM_OPTORDER)
82 #define VMEM_MAXORDER \
83 (VMEM_OPTVALUE - 1 + sizeof(vmem_size_t) * NBBY - VMEM_OPTORDER)
85 #define VMEM_HASHSIZE_MIN 16
86 #define VMEM_HASHSIZE_MAX 131072
88 #define VMEM_QCACHE_IDX_MAX 16
90 #define VMEM_FITMASK (M_BESTFIT | M_FIRSTFIT | M_NEXTFIT)
92 #define VMEM_FLAGS (M_NOWAIT | M_WAITOK | M_USE_RESERVE | M_NOVM | \
93 M_BESTFIT | M_FIRSTFIT | M_NEXTFIT)
95 #define BT_FLAGS (M_NOWAIT | M_WAITOK | M_USE_RESERVE | M_NOVM)
97 #define QC_NAME_MAX 16
100 * Data structures private to vmem.
102 MALLOC_DEFINE(M_VMEM, "vmem", "vmem internal structures");
104 typedef struct vmem_btag bt_t;
106 TAILQ_HEAD(vmem_seglist, vmem_btag);
107 LIST_HEAD(vmem_freelist, vmem_btag);
108 LIST_HEAD(vmem_hashlist, vmem_btag);
114 char qc_name[QC_NAME_MAX];
116 typedef struct qcache qcache_t;
117 #define QC_POOL_TO_QCACHE(pool) ((qcache_t *)(pool->pr_qcache))
119 #define VMEM_NAME_MAX 16
123 TAILQ_ENTRY(vmem_btag) bt_seglist;
125 LIST_ENTRY(vmem_btag) u_freelist; /* BT_TYPE_FREE */
126 LIST_ENTRY(vmem_btag) u_hashlist; /* BT_TYPE_BUSY */
128 #define bt_hashlist bt_u.u_hashlist
129 #define bt_freelist bt_u.u_freelist
130 vmem_addr_t bt_start;
137 struct mtx_padalign vm_lock;
139 char vm_name[VMEM_NAME_MAX+1];
140 LIST_ENTRY(vmem) vm_alllist;
141 struct vmem_hashlist vm_hash0[VMEM_HASHSIZE_MIN];
142 struct vmem_freelist vm_freelist[VMEM_MAXORDER];
143 struct vmem_seglist vm_seglist;
144 struct vmem_hashlist *vm_hashlist;
145 vmem_size_t vm_hashsize;
147 /* Constant after init */
148 vmem_size_t vm_qcache_max;
149 vmem_size_t vm_quantum_mask;
150 vmem_size_t vm_import_quantum;
151 int vm_quantum_shift;
153 /* Written on alloc/free */
154 LIST_HEAD(, vmem_btag) vm_freetags;
157 vmem_size_t vm_inuse;
159 vmem_size_t vm_limit;
160 struct vmem_btag vm_cursor;
162 /* Used on import. */
163 vmem_import_t *vm_importfn;
164 vmem_release_t *vm_releasefn;
167 /* Space exhaustion callback. */
168 vmem_reclaim_t *vm_reclaimfn;
171 qcache_t vm_qcache[VMEM_QCACHE_IDX_MAX];
174 #define BT_TYPE_SPAN 1 /* Allocated from importfn */
175 #define BT_TYPE_SPAN_STATIC 2 /* vmem_add() or create. */
176 #define BT_TYPE_FREE 3 /* Available space. */
177 #define BT_TYPE_BUSY 4 /* Used space. */
178 #define BT_TYPE_CURSOR 5 /* Cursor for nextfit allocations. */
179 #define BT_ISSPAN_P(bt) ((bt)->bt_type <= BT_TYPE_SPAN_STATIC)
181 #define BT_END(bt) ((bt)->bt_start + (bt)->bt_size - 1)
183 #if defined(DIAGNOSTIC)
184 static int enable_vmem_check = 1;
185 SYSCTL_INT(_debug, OID_AUTO, vmem_check, CTLFLAG_RWTUN,
186 &enable_vmem_check, 0, "Enable vmem check");
187 static void vmem_check(vmem_t *);
190 static struct callout vmem_periodic_ch;
191 static int vmem_periodic_interval;
192 static struct task vmem_periodic_wk;
194 static struct mtx_padalign __exclusive_cache_line vmem_list_lock;
195 static LIST_HEAD(, vmem) vmem_list = LIST_HEAD_INITIALIZER(vmem_list);
196 static uma_zone_t vmem_zone;
199 #define VMEM_CONDVAR_INIT(vm, wchan) cv_init(&vm->vm_cv, wchan)
200 #define VMEM_CONDVAR_DESTROY(vm) cv_destroy(&vm->vm_cv)
201 #define VMEM_CONDVAR_WAIT(vm) cv_wait(&vm->vm_cv, &vm->vm_lock)
202 #define VMEM_CONDVAR_BROADCAST(vm) cv_broadcast(&vm->vm_cv)
205 #define VMEM_LOCK(vm) mtx_lock(&vm->vm_lock)
206 #define VMEM_TRYLOCK(vm) mtx_trylock(&vm->vm_lock)
207 #define VMEM_UNLOCK(vm) mtx_unlock(&vm->vm_lock)
208 #define VMEM_LOCK_INIT(vm, name) mtx_init(&vm->vm_lock, (name), NULL, MTX_DEF)
209 #define VMEM_LOCK_DESTROY(vm) mtx_destroy(&vm->vm_lock)
210 #define VMEM_ASSERT_LOCKED(vm) mtx_assert(&vm->vm_lock, MA_OWNED);
212 #define VMEM_ALIGNUP(addr, align) (-(-(addr) & -(align)))
214 #define VMEM_CROSS_P(addr1, addr2, boundary) \
215 ((((addr1) ^ (addr2)) & -(boundary)) != 0)
217 #define ORDER2SIZE(order) ((order) < VMEM_OPTVALUE ? ((order) + 1) : \
218 (vmem_size_t)1 << ((order) - (VMEM_OPTVALUE - VMEM_OPTORDER - 1)))
219 #define SIZE2ORDER(size) ((size) <= VMEM_OPTVALUE ? ((size) - 1) : \
220 (flsl(size) + (VMEM_OPTVALUE - VMEM_OPTORDER - 2)))
223 * Maximum number of boundary tags that may be required to satisfy an
224 * allocation. Two may be required to import. Another two may be
225 * required to clip edges.
227 #define BT_MAXALLOC 4
230 * Max free limits the number of locally cached boundary tags. We
231 * just want to avoid hitting the zone allocator for every call.
233 #define BT_MAXFREE (BT_MAXALLOC * 8)
235 /* Allocator for boundary tags. */
236 static uma_zone_t vmem_bt_zone;
238 /* boot time arena storage. */
239 static struct vmem kernel_arena_storage;
240 static struct vmem buffer_arena_storage;
241 static struct vmem transient_arena_storage;
242 /* kernel and kmem arenas are aliased for backwards KPI compat. */
243 vmem_t *kernel_arena = &kernel_arena_storage;
244 vmem_t *kmem_arena = &kernel_arena_storage;
245 vmem_t *buffer_arena = &buffer_arena_storage;
246 vmem_t *transient_arena = &transient_arena_storage;
248 #ifdef DEBUG_MEMGUARD
249 static struct vmem memguard_arena_storage;
250 vmem_t *memguard_arena = &memguard_arena_storage;
254 * Fill the vmem's boundary tag cache. We guarantee that boundary tag
255 * allocation will not fail once bt_fill() passes. To do so we cache
256 * at least the maximum possible tag allocations in the arena.
259 bt_fill(vmem_t *vm, int flags)
263 VMEM_ASSERT_LOCKED(vm);
266 * Only allow the kernel arena and arenas derived from kernel arena to
267 * dip into reserve tags. They are where new tags come from.
270 if (vm != kernel_arena && vm->vm_arg != kernel_arena)
271 flags &= ~M_USE_RESERVE;
274 * Loop until we meet the reserve. To minimize the lock shuffle
275 * and prevent simultaneous fills we first try a NOWAIT regardless
276 * of the caller's flags. Specify M_NOVM so we don't recurse while
277 * holding a vmem lock.
279 while (vm->vm_nfreetags < BT_MAXALLOC) {
280 bt = uma_zalloc(vmem_bt_zone,
281 (flags & M_USE_RESERVE) | M_NOWAIT | M_NOVM);
284 bt = uma_zalloc(vmem_bt_zone, flags);
289 LIST_INSERT_HEAD(&vm->vm_freetags, bt, bt_freelist);
293 if (vm->vm_nfreetags < BT_MAXALLOC)
300 * Pop a tag off of the freetag stack.
307 VMEM_ASSERT_LOCKED(vm);
308 bt = LIST_FIRST(&vm->vm_freetags);
310 LIST_REMOVE(bt, bt_freelist);
317 * Trim the per-vmem free list. Returns with the lock released to
318 * avoid allocator recursions.
321 bt_freetrim(vmem_t *vm, int freelimit)
323 LIST_HEAD(, vmem_btag) freetags;
326 LIST_INIT(&freetags);
327 VMEM_ASSERT_LOCKED(vm);
328 while (vm->vm_nfreetags > freelimit) {
329 bt = LIST_FIRST(&vm->vm_freetags);
330 LIST_REMOVE(bt, bt_freelist);
332 LIST_INSERT_HEAD(&freetags, bt, bt_freelist);
335 while ((bt = LIST_FIRST(&freetags)) != NULL) {
336 LIST_REMOVE(bt, bt_freelist);
337 uma_zfree(vmem_bt_zone, bt);
342 bt_free(vmem_t *vm, bt_t *bt)
345 VMEM_ASSERT_LOCKED(vm);
346 MPASS(LIST_FIRST(&vm->vm_freetags) != bt);
347 LIST_INSERT_HEAD(&vm->vm_freetags, bt, bt_freelist);
352 * freelist[0] ... [1, 1]
353 * freelist[1] ... [2, 2]
355 * freelist[29] ... [30, 30]
356 * freelist[30] ... [31, 31]
357 * freelist[31] ... [32, 63]
358 * freelist[33] ... [64, 127]
360 * freelist[n] ... [(1 << (n - 26)), (1 << (n - 25)) - 1]
364 static struct vmem_freelist *
365 bt_freehead_tofree(vmem_t *vm, vmem_size_t size)
367 const vmem_size_t qsize = size >> vm->vm_quantum_shift;
368 const int idx = SIZE2ORDER(qsize);
370 MPASS(size != 0 && qsize != 0);
371 MPASS((size & vm->vm_quantum_mask) == 0);
373 MPASS(idx < VMEM_MAXORDER);
375 return &vm->vm_freelist[idx];
379 * bt_freehead_toalloc: return the freelist for the given size and allocation
382 * For M_FIRSTFIT, return the list in which any blocks are large enough
383 * for the requested size. otherwise, return the list which can have blocks
384 * large enough for the requested size.
386 static struct vmem_freelist *
387 bt_freehead_toalloc(vmem_t *vm, vmem_size_t size, int strat)
389 const vmem_size_t qsize = size >> vm->vm_quantum_shift;
390 int idx = SIZE2ORDER(qsize);
392 MPASS(size != 0 && qsize != 0);
393 MPASS((size & vm->vm_quantum_mask) == 0);
395 if (strat == M_FIRSTFIT && ORDER2SIZE(idx) != qsize) {
397 /* check too large request? */
400 MPASS(idx < VMEM_MAXORDER);
402 return &vm->vm_freelist[idx];
405 /* ---- boundary tag hash */
407 static struct vmem_hashlist *
408 bt_hashhead(vmem_t *vm, vmem_addr_t addr)
410 struct vmem_hashlist *list;
413 hash = hash32_buf(&addr, sizeof(addr), 0);
414 list = &vm->vm_hashlist[hash % vm->vm_hashsize];
420 bt_lookupbusy(vmem_t *vm, vmem_addr_t addr)
422 struct vmem_hashlist *list;
425 VMEM_ASSERT_LOCKED(vm);
426 list = bt_hashhead(vm, addr);
427 LIST_FOREACH(bt, list, bt_hashlist) {
428 if (bt->bt_start == addr) {
437 bt_rembusy(vmem_t *vm, bt_t *bt)
440 VMEM_ASSERT_LOCKED(vm);
441 MPASS(vm->vm_nbusytag > 0);
442 vm->vm_inuse -= bt->bt_size;
444 LIST_REMOVE(bt, bt_hashlist);
448 bt_insbusy(vmem_t *vm, bt_t *bt)
450 struct vmem_hashlist *list;
452 VMEM_ASSERT_LOCKED(vm);
453 MPASS(bt->bt_type == BT_TYPE_BUSY);
455 list = bt_hashhead(vm, bt->bt_start);
456 LIST_INSERT_HEAD(list, bt, bt_hashlist);
458 vm->vm_inuse += bt->bt_size;
461 /* ---- boundary tag list */
464 bt_remseg(vmem_t *vm, bt_t *bt)
467 MPASS(bt->bt_type != BT_TYPE_CURSOR);
468 TAILQ_REMOVE(&vm->vm_seglist, bt, bt_seglist);
473 bt_insseg(vmem_t *vm, bt_t *bt, bt_t *prev)
476 TAILQ_INSERT_AFTER(&vm->vm_seglist, prev, bt, bt_seglist);
480 bt_insseg_tail(vmem_t *vm, bt_t *bt)
483 TAILQ_INSERT_TAIL(&vm->vm_seglist, bt, bt_seglist);
487 bt_remfree(vmem_t *vm, bt_t *bt)
490 MPASS(bt->bt_type == BT_TYPE_FREE);
492 LIST_REMOVE(bt, bt_freelist);
496 bt_insfree(vmem_t *vm, bt_t *bt)
498 struct vmem_freelist *list;
500 list = bt_freehead_tofree(vm, bt->bt_size);
501 LIST_INSERT_HEAD(list, bt, bt_freelist);
504 /* ---- vmem internal functions */
507 * Import from the arena into the quantum cache in UMA.
509 * We use VMEM_ADDR_QCACHE_MIN instead of 0: uma_zalloc() returns 0 to indicate
510 * failure, so UMA can't be used to cache a resource with value 0.
513 qc_import(void *arg, void **store, int cnt, int domain, int flags)
519 KASSERT((flags & M_WAITOK) == 0, ("blocking allocation"));
522 for (i = 0; i < cnt; i++) {
523 if (vmem_xalloc(qc->qc_vmem, qc->qc_size, 0, 0, 0,
524 VMEM_ADDR_QCACHE_MIN, VMEM_ADDR_MAX, flags, &addr) != 0)
526 store[i] = (void *)addr;
532 * Release memory from the UMA cache to the arena.
535 qc_release(void *arg, void **store, int cnt)
541 for (i = 0; i < cnt; i++)
542 vmem_xfree(qc->qc_vmem, (vmem_addr_t)store[i], qc->qc_size);
546 qc_init(vmem_t *vm, vmem_size_t qcache_max)
553 MPASS((qcache_max & vm->vm_quantum_mask) == 0);
554 qcache_idx_max = MIN(qcache_max >> vm->vm_quantum_shift,
555 VMEM_QCACHE_IDX_MAX);
556 vm->vm_qcache_max = qcache_idx_max << vm->vm_quantum_shift;
557 for (i = 0; i < qcache_idx_max; i++) {
558 qc = &vm->vm_qcache[i];
559 size = (i + 1) << vm->vm_quantum_shift;
560 snprintf(qc->qc_name, sizeof(qc->qc_name), "%s-%zu",
564 qc->qc_cache = uma_zcache_create(qc->qc_name, size,
565 NULL, NULL, NULL, NULL, qc_import, qc_release, qc,
572 qc_destroy(vmem_t *vm)
577 qcache_idx_max = vm->vm_qcache_max >> vm->vm_quantum_shift;
578 for (i = 0; i < qcache_idx_max; i++)
579 uma_zdestroy(vm->vm_qcache[i].qc_cache);
588 qcache_idx_max = vm->vm_qcache_max >> vm->vm_quantum_shift;
589 for (i = 0; i < qcache_idx_max; i++)
590 uma_zone_reclaim(vm->vm_qcache[i].qc_cache, UMA_RECLAIM_DRAIN);
593 #ifndef UMA_MD_SMALL_ALLOC
595 static struct mtx_padalign __exclusive_cache_line vmem_bt_lock;
598 * vmem_bt_alloc: Allocate a new page of boundary tags.
600 * On architectures with uma_small_alloc there is no recursion; no address
601 * space need be allocated to allocate boundary tags. For the others, we
602 * must handle recursion. Boundary tags are necessary to allocate new
605 * UMA guarantees that enough tags are held in reserve to allocate a new
606 * page of kva. We dip into this reserve by specifying M_USE_RESERVE only
607 * when allocating the page to hold new boundary tags. In this way the
608 * reserve is automatically filled by the allocation that uses the reserve.
610 * We still have to guarantee that the new tags are allocated atomically since
611 * many threads may try concurrently. The bt_lock provides this guarantee.
612 * We convert WAITOK allocations to NOWAIT and then handle the blocking here
613 * on failure. It's ok to return NULL for a WAITOK allocation as UMA will
614 * loop again after checking to see if we lost the race to allocate.
616 * There is a small race between vmem_bt_alloc() returning the page and the
617 * zone lock being acquired to add the page to the zone. For WAITOK
618 * allocations we just pause briefly. NOWAIT may experience a transient
619 * failure. To alleviate this we permit a small number of simultaneous
620 * fills to proceed concurrently so NOWAIT is less likely to fail unless
621 * we are really out of KVA.
624 vmem_bt_alloc(uma_zone_t zone, vm_size_t bytes, int domain, uint8_t *pflag,
629 *pflag = UMA_SLAB_KERNEL;
632 * Single thread boundary tag allocation so that the address space
633 * and memory are added in one atomic operation.
635 mtx_lock(&vmem_bt_lock);
636 if (vmem_xalloc(vm_dom[domain].vmd_kernel_arena, bytes, 0, 0, 0,
637 VMEM_ADDR_MIN, VMEM_ADDR_MAX,
638 M_NOWAIT | M_NOVM | M_USE_RESERVE | M_BESTFIT, &addr) == 0) {
639 if (kmem_back_domain(domain, kernel_object, addr, bytes,
640 M_NOWAIT | M_USE_RESERVE) == 0) {
641 mtx_unlock(&vmem_bt_lock);
642 return ((void *)addr);
644 vmem_xfree(vm_dom[domain].vmd_kernel_arena, addr, bytes);
645 mtx_unlock(&vmem_bt_lock);
647 * Out of memory, not address space. This may not even be
648 * possible due to M_USE_RESERVE page allocation.
651 vm_wait_domain(domain);
654 mtx_unlock(&vmem_bt_lock);
656 * We're either out of address space or lost a fill race.
669 mtx_init(&vmem_list_lock, "vmem list lock", NULL, MTX_DEF);
670 vmem_zone = uma_zcreate("vmem",
671 sizeof(struct vmem), NULL, NULL, NULL, NULL,
672 UMA_ALIGN_PTR, UMA_ZONE_VM);
673 vmem_bt_zone = uma_zcreate("vmem btag",
674 sizeof(struct vmem_btag), NULL, NULL, NULL, NULL,
675 UMA_ALIGN_PTR, UMA_ZONE_VM | UMA_ZONE_NOFREE);
676 #ifndef UMA_MD_SMALL_ALLOC
677 mtx_init(&vmem_bt_lock, "btag lock", NULL, MTX_DEF);
678 uma_prealloc(vmem_bt_zone, BT_MAXALLOC);
680 * Reserve enough tags to allocate new tags. We allow multiple
681 * CPUs to attempt to allocate new tags concurrently to limit
682 * false restarts in UMA. vmem_bt_alloc() allocates from a per-domain
683 * arena, which may involve importing a range from the kernel arena,
684 * so we need to keep at least 2 * BT_MAXALLOC tags reserved.
686 uma_zone_reserve(vmem_bt_zone, 2 * BT_MAXALLOC * mp_ncpus);
687 uma_zone_set_allocf(vmem_bt_zone, vmem_bt_alloc);
694 vmem_rehash(vmem_t *vm, vmem_size_t newhashsize)
698 struct vmem_hashlist *newhashlist;
699 struct vmem_hashlist *oldhashlist;
700 vmem_size_t oldhashsize;
702 MPASS(newhashsize > 0);
704 newhashlist = malloc(sizeof(struct vmem_hashlist) * newhashsize,
706 if (newhashlist == NULL)
708 for (i = 0; i < newhashsize; i++) {
709 LIST_INIT(&newhashlist[i]);
713 oldhashlist = vm->vm_hashlist;
714 oldhashsize = vm->vm_hashsize;
715 vm->vm_hashlist = newhashlist;
716 vm->vm_hashsize = newhashsize;
717 if (oldhashlist == NULL) {
721 for (i = 0; i < oldhashsize; i++) {
722 while ((bt = LIST_FIRST(&oldhashlist[i])) != NULL) {
729 if (oldhashlist != vm->vm_hash0) {
730 free(oldhashlist, M_VMEM);
737 vmem_periodic_kick(void *dummy)
740 taskqueue_enqueue(taskqueue_thread, &vmem_periodic_wk);
744 vmem_periodic(void *unused, int pending)
750 mtx_lock(&vmem_list_lock);
751 LIST_FOREACH(vm, &vmem_list, vm_alllist) {
753 /* Convenient time to verify vmem state. */
754 if (enable_vmem_check == 1) {
760 desired = 1 << flsl(vm->vm_nbusytag);
761 desired = MIN(MAX(desired, VMEM_HASHSIZE_MIN),
763 current = vm->vm_hashsize;
765 /* Grow in powers of two. Shrink less aggressively. */
766 if (desired >= current * 2 || desired * 4 <= current)
767 vmem_rehash(vm, desired);
770 * Periodically wake up threads waiting for resources,
771 * so they could ask for reclamation again.
773 VMEM_CONDVAR_BROADCAST(vm);
775 mtx_unlock(&vmem_list_lock);
777 callout_reset(&vmem_periodic_ch, vmem_periodic_interval,
778 vmem_periodic_kick, NULL);
782 vmem_start_callout(void *unused)
785 TASK_INIT(&vmem_periodic_wk, 0, vmem_periodic, NULL);
786 vmem_periodic_interval = hz * 10;
787 callout_init(&vmem_periodic_ch, 1);
788 callout_reset(&vmem_periodic_ch, vmem_periodic_interval,
789 vmem_periodic_kick, NULL);
791 SYSINIT(vfs, SI_SUB_CONFIGURE, SI_ORDER_ANY, vmem_start_callout, NULL);
794 vmem_add1(vmem_t *vm, vmem_addr_t addr, vmem_size_t size, int type)
799 MPASS(type == BT_TYPE_SPAN || type == BT_TYPE_SPAN_STATIC);
800 MPASS((size & vm->vm_quantum_mask) == 0);
802 btspan = bt_alloc(vm);
803 btspan->bt_type = type;
804 btspan->bt_start = addr;
805 btspan->bt_size = size;
806 bt_insseg_tail(vm, btspan);
808 btfree = bt_alloc(vm);
809 btfree->bt_type = BT_TYPE_FREE;
810 btfree->bt_start = addr;
811 btfree->bt_size = size;
812 bt_insseg(vm, btfree, btspan);
813 bt_insfree(vm, btfree);
819 vmem_destroy1(vmem_t *vm)
824 * Drain per-cpu quantum caches.
829 * The vmem should now only contain empty segments.
832 MPASS(vm->vm_nbusytag == 0);
834 TAILQ_REMOVE(&vm->vm_seglist, &vm->vm_cursor, bt_seglist);
835 while ((bt = TAILQ_FIRST(&vm->vm_seglist)) != NULL)
838 if (vm->vm_hashlist != NULL && vm->vm_hashlist != vm->vm_hash0)
839 free(vm->vm_hashlist, M_VMEM);
843 VMEM_CONDVAR_DESTROY(vm);
844 VMEM_LOCK_DESTROY(vm);
845 uma_zfree(vmem_zone, vm);
849 vmem_import(vmem_t *vm, vmem_size_t size, vmem_size_t align, int flags)
854 if (vm->vm_importfn == NULL)
858 * To make sure we get a span that meets the alignment we double it
859 * and add the size to the tail. This slightly overestimates.
861 if (align != vm->vm_quantum_mask + 1)
862 size = (align * 2) + size;
863 size = roundup(size, vm->vm_import_quantum);
865 if (vm->vm_limit != 0 && vm->vm_limit < vm->vm_size + size)
869 * Hide MAXALLOC tags so we're guaranteed to be able to add this
870 * span and the tag we want to allocate from it.
872 MPASS(vm->vm_nfreetags >= BT_MAXALLOC);
873 vm->vm_nfreetags -= BT_MAXALLOC;
875 error = (vm->vm_importfn)(vm->vm_arg, size, flags, &addr);
877 vm->vm_nfreetags += BT_MAXALLOC;
881 vmem_add1(vm, addr, size, BT_TYPE_SPAN);
887 * vmem_fit: check if a bt can satisfy the given restrictions.
889 * it's a caller's responsibility to ensure the region is big enough
893 vmem_fit(const bt_t *bt, vmem_size_t size, vmem_size_t align,
894 vmem_size_t phase, vmem_size_t nocross, vmem_addr_t minaddr,
895 vmem_addr_t maxaddr, vmem_addr_t *addrp)
901 MPASS(bt->bt_size >= size); /* caller's responsibility */
904 * XXX assumption: vmem_addr_t and vmem_size_t are
905 * unsigned integer of the same size.
908 start = bt->bt_start;
909 if (start < minaddr) {
918 start = VMEM_ALIGNUP(start - phase, align) + phase;
919 if (start < bt->bt_start)
921 if (VMEM_CROSS_P(start, start + size - 1, nocross)) {
922 MPASS(align < nocross);
923 start = VMEM_ALIGNUP(start - phase, nocross) + phase;
925 if (start <= end && end - start >= size - 1) {
926 MPASS((start & (align - 1)) == phase);
927 MPASS(!VMEM_CROSS_P(start, start + size - 1, nocross));
928 MPASS(minaddr <= start);
929 MPASS(maxaddr == 0 || start + size - 1 <= maxaddr);
930 MPASS(bt->bt_start <= start);
931 MPASS(BT_END(bt) - start >= size - 1);
940 * vmem_clip: Trim the boundary tag edges to the requested start and size.
943 vmem_clip(vmem_t *vm, bt_t *bt, vmem_addr_t start, vmem_size_t size)
948 VMEM_ASSERT_LOCKED(vm);
949 MPASS(bt->bt_type == BT_TYPE_FREE);
950 MPASS(bt->bt_size >= size);
952 if (bt->bt_start != start) {
953 btprev = bt_alloc(vm);
954 btprev->bt_type = BT_TYPE_FREE;
955 btprev->bt_start = bt->bt_start;
956 btprev->bt_size = start - bt->bt_start;
957 bt->bt_start = start;
958 bt->bt_size -= btprev->bt_size;
959 bt_insfree(vm, btprev);
960 bt_insseg(vm, btprev,
961 TAILQ_PREV(bt, vmem_seglist, bt_seglist));
963 MPASS(bt->bt_start == start);
964 if (bt->bt_size != size && bt->bt_size - size > vm->vm_quantum_mask) {
966 btnew = bt_alloc(vm);
967 btnew->bt_type = BT_TYPE_BUSY;
968 btnew->bt_start = bt->bt_start;
969 btnew->bt_size = size;
970 bt->bt_start = bt->bt_start + size;
974 TAILQ_PREV(bt, vmem_seglist, bt_seglist));
975 bt_insbusy(vm, btnew);
978 bt->bt_type = BT_TYPE_BUSY;
981 MPASS(bt->bt_size >= size);
985 vmem_try_fetch(vmem_t *vm, const vmem_size_t size, vmem_size_t align, int flags)
989 VMEM_ASSERT_LOCKED(vm);
992 * XXX it is possible to fail to meet xalloc constraints with the
993 * imported region. It is up to the user to specify the
994 * import quantum such that it can satisfy any allocation.
996 if (vmem_import(vm, size, align, flags) == 0)
1000 * Try to free some space from the quantum cache or reclaim
1001 * functions if available.
1003 if (vm->vm_qcache_max != 0 || vm->vm_reclaimfn != NULL) {
1004 avail = vm->vm_size - vm->vm_inuse;
1006 if (vm->vm_qcache_max != 0)
1008 if (vm->vm_reclaimfn != NULL)
1009 vm->vm_reclaimfn(vm, flags);
1011 /* If we were successful retry even NOWAIT. */
1012 if (vm->vm_size - vm->vm_inuse > avail)
1015 if ((flags & M_NOWAIT) != 0)
1017 VMEM_CONDVAR_WAIT(vm);
1022 vmem_try_release(vmem_t *vm, struct vmem_btag *bt, const bool remfree)
1024 struct vmem_btag *prev;
1026 MPASS(bt->bt_type == BT_TYPE_FREE);
1028 if (vm->vm_releasefn == NULL)
1031 prev = TAILQ_PREV(bt, vmem_seglist, bt_seglist);
1032 MPASS(prev != NULL);
1033 MPASS(prev->bt_type != BT_TYPE_FREE);
1035 if (prev->bt_type == BT_TYPE_SPAN && prev->bt_size == bt->bt_size) {
1036 vmem_addr_t spanaddr;
1037 vmem_size_t spansize;
1039 MPASS(prev->bt_start == bt->bt_start);
1040 spanaddr = prev->bt_start;
1041 spansize = prev->bt_size;
1045 bt_remseg(vm, prev);
1046 vm->vm_size -= spansize;
1047 VMEM_CONDVAR_BROADCAST(vm);
1048 bt_freetrim(vm, BT_MAXFREE);
1049 vm->vm_releasefn(vm->vm_arg, spanaddr, spansize);
1056 vmem_xalloc_nextfit(vmem_t *vm, const vmem_size_t size, vmem_size_t align,
1057 const vmem_size_t phase, const vmem_size_t nocross, int flags,
1060 struct vmem_btag *bt, *cursor, *next, *prev;
1067 * Make sure we have enough tags to complete the operation.
1069 if (vm->vm_nfreetags < BT_MAXALLOC && bt_fill(vm, flags) != 0)
1073 * Find the next free tag meeting our constraints. If one is found,
1074 * perform the allocation.
1076 for (cursor = &vm->vm_cursor, bt = TAILQ_NEXT(cursor, bt_seglist);
1077 bt != cursor; bt = TAILQ_NEXT(bt, bt_seglist)) {
1079 bt = TAILQ_FIRST(&vm->vm_seglist);
1080 if (bt->bt_type == BT_TYPE_FREE && bt->bt_size >= size &&
1081 (error = vmem_fit(bt, size, align, phase, nocross,
1082 VMEM_ADDR_MIN, VMEM_ADDR_MAX, addrp)) == 0) {
1083 vmem_clip(vm, bt, *addrp, size);
1089 * Try to coalesce free segments around the cursor. If we succeed, and
1090 * have not yet satisfied the allocation request, try again with the
1091 * newly coalesced segment.
1093 if ((next = TAILQ_NEXT(cursor, bt_seglist)) != NULL &&
1094 (prev = TAILQ_PREV(cursor, vmem_seglist, bt_seglist)) != NULL &&
1095 next->bt_type == BT_TYPE_FREE && prev->bt_type == BT_TYPE_FREE &&
1096 prev->bt_start + prev->bt_size == next->bt_start) {
1097 prev->bt_size += next->bt_size;
1098 bt_remfree(vm, next);
1099 bt_remseg(vm, next);
1102 * The coalesced segment might be able to satisfy our request.
1103 * If not, we might need to release it from the arena.
1105 if (error == ENOMEM && prev->bt_size >= size &&
1106 (error = vmem_fit(prev, size, align, phase, nocross,
1107 VMEM_ADDR_MIN, VMEM_ADDR_MAX, addrp)) == 0) {
1108 vmem_clip(vm, prev, *addrp, size);
1111 (void)vmem_try_release(vm, prev, true);
1115 * If the allocation was successful, advance the cursor.
1118 TAILQ_REMOVE(&vm->vm_seglist, cursor, bt_seglist);
1119 for (; bt != NULL && bt->bt_start < *addrp + size;
1120 bt = TAILQ_NEXT(bt, bt_seglist))
1123 TAILQ_INSERT_BEFORE(bt, cursor, bt_seglist);
1125 TAILQ_INSERT_HEAD(&vm->vm_seglist, cursor, bt_seglist);
1129 * Attempt to bring additional resources into the arena. If that fails
1130 * and M_WAITOK is specified, sleep waiting for resources to be freed.
1132 if (error == ENOMEM && vmem_try_fetch(vm, size, align, flags))
1143 vmem_set_import(vmem_t *vm, vmem_import_t *importfn,
1144 vmem_release_t *releasefn, void *arg, vmem_size_t import_quantum)
1148 vm->vm_importfn = importfn;
1149 vm->vm_releasefn = releasefn;
1151 vm->vm_import_quantum = import_quantum;
1156 vmem_set_limit(vmem_t *vm, vmem_size_t limit)
1160 vm->vm_limit = limit;
1165 vmem_set_reclaim(vmem_t *vm, vmem_reclaim_t *reclaimfn)
1169 vm->vm_reclaimfn = reclaimfn;
1174 * vmem_init: Initializes vmem arena.
1177 vmem_init(vmem_t *vm, const char *name, vmem_addr_t base, vmem_size_t size,
1178 vmem_size_t quantum, vmem_size_t qcache_max, int flags)
1183 MPASS((quantum & (quantum - 1)) == 0);
1185 bzero(vm, sizeof(*vm));
1187 VMEM_CONDVAR_INIT(vm, name);
1188 VMEM_LOCK_INIT(vm, name);
1189 vm->vm_nfreetags = 0;
1190 LIST_INIT(&vm->vm_freetags);
1191 strlcpy(vm->vm_name, name, sizeof(vm->vm_name));
1192 vm->vm_quantum_mask = quantum - 1;
1193 vm->vm_quantum_shift = flsl(quantum) - 1;
1194 vm->vm_nbusytag = 0;
1198 qc_init(vm, qcache_max);
1200 TAILQ_INIT(&vm->vm_seglist);
1201 vm->vm_cursor.bt_start = vm->vm_cursor.bt_size = 0;
1202 vm->vm_cursor.bt_type = BT_TYPE_CURSOR;
1203 TAILQ_INSERT_TAIL(&vm->vm_seglist, &vm->vm_cursor, bt_seglist);
1205 for (i = 0; i < VMEM_MAXORDER; i++)
1206 LIST_INIT(&vm->vm_freelist[i]);
1208 memset(&vm->vm_hash0, 0, sizeof(vm->vm_hash0));
1209 vm->vm_hashsize = VMEM_HASHSIZE_MIN;
1210 vm->vm_hashlist = vm->vm_hash0;
1213 if (vmem_add(vm, base, size, flags) != 0) {
1219 mtx_lock(&vmem_list_lock);
1220 LIST_INSERT_HEAD(&vmem_list, vm, vm_alllist);
1221 mtx_unlock(&vmem_list_lock);
1227 * vmem_create: create an arena.
1230 vmem_create(const char *name, vmem_addr_t base, vmem_size_t size,
1231 vmem_size_t quantum, vmem_size_t qcache_max, int flags)
1236 vm = uma_zalloc(vmem_zone, flags & (M_WAITOK|M_NOWAIT));
1239 if (vmem_init(vm, name, base, size, quantum, qcache_max,
1246 vmem_destroy(vmem_t *vm)
1249 mtx_lock(&vmem_list_lock);
1250 LIST_REMOVE(vm, vm_alllist);
1251 mtx_unlock(&vmem_list_lock);
1257 vmem_roundup_size(vmem_t *vm, vmem_size_t size)
1260 return (size + vm->vm_quantum_mask) & ~vm->vm_quantum_mask;
1264 * vmem_alloc: allocate resource from the arena.
1267 vmem_alloc(vmem_t *vm, vmem_size_t size, int flags, vmem_addr_t *addrp)
1269 const int strat __unused = flags & VMEM_FITMASK;
1272 flags &= VMEM_FLAGS;
1274 MPASS(strat == M_BESTFIT || strat == M_FIRSTFIT || strat == M_NEXTFIT);
1275 if ((flags & M_NOWAIT) == 0)
1276 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, "vmem_alloc");
1278 if (size <= vm->vm_qcache_max) {
1280 * Resource 0 cannot be cached, so avoid a blocking allocation
1281 * in qc_import() and give the vmem_xalloc() call below a chance
1284 qc = &vm->vm_qcache[(size - 1) >> vm->vm_quantum_shift];
1285 *addrp = (vmem_addr_t)uma_zalloc(qc->qc_cache,
1286 (flags & ~M_WAITOK) | M_NOWAIT);
1287 if (__predict_true(*addrp != 0))
1291 return (vmem_xalloc(vm, size, 0, 0, 0, VMEM_ADDR_MIN, VMEM_ADDR_MAX,
1296 vmem_xalloc(vmem_t *vm, const vmem_size_t size0, vmem_size_t align,
1297 const vmem_size_t phase, const vmem_size_t nocross,
1298 const vmem_addr_t minaddr, const vmem_addr_t maxaddr, int flags,
1301 const vmem_size_t size = vmem_roundup_size(vm, size0);
1302 struct vmem_freelist *list;
1303 struct vmem_freelist *first;
1304 struct vmem_freelist *end;
1309 flags &= VMEM_FLAGS;
1310 strat = flags & VMEM_FITMASK;
1313 MPASS(strat == M_BESTFIT || strat == M_FIRSTFIT || strat == M_NEXTFIT);
1314 MPASS((flags & (M_NOWAIT|M_WAITOK)) != (M_NOWAIT|M_WAITOK));
1315 if ((flags & M_NOWAIT) == 0)
1316 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, "vmem_xalloc");
1317 MPASS((align & vm->vm_quantum_mask) == 0);
1318 MPASS((align & (align - 1)) == 0);
1319 MPASS((phase & vm->vm_quantum_mask) == 0);
1320 MPASS((nocross & vm->vm_quantum_mask) == 0);
1321 MPASS((nocross & (nocross - 1)) == 0);
1322 MPASS((align == 0 && phase == 0) || phase < align);
1323 MPASS(nocross == 0 || nocross >= size);
1324 MPASS(minaddr <= maxaddr);
1325 MPASS(!VMEM_CROSS_P(phase, phase + size - 1, nocross));
1326 if (strat == M_NEXTFIT)
1327 MPASS(minaddr == VMEM_ADDR_MIN && maxaddr == VMEM_ADDR_MAX);
1330 align = vm->vm_quantum_mask + 1;
1334 * Next-fit allocations don't use the freelists.
1336 if (strat == M_NEXTFIT)
1337 return (vmem_xalloc_nextfit(vm, size0, align, phase, nocross,
1340 end = &vm->vm_freelist[VMEM_MAXORDER];
1342 * choose a free block from which we allocate.
1344 first = bt_freehead_toalloc(vm, size, strat);
1348 * Make sure we have enough tags to complete the
1351 if (vm->vm_nfreetags < BT_MAXALLOC &&
1352 bt_fill(vm, flags) != 0) {
1358 * Scan freelists looking for a tag that satisfies the
1359 * allocation. If we're doing BESTFIT we may encounter
1360 * sizes below the request. If we're doing FIRSTFIT we
1361 * inspect only the first element from each list.
1363 for (list = first; list < end; list++) {
1364 LIST_FOREACH(bt, list, bt_freelist) {
1365 if (bt->bt_size >= size) {
1366 error = vmem_fit(bt, size, align, phase,
1367 nocross, minaddr, maxaddr, addrp);
1369 vmem_clip(vm, bt, *addrp, size);
1373 /* FIRST skips to the next list. */
1374 if (strat == M_FIRSTFIT)
1380 * Retry if the fast algorithm failed.
1382 if (strat == M_FIRSTFIT) {
1384 first = bt_freehead_toalloc(vm, size, strat);
1389 * Try a few measures to bring additional resources into the
1390 * arena. If all else fails, we will sleep waiting for
1391 * resources to be freed.
1393 if (!vmem_try_fetch(vm, size, align, flags)) {
1400 if (error != 0 && (flags & M_NOWAIT) == 0)
1401 panic("failed to allocate waiting allocation\n");
1407 * vmem_free: free the resource to the arena.
1410 vmem_free(vmem_t *vm, vmem_addr_t addr, vmem_size_t size)
1415 if (size <= vm->vm_qcache_max &&
1416 __predict_true(addr >= VMEM_ADDR_QCACHE_MIN)) {
1417 qc = &vm->vm_qcache[(size - 1) >> vm->vm_quantum_shift];
1418 uma_zfree(qc->qc_cache, (void *)addr);
1420 vmem_xfree(vm, addr, size);
1424 vmem_xfree(vmem_t *vm, vmem_addr_t addr, vmem_size_t size)
1432 bt = bt_lookupbusy(vm, addr);
1434 MPASS(bt->bt_start == addr);
1435 MPASS(bt->bt_size == vmem_roundup_size(vm, size) ||
1436 bt->bt_size - vmem_roundup_size(vm, size) <= vm->vm_quantum_mask);
1437 MPASS(bt->bt_type == BT_TYPE_BUSY);
1439 bt->bt_type = BT_TYPE_FREE;
1442 t = TAILQ_NEXT(bt, bt_seglist);
1443 if (t != NULL && t->bt_type == BT_TYPE_FREE) {
1444 MPASS(BT_END(bt) < t->bt_start); /* YYY */
1445 bt->bt_size += t->bt_size;
1449 t = TAILQ_PREV(bt, vmem_seglist, bt_seglist);
1450 if (t != NULL && t->bt_type == BT_TYPE_FREE) {
1451 MPASS(BT_END(t) < bt->bt_start); /* YYY */
1452 bt->bt_size += t->bt_size;
1453 bt->bt_start = t->bt_start;
1458 if (!vmem_try_release(vm, bt, false)) {
1460 VMEM_CONDVAR_BROADCAST(vm);
1461 bt_freetrim(vm, BT_MAXFREE);
1470 vmem_add(vmem_t *vm, vmem_addr_t addr, vmem_size_t size, int flags)
1475 flags &= VMEM_FLAGS;
1477 if (vm->vm_nfreetags >= BT_MAXALLOC || bt_fill(vm, flags) == 0)
1478 vmem_add1(vm, addr, size, BT_TYPE_SPAN_STATIC);
1487 * vmem_size: information about arenas size
1490 vmem_size(vmem_t *vm, int typemask)
1496 return vm->vm_inuse;
1498 return vm->vm_size - vm->vm_inuse;
1499 case VMEM_FREE|VMEM_ALLOC:
1503 for (i = VMEM_MAXORDER - 1; i >= 0; i--) {
1504 if (LIST_EMPTY(&vm->vm_freelist[i]))
1507 return ((vmem_size_t)ORDER2SIZE(i) <<
1508 vm->vm_quantum_shift);
1519 #if defined(DDB) || defined(DIAGNOSTIC)
1521 static void bt_dump(const bt_t *, int (*)(const char *, ...)
1522 __printflike(1, 2));
1525 bt_type_string(int type)
1535 case BT_TYPE_SPAN_STATIC:
1536 return "static span";
1537 case BT_TYPE_CURSOR:
1546 bt_dump(const bt_t *bt, int (*pr)(const char *, ...))
1549 (*pr)("\t%p: %jx %jx, %d(%s)\n",
1550 bt, (intmax_t)bt->bt_start, (intmax_t)bt->bt_size,
1551 bt->bt_type, bt_type_string(bt->bt_type));
1555 vmem_dump(const vmem_t *vm , int (*pr)(const char *, ...) __printflike(1, 2))
1560 (*pr)("vmem %p '%s'\n", vm, vm->vm_name);
1561 TAILQ_FOREACH(bt, &vm->vm_seglist, bt_seglist) {
1565 for (i = 0; i < VMEM_MAXORDER; i++) {
1566 const struct vmem_freelist *fl = &vm->vm_freelist[i];
1568 if (LIST_EMPTY(fl)) {
1572 (*pr)("freelist[%d]\n", i);
1573 LIST_FOREACH(bt, fl, bt_freelist) {
1579 #endif /* defined(DDB) || defined(DIAGNOSTIC) */
1582 #include <ddb/ddb.h>
1585 vmem_whatis_lookup(vmem_t *vm, vmem_addr_t addr)
1589 TAILQ_FOREACH(bt, &vm->vm_seglist, bt_seglist) {
1590 if (BT_ISSPAN_P(bt)) {
1593 if (bt->bt_start <= addr && addr <= BT_END(bt)) {
1602 vmem_whatis(vmem_addr_t addr, int (*pr)(const char *, ...))
1606 LIST_FOREACH(vm, &vmem_list, vm_alllist) {
1609 bt = vmem_whatis_lookup(vm, addr);
1613 (*pr)("%p is %p+%zu in VMEM '%s' (%s)\n",
1614 (void *)addr, (void *)bt->bt_start,
1615 (vmem_size_t)(addr - bt->bt_start), vm->vm_name,
1616 (bt->bt_type == BT_TYPE_BUSY) ? "allocated" : "free");
1621 vmem_printall(const char *modif, int (*pr)(const char *, ...))
1625 LIST_FOREACH(vm, &vmem_list, vm_alllist) {
1631 vmem_print(vmem_addr_t addr, const char *modif, int (*pr)(const char *, ...))
1633 const vmem_t *vm = (const void *)addr;
1638 DB_SHOW_COMMAND(vmemdump, vmemdump)
1642 db_printf("usage: show vmemdump <addr>\n");
1646 vmem_dump((const vmem_t *)addr, db_printf);
1649 DB_SHOW_ALL_COMMAND(vmemdump, vmemdumpall)
1653 LIST_FOREACH(vm, &vmem_list, vm_alllist)
1654 vmem_dump(vm, db_printf);
1657 DB_SHOW_COMMAND(vmem, vmem_summ)
1659 const vmem_t *vm = (const void *)addr;
1661 size_t ft[VMEM_MAXORDER], ut[VMEM_MAXORDER];
1662 size_t fs[VMEM_MAXORDER], us[VMEM_MAXORDER];
1666 db_printf("usage: show vmem <addr>\n");
1670 db_printf("vmem %p '%s'\n", vm, vm->vm_name);
1671 db_printf("\tquantum:\t%zu\n", vm->vm_quantum_mask + 1);
1672 db_printf("\tsize:\t%zu\n", vm->vm_size);
1673 db_printf("\tinuse:\t%zu\n", vm->vm_inuse);
1674 db_printf("\tfree:\t%zu\n", vm->vm_size - vm->vm_inuse);
1675 db_printf("\tbusy tags:\t%d\n", vm->vm_nbusytag);
1676 db_printf("\tfree tags:\t%d\n", vm->vm_nfreetags);
1678 memset(&ft, 0, sizeof(ft));
1679 memset(&ut, 0, sizeof(ut));
1680 memset(&fs, 0, sizeof(fs));
1681 memset(&us, 0, sizeof(us));
1682 TAILQ_FOREACH(bt, &vm->vm_seglist, bt_seglist) {
1683 ord = SIZE2ORDER(bt->bt_size >> vm->vm_quantum_shift);
1684 if (bt->bt_type == BT_TYPE_BUSY) {
1686 us[ord] += bt->bt_size;
1687 } else if (bt->bt_type == BT_TYPE_FREE) {
1689 fs[ord] += bt->bt_size;
1692 db_printf("\t\t\tinuse\tsize\t\tfree\tsize\n");
1693 for (ord = 0; ord < VMEM_MAXORDER; ord++) {
1694 if (ut[ord] == 0 && ft[ord] == 0)
1696 db_printf("\t%-15zu %zu\t%-15zu %zu\t%-16zu\n",
1697 ORDER2SIZE(ord) << vm->vm_quantum_shift,
1698 ut[ord], us[ord], ft[ord], fs[ord]);
1702 DB_SHOW_ALL_COMMAND(vmem, vmem_summall)
1706 LIST_FOREACH(vm, &vmem_list, vm_alllist)
1707 vmem_summ((db_expr_t)vm, TRUE, count, modif);
1709 #endif /* defined(DDB) */
1711 #define vmem_printf printf
1713 #if defined(DIAGNOSTIC)
1716 vmem_check_sanity(vmem_t *vm)
1718 const bt_t *bt, *bt2;
1722 TAILQ_FOREACH(bt, &vm->vm_seglist, bt_seglist) {
1723 if (bt->bt_start > BT_END(bt)) {
1724 printf("corrupted tag\n");
1725 bt_dump(bt, vmem_printf);
1729 TAILQ_FOREACH(bt, &vm->vm_seglist, bt_seglist) {
1730 if (bt->bt_type == BT_TYPE_CURSOR) {
1731 if (bt->bt_start != 0 || bt->bt_size != 0) {
1732 printf("corrupted cursor\n");
1737 TAILQ_FOREACH(bt2, &vm->vm_seglist, bt_seglist) {
1741 if (bt2->bt_type == BT_TYPE_CURSOR) {
1744 if (BT_ISSPAN_P(bt) != BT_ISSPAN_P(bt2)) {
1747 if (bt->bt_start <= BT_END(bt2) &&
1748 bt2->bt_start <= BT_END(bt)) {
1749 printf("overwrapped tags\n");
1750 bt_dump(bt, vmem_printf);
1751 bt_dump(bt2, vmem_printf);
1761 vmem_check(vmem_t *vm)
1764 if (!vmem_check_sanity(vm)) {
1765 panic("insanity vmem %p", vm);
1769 #endif /* defined(DIAGNOSTIC) */