2 * Copyright (c) 2002-2005, 2009, 2013 Jeffrey Roberson <jeff@FreeBSD.org>
3 * Copyright (c) 2004, 2005 Bosko Milekic <bmilekic@FreeBSD.org>
4 * Copyright (c) 2004-2006 Robert N. M. Watson
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 unmodified, this list of conditions, and the following
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 ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 * uma_core.c Implementation of the Universal Memory allocator
32 * This allocator is intended to replace the multitude of similar object caches
33 * in the standard FreeBSD kernel. The intent is to be flexible as well as
34 * effecient. A primary design goal is to return unused memory to the rest of
35 * the system. This will make the system as a whole more flexible due to the
36 * ability to move memory to subsystems which most need it instead of leaving
37 * pools of reserved memory unused.
39 * The basic ideas stem from similar slab/zone based allocators whose algorithms
46 * - Improve memory usage for large allocations
47 * - Investigate cache size adjustments
50 #include <sys/cdefs.h>
51 __FBSDID("$FreeBSD$");
53 /* I should really use ktr.. */
56 #define UMA_DEBUG_ALLOC 1
57 #define UMA_DEBUG_ALLOC_1 1
61 #include "opt_param.h"
64 #include <sys/param.h>
65 #include <sys/systm.h>
66 #include <sys/bitset.h>
67 #include <sys/kernel.h>
68 #include <sys/types.h>
69 #include <sys/queue.h>
70 #include <sys/malloc.h>
73 #include <sys/sysctl.h>
74 #include <sys/mutex.h>
76 #include <sys/random.h>
77 #include <sys/rwlock.h>
79 #include <sys/sched.h>
81 #include <sys/vmmeter.h>
84 #include <vm/vm_object.h>
85 #include <vm/vm_page.h>
86 #include <vm/vm_pageout.h>
87 #include <vm/vm_param.h>
88 #include <vm/vm_map.h>
89 #include <vm/vm_kern.h>
90 #include <vm/vm_extern.h>
92 #include <vm/uma_int.h>
93 #include <vm/uma_dbg.h>
98 #include <vm/memguard.h>
102 * This is the zone and keg from which all zones are spawned. The idea is that
103 * even the zone & keg heads are allocated from the allocator, so we use the
104 * bss section to bootstrap us.
106 static struct uma_keg masterkeg;
107 static struct uma_zone masterzone_k;
108 static struct uma_zone masterzone_z;
109 static uma_zone_t kegs = &masterzone_k;
110 static uma_zone_t zones = &masterzone_z;
112 /* This is the zone from which all of uma_slab_t's are allocated. */
113 static uma_zone_t slabzone;
114 static uma_zone_t slabrefzone; /* With refcounters (for UMA_ZONE_REFCNT) */
117 * The initial hash tables come out of this zone so they can be allocated
118 * prior to malloc coming up.
120 static uma_zone_t hashzone;
122 /* The boot-time adjusted value for cache line alignment. */
123 int uma_align_cache = 64 - 1;
125 static MALLOC_DEFINE(M_UMAHASH, "UMAHash", "UMA Hash Buckets");
128 * Are we allowed to allocate buckets?
130 static int bucketdisable = 1;
132 /* Linked list of all kegs in the system */
133 static LIST_HEAD(,uma_keg) uma_kegs = LIST_HEAD_INITIALIZER(uma_kegs);
135 /* Linked list of all cache-only zones in the system */
136 static LIST_HEAD(,uma_zone) uma_cachezones =
137 LIST_HEAD_INITIALIZER(uma_cachezones);
139 /* This RW lock protects the keg list */
140 static struct rwlock_padalign uma_rwlock;
142 /* Linked list of boot time pages */
143 static LIST_HEAD(,uma_slab) uma_boot_pages =
144 LIST_HEAD_INITIALIZER(uma_boot_pages);
146 /* This mutex protects the boot time pages list */
147 static struct mtx_padalign uma_boot_pages_mtx;
149 static struct sx uma_drain_lock;
151 /* Is the VM done starting up? */
152 static int booted = 0;
153 #define UMA_STARTUP 1
154 #define UMA_STARTUP2 2
157 * Only mbuf clusters use ref zones. Just provide enough references
158 * to support the one user. New code should not use the ref facility.
160 static const u_int uma_max_ipers_ref = PAGE_SIZE / MCLBYTES;
163 * This is the handle used to schedule events that need to happen
164 * outside of the allocation fast path.
166 static struct callout uma_callout;
167 #define UMA_TIMEOUT 20 /* Seconds for callout interval. */
170 * This structure is passed as the zone ctor arg so that I don't have to create
171 * a special allocation function just for zones.
173 struct uma_zctor_args {
188 struct uma_kctor_args {
197 struct uma_bucket_zone {
200 int ubz_entries; /* Number of items it can hold. */
201 int ubz_maxsize; /* Maximum allocation size per-item. */
205 * Compute the actual number of bucket entries to pack them in power
206 * of two sizes for more efficient space utilization.
208 #define BUCKET_SIZE(n) \
209 (((sizeof(void *) * (n)) - sizeof(struct uma_bucket)) / sizeof(void *))
211 #define BUCKET_MAX BUCKET_SIZE(256)
213 struct uma_bucket_zone bucket_zones[] = {
214 { NULL, "4 Bucket", BUCKET_SIZE(4), 4096 },
215 { NULL, "6 Bucket", BUCKET_SIZE(6), 3072 },
216 { NULL, "8 Bucket", BUCKET_SIZE(8), 2048 },
217 { NULL, "12 Bucket", BUCKET_SIZE(12), 1536 },
218 { NULL, "16 Bucket", BUCKET_SIZE(16), 1024 },
219 { NULL, "32 Bucket", BUCKET_SIZE(32), 512 },
220 { NULL, "64 Bucket", BUCKET_SIZE(64), 256 },
221 { NULL, "128 Bucket", BUCKET_SIZE(128), 128 },
222 { NULL, "256 Bucket", BUCKET_SIZE(256), 64 },
227 * Flags and enumerations to be passed to internal functions.
229 enum zfreeskip { SKIP_NONE = 0, SKIP_DTOR, SKIP_FINI };
233 static void *noobj_alloc(uma_zone_t, vm_size_t, uint8_t *, int);
234 static void *page_alloc(uma_zone_t, vm_size_t, uint8_t *, int);
235 static void *startup_alloc(uma_zone_t, vm_size_t, uint8_t *, int);
236 static void page_free(void *, vm_size_t, uint8_t);
237 static uma_slab_t keg_alloc_slab(uma_keg_t, uma_zone_t, int);
238 static void cache_drain(uma_zone_t);
239 static void bucket_drain(uma_zone_t, uma_bucket_t);
240 static void bucket_cache_drain(uma_zone_t zone);
241 static int keg_ctor(void *, int, void *, int);
242 static void keg_dtor(void *, int, void *);
243 static int zone_ctor(void *, int, void *, int);
244 static void zone_dtor(void *, int, void *);
245 static int zero_init(void *, int, int);
246 static void keg_small_init(uma_keg_t keg);
247 static void keg_large_init(uma_keg_t keg);
248 static void zone_foreach(void (*zfunc)(uma_zone_t));
249 static void zone_timeout(uma_zone_t zone);
250 static int hash_alloc(struct uma_hash *);
251 static int hash_expand(struct uma_hash *, struct uma_hash *);
252 static void hash_free(struct uma_hash *hash);
253 static void uma_timeout(void *);
254 static void uma_startup3(void);
255 static void *zone_alloc_item(uma_zone_t, void *, int);
256 static void zone_free_item(uma_zone_t, void *, void *, enum zfreeskip);
257 static void bucket_enable(void);
258 static void bucket_init(void);
259 static uma_bucket_t bucket_alloc(uma_zone_t zone, void *, int);
260 static void bucket_free(uma_zone_t zone, uma_bucket_t, void *);
261 static void bucket_zone_drain(void);
262 static uma_bucket_t zone_alloc_bucket(uma_zone_t zone, void *, int flags);
263 static uma_slab_t zone_fetch_slab(uma_zone_t zone, uma_keg_t last, int flags);
264 static uma_slab_t zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int flags);
265 static void *slab_alloc_item(uma_keg_t keg, uma_slab_t slab);
266 static void slab_free_item(uma_keg_t keg, uma_slab_t slab, void *item);
267 static uma_keg_t uma_kcreate(uma_zone_t zone, size_t size, uma_init uminit,
268 uma_fini fini, int align, uint32_t flags);
269 static int zone_import(uma_zone_t zone, void **bucket, int max, int flags);
270 static void zone_release(uma_zone_t zone, void **bucket, int cnt);
271 static void uma_zero_item(void *item, uma_zone_t zone);
273 void uma_print_zone(uma_zone_t);
274 void uma_print_stats(void);
275 static int sysctl_vm_zone_count(SYSCTL_HANDLER_ARGS);
276 static int sysctl_vm_zone_stats(SYSCTL_HANDLER_ARGS);
278 SYSINIT(uma_startup3, SI_SUB_VM_CONF, SI_ORDER_SECOND, uma_startup3, NULL);
280 SYSCTL_PROC(_vm, OID_AUTO, zone_count, CTLFLAG_RD|CTLTYPE_INT,
281 0, 0, sysctl_vm_zone_count, "I", "Number of UMA zones");
283 SYSCTL_PROC(_vm, OID_AUTO, zone_stats, CTLFLAG_RD|CTLTYPE_STRUCT,
284 0, 0, sysctl_vm_zone_stats, "s,struct uma_type_header", "Zone Stats");
286 static int zone_warnings = 1;
287 SYSCTL_INT(_vm, OID_AUTO, zone_warnings, CTLFLAG_RWTUN, &zone_warnings, 0,
288 "Warn when UMA zones becomes full");
291 * This routine checks to see whether or not it's safe to enable buckets.
296 bucketdisable = vm_page_count_min();
300 * Initialize bucket_zones, the array of zones of buckets of various sizes.
302 * For each zone, calculate the memory required for each bucket, consisting
303 * of the header and an array of pointers.
308 struct uma_bucket_zone *ubz;
311 for (ubz = &bucket_zones[0]; ubz->ubz_entries != 0; ubz++) {
312 size = roundup(sizeof(struct uma_bucket), sizeof(void *));
313 size += sizeof(void *) * ubz->ubz_entries;
314 ubz->ubz_zone = uma_zcreate(ubz->ubz_name, size,
315 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
316 UMA_ZONE_MTXCLASS | UMA_ZFLAG_BUCKET);
321 * Given a desired number of entries for a bucket, return the zone from which
322 * to allocate the bucket.
324 static struct uma_bucket_zone *
325 bucket_zone_lookup(int entries)
327 struct uma_bucket_zone *ubz;
329 for (ubz = &bucket_zones[0]; ubz->ubz_entries != 0; ubz++)
330 if (ubz->ubz_entries >= entries)
337 bucket_select(int size)
339 struct uma_bucket_zone *ubz;
341 ubz = &bucket_zones[0];
342 if (size > ubz->ubz_maxsize)
343 return MAX((ubz->ubz_maxsize * ubz->ubz_entries) / size, 1);
345 for (; ubz->ubz_entries != 0; ubz++)
346 if (ubz->ubz_maxsize < size)
349 return (ubz->ubz_entries);
353 bucket_alloc(uma_zone_t zone, void *udata, int flags)
355 struct uma_bucket_zone *ubz;
359 * This is to stop us from allocating per cpu buckets while we're
360 * running out of vm.boot_pages. Otherwise, we would exhaust the
361 * boot pages. This also prevents us from allocating buckets in
362 * low memory situations.
367 * To limit bucket recursion we store the original zone flags
368 * in a cookie passed via zalloc_arg/zfree_arg. This allows the
369 * NOVM flag to persist even through deep recursions. We also
370 * store ZFLAG_BUCKET once we have recursed attempting to allocate
371 * a bucket for a bucket zone so we do not allow infinite bucket
372 * recursion. This cookie will even persist to frees of unused
373 * buckets via the allocation path or bucket allocations in the
376 if ((zone->uz_flags & UMA_ZFLAG_BUCKET) == 0)
377 udata = (void *)(uintptr_t)zone->uz_flags;
379 if ((uintptr_t)udata & UMA_ZFLAG_BUCKET)
381 udata = (void *)((uintptr_t)udata | UMA_ZFLAG_BUCKET);
383 if ((uintptr_t)udata & UMA_ZFLAG_CACHEONLY)
385 ubz = bucket_zone_lookup(zone->uz_count);
386 if (ubz->ubz_zone == zone && (ubz + 1)->ubz_entries != 0)
388 bucket = uma_zalloc_arg(ubz->ubz_zone, udata, flags);
391 bzero(bucket->ub_bucket, sizeof(void *) * ubz->ubz_entries);
394 bucket->ub_entries = ubz->ubz_entries;
401 bucket_free(uma_zone_t zone, uma_bucket_t bucket, void *udata)
403 struct uma_bucket_zone *ubz;
405 KASSERT(bucket->ub_cnt == 0,
406 ("bucket_free: Freeing a non free bucket."));
407 if ((zone->uz_flags & UMA_ZFLAG_BUCKET) == 0)
408 udata = (void *)(uintptr_t)zone->uz_flags;
409 ubz = bucket_zone_lookup(bucket->ub_entries);
410 uma_zfree_arg(ubz->ubz_zone, bucket, udata);
414 bucket_zone_drain(void)
416 struct uma_bucket_zone *ubz;
418 for (ubz = &bucket_zones[0]; ubz->ubz_entries != 0; ubz++)
419 zone_drain(ubz->ubz_zone);
423 zone_log_warning(uma_zone_t zone)
425 static const struct timeval warninterval = { 300, 0 };
427 if (!zone_warnings || zone->uz_warning == NULL)
430 if (ratecheck(&zone->uz_ratecheck, &warninterval))
431 printf("[zone: %s] %s\n", zone->uz_name, zone->uz_warning);
435 zone_foreach_keg(uma_zone_t zone, void (*kegfn)(uma_keg_t))
439 LIST_FOREACH(klink, &zone->uz_kegs, kl_link)
440 kegfn(klink->kl_keg);
444 * Routine called by timeout which is used to fire off some time interval
445 * based calculations. (stats, hash size, etc.)
454 uma_timeout(void *unused)
457 zone_foreach(zone_timeout);
459 /* Reschedule this event */
460 callout_reset(&uma_callout, UMA_TIMEOUT * hz, uma_timeout, NULL);
464 * Routine to perform timeout driven calculations. This expands the
465 * hashes and does per cpu statistics aggregation.
470 keg_timeout(uma_keg_t keg)
475 * Expand the keg hash table.
477 * This is done if the number of slabs is larger than the hash size.
478 * What I'm trying to do here is completely reduce collisions. This
479 * may be a little aggressive. Should I allow for two collisions max?
481 if (keg->uk_flags & UMA_ZONE_HASH &&
482 keg->uk_pages / keg->uk_ppera >= keg->uk_hash.uh_hashsize) {
483 struct uma_hash newhash;
484 struct uma_hash oldhash;
488 * This is so involved because allocating and freeing
489 * while the keg lock is held will lead to deadlock.
490 * I have to do everything in stages and check for
493 newhash = keg->uk_hash;
495 ret = hash_alloc(&newhash);
498 if (hash_expand(&keg->uk_hash, &newhash)) {
499 oldhash = keg->uk_hash;
500 keg->uk_hash = newhash;
513 zone_timeout(uma_zone_t zone)
516 zone_foreach_keg(zone, &keg_timeout);
520 * Allocate and zero fill the next sized hash table from the appropriate
524 * hash A new hash structure with the old hash size in uh_hashsize
527 * 1 on sucess and 0 on failure.
530 hash_alloc(struct uma_hash *hash)
535 oldsize = hash->uh_hashsize;
537 /* We're just going to go to a power of two greater */
539 hash->uh_hashsize = oldsize * 2;
540 alloc = sizeof(hash->uh_slab_hash[0]) * hash->uh_hashsize;
541 hash->uh_slab_hash = (struct slabhead *)malloc(alloc,
542 M_UMAHASH, M_NOWAIT);
544 alloc = sizeof(hash->uh_slab_hash[0]) * UMA_HASH_SIZE_INIT;
545 hash->uh_slab_hash = zone_alloc_item(hashzone, NULL,
547 hash->uh_hashsize = UMA_HASH_SIZE_INIT;
549 if (hash->uh_slab_hash) {
550 bzero(hash->uh_slab_hash, alloc);
551 hash->uh_hashmask = hash->uh_hashsize - 1;
559 * Expands the hash table for HASH zones. This is done from zone_timeout
560 * to reduce collisions. This must not be done in the regular allocation
561 * path, otherwise, we can recurse on the vm while allocating pages.
564 * oldhash The hash you want to expand
565 * newhash The hash structure for the new table
573 hash_expand(struct uma_hash *oldhash, struct uma_hash *newhash)
579 if (!newhash->uh_slab_hash)
582 if (oldhash->uh_hashsize >= newhash->uh_hashsize)
586 * I need to investigate hash algorithms for resizing without a
590 for (i = 0; i < oldhash->uh_hashsize; i++)
591 while (!SLIST_EMPTY(&oldhash->uh_slab_hash[i])) {
592 slab = SLIST_FIRST(&oldhash->uh_slab_hash[i]);
593 SLIST_REMOVE_HEAD(&oldhash->uh_slab_hash[i], us_hlink);
594 hval = UMA_HASH(newhash, slab->us_data);
595 SLIST_INSERT_HEAD(&newhash->uh_slab_hash[hval],
603 * Free the hash bucket to the appropriate backing store.
606 * slab_hash The hash bucket we're freeing
607 * hashsize The number of entries in that hash bucket
613 hash_free(struct uma_hash *hash)
615 if (hash->uh_slab_hash == NULL)
617 if (hash->uh_hashsize == UMA_HASH_SIZE_INIT)
618 zone_free_item(hashzone, hash->uh_slab_hash, NULL, SKIP_NONE);
620 free(hash->uh_slab_hash, M_UMAHASH);
624 * Frees all outstanding items in a bucket
627 * zone The zone to free to, must be unlocked.
628 * bucket The free/alloc bucket with items, cpu queue must be locked.
635 bucket_drain(uma_zone_t zone, uma_bucket_t bucket)
643 for (i = 0; i < bucket->ub_cnt; i++)
644 zone->uz_fini(bucket->ub_bucket[i], zone->uz_size);
645 zone->uz_release(zone->uz_arg, bucket->ub_bucket, bucket->ub_cnt);
650 * Drains the per cpu caches for a zone.
652 * NOTE: This may only be called while the zone is being turn down, and not
653 * during normal operation. This is necessary in order that we do not have
654 * to migrate CPUs to drain the per-CPU caches.
657 * zone The zone to drain, must be unlocked.
663 cache_drain(uma_zone_t zone)
669 * XXX: It is safe to not lock the per-CPU caches, because we're
670 * tearing down the zone anyway. I.e., there will be no further use
671 * of the caches at this point.
673 * XXX: It would good to be able to assert that the zone is being
674 * torn down to prevent improper use of cache_drain().
676 * XXX: We lock the zone before passing into bucket_cache_drain() as
677 * it is used elsewhere. Should the tear-down path be made special
678 * there in some form?
681 cache = &zone->uz_cpu[cpu];
682 bucket_drain(zone, cache->uc_allocbucket);
683 bucket_drain(zone, cache->uc_freebucket);
684 if (cache->uc_allocbucket != NULL)
685 bucket_free(zone, cache->uc_allocbucket, NULL);
686 if (cache->uc_freebucket != NULL)
687 bucket_free(zone, cache->uc_freebucket, NULL);
688 cache->uc_allocbucket = cache->uc_freebucket = NULL;
691 bucket_cache_drain(zone);
696 cache_shrink(uma_zone_t zone)
699 if (zone->uz_flags & UMA_ZFLAG_INTERNAL)
703 zone->uz_count = (zone->uz_count_min + zone->uz_count) / 2;
708 cache_drain_safe_cpu(uma_zone_t zone)
713 if (zone->uz_flags & UMA_ZFLAG_INTERNAL)
719 cache = &zone->uz_cpu[curcpu];
720 if (cache->uc_allocbucket) {
721 if (cache->uc_allocbucket->ub_cnt != 0)
722 LIST_INSERT_HEAD(&zone->uz_buckets,
723 cache->uc_allocbucket, ub_link);
725 b1 = cache->uc_allocbucket;
726 cache->uc_allocbucket = NULL;
728 if (cache->uc_freebucket) {
729 if (cache->uc_freebucket->ub_cnt != 0)
730 LIST_INSERT_HEAD(&zone->uz_buckets,
731 cache->uc_freebucket, ub_link);
733 b2 = cache->uc_freebucket;
734 cache->uc_freebucket = NULL;
739 bucket_free(zone, b1, NULL);
741 bucket_free(zone, b2, NULL);
745 * Safely drain per-CPU caches of a zone(s) to alloc bucket.
746 * This is an expensive call because it needs to bind to all CPUs
747 * one by one and enter a critical section on each of them in order
748 * to safely access their cache buckets.
749 * Zone lock must not be held on call this function.
752 cache_drain_safe(uma_zone_t zone)
757 * Polite bucket sizes shrinking was not enouth, shrink aggressively.
762 zone_foreach(cache_shrink);
765 thread_lock(curthread);
766 sched_bind(curthread, cpu);
767 thread_unlock(curthread);
770 cache_drain_safe_cpu(zone);
772 zone_foreach(cache_drain_safe_cpu);
774 thread_lock(curthread);
775 sched_unbind(curthread);
776 thread_unlock(curthread);
780 * Drain the cached buckets from a zone. Expects a locked zone on entry.
783 bucket_cache_drain(uma_zone_t zone)
788 * Drain the bucket queues and free the buckets, we just keep two per
791 while ((bucket = LIST_FIRST(&zone->uz_buckets)) != NULL) {
792 LIST_REMOVE(bucket, ub_link);
794 bucket_drain(zone, bucket);
795 bucket_free(zone, bucket, NULL);
800 * Shrink further bucket sizes. Price of single zone lock collision
801 * is probably lower then price of global cache drain.
803 if (zone->uz_count > zone->uz_count_min)
808 keg_free_slab(uma_keg_t keg, uma_slab_t slab, int start)
815 flags = slab->us_flags;
817 if (keg->uk_fini != NULL) {
818 for (i--; i > -1; i--)
819 keg->uk_fini(slab->us_data + (keg->uk_rsize * i),
822 if (keg->uk_flags & UMA_ZONE_OFFPAGE)
823 zone_free_item(keg->uk_slabzone, slab, NULL, SKIP_NONE);
825 printf("%s: Returning %d bytes.\n", keg->uk_name,
826 PAGE_SIZE * keg->uk_ppera);
828 keg->uk_freef(mem, PAGE_SIZE * keg->uk_ppera, flags);
832 * Frees pages from a keg back to the system. This is done on demand from
833 * the pageout daemon.
838 keg_drain(uma_keg_t keg)
840 struct slabhead freeslabs = { 0 };
845 * We don't want to take pages from statically allocated kegs at this
848 if (keg->uk_flags & UMA_ZONE_NOFREE || keg->uk_freef == NULL)
852 printf("%s free items: %u\n", keg->uk_name, keg->uk_free);
855 if (keg->uk_free == 0)
858 slab = LIST_FIRST(&keg->uk_free_slab);
860 n = LIST_NEXT(slab, us_link);
862 /* We have no where to free these to */
863 if (slab->us_flags & UMA_SLAB_BOOT) {
868 LIST_REMOVE(slab, us_link);
869 keg->uk_pages -= keg->uk_ppera;
870 keg->uk_free -= keg->uk_ipers;
872 if (keg->uk_flags & UMA_ZONE_HASH)
873 UMA_HASH_REMOVE(&keg->uk_hash, slab, slab->us_data);
875 SLIST_INSERT_HEAD(&freeslabs, slab, us_hlink);
882 while ((slab = SLIST_FIRST(&freeslabs)) != NULL) {
883 SLIST_REMOVE(&freeslabs, slab, uma_slab, us_hlink);
884 keg_free_slab(keg, slab, keg->uk_ipers);
889 zone_drain_wait(uma_zone_t zone, int waitok)
893 * Set draining to interlock with zone_dtor() so we can release our
894 * locks as we go. Only dtor() should do a WAITOK call since it
895 * is the only call that knows the structure will still be available
899 while (zone->uz_flags & UMA_ZFLAG_DRAINING) {
900 if (waitok == M_NOWAIT)
902 msleep(zone, zone->uz_lockptr, PVM, "zonedrain", 1);
904 zone->uz_flags |= UMA_ZFLAG_DRAINING;
905 bucket_cache_drain(zone);
908 * The DRAINING flag protects us from being freed while
909 * we're running. Normally the uma_rwlock would protect us but we
910 * must be able to release and acquire the right lock for each keg.
912 zone_foreach_keg(zone, &keg_drain);
914 zone->uz_flags &= ~UMA_ZFLAG_DRAINING;
921 zone_drain(uma_zone_t zone)
924 zone_drain_wait(zone, M_NOWAIT);
928 * Allocate a new slab for a keg. This does not insert the slab onto a list.
931 * wait Shall we wait?
934 * The slab that was allocated or NULL if there is no memory and the
935 * caller specified M_NOWAIT.
938 keg_alloc_slab(uma_keg_t keg, uma_zone_t zone, int wait)
940 uma_slabrefcnt_t slabref;
947 mtx_assert(&keg->uk_lock, MA_OWNED);
952 printf("alloc_slab: Allocating a new slab for %s\n", keg->uk_name);
954 allocf = keg->uk_allocf;
957 if (keg->uk_flags & UMA_ZONE_OFFPAGE) {
958 slab = zone_alloc_item(keg->uk_slabzone, NULL, wait);
964 * This reproduces the old vm_zone behavior of zero filling pages the
965 * first time they are added to a zone.
967 * Malloced items are zeroed in uma_zalloc.
970 if ((keg->uk_flags & UMA_ZONE_MALLOC) == 0)
975 if (keg->uk_flags & UMA_ZONE_NODUMP)
978 /* zone is passed for legacy reasons. */
979 mem = allocf(zone, keg->uk_ppera * PAGE_SIZE, &flags, wait);
981 if (keg->uk_flags & UMA_ZONE_OFFPAGE)
982 zone_free_item(keg->uk_slabzone, slab, NULL, SKIP_NONE);
987 /* Point the slab into the allocated memory */
988 if (!(keg->uk_flags & UMA_ZONE_OFFPAGE))
989 slab = (uma_slab_t )(mem + keg->uk_pgoff);
991 if (keg->uk_flags & UMA_ZONE_VTOSLAB)
992 for (i = 0; i < keg->uk_ppera; i++)
993 vsetslab((vm_offset_t)mem + (i * PAGE_SIZE), slab);
997 slab->us_freecount = keg->uk_ipers;
998 slab->us_flags = flags;
999 BIT_FILL(SLAB_SETSIZE, &slab->us_free);
1001 BIT_ZERO(SLAB_SETSIZE, &slab->us_debugfree);
1003 if (keg->uk_flags & UMA_ZONE_REFCNT) {
1004 slabref = (uma_slabrefcnt_t)slab;
1005 for (i = 0; i < keg->uk_ipers; i++)
1006 slabref->us_refcnt[i] = 0;
1009 if (keg->uk_init != NULL) {
1010 for (i = 0; i < keg->uk_ipers; i++)
1011 if (keg->uk_init(slab->us_data + (keg->uk_rsize * i),
1012 keg->uk_size, wait) != 0)
1014 if (i != keg->uk_ipers) {
1015 keg_free_slab(keg, slab, i);
1024 if (keg->uk_flags & UMA_ZONE_HASH)
1025 UMA_HASH_INSERT(&keg->uk_hash, slab, mem);
1027 keg->uk_pages += keg->uk_ppera;
1028 keg->uk_free += keg->uk_ipers;
1035 * This function is intended to be used early on in place of page_alloc() so
1036 * that we may use the boot time page cache to satisfy allocations before
1040 startup_alloc(uma_zone_t zone, vm_size_t bytes, uint8_t *pflag, int wait)
1044 int pages, check_pages;
1046 keg = zone_first_keg(zone);
1047 pages = howmany(bytes, PAGE_SIZE);
1048 check_pages = pages - 1;
1049 KASSERT(pages > 0, ("startup_alloc can't reserve 0 pages\n"));
1052 * Check our small startup cache to see if it has pages remaining.
1054 mtx_lock(&uma_boot_pages_mtx);
1056 /* First check if we have enough room. */
1057 tmps = LIST_FIRST(&uma_boot_pages);
1058 while (tmps != NULL && check_pages-- > 0)
1059 tmps = LIST_NEXT(tmps, us_link);
1062 * It's ok to lose tmps references. The last one will
1063 * have tmps->us_data pointing to the start address of
1064 * "pages" contiguous pages of memory.
1066 while (pages-- > 0) {
1067 tmps = LIST_FIRST(&uma_boot_pages);
1068 LIST_REMOVE(tmps, us_link);
1070 mtx_unlock(&uma_boot_pages_mtx);
1071 *pflag = tmps->us_flags;
1072 return (tmps->us_data);
1074 mtx_unlock(&uma_boot_pages_mtx);
1075 if (booted < UMA_STARTUP2)
1076 panic("UMA: Increase vm.boot_pages");
1078 * Now that we've booted reset these users to their real allocator.
1080 #ifdef UMA_MD_SMALL_ALLOC
1081 keg->uk_allocf = (keg->uk_ppera > 1) ? page_alloc : uma_small_alloc;
1083 keg->uk_allocf = page_alloc;
1085 return keg->uk_allocf(zone, bytes, pflag, wait);
1089 * Allocates a number of pages from the system
1092 * bytes The number of bytes requested
1093 * wait Shall we wait?
1096 * A pointer to the alloced memory or possibly
1097 * NULL if M_NOWAIT is set.
1100 page_alloc(uma_zone_t zone, vm_size_t bytes, uint8_t *pflag, int wait)
1102 void *p; /* Returned page */
1104 *pflag = UMA_SLAB_KMEM;
1105 p = (void *) kmem_malloc(kmem_arena, bytes, wait);
1111 * Allocates a number of pages from within an object
1114 * bytes The number of bytes requested
1115 * wait Shall we wait?
1118 * A pointer to the alloced memory or possibly
1119 * NULL if M_NOWAIT is set.
1122 noobj_alloc(uma_zone_t zone, vm_size_t bytes, uint8_t *flags, int wait)
1124 TAILQ_HEAD(, vm_page) alloctail;
1126 vm_offset_t retkva, zkva;
1127 vm_page_t p, p_next;
1130 TAILQ_INIT(&alloctail);
1131 keg = zone_first_keg(zone);
1133 npages = howmany(bytes, PAGE_SIZE);
1134 while (npages > 0) {
1135 p = vm_page_alloc(NULL, 0, VM_ALLOC_INTERRUPT |
1136 VM_ALLOC_WIRED | VM_ALLOC_NOOBJ);
1139 * Since the page does not belong to an object, its
1142 TAILQ_INSERT_TAIL(&alloctail, p, listq);
1146 if (wait & M_WAITOK) {
1152 * Page allocation failed, free intermediate pages and
1155 TAILQ_FOREACH_SAFE(p, &alloctail, listq, p_next) {
1156 vm_page_unwire(p, PQ_INACTIVE);
1161 *flags = UMA_SLAB_PRIV;
1162 zkva = keg->uk_kva +
1163 atomic_fetchadd_long(&keg->uk_offset, round_page(bytes));
1165 TAILQ_FOREACH(p, &alloctail, listq) {
1166 pmap_qenter(zkva, &p, 1);
1170 return ((void *)retkva);
1174 * Frees a number of pages to the system
1177 * mem A pointer to the memory to be freed
1178 * size The size of the memory being freed
1179 * flags The original p->us_flags field
1185 page_free(void *mem, vm_size_t size, uint8_t flags)
1189 if (flags & UMA_SLAB_KMEM)
1191 else if (flags & UMA_SLAB_KERNEL)
1192 vmem = kernel_arena;
1194 panic("UMA: page_free used with invalid flags %d", flags);
1196 kmem_free(vmem, (vm_offset_t)mem, size);
1200 * Zero fill initializer
1202 * Arguments/Returns follow uma_init specifications
1205 zero_init(void *mem, int size, int flags)
1212 * Finish creating a small uma keg. This calculates ipers, and the keg size.
1215 * keg The zone we should initialize
1221 keg_small_init(uma_keg_t keg)
1228 if (keg->uk_flags & UMA_ZONE_PCPU) {
1229 u_int ncpus = mp_ncpus ? mp_ncpus : MAXCPU;
1231 keg->uk_slabsize = sizeof(struct pcpu);
1232 keg->uk_ppera = howmany(ncpus * sizeof(struct pcpu),
1235 keg->uk_slabsize = UMA_SLAB_SIZE;
1240 * Calculate the size of each allocation (rsize) according to
1241 * alignment. If the requested size is smaller than we have
1242 * allocation bits for we round it up.
1244 rsize = keg->uk_size;
1245 if (rsize < keg->uk_slabsize / SLAB_SETSIZE)
1246 rsize = keg->uk_slabsize / SLAB_SETSIZE;
1247 if (rsize & keg->uk_align)
1248 rsize = (rsize & ~keg->uk_align) + (keg->uk_align + 1);
1249 keg->uk_rsize = rsize;
1251 KASSERT((keg->uk_flags & UMA_ZONE_PCPU) == 0 ||
1252 keg->uk_rsize < sizeof(struct pcpu),
1253 ("%s: size %u too large", __func__, keg->uk_rsize));
1255 if (keg->uk_flags & UMA_ZONE_REFCNT)
1256 rsize += sizeof(uint32_t);
1258 if (keg->uk_flags & UMA_ZONE_OFFPAGE)
1261 shsize = sizeof(struct uma_slab);
1263 keg->uk_ipers = (keg->uk_slabsize - shsize) / rsize;
1264 KASSERT(keg->uk_ipers > 0 && keg->uk_ipers <= SLAB_SETSIZE,
1265 ("%s: keg->uk_ipers %u", __func__, keg->uk_ipers));
1267 memused = keg->uk_ipers * rsize + shsize;
1268 wastedspace = keg->uk_slabsize - memused;
1271 * We can't do OFFPAGE if we're internal or if we've been
1272 * asked to not go to the VM for buckets. If we do this we
1273 * may end up going to the VM for slabs which we do not
1274 * want to do if we're UMA_ZFLAG_CACHEONLY as a result
1275 * of UMA_ZONE_VM, which clearly forbids it.
1277 if ((keg->uk_flags & UMA_ZFLAG_INTERNAL) ||
1278 (keg->uk_flags & UMA_ZFLAG_CACHEONLY))
1282 * See if using an OFFPAGE slab will limit our waste. Only do
1283 * this if it permits more items per-slab.
1285 * XXX We could try growing slabsize to limit max waste as well.
1286 * Historically this was not done because the VM could not
1287 * efficiently handle contiguous allocations.
1289 if ((wastedspace >= keg->uk_slabsize / UMA_MAX_WASTE) &&
1290 (keg->uk_ipers < (keg->uk_slabsize / keg->uk_rsize))) {
1291 keg->uk_ipers = keg->uk_slabsize / keg->uk_rsize;
1292 KASSERT(keg->uk_ipers > 0 && keg->uk_ipers <= SLAB_SETSIZE,
1293 ("%s: keg->uk_ipers %u", __func__, keg->uk_ipers));
1295 printf("UMA decided we need offpage slab headers for "
1296 "keg: %s, calculated wastedspace = %d, "
1297 "maximum wasted space allowed = %d, "
1298 "calculated ipers = %d, "
1299 "new wasted space = %d\n", keg->uk_name, wastedspace,
1300 keg->uk_slabsize / UMA_MAX_WASTE, keg->uk_ipers,
1301 keg->uk_slabsize - keg->uk_ipers * keg->uk_rsize);
1303 keg->uk_flags |= UMA_ZONE_OFFPAGE;
1306 if ((keg->uk_flags & UMA_ZONE_OFFPAGE) &&
1307 (keg->uk_flags & UMA_ZONE_VTOSLAB) == 0)
1308 keg->uk_flags |= UMA_ZONE_HASH;
1312 * Finish creating a large (> UMA_SLAB_SIZE) uma kegs. Just give in and do
1313 * OFFPAGE for now. When I can allow for more dynamic slab sizes this will be
1317 * keg The keg we should initialize
1323 keg_large_init(uma_keg_t keg)
1327 KASSERT(keg != NULL, ("Keg is null in keg_large_init"));
1328 KASSERT((keg->uk_flags & UMA_ZFLAG_CACHEONLY) == 0,
1329 ("keg_large_init: Cannot large-init a UMA_ZFLAG_CACHEONLY keg"));
1330 KASSERT((keg->uk_flags & UMA_ZONE_PCPU) == 0,
1331 ("%s: Cannot large-init a UMA_ZONE_PCPU keg", __func__));
1333 keg->uk_ppera = howmany(keg->uk_size, PAGE_SIZE);
1334 keg->uk_slabsize = keg->uk_ppera * PAGE_SIZE;
1336 keg->uk_rsize = keg->uk_size;
1338 /* We can't do OFFPAGE if we're internal, bail out here. */
1339 if (keg->uk_flags & UMA_ZFLAG_INTERNAL)
1342 /* Check whether we have enough space to not do OFFPAGE. */
1343 if ((keg->uk_flags & UMA_ZONE_OFFPAGE) == 0) {
1344 shsize = sizeof(struct uma_slab);
1345 if (keg->uk_flags & UMA_ZONE_REFCNT)
1346 shsize += keg->uk_ipers * sizeof(uint32_t);
1347 if (shsize & UMA_ALIGN_PTR)
1348 shsize = (shsize & ~UMA_ALIGN_PTR) +
1349 (UMA_ALIGN_PTR + 1);
1351 if ((PAGE_SIZE * keg->uk_ppera) - keg->uk_rsize < shsize)
1352 keg->uk_flags |= UMA_ZONE_OFFPAGE;
1355 if ((keg->uk_flags & UMA_ZONE_OFFPAGE) &&
1356 (keg->uk_flags & UMA_ZONE_VTOSLAB) == 0)
1357 keg->uk_flags |= UMA_ZONE_HASH;
1361 keg_cachespread_init(uma_keg_t keg)
1368 KASSERT((keg->uk_flags & UMA_ZONE_PCPU) == 0,
1369 ("%s: Cannot cachespread-init a UMA_ZONE_PCPU keg", __func__));
1371 alignsize = keg->uk_align + 1;
1372 rsize = keg->uk_size;
1374 * We want one item to start on every align boundary in a page. To
1375 * do this we will span pages. We will also extend the item by the
1376 * size of align if it is an even multiple of align. Otherwise, it
1377 * would fall on the same boundary every time.
1379 if (rsize & keg->uk_align)
1380 rsize = (rsize & ~keg->uk_align) + alignsize;
1381 if ((rsize & alignsize) == 0)
1383 trailer = rsize - keg->uk_size;
1384 pages = (rsize * (PAGE_SIZE / alignsize)) / PAGE_SIZE;
1385 pages = MIN(pages, (128 * 1024) / PAGE_SIZE);
1386 keg->uk_rsize = rsize;
1387 keg->uk_ppera = pages;
1388 keg->uk_slabsize = UMA_SLAB_SIZE;
1389 keg->uk_ipers = ((pages * PAGE_SIZE) + trailer) / rsize;
1390 keg->uk_flags |= UMA_ZONE_OFFPAGE | UMA_ZONE_VTOSLAB;
1391 KASSERT(keg->uk_ipers <= SLAB_SETSIZE,
1392 ("%s: keg->uk_ipers too high(%d) increase max_ipers", __func__,
1397 * Keg header ctor. This initializes all fields, locks, etc. And inserts
1398 * the keg onto the global keg list.
1400 * Arguments/Returns follow uma_ctor specifications
1401 * udata Actually uma_kctor_args
1404 keg_ctor(void *mem, int size, void *udata, int flags)
1406 struct uma_kctor_args *arg = udata;
1407 uma_keg_t keg = mem;
1411 keg->uk_size = arg->size;
1412 keg->uk_init = arg->uminit;
1413 keg->uk_fini = arg->fini;
1414 keg->uk_align = arg->align;
1416 keg->uk_reserve = 0;
1418 keg->uk_flags = arg->flags;
1419 keg->uk_allocf = page_alloc;
1420 keg->uk_freef = page_free;
1421 keg->uk_slabzone = NULL;
1424 * The master zone is passed to us at keg-creation time.
1427 keg->uk_name = zone->uz_name;
1429 if (arg->flags & UMA_ZONE_VM)
1430 keg->uk_flags |= UMA_ZFLAG_CACHEONLY;
1432 if (arg->flags & UMA_ZONE_ZINIT)
1433 keg->uk_init = zero_init;
1435 if (arg->flags & UMA_ZONE_REFCNT || arg->flags & UMA_ZONE_MALLOC)
1436 keg->uk_flags |= UMA_ZONE_VTOSLAB;
1438 if (arg->flags & UMA_ZONE_PCPU)
1440 keg->uk_flags |= UMA_ZONE_OFFPAGE;
1442 keg->uk_flags &= ~UMA_ZONE_PCPU;
1445 if (keg->uk_flags & UMA_ZONE_CACHESPREAD) {
1446 keg_cachespread_init(keg);
1447 } else if (keg->uk_flags & UMA_ZONE_REFCNT) {
1449 (UMA_SLAB_SIZE - sizeof(struct uma_slab_refcnt) -
1451 keg_large_init(keg);
1453 keg_small_init(keg);
1455 if (keg->uk_size > (UMA_SLAB_SIZE - sizeof(struct uma_slab)))
1456 keg_large_init(keg);
1458 keg_small_init(keg);
1461 if (keg->uk_flags & UMA_ZONE_OFFPAGE) {
1462 if (keg->uk_flags & UMA_ZONE_REFCNT) {
1463 if (keg->uk_ipers > uma_max_ipers_ref)
1464 panic("Too many ref items per zone: %d > %d\n",
1465 keg->uk_ipers, uma_max_ipers_ref);
1466 keg->uk_slabzone = slabrefzone;
1468 keg->uk_slabzone = slabzone;
1472 * If we haven't booted yet we need allocations to go through the
1473 * startup cache until the vm is ready.
1475 if (keg->uk_ppera == 1) {
1476 #ifdef UMA_MD_SMALL_ALLOC
1477 keg->uk_allocf = uma_small_alloc;
1478 keg->uk_freef = uma_small_free;
1480 if (booted < UMA_STARTUP)
1481 keg->uk_allocf = startup_alloc;
1483 if (booted < UMA_STARTUP2)
1484 keg->uk_allocf = startup_alloc;
1486 } else if (booted < UMA_STARTUP2 &&
1487 (keg->uk_flags & UMA_ZFLAG_INTERNAL))
1488 keg->uk_allocf = startup_alloc;
1491 * Initialize keg's lock
1493 KEG_LOCK_INIT(keg, (arg->flags & UMA_ZONE_MTXCLASS));
1496 * If we're putting the slab header in the actual page we need to
1497 * figure out where in each page it goes. This calculates a right
1498 * justified offset into the memory on an ALIGN_PTR boundary.
1500 if (!(keg->uk_flags & UMA_ZONE_OFFPAGE)) {
1503 /* Size of the slab struct and free list */
1504 totsize = sizeof(struct uma_slab);
1506 /* Size of the reference counts. */
1507 if (keg->uk_flags & UMA_ZONE_REFCNT)
1508 totsize += keg->uk_ipers * sizeof(uint32_t);
1510 if (totsize & UMA_ALIGN_PTR)
1511 totsize = (totsize & ~UMA_ALIGN_PTR) +
1512 (UMA_ALIGN_PTR + 1);
1513 keg->uk_pgoff = (PAGE_SIZE * keg->uk_ppera) - totsize;
1516 * The only way the following is possible is if with our
1517 * UMA_ALIGN_PTR adjustments we are now bigger than
1518 * UMA_SLAB_SIZE. I haven't checked whether this is
1519 * mathematically possible for all cases, so we make
1522 totsize = keg->uk_pgoff + sizeof(struct uma_slab);
1523 if (keg->uk_flags & UMA_ZONE_REFCNT)
1524 totsize += keg->uk_ipers * sizeof(uint32_t);
1525 if (totsize > PAGE_SIZE * keg->uk_ppera) {
1526 printf("zone %s ipers %d rsize %d size %d\n",
1527 zone->uz_name, keg->uk_ipers, keg->uk_rsize,
1529 panic("UMA slab won't fit.");
1533 if (keg->uk_flags & UMA_ZONE_HASH)
1534 hash_alloc(&keg->uk_hash);
1537 printf("UMA: %s(%p) size %d(%d) flags %#x ipers %d ppera %d out %d free %d\n",
1538 zone->uz_name, zone, keg->uk_size, keg->uk_rsize, keg->uk_flags,
1539 keg->uk_ipers, keg->uk_ppera,
1540 (keg->uk_ipers * keg->uk_pages) - keg->uk_free, keg->uk_free);
1543 LIST_INSERT_HEAD(&keg->uk_zones, zone, uz_link);
1545 rw_wlock(&uma_rwlock);
1546 LIST_INSERT_HEAD(&uma_kegs, keg, uk_link);
1547 rw_wunlock(&uma_rwlock);
1552 * Zone header ctor. This initializes all fields, locks, etc.
1554 * Arguments/Returns follow uma_ctor specifications
1555 * udata Actually uma_zctor_args
1558 zone_ctor(void *mem, int size, void *udata, int flags)
1560 struct uma_zctor_args *arg = udata;
1561 uma_zone_t zone = mem;
1566 zone->uz_name = arg->name;
1567 zone->uz_ctor = arg->ctor;
1568 zone->uz_dtor = arg->dtor;
1569 zone->uz_slab = zone_fetch_slab;
1570 zone->uz_init = NULL;
1571 zone->uz_fini = NULL;
1572 zone->uz_allocs = 0;
1575 zone->uz_sleeps = 0;
1577 zone->uz_count_min = 0;
1579 zone->uz_warning = NULL;
1580 timevalclear(&zone->uz_ratecheck);
1583 ZONE_LOCK_INIT(zone, (arg->flags & UMA_ZONE_MTXCLASS));
1586 * This is a pure cache zone, no kegs.
1589 if (arg->flags & UMA_ZONE_VM)
1590 arg->flags |= UMA_ZFLAG_CACHEONLY;
1591 zone->uz_flags = arg->flags;
1592 zone->uz_size = arg->size;
1593 zone->uz_import = arg->import;
1594 zone->uz_release = arg->release;
1595 zone->uz_arg = arg->arg;
1596 zone->uz_lockptr = &zone->uz_lock;
1597 rw_wlock(&uma_rwlock);
1598 LIST_INSERT_HEAD(&uma_cachezones, zone, uz_link);
1599 rw_wunlock(&uma_rwlock);
1604 * Use the regular zone/keg/slab allocator.
1606 zone->uz_import = (uma_import)zone_import;
1607 zone->uz_release = (uma_release)zone_release;
1608 zone->uz_arg = zone;
1610 if (arg->flags & UMA_ZONE_SECONDARY) {
1611 KASSERT(arg->keg != NULL, ("Secondary zone on zero'd keg"));
1612 zone->uz_init = arg->uminit;
1613 zone->uz_fini = arg->fini;
1614 zone->uz_lockptr = &keg->uk_lock;
1615 zone->uz_flags |= UMA_ZONE_SECONDARY;
1616 rw_wlock(&uma_rwlock);
1618 LIST_FOREACH(z, &keg->uk_zones, uz_link) {
1619 if (LIST_NEXT(z, uz_link) == NULL) {
1620 LIST_INSERT_AFTER(z, zone, uz_link);
1625 rw_wunlock(&uma_rwlock);
1626 } else if (keg == NULL) {
1627 if ((keg = uma_kcreate(zone, arg->size, arg->uminit, arg->fini,
1628 arg->align, arg->flags)) == NULL)
1631 struct uma_kctor_args karg;
1634 /* We should only be here from uma_startup() */
1635 karg.size = arg->size;
1636 karg.uminit = arg->uminit;
1637 karg.fini = arg->fini;
1638 karg.align = arg->align;
1639 karg.flags = arg->flags;
1641 error = keg_ctor(arg->keg, sizeof(struct uma_keg), &karg,
1648 * Link in the first keg.
1650 zone->uz_klink.kl_keg = keg;
1651 LIST_INSERT_HEAD(&zone->uz_kegs, &zone->uz_klink, kl_link);
1652 zone->uz_lockptr = &keg->uk_lock;
1653 zone->uz_size = keg->uk_size;
1654 zone->uz_flags |= (keg->uk_flags &
1655 (UMA_ZONE_INHERIT | UMA_ZFLAG_INHERIT));
1658 * Some internal zones don't have room allocated for the per cpu
1659 * caches. If we're internal, bail out here.
1661 if (keg->uk_flags & UMA_ZFLAG_INTERNAL) {
1662 KASSERT((zone->uz_flags & UMA_ZONE_SECONDARY) == 0,
1663 ("Secondary zone requested UMA_ZFLAG_INTERNAL"));
1668 if ((arg->flags & UMA_ZONE_MAXBUCKET) == 0)
1669 zone->uz_count = bucket_select(zone->uz_size);
1671 zone->uz_count = BUCKET_MAX;
1672 zone->uz_count_min = zone->uz_count;
1678 * Keg header dtor. This frees all data, destroys locks, frees the hash
1679 * table and removes the keg from the global list.
1681 * Arguments/Returns follow uma_dtor specifications
1685 keg_dtor(void *arg, int size, void *udata)
1689 keg = (uma_keg_t)arg;
1691 if (keg->uk_free != 0) {
1692 printf("Freed UMA keg (%s) was not empty (%d items). "
1693 " Lost %d pages of memory.\n",
1694 keg->uk_name ? keg->uk_name : "",
1695 keg->uk_free, keg->uk_pages);
1699 hash_free(&keg->uk_hash);
1707 * Arguments/Returns follow uma_dtor specifications
1711 zone_dtor(void *arg, int size, void *udata)
1717 zone = (uma_zone_t)arg;
1718 keg = zone_first_keg(zone);
1720 if (!(zone->uz_flags & UMA_ZFLAG_INTERNAL))
1723 rw_wlock(&uma_rwlock);
1724 LIST_REMOVE(zone, uz_link);
1725 rw_wunlock(&uma_rwlock);
1727 * XXX there are some races here where
1728 * the zone can be drained but zone lock
1729 * released and then refilled before we
1730 * remove it... we dont care for now
1732 zone_drain_wait(zone, M_WAITOK);
1734 * Unlink all of our kegs.
1736 while ((klink = LIST_FIRST(&zone->uz_kegs)) != NULL) {
1737 klink->kl_keg = NULL;
1738 LIST_REMOVE(klink, kl_link);
1739 if (klink == &zone->uz_klink)
1741 free(klink, M_TEMP);
1744 * We only destroy kegs from non secondary zones.
1746 if (keg != NULL && (zone->uz_flags & UMA_ZONE_SECONDARY) == 0) {
1747 rw_wlock(&uma_rwlock);
1748 LIST_REMOVE(keg, uk_link);
1749 rw_wunlock(&uma_rwlock);
1750 zone_free_item(kegs, keg, NULL, SKIP_NONE);
1752 ZONE_LOCK_FINI(zone);
1756 * Traverses every zone in the system and calls a callback
1759 * zfunc A pointer to a function which accepts a zone
1766 zone_foreach(void (*zfunc)(uma_zone_t))
1771 rw_rlock(&uma_rwlock);
1772 LIST_FOREACH(keg, &uma_kegs, uk_link) {
1773 LIST_FOREACH(zone, &keg->uk_zones, uz_link)
1776 rw_runlock(&uma_rwlock);
1779 /* Public functions */
1782 uma_startup(void *bootmem, int boot_pages)
1784 struct uma_zctor_args args;
1790 printf("Creating uma keg headers zone and keg.\n");
1792 rw_init(&uma_rwlock, "UMA lock");
1794 /* "manually" create the initial zone */
1795 memset(&args, 0, sizeof(args));
1796 args.name = "UMA Kegs";
1797 args.size = sizeof(struct uma_keg);
1798 args.ctor = keg_ctor;
1799 args.dtor = keg_dtor;
1800 args.uminit = zero_init;
1802 args.keg = &masterkeg;
1803 args.align = 32 - 1;
1804 args.flags = UMA_ZFLAG_INTERNAL;
1805 /* The initial zone has no Per cpu queues so it's smaller */
1806 zone_ctor(kegs, sizeof(struct uma_zone), &args, M_WAITOK);
1809 printf("Filling boot free list.\n");
1811 for (i = 0; i < boot_pages; i++) {
1812 slab = (uma_slab_t)((uint8_t *)bootmem + (i * UMA_SLAB_SIZE));
1813 slab->us_data = (uint8_t *)slab;
1814 slab->us_flags = UMA_SLAB_BOOT;
1815 LIST_INSERT_HEAD(&uma_boot_pages, slab, us_link);
1817 mtx_init(&uma_boot_pages_mtx, "UMA boot pages", NULL, MTX_DEF);
1820 printf("Creating uma zone headers zone and keg.\n");
1822 args.name = "UMA Zones";
1823 args.size = sizeof(struct uma_zone) +
1824 (sizeof(struct uma_cache) * (mp_maxid + 1));
1825 args.ctor = zone_ctor;
1826 args.dtor = zone_dtor;
1827 args.uminit = zero_init;
1830 args.align = 32 - 1;
1831 args.flags = UMA_ZFLAG_INTERNAL;
1832 /* The initial zone has no Per cpu queues so it's smaller */
1833 zone_ctor(zones, sizeof(struct uma_zone), &args, M_WAITOK);
1836 printf("Creating slab and hash zones.\n");
1839 /* Now make a zone for slab headers */
1840 slabzone = uma_zcreate("UMA Slabs",
1841 sizeof(struct uma_slab),
1842 NULL, NULL, NULL, NULL,
1843 UMA_ALIGN_PTR, UMA_ZFLAG_INTERNAL);
1846 * We also create a zone for the bigger slabs with reference
1847 * counts in them, to accomodate UMA_ZONE_REFCNT zones.
1849 slabsize = sizeof(struct uma_slab_refcnt);
1850 slabsize += uma_max_ipers_ref * sizeof(uint32_t);
1851 slabrefzone = uma_zcreate("UMA RCntSlabs",
1853 NULL, NULL, NULL, NULL,
1855 UMA_ZFLAG_INTERNAL);
1857 hashzone = uma_zcreate("UMA Hash",
1858 sizeof(struct slabhead *) * UMA_HASH_SIZE_INIT,
1859 NULL, NULL, NULL, NULL,
1860 UMA_ALIGN_PTR, UMA_ZFLAG_INTERNAL);
1864 booted = UMA_STARTUP;
1867 printf("UMA startup complete.\n");
1875 booted = UMA_STARTUP2;
1877 sx_init(&uma_drain_lock, "umadrain");
1879 printf("UMA startup2 complete.\n");
1884 * Initialize our callout handle
1892 printf("Starting callout.\n");
1894 callout_init(&uma_callout, 1);
1895 callout_reset(&uma_callout, UMA_TIMEOUT * hz, uma_timeout, NULL);
1897 printf("UMA startup3 complete.\n");
1902 uma_kcreate(uma_zone_t zone, size_t size, uma_init uminit, uma_fini fini,
1903 int align, uint32_t flags)
1905 struct uma_kctor_args args;
1908 args.uminit = uminit;
1910 args.align = (align == UMA_ALIGN_CACHE) ? uma_align_cache : align;
1913 return (zone_alloc_item(kegs, &args, M_WAITOK));
1918 uma_set_align(int align)
1921 if (align != UMA_ALIGN_CACHE)
1922 uma_align_cache = align;
1927 uma_zcreate(const char *name, size_t size, uma_ctor ctor, uma_dtor dtor,
1928 uma_init uminit, uma_fini fini, int align, uint32_t flags)
1931 struct uma_zctor_args args;
1935 /* This stuff is essential for the zone ctor */
1936 memset(&args, 0, sizeof(args));
1941 args.uminit = uminit;
1947 if (booted < UMA_STARTUP2) {
1950 sx_slock(&uma_drain_lock);
1953 res = zone_alloc_item(zones, &args, M_WAITOK);
1955 sx_sunlock(&uma_drain_lock);
1961 uma_zsecond_create(char *name, uma_ctor ctor, uma_dtor dtor,
1962 uma_init zinit, uma_fini zfini, uma_zone_t master)
1964 struct uma_zctor_args args;
1969 keg = zone_first_keg(master);
1970 memset(&args, 0, sizeof(args));
1972 args.size = keg->uk_size;
1975 args.uminit = zinit;
1977 args.align = keg->uk_align;
1978 args.flags = keg->uk_flags | UMA_ZONE_SECONDARY;
1981 if (booted < UMA_STARTUP2) {
1984 sx_slock(&uma_drain_lock);
1987 /* XXX Attaches only one keg of potentially many. */
1988 res = zone_alloc_item(zones, &args, M_WAITOK);
1990 sx_sunlock(&uma_drain_lock);
1996 uma_zcache_create(char *name, int size, uma_ctor ctor, uma_dtor dtor,
1997 uma_init zinit, uma_fini zfini, uma_import zimport,
1998 uma_release zrelease, void *arg, int flags)
2000 struct uma_zctor_args args;
2002 memset(&args, 0, sizeof(args));
2007 args.uminit = zinit;
2009 args.import = zimport;
2010 args.release = zrelease;
2015 return (zone_alloc_item(zones, &args, M_WAITOK));
2019 zone_lock_pair(uma_zone_t a, uma_zone_t b)
2023 mtx_lock_flags(b->uz_lockptr, MTX_DUPOK);
2026 mtx_lock_flags(a->uz_lockptr, MTX_DUPOK);
2031 zone_unlock_pair(uma_zone_t a, uma_zone_t b)
2039 uma_zsecond_add(uma_zone_t zone, uma_zone_t master)
2046 klink = malloc(sizeof(*klink), M_TEMP, M_WAITOK | M_ZERO);
2048 zone_lock_pair(zone, master);
2050 * zone must use vtoslab() to resolve objects and must already be
2053 if ((zone->uz_flags & (UMA_ZONE_VTOSLAB | UMA_ZONE_SECONDARY))
2054 != (UMA_ZONE_VTOSLAB | UMA_ZONE_SECONDARY)) {
2059 * The new master must also use vtoslab().
2061 if ((zone->uz_flags & UMA_ZONE_VTOSLAB) != UMA_ZONE_VTOSLAB) {
2066 * Both must either be refcnt, or not be refcnt.
2068 if ((zone->uz_flags & UMA_ZONE_REFCNT) !=
2069 (master->uz_flags & UMA_ZONE_REFCNT)) {
2074 * The underlying object must be the same size. rsize
2077 if (master->uz_size != zone->uz_size) {
2082 * Put it at the end of the list.
2084 klink->kl_keg = zone_first_keg(master);
2085 LIST_FOREACH(kl, &zone->uz_kegs, kl_link) {
2086 if (LIST_NEXT(kl, kl_link) == NULL) {
2087 LIST_INSERT_AFTER(kl, klink, kl_link);
2092 zone->uz_flags |= UMA_ZFLAG_MULTI;
2093 zone->uz_slab = zone_fetch_slab_multi;
2096 zone_unlock_pair(zone, master);
2098 free(klink, M_TEMP);
2106 uma_zdestroy(uma_zone_t zone)
2109 sx_slock(&uma_drain_lock);
2110 zone_free_item(zones, zone, NULL, SKIP_NONE);
2111 sx_sunlock(&uma_drain_lock);
2116 uma_zalloc_arg(uma_zone_t zone, void *udata, int flags)
2120 uma_bucket_t bucket;
2125 /* XXX: FIX!! Do not enable this in CURRENT!! MarkM */
2126 /* The entropy here is desirable, but the harvesting is expensive */
2127 random_harvest(&(zone->uz_name), sizeof(void *), 1, RANDOM_UMA_ALLOC);
2130 /* This is the fast path allocation */
2131 #ifdef UMA_DEBUG_ALLOC_1
2132 printf("Allocating one item from %s(%p)\n", zone->uz_name, zone);
2134 CTR3(KTR_UMA, "uma_zalloc_arg thread %x zone %s flags %d", curthread,
2135 zone->uz_name, flags);
2137 if (flags & M_WAITOK) {
2138 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
2139 "uma_zalloc_arg: zone \"%s\"", zone->uz_name);
2141 #ifdef DEBUG_MEMGUARD
2142 if (memguard_cmp_zone(zone)) {
2143 item = memguard_alloc(zone->uz_size, flags);
2146 * Avoid conflict with the use-after-free
2147 * protecting infrastructure from INVARIANTS.
2149 if (zone->uz_init != NULL &&
2150 zone->uz_init != mtrash_init &&
2151 zone->uz_init(item, zone->uz_size, flags) != 0)
2153 if (zone->uz_ctor != NULL &&
2154 zone->uz_ctor != mtrash_ctor &&
2155 zone->uz_ctor(item, zone->uz_size, udata,
2157 zone->uz_fini(item, zone->uz_size);
2161 /* XXX: FIX!! Do not enable this in CURRENT!! MarkM */
2162 /* The entropy here is desirable, but the harvesting is expensive */
2163 random_harvest(&item, sizeof(void *), 1, RANDOM_UMA_ALLOC);
2167 /* This is unfortunate but should not be fatal. */
2171 * If possible, allocate from the per-CPU cache. There are two
2172 * requirements for safe access to the per-CPU cache: (1) the thread
2173 * accessing the cache must not be preempted or yield during access,
2174 * and (2) the thread must not migrate CPUs without switching which
2175 * cache it accesses. We rely on a critical section to prevent
2176 * preemption and migration. We release the critical section in
2177 * order to acquire the zone mutex if we are unable to allocate from
2178 * the current cache; when we re-acquire the critical section, we
2179 * must detect and handle migration if it has occurred.
2183 cache = &zone->uz_cpu[cpu];
2186 bucket = cache->uc_allocbucket;
2187 if (bucket != NULL && bucket->ub_cnt > 0) {
2189 item = bucket->ub_bucket[bucket->ub_cnt];
2191 bucket->ub_bucket[bucket->ub_cnt] = NULL;
2193 KASSERT(item != NULL, ("uma_zalloc: Bucket pointer mangled."));
2196 if (zone->uz_ctor != NULL &&
2197 zone->uz_ctor(item, zone->uz_size, udata, flags) != 0) {
2198 atomic_add_long(&zone->uz_fails, 1);
2199 zone_free_item(zone, item, udata, SKIP_DTOR);
2203 uma_dbg_alloc(zone, NULL, item);
2206 uma_zero_item(item, zone);
2208 /* XXX: FIX!! Do not enable this in CURRENT!! MarkM */
2209 /* The entropy here is desirable, but the harvesting is expensive */
2210 random_harvest(&item, sizeof(void *), 1, RANDOM_UMA_ALLOC);
2216 * We have run out of items in our alloc bucket.
2217 * See if we can switch with our free bucket.
2219 bucket = cache->uc_freebucket;
2220 if (bucket != NULL && bucket->ub_cnt > 0) {
2221 #ifdef UMA_DEBUG_ALLOC
2222 printf("uma_zalloc: Swapping empty with alloc.\n");
2224 cache->uc_freebucket = cache->uc_allocbucket;
2225 cache->uc_allocbucket = bucket;
2230 * Discard any empty allocation bucket while we hold no locks.
2232 bucket = cache->uc_allocbucket;
2233 cache->uc_allocbucket = NULL;
2236 bucket_free(zone, bucket, udata);
2238 /* Short-circuit for zones without buckets and low memory. */
2239 if (zone->uz_count == 0 || bucketdisable)
2243 * Attempt to retrieve the item from the per-CPU cache has failed, so
2244 * we must go back to the zone. This requires the zone lock, so we
2245 * must drop the critical section, then re-acquire it when we go back
2246 * to the cache. Since the critical section is released, we may be
2247 * preempted or migrate. As such, make sure not to maintain any
2248 * thread-local state specific to the cache from prior to releasing
2249 * the critical section.
2252 if (ZONE_TRYLOCK(zone) == 0) {
2253 /* Record contention to size the buckets. */
2259 cache = &zone->uz_cpu[cpu];
2262 * Since we have locked the zone we may as well send back our stats.
2264 atomic_add_long(&zone->uz_allocs, cache->uc_allocs);
2265 atomic_add_long(&zone->uz_frees, cache->uc_frees);
2266 cache->uc_allocs = 0;
2267 cache->uc_frees = 0;
2269 /* See if we lost the race to fill the cache. */
2270 if (cache->uc_allocbucket != NULL) {
2276 * Check the zone's cache of buckets.
2278 if ((bucket = LIST_FIRST(&zone->uz_buckets)) != NULL) {
2279 KASSERT(bucket->ub_cnt != 0,
2280 ("uma_zalloc_arg: Returning an empty bucket."));
2282 LIST_REMOVE(bucket, ub_link);
2283 cache->uc_allocbucket = bucket;
2287 /* We are no longer associated with this CPU. */
2291 * We bump the uz count when the cache size is insufficient to
2292 * handle the working set.
2294 if (lockfail && zone->uz_count < BUCKET_MAX)
2299 * Now lets just fill a bucket and put it on the free list. If that
2300 * works we'll restart the allocation from the begining and it
2301 * will use the just filled bucket.
2303 bucket = zone_alloc_bucket(zone, udata, flags);
2304 if (bucket != NULL) {
2308 cache = &zone->uz_cpu[cpu];
2310 * See if we lost the race or were migrated. Cache the
2311 * initialized bucket to make this less likely or claim
2312 * the memory directly.
2314 if (cache->uc_allocbucket == NULL)
2315 cache->uc_allocbucket = bucket;
2317 LIST_INSERT_HEAD(&zone->uz_buckets, bucket, ub_link);
2323 * We may not be able to get a bucket so return an actual item.
2326 printf("uma_zalloc_arg: Bucketzone returned NULL\n");
2330 item = zone_alloc_item(zone, udata, flags);
2333 /* XXX: FIX!! Do not enable this in CURRENT!! MarkM */
2334 /* The entropy here is desirable, but the harvesting is expensive */
2335 random_harvest(&item, sizeof(void *), 1, RANDOM_UMA_ALLOC);
2341 keg_fetch_slab(uma_keg_t keg, uma_zone_t zone, int flags)
2346 mtx_assert(&keg->uk_lock, MA_OWNED);
2349 if ((flags & M_USE_RESERVE) == 0)
2350 reserve = keg->uk_reserve;
2354 * Find a slab with some space. Prefer slabs that are partially
2355 * used over those that are totally full. This helps to reduce
2358 if (keg->uk_free > reserve) {
2359 if (!LIST_EMPTY(&keg->uk_part_slab)) {
2360 slab = LIST_FIRST(&keg->uk_part_slab);
2362 slab = LIST_FIRST(&keg->uk_free_slab);
2363 LIST_REMOVE(slab, us_link);
2364 LIST_INSERT_HEAD(&keg->uk_part_slab, slab,
2367 MPASS(slab->us_keg == keg);
2372 * M_NOVM means don't ask at all!
2377 if (keg->uk_maxpages && keg->uk_pages >= keg->uk_maxpages) {
2378 keg->uk_flags |= UMA_ZFLAG_FULL;
2380 * If this is not a multi-zone, set the FULL bit.
2381 * Otherwise slab_multi() takes care of it.
2383 if ((zone->uz_flags & UMA_ZFLAG_MULTI) == 0) {
2384 zone->uz_flags |= UMA_ZFLAG_FULL;
2385 zone_log_warning(zone);
2387 if (flags & M_NOWAIT)
2390 msleep(keg, &keg->uk_lock, PVM, "keglimit", 0);
2393 slab = keg_alloc_slab(keg, zone, flags);
2395 * If we got a slab here it's safe to mark it partially used
2396 * and return. We assume that the caller is going to remove
2397 * at least one item.
2400 MPASS(slab->us_keg == keg);
2401 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, us_link);
2405 * We might not have been able to get a slab but another cpu
2406 * could have while we were unlocked. Check again before we
2415 zone_fetch_slab(uma_zone_t zone, uma_keg_t keg, int flags)
2420 keg = zone_first_keg(zone);
2425 slab = keg_fetch_slab(keg, zone, flags);
2428 if (flags & (M_NOWAIT | M_NOVM))
2436 * uma_zone_fetch_slab_multi: Fetches a slab from one available keg. Returns
2437 * with the keg locked. On NULL no lock is held.
2439 * The last pointer is used to seed the search. It is not required.
2442 zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int rflags)
2452 * Don't wait on the first pass. This will skip limit tests
2453 * as well. We don't want to block if we can find a provider
2456 flags = (rflags & ~M_WAITOK) | M_NOWAIT;
2458 * Use the last slab allocated as a hint for where to start
2462 slab = keg_fetch_slab(last, zone, flags);
2468 * Loop until we have a slab incase of transient failures
2469 * while M_WAITOK is specified. I'm not sure this is 100%
2470 * required but we've done it for so long now.
2476 * Search the available kegs for slabs. Be careful to hold the
2477 * correct lock while calling into the keg layer.
2479 LIST_FOREACH(klink, &zone->uz_kegs, kl_link) {
2480 keg = klink->kl_keg;
2482 if ((keg->uk_flags & UMA_ZFLAG_FULL) == 0) {
2483 slab = keg_fetch_slab(keg, zone, flags);
2487 if (keg->uk_flags & UMA_ZFLAG_FULL)
2493 if (rflags & (M_NOWAIT | M_NOVM))
2497 * All kegs are full. XXX We can't atomically check all kegs
2498 * and sleep so just sleep for a short period and retry.
2500 if (full && !empty) {
2502 zone->uz_flags |= UMA_ZFLAG_FULL;
2504 zone_log_warning(zone);
2505 msleep(zone, zone->uz_lockptr, PVM,
2506 "zonelimit", hz/100);
2507 zone->uz_flags &= ~UMA_ZFLAG_FULL;
2516 slab_alloc_item(uma_keg_t keg, uma_slab_t slab)
2521 MPASS(keg == slab->us_keg);
2522 mtx_assert(&keg->uk_lock, MA_OWNED);
2524 freei = BIT_FFS(SLAB_SETSIZE, &slab->us_free) - 1;
2525 BIT_CLR(SLAB_SETSIZE, freei, &slab->us_free);
2526 item = slab->us_data + (keg->uk_rsize * freei);
2527 slab->us_freecount--;
2530 /* Move this slab to the full list */
2531 if (slab->us_freecount == 0) {
2532 LIST_REMOVE(slab, us_link);
2533 LIST_INSERT_HEAD(&keg->uk_full_slab, slab, us_link);
2540 zone_import(uma_zone_t zone, void **bucket, int max, int flags)
2548 /* Try to keep the buckets totally full */
2549 for (i = 0; i < max; ) {
2550 if ((slab = zone->uz_slab(zone, keg, flags)) == NULL)
2553 while (slab->us_freecount && i < max) {
2554 bucket[i++] = slab_alloc_item(keg, slab);
2555 if (keg->uk_free <= keg->uk_reserve)
2558 /* Don't grab more than one slab at a time. */
2569 zone_alloc_bucket(uma_zone_t zone, void *udata, int flags)
2571 uma_bucket_t bucket;
2574 /* Don't wait for buckets, preserve caller's NOVM setting. */
2575 bucket = bucket_alloc(zone, udata, M_NOWAIT | (flags & M_NOVM));
2579 max = MIN(bucket->ub_entries, zone->uz_count);
2580 bucket->ub_cnt = zone->uz_import(zone->uz_arg, bucket->ub_bucket,
2584 * Initialize the memory if necessary.
2586 if (bucket->ub_cnt != 0 && zone->uz_init != NULL) {
2589 for (i = 0; i < bucket->ub_cnt; i++)
2590 if (zone->uz_init(bucket->ub_bucket[i], zone->uz_size,
2594 * If we couldn't initialize the whole bucket, put the
2595 * rest back onto the freelist.
2597 if (i != bucket->ub_cnt) {
2598 zone->uz_release(zone->uz_arg, &bucket->ub_bucket[i],
2599 bucket->ub_cnt - i);
2601 bzero(&bucket->ub_bucket[i],
2602 sizeof(void *) * (bucket->ub_cnt - i));
2608 if (bucket->ub_cnt == 0) {
2609 bucket_free(zone, bucket, udata);
2610 atomic_add_long(&zone->uz_fails, 1);
2618 * Allocates a single item from a zone.
2621 * zone The zone to alloc for.
2622 * udata The data to be passed to the constructor.
2623 * flags M_WAITOK, M_NOWAIT, M_ZERO.
2626 * NULL if there is no memory and M_NOWAIT is set
2627 * An item if successful
2631 zone_alloc_item(uma_zone_t zone, void *udata, int flags)
2637 #ifdef UMA_DEBUG_ALLOC
2638 printf("INTERNAL: Allocating one item from %s(%p)\n", zone->uz_name, zone);
2640 if (zone->uz_import(zone->uz_arg, &item, 1, flags) != 1)
2642 atomic_add_long(&zone->uz_allocs, 1);
2645 * We have to call both the zone's init (not the keg's init)
2646 * and the zone's ctor. This is because the item is going from
2647 * a keg slab directly to the user, and the user is expecting it
2648 * to be both zone-init'd as well as zone-ctor'd.
2650 if (zone->uz_init != NULL) {
2651 if (zone->uz_init(item, zone->uz_size, flags) != 0) {
2652 zone_free_item(zone, item, udata, SKIP_FINI);
2656 if (zone->uz_ctor != NULL) {
2657 if (zone->uz_ctor(item, zone->uz_size, udata, flags) != 0) {
2658 zone_free_item(zone, item, udata, SKIP_DTOR);
2663 uma_dbg_alloc(zone, NULL, item);
2666 uma_zero_item(item, zone);
2671 atomic_add_long(&zone->uz_fails, 1);
2677 uma_zfree_arg(uma_zone_t zone, void *item, void *udata)
2680 uma_bucket_t bucket;
2685 /* XXX: FIX!! Do not enable this in CURRENT!! MarkM */
2686 /* The entropy here is desirable, but the harvesting is expensive */
2688 const void *uz_name;
2692 entropy.uz_name = zone->uz_name;
2693 entropy.item = item;
2694 random_harvest(&entropy, sizeof(struct entropy), 2, RANDOM_UMA_ALLOC);
2697 #ifdef UMA_DEBUG_ALLOC_1
2698 printf("Freeing item %p to %s(%p)\n", item, zone->uz_name, zone);
2700 CTR2(KTR_UMA, "uma_zfree_arg thread %x zone %s", curthread,
2703 /* uma_zfree(..., NULL) does nothing, to match free(9). */
2706 #ifdef DEBUG_MEMGUARD
2707 if (is_memguard_addr(item)) {
2708 if (zone->uz_dtor != NULL && zone->uz_dtor != mtrash_dtor)
2709 zone->uz_dtor(item, zone->uz_size, udata);
2710 if (zone->uz_fini != NULL && zone->uz_fini != mtrash_fini)
2711 zone->uz_fini(item, zone->uz_size);
2712 memguard_free(item);
2717 if (zone->uz_flags & UMA_ZONE_MALLOC)
2718 uma_dbg_free(zone, udata, item);
2720 uma_dbg_free(zone, NULL, item);
2722 if (zone->uz_dtor != NULL)
2723 zone->uz_dtor(item, zone->uz_size, udata);
2726 * The race here is acceptable. If we miss it we'll just have to wait
2727 * a little longer for the limits to be reset.
2729 if (zone->uz_flags & UMA_ZFLAG_FULL)
2733 * If possible, free to the per-CPU cache. There are two
2734 * requirements for safe access to the per-CPU cache: (1) the thread
2735 * accessing the cache must not be preempted or yield during access,
2736 * and (2) the thread must not migrate CPUs without switching which
2737 * cache it accesses. We rely on a critical section to prevent
2738 * preemption and migration. We release the critical section in
2739 * order to acquire the zone mutex if we are unable to free to the
2740 * current cache; when we re-acquire the critical section, we must
2741 * detect and handle migration if it has occurred.
2746 cache = &zone->uz_cpu[cpu];
2750 * Try to free into the allocbucket first to give LIFO ordering
2751 * for cache-hot datastructures. Spill over into the freebucket
2752 * if necessary. Alloc will swap them if one runs dry.
2754 bucket = cache->uc_allocbucket;
2755 if (bucket == NULL || bucket->ub_cnt >= bucket->ub_entries)
2756 bucket = cache->uc_freebucket;
2757 if (bucket != NULL && bucket->ub_cnt < bucket->ub_entries) {
2758 KASSERT(bucket->ub_bucket[bucket->ub_cnt] == NULL,
2759 ("uma_zfree: Freeing to non free bucket index."));
2760 bucket->ub_bucket[bucket->ub_cnt] = item;
2768 * We must go back the zone, which requires acquiring the zone lock,
2769 * which in turn means we must release and re-acquire the critical
2770 * section. Since the critical section is released, we may be
2771 * preempted or migrate. As such, make sure not to maintain any
2772 * thread-local state specific to the cache from prior to releasing
2773 * the critical section.
2776 if (zone->uz_count == 0 || bucketdisable)
2780 if (ZONE_TRYLOCK(zone) == 0) {
2781 /* Record contention to size the buckets. */
2787 cache = &zone->uz_cpu[cpu];
2790 * Since we have locked the zone we may as well send back our stats.
2792 atomic_add_long(&zone->uz_allocs, cache->uc_allocs);
2793 atomic_add_long(&zone->uz_frees, cache->uc_frees);
2794 cache->uc_allocs = 0;
2795 cache->uc_frees = 0;
2797 bucket = cache->uc_freebucket;
2798 if (bucket != NULL && bucket->ub_cnt < bucket->ub_entries) {
2802 cache->uc_freebucket = NULL;
2804 /* Can we throw this on the zone full list? */
2805 if (bucket != NULL) {
2806 #ifdef UMA_DEBUG_ALLOC
2807 printf("uma_zfree: Putting old bucket on the free list.\n");
2809 /* ub_cnt is pointing to the last free item */
2810 KASSERT(bucket->ub_cnt != 0,
2811 ("uma_zfree: Attempting to insert an empty bucket onto the full list.\n"));
2812 LIST_INSERT_HEAD(&zone->uz_buckets, bucket, ub_link);
2815 /* We are no longer associated with this CPU. */
2819 * We bump the uz count when the cache size is insufficient to
2820 * handle the working set.
2822 if (lockfail && zone->uz_count < BUCKET_MAX)
2826 #ifdef UMA_DEBUG_ALLOC
2827 printf("uma_zfree: Allocating new free bucket.\n");
2829 bucket = bucket_alloc(zone, udata, M_NOWAIT);
2833 cache = &zone->uz_cpu[cpu];
2834 if (cache->uc_freebucket == NULL) {
2835 cache->uc_freebucket = bucket;
2839 * We lost the race, start over. We have to drop our
2840 * critical section to free the bucket.
2843 bucket_free(zone, bucket, udata);
2848 * If nothing else caught this, we'll just do an internal free.
2851 zone_free_item(zone, item, udata, SKIP_DTOR);
2857 slab_free_item(uma_keg_t keg, uma_slab_t slab, void *item)
2861 mtx_assert(&keg->uk_lock, MA_OWNED);
2862 MPASS(keg == slab->us_keg);
2864 /* Do we need to remove from any lists? */
2865 if (slab->us_freecount+1 == keg->uk_ipers) {
2866 LIST_REMOVE(slab, us_link);
2867 LIST_INSERT_HEAD(&keg->uk_free_slab, slab, us_link);
2868 } else if (slab->us_freecount == 0) {
2869 LIST_REMOVE(slab, us_link);
2870 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, us_link);
2873 /* Slab management. */
2874 freei = ((uintptr_t)item - (uintptr_t)slab->us_data) / keg->uk_rsize;
2875 BIT_SET(SLAB_SETSIZE, freei, &slab->us_free);
2876 slab->us_freecount++;
2878 /* Keg statistics. */
2883 zone_release(uma_zone_t zone, void **bucket, int cnt)
2893 keg = zone_first_keg(zone);
2895 for (i = 0; i < cnt; i++) {
2897 if (!(zone->uz_flags & UMA_ZONE_VTOSLAB)) {
2898 mem = (uint8_t *)((uintptr_t)item & (~UMA_SLAB_MASK));
2899 if (zone->uz_flags & UMA_ZONE_HASH) {
2900 slab = hash_sfind(&keg->uk_hash, mem);
2902 mem += keg->uk_pgoff;
2903 slab = (uma_slab_t)mem;
2906 slab = vtoslab((vm_offset_t)item);
2907 if (slab->us_keg != keg) {
2913 slab_free_item(keg, slab, item);
2914 if (keg->uk_flags & UMA_ZFLAG_FULL) {
2915 if (keg->uk_pages < keg->uk_maxpages) {
2916 keg->uk_flags &= ~UMA_ZFLAG_FULL;
2921 * We can handle one more allocation. Since we're
2922 * clearing ZFLAG_FULL, wake up all procs blocked
2923 * on pages. This should be uncommon, so keeping this
2924 * simple for now (rather than adding count of blocked
2933 zone->uz_flags &= ~UMA_ZFLAG_FULL;
2941 * Frees a single item to any zone.
2944 * zone The zone to free to
2945 * item The item we're freeing
2946 * udata User supplied data for the dtor
2947 * skip Skip dtors and finis
2950 zone_free_item(uma_zone_t zone, void *item, void *udata, enum zfreeskip skip)
2954 if (skip == SKIP_NONE) {
2955 if (zone->uz_flags & UMA_ZONE_MALLOC)
2956 uma_dbg_free(zone, udata, item);
2958 uma_dbg_free(zone, NULL, item);
2961 if (skip < SKIP_DTOR && zone->uz_dtor)
2962 zone->uz_dtor(item, zone->uz_size, udata);
2964 if (skip < SKIP_FINI && zone->uz_fini)
2965 zone->uz_fini(item, zone->uz_size);
2967 atomic_add_long(&zone->uz_frees, 1);
2968 zone->uz_release(zone->uz_arg, &item, 1);
2973 uma_zone_set_max(uma_zone_t zone, int nitems)
2977 keg = zone_first_keg(zone);
2981 keg->uk_maxpages = (nitems / keg->uk_ipers) * keg->uk_ppera;
2982 if (keg->uk_maxpages * keg->uk_ipers < nitems)
2983 keg->uk_maxpages += keg->uk_ppera;
2984 nitems = keg->uk_maxpages * keg->uk_ipers;
2992 uma_zone_get_max(uma_zone_t zone)
2997 keg = zone_first_keg(zone);
3001 nitems = keg->uk_maxpages * keg->uk_ipers;
3009 uma_zone_set_warning(uma_zone_t zone, const char *warning)
3013 zone->uz_warning = warning;
3019 uma_zone_get_cur(uma_zone_t zone)
3025 nitems = zone->uz_allocs - zone->uz_frees;
3028 * See the comment in sysctl_vm_zone_stats() regarding the
3029 * safety of accessing the per-cpu caches. With the zone lock
3030 * held, it is safe, but can potentially result in stale data.
3032 nitems += zone->uz_cpu[i].uc_allocs -
3033 zone->uz_cpu[i].uc_frees;
3037 return (nitems < 0 ? 0 : nitems);
3042 uma_zone_set_init(uma_zone_t zone, uma_init uminit)
3046 keg = zone_first_keg(zone);
3047 KASSERT(keg != NULL, ("uma_zone_set_init: Invalid zone type"));
3049 KASSERT(keg->uk_pages == 0,
3050 ("uma_zone_set_init on non-empty keg"));
3051 keg->uk_init = uminit;
3057 uma_zone_set_fini(uma_zone_t zone, uma_fini fini)
3061 keg = zone_first_keg(zone);
3062 KASSERT(keg != NULL, ("uma_zone_set_fini: Invalid zone type"));
3064 KASSERT(keg->uk_pages == 0,
3065 ("uma_zone_set_fini on non-empty keg"));
3066 keg->uk_fini = fini;
3072 uma_zone_set_zinit(uma_zone_t zone, uma_init zinit)
3076 KASSERT(zone_first_keg(zone)->uk_pages == 0,
3077 ("uma_zone_set_zinit on non-empty keg"));
3078 zone->uz_init = zinit;
3084 uma_zone_set_zfini(uma_zone_t zone, uma_fini zfini)
3088 KASSERT(zone_first_keg(zone)->uk_pages == 0,
3089 ("uma_zone_set_zfini on non-empty keg"));
3090 zone->uz_fini = zfini;
3095 /* XXX uk_freef is not actually used with the zone locked */
3097 uma_zone_set_freef(uma_zone_t zone, uma_free freef)
3101 keg = zone_first_keg(zone);
3102 KASSERT(keg != NULL, ("uma_zone_set_freef: Invalid zone type"));
3104 keg->uk_freef = freef;
3109 /* XXX uk_allocf is not actually used with the zone locked */
3111 uma_zone_set_allocf(uma_zone_t zone, uma_alloc allocf)
3115 keg = zone_first_keg(zone);
3117 keg->uk_allocf = allocf;
3123 uma_zone_reserve(uma_zone_t zone, int items)
3127 keg = zone_first_keg(zone);
3131 keg->uk_reserve = items;
3139 uma_zone_reserve_kva(uma_zone_t zone, int count)
3145 keg = zone_first_keg(zone);
3148 pages = count / keg->uk_ipers;
3150 if (pages * keg->uk_ipers < count)
3153 #ifdef UMA_MD_SMALL_ALLOC
3154 if (keg->uk_ppera > 1) {
3158 kva = kva_alloc(pages * UMA_SLAB_SIZE);
3166 keg->uk_maxpages = pages;
3167 #ifdef UMA_MD_SMALL_ALLOC
3168 keg->uk_allocf = (keg->uk_ppera > 1) ? noobj_alloc : uma_small_alloc;
3170 keg->uk_allocf = noobj_alloc;
3172 keg->uk_flags |= UMA_ZONE_NOFREE;
3180 uma_prealloc(uma_zone_t zone, int items)
3186 keg = zone_first_keg(zone);
3190 slabs = items / keg->uk_ipers;
3191 if (slabs * keg->uk_ipers < items)
3194 slab = keg_alloc_slab(keg, zone, M_WAITOK);
3197 MPASS(slab->us_keg == keg);
3198 LIST_INSERT_HEAD(&keg->uk_free_slab, slab, us_link);
3206 uma_find_refcnt(uma_zone_t zone, void *item)
3208 uma_slabrefcnt_t slabref;
3214 slab = vtoslab((vm_offset_t)item & (~UMA_SLAB_MASK));
3215 slabref = (uma_slabrefcnt_t)slab;
3217 KASSERT(keg->uk_flags & UMA_ZONE_REFCNT,
3218 ("uma_find_refcnt(): zone possibly not UMA_ZONE_REFCNT"));
3219 idx = ((uintptr_t)item - (uintptr_t)slab->us_data) / keg->uk_rsize;
3220 refcnt = &slabref->us_refcnt[idx];
3226 uma_reclaim_locked(bool kmem_danger)
3230 printf("UMA: vm asked us to release pages!\n");
3232 sx_assert(&uma_drain_lock, SA_XLOCKED);
3234 zone_foreach(zone_drain);
3235 if (vm_page_count_min() || kmem_danger) {
3236 cache_drain_safe(NULL);
3237 zone_foreach(zone_drain);
3240 * Some slabs may have been freed but this zone will be visited early
3241 * we visit again so that we can free pages that are empty once other
3242 * zones are drained. We have to do the same for buckets.
3244 zone_drain(slabzone);
3245 zone_drain(slabrefzone);
3246 bucket_zone_drain();
3253 sx_xlock(&uma_drain_lock);
3254 uma_reclaim_locked(false);
3255 sx_xunlock(&uma_drain_lock);
3258 static int uma_reclaim_needed;
3261 uma_reclaim_wakeup(void)
3264 uma_reclaim_needed = 1;
3265 wakeup(&uma_reclaim_needed);
3269 uma_reclaim_worker(void *arg __unused)
3272 sx_xlock(&uma_drain_lock);
3274 sx_sleep(&uma_reclaim_needed, &uma_drain_lock, PVM,
3276 if (uma_reclaim_needed) {
3277 uma_reclaim_needed = 0;
3278 uma_reclaim_locked(true);
3285 uma_zone_exhausted(uma_zone_t zone)
3290 full = (zone->uz_flags & UMA_ZFLAG_FULL);
3296 uma_zone_exhausted_nolock(uma_zone_t zone)
3298 return (zone->uz_flags & UMA_ZFLAG_FULL);
3302 uma_large_malloc(vm_size_t size, int wait)
3308 slab = zone_alloc_item(slabzone, NULL, wait);
3311 mem = page_alloc(NULL, size, &flags, wait);
3313 vsetslab((vm_offset_t)mem, slab);
3314 slab->us_data = mem;
3315 slab->us_flags = flags | UMA_SLAB_MALLOC;
3316 slab->us_size = size;
3318 zone_free_item(slabzone, slab, NULL, SKIP_NONE);
3325 uma_large_free(uma_slab_t slab)
3328 page_free(slab->us_data, slab->us_size, slab->us_flags);
3329 zone_free_item(slabzone, slab, NULL, SKIP_NONE);
3333 uma_zero_item(void *item, uma_zone_t zone)
3336 if (zone->uz_flags & UMA_ZONE_PCPU) {
3337 for (int i = 0; i < mp_ncpus; i++)
3338 bzero(zpcpu_get_cpu(item, i), zone->uz_size);
3340 bzero(item, zone->uz_size);
3344 uma_print_stats(void)
3346 zone_foreach(uma_print_zone);
3350 slab_print(uma_slab_t slab)
3352 printf("slab: keg %p, data %p, freecount %d\n",
3353 slab->us_keg, slab->us_data, slab->us_freecount);
3357 cache_print(uma_cache_t cache)
3359 printf("alloc: %p(%d), free: %p(%d)\n",
3360 cache->uc_allocbucket,
3361 cache->uc_allocbucket?cache->uc_allocbucket->ub_cnt:0,
3362 cache->uc_freebucket,
3363 cache->uc_freebucket?cache->uc_freebucket->ub_cnt:0);
3367 uma_print_keg(uma_keg_t keg)
3371 printf("keg: %s(%p) size %d(%d) flags %#x ipers %d ppera %d "
3372 "out %d free %d limit %d\n",
3373 keg->uk_name, keg, keg->uk_size, keg->uk_rsize, keg->uk_flags,
3374 keg->uk_ipers, keg->uk_ppera,
3375 (keg->uk_ipers * keg->uk_pages) - keg->uk_free, keg->uk_free,
3376 (keg->uk_maxpages / keg->uk_ppera) * keg->uk_ipers);
3377 printf("Part slabs:\n");
3378 LIST_FOREACH(slab, &keg->uk_part_slab, us_link)
3380 printf("Free slabs:\n");
3381 LIST_FOREACH(slab, &keg->uk_free_slab, us_link)
3383 printf("Full slabs:\n");
3384 LIST_FOREACH(slab, &keg->uk_full_slab, us_link)
3389 uma_print_zone(uma_zone_t zone)
3395 printf("zone: %s(%p) size %d flags %#x\n",
3396 zone->uz_name, zone, zone->uz_size, zone->uz_flags);
3397 LIST_FOREACH(kl, &zone->uz_kegs, kl_link)
3398 uma_print_keg(kl->kl_keg);
3400 cache = &zone->uz_cpu[i];
3401 printf("CPU %d Cache:\n", i);
3408 * Generate statistics across both the zone and its per-cpu cache's. Return
3409 * desired statistics if the pointer is non-NULL for that statistic.
3411 * Note: does not update the zone statistics, as it can't safely clear the
3412 * per-CPU cache statistic.
3414 * XXXRW: Following the uc_allocbucket and uc_freebucket pointers here isn't
3415 * safe from off-CPU; we should modify the caches to track this information
3416 * directly so that we don't have to.
3419 uma_zone_sumstat(uma_zone_t z, int *cachefreep, uint64_t *allocsp,
3420 uint64_t *freesp, uint64_t *sleepsp)
3423 uint64_t allocs, frees, sleeps;
3426 allocs = frees = sleeps = 0;
3429 cache = &z->uz_cpu[cpu];
3430 if (cache->uc_allocbucket != NULL)
3431 cachefree += cache->uc_allocbucket->ub_cnt;
3432 if (cache->uc_freebucket != NULL)
3433 cachefree += cache->uc_freebucket->ub_cnt;
3434 allocs += cache->uc_allocs;
3435 frees += cache->uc_frees;
3437 allocs += z->uz_allocs;
3438 frees += z->uz_frees;
3439 sleeps += z->uz_sleeps;
3440 if (cachefreep != NULL)
3441 *cachefreep = cachefree;
3442 if (allocsp != NULL)
3446 if (sleepsp != NULL)
3452 sysctl_vm_zone_count(SYSCTL_HANDLER_ARGS)
3459 rw_rlock(&uma_rwlock);
3460 LIST_FOREACH(kz, &uma_kegs, uk_link) {
3461 LIST_FOREACH(z, &kz->uk_zones, uz_link)
3464 rw_runlock(&uma_rwlock);
3465 return (sysctl_handle_int(oidp, &count, 0, req));
3469 sysctl_vm_zone_stats(SYSCTL_HANDLER_ARGS)
3471 struct uma_stream_header ush;
3472 struct uma_type_header uth;
3473 struct uma_percpu_stat ups;
3474 uma_bucket_t bucket;
3481 int count, error, i;
3483 error = sysctl_wire_old_buffer(req, 0);
3486 sbuf_new_for_sysctl(&sbuf, NULL, 128, req);
3487 sbuf_clear_flags(&sbuf, SBUF_INCLUDENUL);
3490 rw_rlock(&uma_rwlock);
3491 LIST_FOREACH(kz, &uma_kegs, uk_link) {
3492 LIST_FOREACH(z, &kz->uk_zones, uz_link)
3497 * Insert stream header.
3499 bzero(&ush, sizeof(ush));
3500 ush.ush_version = UMA_STREAM_VERSION;
3501 ush.ush_maxcpus = (mp_maxid + 1);
3502 ush.ush_count = count;
3503 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush));
3505 LIST_FOREACH(kz, &uma_kegs, uk_link) {
3506 LIST_FOREACH(z, &kz->uk_zones, uz_link) {
3507 bzero(&uth, sizeof(uth));
3509 strlcpy(uth.uth_name, z->uz_name, UTH_MAX_NAME);
3510 uth.uth_align = kz->uk_align;
3511 uth.uth_size = kz->uk_size;
3512 uth.uth_rsize = kz->uk_rsize;
3513 LIST_FOREACH(kl, &z->uz_kegs, kl_link) {
3515 uth.uth_maxpages += k->uk_maxpages;
3516 uth.uth_pages += k->uk_pages;
3517 uth.uth_keg_free += k->uk_free;
3518 uth.uth_limit = (k->uk_maxpages / k->uk_ppera)
3523 * A zone is secondary is it is not the first entry
3524 * on the keg's zone list.
3526 if ((z->uz_flags & UMA_ZONE_SECONDARY) &&
3527 (LIST_FIRST(&kz->uk_zones) != z))
3528 uth.uth_zone_flags = UTH_ZONE_SECONDARY;
3530 LIST_FOREACH(bucket, &z->uz_buckets, ub_link)
3531 uth.uth_zone_free += bucket->ub_cnt;
3532 uth.uth_allocs = z->uz_allocs;
3533 uth.uth_frees = z->uz_frees;
3534 uth.uth_fails = z->uz_fails;
3535 uth.uth_sleeps = z->uz_sleeps;
3536 (void)sbuf_bcat(&sbuf, &uth, sizeof(uth));
3538 * While it is not normally safe to access the cache
3539 * bucket pointers while not on the CPU that owns the
3540 * cache, we only allow the pointers to be exchanged
3541 * without the zone lock held, not invalidated, so
3542 * accept the possible race associated with bucket
3543 * exchange during monitoring.
3545 for (i = 0; i < (mp_maxid + 1); i++) {
3546 bzero(&ups, sizeof(ups));
3547 if (kz->uk_flags & UMA_ZFLAG_INTERNAL)
3551 cache = &z->uz_cpu[i];
3552 if (cache->uc_allocbucket != NULL)
3553 ups.ups_cache_free +=
3554 cache->uc_allocbucket->ub_cnt;
3555 if (cache->uc_freebucket != NULL)
3556 ups.ups_cache_free +=
3557 cache->uc_freebucket->ub_cnt;
3558 ups.ups_allocs = cache->uc_allocs;
3559 ups.ups_frees = cache->uc_frees;
3561 (void)sbuf_bcat(&sbuf, &ups, sizeof(ups));
3566 rw_runlock(&uma_rwlock);
3567 error = sbuf_finish(&sbuf);
3573 sysctl_handle_uma_zone_max(SYSCTL_HANDLER_ARGS)
3575 uma_zone_t zone = *(uma_zone_t *)arg1;
3578 max = uma_zone_get_max(zone);
3579 error = sysctl_handle_int(oidp, &max, 0, req);
3580 if (error || !req->newptr)
3583 uma_zone_set_max(zone, max);
3589 sysctl_handle_uma_zone_cur(SYSCTL_HANDLER_ARGS)
3591 uma_zone_t zone = *(uma_zone_t *)arg1;
3594 cur = uma_zone_get_cur(zone);
3595 return (sysctl_handle_int(oidp, &cur, 0, req));
3599 DB_SHOW_COMMAND(uma, db_show_uma)
3601 uint64_t allocs, frees, sleeps;
3602 uma_bucket_t bucket;
3607 db_printf("%18s %8s %8s %8s %12s %8s %8s\n", "Zone", "Size", "Used",
3608 "Free", "Requests", "Sleeps", "Bucket");
3609 LIST_FOREACH(kz, &uma_kegs, uk_link) {
3610 LIST_FOREACH(z, &kz->uk_zones, uz_link) {
3611 if (kz->uk_flags & UMA_ZFLAG_INTERNAL) {
3612 allocs = z->uz_allocs;
3613 frees = z->uz_frees;
3614 sleeps = z->uz_sleeps;
3617 uma_zone_sumstat(z, &cachefree, &allocs,
3619 if (!((z->uz_flags & UMA_ZONE_SECONDARY) &&
3620 (LIST_FIRST(&kz->uk_zones) != z)))
3621 cachefree += kz->uk_free;
3622 LIST_FOREACH(bucket, &z->uz_buckets, ub_link)
3623 cachefree += bucket->ub_cnt;
3624 db_printf("%18s %8ju %8jd %8d %12ju %8ju %8u\n",
3625 z->uz_name, (uintmax_t)kz->uk_size,
3626 (intmax_t)(allocs - frees), cachefree,
3627 (uintmax_t)allocs, sleeps, z->uz_count);
3634 DB_SHOW_COMMAND(umacache, db_show_umacache)
3636 uint64_t allocs, frees;
3637 uma_bucket_t bucket;
3641 db_printf("%18s %8s %8s %8s %12s %8s\n", "Zone", "Size", "Used", "Free",
3642 "Requests", "Bucket");
3643 LIST_FOREACH(z, &uma_cachezones, uz_link) {
3644 uma_zone_sumstat(z, &cachefree, &allocs, &frees, NULL);
3645 LIST_FOREACH(bucket, &z->uz_buckets, ub_link)
3646 cachefree += bucket->ub_cnt;
3647 db_printf("%18s %8ju %8jd %8d %12ju %8u\n",
3648 z->uz_name, (uintmax_t)z->uz_size,
3649 (intmax_t)(allocs - frees), cachefree,
3650 (uintmax_t)allocs, z->uz_count);