uma_core.c revision 316835
1/*- 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 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice unmodified, this list of conditions, and the following 12 * 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. 16 * 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. 27 */ 28 29/* 30 * uma_core.c Implementation of the Universal Memory allocator 31 * 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. 38 * 39 * The basic ideas stem from similar slab/zone based allocators whose algorithms 40 * are well known. 41 * 42 */ 43 44/* 45 * TODO: 46 * - Improve memory usage for large allocations 47 * - Investigate cache size adjustments 48 */ 49 50#include <sys/cdefs.h> 51__FBSDID("$FreeBSD: stable/10/sys/vm/uma_core.c 316835 2017-04-14 14:11:59Z avg $"); 52 53/* I should really use ktr.. */ 54/* 55#define UMA_DEBUG 1 56#define UMA_DEBUG_ALLOC 1 57#define UMA_DEBUG_ALLOC_1 1 58*/ 59 60#include "opt_ddb.h" 61#include "opt_param.h" 62#include "opt_vm.h" 63 64#include <sys/param.h> 65#include <sys/systm.h> 66#include <sys/bitset.h> 67#include <sys/eventhandler.h> 68#include <sys/kernel.h> 69#include <sys/types.h> 70#include <sys/queue.h> 71#include <sys/malloc.h> 72#include <sys/ktr.h> 73#include <sys/lock.h> 74#include <sys/sysctl.h> 75#include <sys/mutex.h> 76#include <sys/proc.h> 77#include <sys/rwlock.h> 78#include <sys/sbuf.h> 79#include <sys/sched.h> 80#include <sys/smp.h> 81#include <sys/vmmeter.h> 82 83#include <vm/vm.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> 91#include <vm/uma.h> 92#include <vm/uma_int.h> 93#include <vm/uma_dbg.h> 94 95#include <ddb/ddb.h> 96 97#ifdef DEBUG_MEMGUARD 98#include <vm/memguard.h> 99#endif 100 101/* 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. 105 */ 106static struct uma_keg masterkeg; 107static struct uma_zone masterzone_k; 108static struct uma_zone masterzone_z; 109static uma_zone_t kegs = &masterzone_k; 110static uma_zone_t zones = &masterzone_z; 111 112/* This is the zone from which all of uma_slab_t's are allocated. */ 113static uma_zone_t slabzone; 114static uma_zone_t slabrefzone; /* With refcounters (for UMA_ZONE_REFCNT) */ 115 116/* 117 * The initial hash tables come out of this zone so they can be allocated 118 * prior to malloc coming up. 119 */ 120static uma_zone_t hashzone; 121 122/* The boot-time adjusted value for cache line alignment. */ 123int uma_align_cache = 64 - 1; 124 125static MALLOC_DEFINE(M_UMAHASH, "UMAHash", "UMA Hash Buckets"); 126 127/* 128 * Are we allowed to allocate buckets? 129 */ 130static int bucketdisable = 1; 131 132/* Linked list of all kegs in the system */ 133static LIST_HEAD(,uma_keg) uma_kegs = LIST_HEAD_INITIALIZER(uma_kegs); 134 135/* Linked list of all cache-only zones in the system */ 136static LIST_HEAD(,uma_zone) uma_cachezones = 137 LIST_HEAD_INITIALIZER(uma_cachezones); 138 139/* This RW lock protects the keg list */ 140static struct rwlock_padalign uma_rwlock; 141 142/* Linked list of boot time pages */ 143static LIST_HEAD(,uma_slab) uma_boot_pages = 144 LIST_HEAD_INITIALIZER(uma_boot_pages); 145 146/* This mutex protects the boot time pages list */ 147static struct mtx_padalign uma_boot_pages_mtx; 148 149static struct sx uma_drain_lock; 150 151/* Is the VM done starting up? */ 152static int booted = 0; 153#define UMA_STARTUP 1 154#define UMA_STARTUP2 2 155 156/* 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. 159 */ 160static const u_int uma_max_ipers_ref = PAGE_SIZE / MCLBYTES; 161 162/* 163 * This is the handle used to schedule events that need to happen 164 * outside of the allocation fast path. 165 */ 166static struct callout uma_callout; 167#define UMA_TIMEOUT 20 /* Seconds for callout interval. */ 168 169/* 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. 172 */ 173struct uma_zctor_args { 174 const char *name; 175 size_t size; 176 uma_ctor ctor; 177 uma_dtor dtor; 178 uma_init uminit; 179 uma_fini fini; 180 uma_import import; 181 uma_release release; 182 void *arg; 183 uma_keg_t keg; 184 int align; 185 uint32_t flags; 186}; 187 188struct uma_kctor_args { 189 uma_zone_t zone; 190 size_t size; 191 uma_init uminit; 192 uma_fini fini; 193 int align; 194 uint32_t flags; 195}; 196 197struct uma_bucket_zone { 198 uma_zone_t ubz_zone; 199 char *ubz_name; 200 int ubz_entries; /* Number of items it can hold. */ 201 int ubz_maxsize; /* Maximum allocation size per-item. */ 202}; 203 204/* 205 * Compute the actual number of bucket entries to pack them in power 206 * of two sizes for more efficient space utilization. 207 */ 208#define BUCKET_SIZE(n) \ 209 (((sizeof(void *) * (n)) - sizeof(struct uma_bucket)) / sizeof(void *)) 210 211#define BUCKET_MAX BUCKET_SIZE(256) 212 213struct 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 }, 223 { NULL, NULL, 0} 224}; 225 226/* 227 * Flags and enumerations to be passed to internal functions. 228 */ 229enum zfreeskip { SKIP_NONE = 0, SKIP_DTOR, SKIP_FINI }; 230 231/* Prototypes.. */ 232 233static void *noobj_alloc(uma_zone_t, vm_size_t, uint8_t *, int); 234static void *page_alloc(uma_zone_t, vm_size_t, uint8_t *, int); 235static void *startup_alloc(uma_zone_t, vm_size_t, uint8_t *, int); 236static void page_free(void *, vm_size_t, uint8_t); 237static uma_slab_t keg_alloc_slab(uma_keg_t, uma_zone_t, int); 238static void cache_drain(uma_zone_t); 239static void bucket_drain(uma_zone_t, uma_bucket_t); 240static void bucket_cache_drain(uma_zone_t zone); 241static int keg_ctor(void *, int, void *, int); 242static void keg_dtor(void *, int, void *); 243static int zone_ctor(void *, int, void *, int); 244static void zone_dtor(void *, int, void *); 245static int zero_init(void *, int, int); 246static void keg_small_init(uma_keg_t keg); 247static void keg_large_init(uma_keg_t keg); 248static void zone_foreach(void (*zfunc)(uma_zone_t)); 249static void zone_timeout(uma_zone_t zone); 250static int hash_alloc(struct uma_hash *); 251static int hash_expand(struct uma_hash *, struct uma_hash *); 252static void hash_free(struct uma_hash *hash); 253static void uma_timeout(void *); 254static void uma_startup3(void); 255static void *zone_alloc_item(uma_zone_t, void *, int); 256static void zone_free_item(uma_zone_t, void *, void *, enum zfreeskip); 257static void bucket_enable(void); 258static void bucket_init(void); 259static uma_bucket_t bucket_alloc(uma_zone_t zone, void *, int); 260static void bucket_free(uma_zone_t zone, uma_bucket_t, void *); 261static void bucket_zone_drain(void); 262static uma_bucket_t zone_alloc_bucket(uma_zone_t zone, void *, int flags); 263static uma_slab_t zone_fetch_slab(uma_zone_t zone, uma_keg_t last, int flags); 264static uma_slab_t zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int flags); 265static void *slab_alloc_item(uma_keg_t keg, uma_slab_t slab); 266static void slab_free_item(uma_keg_t keg, uma_slab_t slab, void *item); 267static uma_keg_t uma_kcreate(uma_zone_t zone, size_t size, uma_init uminit, 268 uma_fini fini, int align, uint32_t flags); 269static int zone_import(uma_zone_t zone, void **bucket, int max, int flags); 270static void zone_release(uma_zone_t zone, void **bucket, int cnt); 271static void uma_zero_item(void *item, uma_zone_t zone); 272 273void uma_print_zone(uma_zone_t); 274void uma_print_stats(void); 275static int sysctl_vm_zone_count(SYSCTL_HANDLER_ARGS); 276static int sysctl_vm_zone_stats(SYSCTL_HANDLER_ARGS); 277 278SYSINIT(uma_startup3, SI_SUB_VM_CONF, SI_ORDER_SECOND, uma_startup3, NULL); 279 280SYSCTL_PROC(_vm, OID_AUTO, zone_count, CTLFLAG_RD|CTLTYPE_INT, 281 0, 0, sysctl_vm_zone_count, "I", "Number of UMA zones"); 282 283SYSCTL_PROC(_vm, OID_AUTO, zone_stats, CTLFLAG_RD|CTLTYPE_STRUCT, 284 0, 0, sysctl_vm_zone_stats, "s,struct uma_type_header", "Zone Stats"); 285 286static int zone_warnings = 1; 287TUNABLE_INT("vm.zone_warnings", &zone_warnings); 288SYSCTL_INT(_vm, OID_AUTO, zone_warnings, CTLFLAG_RW, &zone_warnings, 0, 289 "Warn when UMA zones becomes full"); 290 291/* 292 * This routine checks to see whether or not it's safe to enable buckets. 293 */ 294static void 295bucket_enable(void) 296{ 297 bucketdisable = vm_page_count_min(); 298} 299 300/* 301 * Initialize bucket_zones, the array of zones of buckets of various sizes. 302 * 303 * For each zone, calculate the memory required for each bucket, consisting 304 * of the header and an array of pointers. 305 */ 306static void 307bucket_init(void) 308{ 309 struct uma_bucket_zone *ubz; 310 int size; 311 int i; 312 313 for (i = 0, ubz = &bucket_zones[0]; ubz->ubz_entries != 0; ubz++) { 314 size = roundup(sizeof(struct uma_bucket), sizeof(void *)); 315 size += sizeof(void *) * ubz->ubz_entries; 316 ubz->ubz_zone = uma_zcreate(ubz->ubz_name, size, 317 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 318 UMA_ZONE_MTXCLASS | UMA_ZFLAG_BUCKET); 319 } 320} 321 322/* 323 * Given a desired number of entries for a bucket, return the zone from which 324 * to allocate the bucket. 325 */ 326static struct uma_bucket_zone * 327bucket_zone_lookup(int entries) 328{ 329 struct uma_bucket_zone *ubz; 330 331 for (ubz = &bucket_zones[0]; ubz->ubz_entries != 0; ubz++) 332 if (ubz->ubz_entries >= entries) 333 return (ubz); 334 ubz--; 335 return (ubz); 336} 337 338static int 339bucket_select(int size) 340{ 341 struct uma_bucket_zone *ubz; 342 343 ubz = &bucket_zones[0]; 344 if (size > ubz->ubz_maxsize) 345 return MAX((ubz->ubz_maxsize * ubz->ubz_entries) / size, 1); 346 347 for (; ubz->ubz_entries != 0; ubz++) 348 if (ubz->ubz_maxsize < size) 349 break; 350 ubz--; 351 return (ubz->ubz_entries); 352} 353 354static uma_bucket_t 355bucket_alloc(uma_zone_t zone, void *udata, int flags) 356{ 357 struct uma_bucket_zone *ubz; 358 uma_bucket_t bucket; 359 360 /* 361 * This is to stop us from allocating per cpu buckets while we're 362 * running out of vm.boot_pages. Otherwise, we would exhaust the 363 * boot pages. This also prevents us from allocating buckets in 364 * low memory situations. 365 */ 366 if (bucketdisable) 367 return (NULL); 368 /* 369 * To limit bucket recursion we store the original zone flags 370 * in a cookie passed via zalloc_arg/zfree_arg. This allows the 371 * NOVM flag to persist even through deep recursions. We also 372 * store ZFLAG_BUCKET once we have recursed attempting to allocate 373 * a bucket for a bucket zone so we do not allow infinite bucket 374 * recursion. This cookie will even persist to frees of unused 375 * buckets via the allocation path or bucket allocations in the 376 * free path. 377 */ 378 if ((zone->uz_flags & UMA_ZFLAG_BUCKET) == 0) 379 udata = (void *)(uintptr_t)zone->uz_flags; 380 else { 381 if ((uintptr_t)udata & UMA_ZFLAG_BUCKET) 382 return (NULL); 383 udata = (void *)((uintptr_t)udata | UMA_ZFLAG_BUCKET); 384 } 385 if ((uintptr_t)udata & UMA_ZFLAG_CACHEONLY) 386 flags |= M_NOVM; 387 ubz = bucket_zone_lookup(zone->uz_count); 388 if (ubz->ubz_zone == zone && (ubz + 1)->ubz_entries != 0) 389 ubz++; 390 bucket = uma_zalloc_arg(ubz->ubz_zone, udata, flags); 391 if (bucket) { 392#ifdef INVARIANTS 393 bzero(bucket->ub_bucket, sizeof(void *) * ubz->ubz_entries); 394#endif 395 bucket->ub_cnt = 0; 396 bucket->ub_entries = ubz->ubz_entries; 397 } 398 399 return (bucket); 400} 401 402static void 403bucket_free(uma_zone_t zone, uma_bucket_t bucket, void *udata) 404{ 405 struct uma_bucket_zone *ubz; 406 407 KASSERT(bucket->ub_cnt == 0, 408 ("bucket_free: Freeing a non free bucket.")); 409 if ((zone->uz_flags & UMA_ZFLAG_BUCKET) == 0) 410 udata = (void *)(uintptr_t)zone->uz_flags; 411 ubz = bucket_zone_lookup(bucket->ub_entries); 412 uma_zfree_arg(ubz->ubz_zone, bucket, udata); 413} 414 415static void 416bucket_zone_drain(void) 417{ 418 struct uma_bucket_zone *ubz; 419 420 for (ubz = &bucket_zones[0]; ubz->ubz_entries != 0; ubz++) 421 zone_drain(ubz->ubz_zone); 422} 423 424static void 425zone_log_warning(uma_zone_t zone) 426{ 427 static const struct timeval warninterval = { 300, 0 }; 428 429 if (!zone_warnings || zone->uz_warning == NULL) 430 return; 431 432 if (ratecheck(&zone->uz_ratecheck, &warninterval)) 433 printf("[zone: %s] %s\n", zone->uz_name, zone->uz_warning); 434} 435 436static void 437zone_foreach_keg(uma_zone_t zone, void (*kegfn)(uma_keg_t)) 438{ 439 uma_klink_t klink; 440 441 LIST_FOREACH(klink, &zone->uz_kegs, kl_link) 442 kegfn(klink->kl_keg); 443} 444 445/* 446 * Routine called by timeout which is used to fire off some time interval 447 * based calculations. (stats, hash size, etc.) 448 * 449 * Arguments: 450 * arg Unused 451 * 452 * Returns: 453 * Nothing 454 */ 455static void 456uma_timeout(void *unused) 457{ 458 bucket_enable(); 459 zone_foreach(zone_timeout); 460 461 /* Reschedule this event */ 462 callout_reset(&uma_callout, UMA_TIMEOUT * hz, uma_timeout, NULL); 463} 464 465/* 466 * Routine to perform timeout driven calculations. This expands the 467 * hashes and does per cpu statistics aggregation. 468 * 469 * Returns nothing. 470 */ 471static void 472keg_timeout(uma_keg_t keg) 473{ 474 475 KEG_LOCK(keg); 476 /* 477 * Expand the keg hash table. 478 * 479 * This is done if the number of slabs is larger than the hash size. 480 * What I'm trying to do here is completely reduce collisions. This 481 * may be a little aggressive. Should I allow for two collisions max? 482 */ 483 if (keg->uk_flags & UMA_ZONE_HASH && 484 keg->uk_pages / keg->uk_ppera >= keg->uk_hash.uh_hashsize) { 485 struct uma_hash newhash; 486 struct uma_hash oldhash; 487 int ret; 488 489 /* 490 * This is so involved because allocating and freeing 491 * while the keg lock is held will lead to deadlock. 492 * I have to do everything in stages and check for 493 * races. 494 */ 495 newhash = keg->uk_hash; 496 KEG_UNLOCK(keg); 497 ret = hash_alloc(&newhash); 498 KEG_LOCK(keg); 499 if (ret) { 500 if (hash_expand(&keg->uk_hash, &newhash)) { 501 oldhash = keg->uk_hash; 502 keg->uk_hash = newhash; 503 } else 504 oldhash = newhash; 505 506 KEG_UNLOCK(keg); 507 hash_free(&oldhash); 508 return; 509 } 510 } 511 KEG_UNLOCK(keg); 512} 513 514static void 515zone_timeout(uma_zone_t zone) 516{ 517 518 zone_foreach_keg(zone, &keg_timeout); 519} 520 521/* 522 * Allocate and zero fill the next sized hash table from the appropriate 523 * backing store. 524 * 525 * Arguments: 526 * hash A new hash structure with the old hash size in uh_hashsize 527 * 528 * Returns: 529 * 1 on sucess and 0 on failure. 530 */ 531static int 532hash_alloc(struct uma_hash *hash) 533{ 534 int oldsize; 535 int alloc; 536 537 oldsize = hash->uh_hashsize; 538 539 /* We're just going to go to a power of two greater */ 540 if (oldsize) { 541 hash->uh_hashsize = oldsize * 2; 542 alloc = sizeof(hash->uh_slab_hash[0]) * hash->uh_hashsize; 543 hash->uh_slab_hash = (struct slabhead *)malloc(alloc, 544 M_UMAHASH, M_NOWAIT); 545 } else { 546 alloc = sizeof(hash->uh_slab_hash[0]) * UMA_HASH_SIZE_INIT; 547 hash->uh_slab_hash = zone_alloc_item(hashzone, NULL, 548 M_WAITOK); 549 hash->uh_hashsize = UMA_HASH_SIZE_INIT; 550 } 551 if (hash->uh_slab_hash) { 552 bzero(hash->uh_slab_hash, alloc); 553 hash->uh_hashmask = hash->uh_hashsize - 1; 554 return (1); 555 } 556 557 return (0); 558} 559 560/* 561 * Expands the hash table for HASH zones. This is done from zone_timeout 562 * to reduce collisions. This must not be done in the regular allocation 563 * path, otherwise, we can recurse on the vm while allocating pages. 564 * 565 * Arguments: 566 * oldhash The hash you want to expand 567 * newhash The hash structure for the new table 568 * 569 * Returns: 570 * Nothing 571 * 572 * Discussion: 573 */ 574static int 575hash_expand(struct uma_hash *oldhash, struct uma_hash *newhash) 576{ 577 uma_slab_t slab; 578 int hval; 579 int i; 580 581 if (!newhash->uh_slab_hash) 582 return (0); 583 584 if (oldhash->uh_hashsize >= newhash->uh_hashsize) 585 return (0); 586 587 /* 588 * I need to investigate hash algorithms for resizing without a 589 * full rehash. 590 */ 591 592 for (i = 0; i < oldhash->uh_hashsize; i++) 593 while (!SLIST_EMPTY(&oldhash->uh_slab_hash[i])) { 594 slab = SLIST_FIRST(&oldhash->uh_slab_hash[i]); 595 SLIST_REMOVE_HEAD(&oldhash->uh_slab_hash[i], us_hlink); 596 hval = UMA_HASH(newhash, slab->us_data); 597 SLIST_INSERT_HEAD(&newhash->uh_slab_hash[hval], 598 slab, us_hlink); 599 } 600 601 return (1); 602} 603 604/* 605 * Free the hash bucket to the appropriate backing store. 606 * 607 * Arguments: 608 * slab_hash The hash bucket we're freeing 609 * hashsize The number of entries in that hash bucket 610 * 611 * Returns: 612 * Nothing 613 */ 614static void 615hash_free(struct uma_hash *hash) 616{ 617 if (hash->uh_slab_hash == NULL) 618 return; 619 if (hash->uh_hashsize == UMA_HASH_SIZE_INIT) 620 zone_free_item(hashzone, hash->uh_slab_hash, NULL, SKIP_NONE); 621 else 622 free(hash->uh_slab_hash, M_UMAHASH); 623} 624 625/* 626 * Frees all outstanding items in a bucket 627 * 628 * Arguments: 629 * zone The zone to free to, must be unlocked. 630 * bucket The free/alloc bucket with items, cpu queue must be locked. 631 * 632 * Returns: 633 * Nothing 634 */ 635 636static void 637bucket_drain(uma_zone_t zone, uma_bucket_t bucket) 638{ 639 int i; 640 641 if (bucket == NULL) 642 return; 643 644 if (zone->uz_fini) 645 for (i = 0; i < bucket->ub_cnt; i++) 646 zone->uz_fini(bucket->ub_bucket[i], zone->uz_size); 647 zone->uz_release(zone->uz_arg, bucket->ub_bucket, bucket->ub_cnt); 648 bucket->ub_cnt = 0; 649} 650 651/* 652 * Drains the per cpu caches for a zone. 653 * 654 * NOTE: This may only be called while the zone is being turn down, and not 655 * during normal operation. This is necessary in order that we do not have 656 * to migrate CPUs to drain the per-CPU caches. 657 * 658 * Arguments: 659 * zone The zone to drain, must be unlocked. 660 * 661 * Returns: 662 * Nothing 663 */ 664static void 665cache_drain(uma_zone_t zone) 666{ 667 uma_cache_t cache; 668 int cpu; 669 670 /* 671 * XXX: It is safe to not lock the per-CPU caches, because we're 672 * tearing down the zone anyway. I.e., there will be no further use 673 * of the caches at this point. 674 * 675 * XXX: It would good to be able to assert that the zone is being 676 * torn down to prevent improper use of cache_drain(). 677 * 678 * XXX: We lock the zone before passing into bucket_cache_drain() as 679 * it is used elsewhere. Should the tear-down path be made special 680 * there in some form? 681 */ 682 CPU_FOREACH(cpu) { 683 cache = &zone->uz_cpu[cpu]; 684 bucket_drain(zone, cache->uc_allocbucket); 685 bucket_drain(zone, cache->uc_freebucket); 686 if (cache->uc_allocbucket != NULL) 687 bucket_free(zone, cache->uc_allocbucket, NULL); 688 if (cache->uc_freebucket != NULL) 689 bucket_free(zone, cache->uc_freebucket, NULL); 690 cache->uc_allocbucket = cache->uc_freebucket = NULL; 691 } 692 ZONE_LOCK(zone); 693 bucket_cache_drain(zone); 694 ZONE_UNLOCK(zone); 695} 696 697static void 698cache_shrink(uma_zone_t zone) 699{ 700 701 if (zone->uz_flags & UMA_ZFLAG_INTERNAL) 702 return; 703 704 ZONE_LOCK(zone); 705 zone->uz_count = (zone->uz_count_min + zone->uz_count) / 2; 706 ZONE_UNLOCK(zone); 707} 708 709static void 710cache_drain_safe_cpu(uma_zone_t zone) 711{ 712 uma_cache_t cache; 713 uma_bucket_t b1, b2; 714 715 if (zone->uz_flags & UMA_ZFLAG_INTERNAL) 716 return; 717 718 b1 = b2 = NULL; 719 ZONE_LOCK(zone); 720 critical_enter(); 721 cache = &zone->uz_cpu[curcpu]; 722 if (cache->uc_allocbucket) { 723 if (cache->uc_allocbucket->ub_cnt != 0) 724 LIST_INSERT_HEAD(&zone->uz_buckets, 725 cache->uc_allocbucket, ub_link); 726 else 727 b1 = cache->uc_allocbucket; 728 cache->uc_allocbucket = NULL; 729 } 730 if (cache->uc_freebucket) { 731 if (cache->uc_freebucket->ub_cnt != 0) 732 LIST_INSERT_HEAD(&zone->uz_buckets, 733 cache->uc_freebucket, ub_link); 734 else 735 b2 = cache->uc_freebucket; 736 cache->uc_freebucket = NULL; 737 } 738 critical_exit(); 739 ZONE_UNLOCK(zone); 740 if (b1) 741 bucket_free(zone, b1, NULL); 742 if (b2) 743 bucket_free(zone, b2, NULL); 744} 745 746/* 747 * Safely drain per-CPU caches of a zone(s) to alloc bucket. 748 * This is an expensive call because it needs to bind to all CPUs 749 * one by one and enter a critical section on each of them in order 750 * to safely access their cache buckets. 751 * Zone lock must not be held on call this function. 752 */ 753static void 754cache_drain_safe(uma_zone_t zone) 755{ 756 int cpu; 757 758 /* 759 * Polite bucket sizes shrinking was not enouth, shrink aggressively. 760 */ 761 if (zone) 762 cache_shrink(zone); 763 else 764 zone_foreach(cache_shrink); 765 766 CPU_FOREACH(cpu) { 767 thread_lock(curthread); 768 sched_bind(curthread, cpu); 769 thread_unlock(curthread); 770 771 if (zone) 772 cache_drain_safe_cpu(zone); 773 else 774 zone_foreach(cache_drain_safe_cpu); 775 } 776 thread_lock(curthread); 777 sched_unbind(curthread); 778 thread_unlock(curthread); 779} 780 781/* 782 * Drain the cached buckets from a zone. Expects a locked zone on entry. 783 */ 784static void 785bucket_cache_drain(uma_zone_t zone) 786{ 787 uma_bucket_t bucket; 788 789 /* 790 * Drain the bucket queues and free the buckets, we just keep two per 791 * cpu (alloc/free). 792 */ 793 while ((bucket = LIST_FIRST(&zone->uz_buckets)) != NULL) { 794 LIST_REMOVE(bucket, ub_link); 795 ZONE_UNLOCK(zone); 796 bucket_drain(zone, bucket); 797 bucket_free(zone, bucket, NULL); 798 ZONE_LOCK(zone); 799 } 800 801 /* 802 * Shrink further bucket sizes. Price of single zone lock collision 803 * is probably lower then price of global cache drain. 804 */ 805 if (zone->uz_count > zone->uz_count_min) 806 zone->uz_count--; 807} 808 809static void 810keg_free_slab(uma_keg_t keg, uma_slab_t slab, int start) 811{ 812 uint8_t *mem; 813 int i; 814 uint8_t flags; 815 816 mem = slab->us_data; 817 flags = slab->us_flags; 818 i = start; 819 if (keg->uk_fini != NULL) { 820 for (i--; i > -1; i--) 821 keg->uk_fini(slab->us_data + (keg->uk_rsize * i), 822 keg->uk_size); 823 } 824 if (keg->uk_flags & UMA_ZONE_OFFPAGE) 825 zone_free_item(keg->uk_slabzone, slab, NULL, SKIP_NONE); 826#ifdef UMA_DEBUG 827 printf("%s: Returning %d bytes.\n", keg->uk_name, 828 PAGE_SIZE * keg->uk_ppera); 829#endif 830 keg->uk_freef(mem, PAGE_SIZE * keg->uk_ppera, flags); 831} 832 833/* 834 * Frees pages from a keg back to the system. This is done on demand from 835 * the pageout daemon. 836 * 837 * Returns nothing. 838 */ 839static void 840keg_drain(uma_keg_t keg) 841{ 842 struct slabhead freeslabs = { 0 }; 843 uma_slab_t slab; 844 uma_slab_t n; 845 846 /* 847 * We don't want to take pages from statically allocated kegs at this 848 * time 849 */ 850 if (keg->uk_flags & UMA_ZONE_NOFREE || keg->uk_freef == NULL) 851 return; 852 853#ifdef UMA_DEBUG 854 printf("%s free items: %u\n", keg->uk_name, keg->uk_free); 855#endif 856 KEG_LOCK(keg); 857 if (keg->uk_free == 0) 858 goto finished; 859 860 slab = LIST_FIRST(&keg->uk_free_slab); 861 while (slab) { 862 n = LIST_NEXT(slab, us_link); 863 864 /* We have no where to free these to */ 865 if (slab->us_flags & UMA_SLAB_BOOT) { 866 slab = n; 867 continue; 868 } 869 870 LIST_REMOVE(slab, us_link); 871 keg->uk_pages -= keg->uk_ppera; 872 keg->uk_free -= keg->uk_ipers; 873 874 if (keg->uk_flags & UMA_ZONE_HASH) 875 UMA_HASH_REMOVE(&keg->uk_hash, slab, slab->us_data); 876 877 SLIST_INSERT_HEAD(&freeslabs, slab, us_hlink); 878 879 slab = n; 880 } 881finished: 882 KEG_UNLOCK(keg); 883 884 while ((slab = SLIST_FIRST(&freeslabs)) != NULL) { 885 SLIST_REMOVE(&freeslabs, slab, uma_slab, us_hlink); 886 keg_free_slab(keg, slab, keg->uk_ipers); 887 } 888} 889 890static void 891zone_drain_wait(uma_zone_t zone, int waitok) 892{ 893 894 /* 895 * Set draining to interlock with zone_dtor() so we can release our 896 * locks as we go. Only dtor() should do a WAITOK call since it 897 * is the only call that knows the structure will still be available 898 * when it wakes up. 899 */ 900 ZONE_LOCK(zone); 901 while (zone->uz_flags & UMA_ZFLAG_DRAINING) { 902 if (waitok == M_NOWAIT) 903 goto out; 904 msleep(zone, zone->uz_lockptr, PVM, "zonedrain", 1); 905 } 906 zone->uz_flags |= UMA_ZFLAG_DRAINING; 907 bucket_cache_drain(zone); 908 ZONE_UNLOCK(zone); 909 /* 910 * The DRAINING flag protects us from being freed while 911 * we're running. Normally the uma_rwlock would protect us but we 912 * must be able to release and acquire the right lock for each keg. 913 */ 914 zone_foreach_keg(zone, &keg_drain); 915 ZONE_LOCK(zone); 916 zone->uz_flags &= ~UMA_ZFLAG_DRAINING; 917 wakeup(zone); 918out: 919 ZONE_UNLOCK(zone); 920} 921 922void 923zone_drain(uma_zone_t zone) 924{ 925 926 zone_drain_wait(zone, M_NOWAIT); 927} 928 929/* 930 * Allocate a new slab for a keg. This does not insert the slab onto a list. 931 * 932 * Arguments: 933 * wait Shall we wait? 934 * 935 * Returns: 936 * The slab that was allocated or NULL if there is no memory and the 937 * caller specified M_NOWAIT. 938 */ 939static uma_slab_t 940keg_alloc_slab(uma_keg_t keg, uma_zone_t zone, int wait) 941{ 942 uma_slabrefcnt_t slabref; 943 uma_alloc allocf; 944 uma_slab_t slab; 945 uint8_t *mem; 946 uint8_t flags; 947 int i; 948 949 mtx_assert(&keg->uk_lock, MA_OWNED); 950 slab = NULL; 951 mem = NULL; 952 953#ifdef UMA_DEBUG 954 printf("alloc_slab: Allocating a new slab for %s\n", keg->uk_name); 955#endif 956 allocf = keg->uk_allocf; 957 KEG_UNLOCK(keg); 958 959 if (keg->uk_flags & UMA_ZONE_OFFPAGE) { 960 slab = zone_alloc_item(keg->uk_slabzone, NULL, wait); 961 if (slab == NULL) 962 goto out; 963 } 964 965 /* 966 * This reproduces the old vm_zone behavior of zero filling pages the 967 * first time they are added to a zone. 968 * 969 * Malloced items are zeroed in uma_zalloc. 970 */ 971 972 if ((keg->uk_flags & UMA_ZONE_MALLOC) == 0) 973 wait |= M_ZERO; 974 else 975 wait &= ~M_ZERO; 976 977 if (keg->uk_flags & UMA_ZONE_NODUMP) 978 wait |= M_NODUMP; 979 980 /* zone is passed for legacy reasons. */ 981 mem = allocf(zone, keg->uk_ppera * PAGE_SIZE, &flags, wait); 982 if (mem == NULL) { 983 if (keg->uk_flags & UMA_ZONE_OFFPAGE) 984 zone_free_item(keg->uk_slabzone, slab, NULL, SKIP_NONE); 985 slab = NULL; 986 goto out; 987 } 988 989 /* Point the slab into the allocated memory */ 990 if (!(keg->uk_flags & UMA_ZONE_OFFPAGE)) 991 slab = (uma_slab_t )(mem + keg->uk_pgoff); 992 993 if (keg->uk_flags & UMA_ZONE_VTOSLAB) 994 for (i = 0; i < keg->uk_ppera; i++) 995 vsetslab((vm_offset_t)mem + (i * PAGE_SIZE), slab); 996 997 slab->us_keg = keg; 998 slab->us_data = mem; 999 slab->us_freecount = keg->uk_ipers; 1000 slab->us_flags = flags; 1001 BIT_FILL(SLAB_SETSIZE, &slab->us_free); 1002#ifdef INVARIANTS 1003 BIT_ZERO(SLAB_SETSIZE, &slab->us_debugfree); 1004#endif 1005 if (keg->uk_flags & UMA_ZONE_REFCNT) { 1006 slabref = (uma_slabrefcnt_t)slab; 1007 for (i = 0; i < keg->uk_ipers; i++) 1008 slabref->us_refcnt[i] = 0; 1009 } 1010 1011 if (keg->uk_init != NULL) { 1012 for (i = 0; i < keg->uk_ipers; i++) 1013 if (keg->uk_init(slab->us_data + (keg->uk_rsize * i), 1014 keg->uk_size, wait) != 0) 1015 break; 1016 if (i != keg->uk_ipers) { 1017 keg_free_slab(keg, slab, i); 1018 slab = NULL; 1019 goto out; 1020 } 1021 } 1022out: 1023 KEG_LOCK(keg); 1024 1025 if (slab != NULL) { 1026 if (keg->uk_flags & UMA_ZONE_HASH) 1027 UMA_HASH_INSERT(&keg->uk_hash, slab, mem); 1028 1029 keg->uk_pages += keg->uk_ppera; 1030 keg->uk_free += keg->uk_ipers; 1031 } 1032 1033 return (slab); 1034} 1035 1036/* 1037 * This function is intended to be used early on in place of page_alloc() so 1038 * that we may use the boot time page cache to satisfy allocations before 1039 * the VM is ready. 1040 */ 1041static void * 1042startup_alloc(uma_zone_t zone, vm_size_t bytes, uint8_t *pflag, int wait) 1043{ 1044 uma_keg_t keg; 1045 uma_slab_t tmps; 1046 int pages, check_pages; 1047 1048 keg = zone_first_keg(zone); 1049 pages = howmany(bytes, PAGE_SIZE); 1050 check_pages = pages - 1; 1051 KASSERT(pages > 0, ("startup_alloc can't reserve 0 pages\n")); 1052 1053 /* 1054 * Check our small startup cache to see if it has pages remaining. 1055 */ 1056 mtx_lock(&uma_boot_pages_mtx); 1057 1058 /* First check if we have enough room. */ 1059 tmps = LIST_FIRST(&uma_boot_pages); 1060 while (tmps != NULL && check_pages-- > 0) 1061 tmps = LIST_NEXT(tmps, us_link); 1062 if (tmps != NULL) { 1063 /* 1064 * It's ok to lose tmps references. The last one will 1065 * have tmps->us_data pointing to the start address of 1066 * "pages" contiguous pages of memory. 1067 */ 1068 while (pages-- > 0) { 1069 tmps = LIST_FIRST(&uma_boot_pages); 1070 LIST_REMOVE(tmps, us_link); 1071 } 1072 mtx_unlock(&uma_boot_pages_mtx); 1073 *pflag = tmps->us_flags; 1074 return (tmps->us_data); 1075 } 1076 mtx_unlock(&uma_boot_pages_mtx); 1077 if (booted < UMA_STARTUP2) 1078 panic("UMA: Increase vm.boot_pages"); 1079 /* 1080 * Now that we've booted reset these users to their real allocator. 1081 */ 1082#ifdef UMA_MD_SMALL_ALLOC 1083 keg->uk_allocf = (keg->uk_ppera > 1) ? page_alloc : uma_small_alloc; 1084#else 1085 keg->uk_allocf = page_alloc; 1086#endif 1087 return keg->uk_allocf(zone, bytes, pflag, wait); 1088} 1089 1090/* 1091 * Allocates a number of pages from the system 1092 * 1093 * Arguments: 1094 * bytes The number of bytes requested 1095 * wait Shall we wait? 1096 * 1097 * Returns: 1098 * A pointer to the alloced memory or possibly 1099 * NULL if M_NOWAIT is set. 1100 */ 1101static void * 1102page_alloc(uma_zone_t zone, vm_size_t bytes, uint8_t *pflag, int wait) 1103{ 1104 void *p; /* Returned page */ 1105 1106 *pflag = UMA_SLAB_KMEM; 1107 p = (void *) kmem_malloc(kmem_arena, bytes, wait); 1108 1109 return (p); 1110} 1111 1112/* 1113 * Allocates a number of pages from within an object 1114 * 1115 * Arguments: 1116 * bytes The number of bytes requested 1117 * wait Shall we wait? 1118 * 1119 * Returns: 1120 * A pointer to the alloced memory or possibly 1121 * NULL if M_NOWAIT is set. 1122 */ 1123static void * 1124noobj_alloc(uma_zone_t zone, vm_size_t bytes, uint8_t *flags, int wait) 1125{ 1126 TAILQ_HEAD(, vm_page) alloctail; 1127 u_long npages; 1128 vm_offset_t retkva, zkva; 1129 vm_page_t p, p_next; 1130 uma_keg_t keg; 1131 1132 TAILQ_INIT(&alloctail); 1133 keg = zone_first_keg(zone); 1134 1135 npages = howmany(bytes, PAGE_SIZE); 1136 while (npages > 0) { 1137 p = vm_page_alloc(NULL, 0, VM_ALLOC_INTERRUPT | 1138 VM_ALLOC_WIRED | VM_ALLOC_NOOBJ); 1139 if (p != NULL) { 1140 /* 1141 * Since the page does not belong to an object, its 1142 * listq is unused. 1143 */ 1144 TAILQ_INSERT_TAIL(&alloctail, p, listq); 1145 npages--; 1146 continue; 1147 } 1148 if (wait & M_WAITOK) { 1149 VM_WAIT; 1150 continue; 1151 } 1152 1153 /* 1154 * Page allocation failed, free intermediate pages and 1155 * exit. 1156 */ 1157 TAILQ_FOREACH_SAFE(p, &alloctail, listq, p_next) { 1158 vm_page_unwire(p, 0); 1159 vm_page_free(p); 1160 } 1161 return (NULL); 1162 } 1163 *flags = UMA_SLAB_PRIV; 1164 zkva = keg->uk_kva + 1165 atomic_fetchadd_long(&keg->uk_offset, round_page(bytes)); 1166 retkva = zkva; 1167 TAILQ_FOREACH(p, &alloctail, listq) { 1168 pmap_qenter(zkva, &p, 1); 1169 zkva += PAGE_SIZE; 1170 } 1171 1172 return ((void *)retkva); 1173} 1174 1175/* 1176 * Frees a number of pages to the system 1177 * 1178 * Arguments: 1179 * mem A pointer to the memory to be freed 1180 * size The size of the memory being freed 1181 * flags The original p->us_flags field 1182 * 1183 * Returns: 1184 * Nothing 1185 */ 1186static void 1187page_free(void *mem, vm_size_t size, uint8_t flags) 1188{ 1189 struct vmem *vmem; 1190 1191 if (flags & UMA_SLAB_KMEM) 1192 vmem = kmem_arena; 1193 else if (flags & UMA_SLAB_KERNEL) 1194 vmem = kernel_arena; 1195 else 1196 panic("UMA: page_free used with invalid flags %d", flags); 1197 1198 kmem_free(vmem, (vm_offset_t)mem, size); 1199} 1200 1201/* 1202 * Zero fill initializer 1203 * 1204 * Arguments/Returns follow uma_init specifications 1205 */ 1206static int 1207zero_init(void *mem, int size, int flags) 1208{ 1209 bzero(mem, size); 1210 return (0); 1211} 1212 1213/* 1214 * Finish creating a small uma keg. This calculates ipers, and the keg size. 1215 * 1216 * Arguments 1217 * keg The zone we should initialize 1218 * 1219 * Returns 1220 * Nothing 1221 */ 1222static void 1223keg_small_init(uma_keg_t keg) 1224{ 1225 u_int rsize; 1226 u_int memused; 1227 u_int wastedspace; 1228 u_int shsize; 1229 u_int slabsize; 1230 1231 if (keg->uk_flags & UMA_ZONE_PCPU) { 1232 u_int ncpus = mp_ncpus ? mp_ncpus : MAXCPU; 1233 1234 slabsize = sizeof(struct pcpu); 1235 keg->uk_ppera = howmany(ncpus * sizeof(struct pcpu), 1236 PAGE_SIZE); 1237 } else { 1238 slabsize = UMA_SLAB_SIZE; 1239 keg->uk_ppera = 1; 1240 } 1241 1242 /* 1243 * Calculate the size of each allocation (rsize) according to 1244 * alignment. If the requested size is smaller than we have 1245 * allocation bits for we round it up. 1246 */ 1247 rsize = keg->uk_size; 1248 if (rsize < slabsize / SLAB_SETSIZE) 1249 rsize = slabsize / SLAB_SETSIZE; 1250 if (rsize & keg->uk_align) 1251 rsize = (rsize & ~keg->uk_align) + (keg->uk_align + 1); 1252 keg->uk_rsize = rsize; 1253 1254 KASSERT((keg->uk_flags & UMA_ZONE_PCPU) == 0 || 1255 keg->uk_rsize < sizeof(struct pcpu), 1256 ("%s: size %u too large", __func__, keg->uk_rsize)); 1257 1258 if (keg->uk_flags & UMA_ZONE_REFCNT) 1259 rsize += sizeof(uint32_t); 1260 1261 if (keg->uk_flags & UMA_ZONE_OFFPAGE) 1262 shsize = 0; 1263 else 1264 shsize = sizeof(struct uma_slab); 1265 1266 keg->uk_ipers = (slabsize - shsize) / rsize; 1267 KASSERT(keg->uk_ipers > 0 && keg->uk_ipers <= SLAB_SETSIZE, 1268 ("%s: keg->uk_ipers %u", __func__, keg->uk_ipers)); 1269 1270 memused = keg->uk_ipers * rsize + shsize; 1271 wastedspace = slabsize - memused; 1272 1273 /* 1274 * We can't do OFFPAGE if we're internal or if we've been 1275 * asked to not go to the VM for buckets. If we do this we 1276 * may end up going to the VM for slabs which we do not 1277 * want to do if we're UMA_ZFLAG_CACHEONLY as a result 1278 * of UMA_ZONE_VM, which clearly forbids it. 1279 */ 1280 if ((keg->uk_flags & UMA_ZFLAG_INTERNAL) || 1281 (keg->uk_flags & UMA_ZFLAG_CACHEONLY)) 1282 return; 1283 1284 /* 1285 * See if using an OFFPAGE slab will limit our waste. Only do 1286 * this if it permits more items per-slab. 1287 * 1288 * XXX We could try growing slabsize to limit max waste as well. 1289 * Historically this was not done because the VM could not 1290 * efficiently handle contiguous allocations. 1291 */ 1292 if ((wastedspace >= slabsize / UMA_MAX_WASTE) && 1293 (keg->uk_ipers < (slabsize / keg->uk_rsize))) { 1294 keg->uk_ipers = slabsize / keg->uk_rsize; 1295 KASSERT(keg->uk_ipers > 0 && keg->uk_ipers <= SLAB_SETSIZE, 1296 ("%s: keg->uk_ipers %u", __func__, keg->uk_ipers)); 1297#ifdef UMA_DEBUG 1298 printf("UMA decided we need offpage slab headers for " 1299 "keg: %s, calculated wastedspace = %d, " 1300 "maximum wasted space allowed = %d, " 1301 "calculated ipers = %d, " 1302 "new wasted space = %d\n", keg->uk_name, wastedspace, 1303 slabsize / UMA_MAX_WASTE, keg->uk_ipers, 1304 slabsize - keg->uk_ipers * keg->uk_rsize); 1305#endif 1306 keg->uk_flags |= UMA_ZONE_OFFPAGE; 1307 } 1308 1309 if ((keg->uk_flags & UMA_ZONE_OFFPAGE) && 1310 (keg->uk_flags & UMA_ZONE_VTOSLAB) == 0) 1311 keg->uk_flags |= UMA_ZONE_HASH; 1312} 1313 1314/* 1315 * Finish creating a large (> UMA_SLAB_SIZE) uma kegs. Just give in and do 1316 * OFFPAGE for now. When I can allow for more dynamic slab sizes this will be 1317 * more complicated. 1318 * 1319 * Arguments 1320 * keg The keg we should initialize 1321 * 1322 * Returns 1323 * Nothing 1324 */ 1325static void 1326keg_large_init(uma_keg_t keg) 1327{ 1328 u_int shsize; 1329 1330 KASSERT(keg != NULL, ("Keg is null in keg_large_init")); 1331 KASSERT((keg->uk_flags & UMA_ZFLAG_CACHEONLY) == 0, 1332 ("keg_large_init: Cannot large-init a UMA_ZFLAG_CACHEONLY keg")); 1333 KASSERT((keg->uk_flags & UMA_ZONE_PCPU) == 0, 1334 ("%s: Cannot large-init a UMA_ZONE_PCPU keg", __func__)); 1335 1336 keg->uk_ppera = howmany(keg->uk_size, PAGE_SIZE); 1337 keg->uk_ipers = 1; 1338 keg->uk_rsize = keg->uk_size; 1339 1340 /* We can't do OFFPAGE if we're internal, bail out here. */ 1341 if (keg->uk_flags & UMA_ZFLAG_INTERNAL) 1342 return; 1343 1344 /* Check whether we have enough space to not do OFFPAGE. */ 1345 if ((keg->uk_flags & UMA_ZONE_OFFPAGE) == 0) { 1346 shsize = sizeof(struct uma_slab); 1347 if (keg->uk_flags & UMA_ZONE_REFCNT) 1348 shsize += keg->uk_ipers * sizeof(uint32_t); 1349 if (shsize & UMA_ALIGN_PTR) 1350 shsize = (shsize & ~UMA_ALIGN_PTR) + 1351 (UMA_ALIGN_PTR + 1); 1352 1353 if ((PAGE_SIZE * keg->uk_ppera) - keg->uk_rsize < shsize) 1354 keg->uk_flags |= UMA_ZONE_OFFPAGE; 1355 } 1356 1357 if ((keg->uk_flags & UMA_ZONE_OFFPAGE) && 1358 (keg->uk_flags & UMA_ZONE_VTOSLAB) == 0) 1359 keg->uk_flags |= UMA_ZONE_HASH; 1360} 1361 1362static void 1363keg_cachespread_init(uma_keg_t keg) 1364{ 1365 int alignsize; 1366 int trailer; 1367 int pages; 1368 int rsize; 1369 1370 KASSERT((keg->uk_flags & UMA_ZONE_PCPU) == 0, 1371 ("%s: Cannot cachespread-init a UMA_ZONE_PCPU keg", __func__)); 1372 1373 alignsize = keg->uk_align + 1; 1374 rsize = keg->uk_size; 1375 /* 1376 * We want one item to start on every align boundary in a page. To 1377 * do this we will span pages. We will also extend the item by the 1378 * size of align if it is an even multiple of align. Otherwise, it 1379 * would fall on the same boundary every time. 1380 */ 1381 if (rsize & keg->uk_align) 1382 rsize = (rsize & ~keg->uk_align) + alignsize; 1383 if ((rsize & alignsize) == 0) 1384 rsize += alignsize; 1385 trailer = rsize - keg->uk_size; 1386 pages = (rsize * (PAGE_SIZE / alignsize)) / PAGE_SIZE; 1387 pages = MIN(pages, (128 * 1024) / PAGE_SIZE); 1388 keg->uk_rsize = rsize; 1389 keg->uk_ppera = pages; 1390 keg->uk_ipers = ((pages * PAGE_SIZE) + trailer) / rsize; 1391 keg->uk_flags |= UMA_ZONE_OFFPAGE | UMA_ZONE_VTOSLAB; 1392 KASSERT(keg->uk_ipers <= SLAB_SETSIZE, 1393 ("%s: keg->uk_ipers too high(%d) increase max_ipers", __func__, 1394 keg->uk_ipers)); 1395} 1396 1397/* 1398 * Keg header ctor. This initializes all fields, locks, etc. And inserts 1399 * the keg onto the global keg list. 1400 * 1401 * Arguments/Returns follow uma_ctor specifications 1402 * udata Actually uma_kctor_args 1403 */ 1404static int 1405keg_ctor(void *mem, int size, void *udata, int flags) 1406{ 1407 struct uma_kctor_args *arg = udata; 1408 uma_keg_t keg = mem; 1409 uma_zone_t zone; 1410 1411 bzero(keg, size); 1412 keg->uk_size = arg->size; 1413 keg->uk_init = arg->uminit; 1414 keg->uk_fini = arg->fini; 1415 keg->uk_align = arg->align; 1416 keg->uk_free = 0; 1417 keg->uk_reserve = 0; 1418 keg->uk_pages = 0; 1419 keg->uk_flags = arg->flags; 1420 keg->uk_allocf = page_alloc; 1421 keg->uk_freef = page_free; 1422 keg->uk_slabzone = NULL; 1423 1424 /* 1425 * The master zone is passed to us at keg-creation time. 1426 */ 1427 zone = arg->zone; 1428 keg->uk_name = zone->uz_name; 1429 1430 if (arg->flags & UMA_ZONE_VM) 1431 keg->uk_flags |= UMA_ZFLAG_CACHEONLY; 1432 1433 if (arg->flags & UMA_ZONE_ZINIT) 1434 keg->uk_init = zero_init; 1435 1436 if (arg->flags & UMA_ZONE_REFCNT || arg->flags & UMA_ZONE_MALLOC) 1437 keg->uk_flags |= UMA_ZONE_VTOSLAB; 1438 1439 if (arg->flags & UMA_ZONE_PCPU) 1440#ifdef SMP 1441 keg->uk_flags |= UMA_ZONE_OFFPAGE; 1442#else 1443 keg->uk_flags &= ~UMA_ZONE_PCPU; 1444#endif 1445 1446 if (keg->uk_flags & UMA_ZONE_CACHESPREAD) { 1447 keg_cachespread_init(keg); 1448 } else if (keg->uk_flags & UMA_ZONE_REFCNT) { 1449 if (keg->uk_size > 1450 (UMA_SLAB_SIZE - sizeof(struct uma_slab_refcnt) - 1451 sizeof(uint32_t))) 1452 keg_large_init(keg); 1453 else 1454 keg_small_init(keg); 1455 } else { 1456 if (keg->uk_size > (UMA_SLAB_SIZE - sizeof(struct uma_slab))) 1457 keg_large_init(keg); 1458 else 1459 keg_small_init(keg); 1460 } 1461 1462 if (keg->uk_flags & UMA_ZONE_OFFPAGE) { 1463 if (keg->uk_flags & UMA_ZONE_REFCNT) { 1464 if (keg->uk_ipers > uma_max_ipers_ref) 1465 panic("Too many ref items per zone: %d > %d\n", 1466 keg->uk_ipers, uma_max_ipers_ref); 1467 keg->uk_slabzone = slabrefzone; 1468 } else 1469 keg->uk_slabzone = slabzone; 1470 } 1471 1472 /* 1473 * If we haven't booted yet we need allocations to go through the 1474 * startup cache until the vm is ready. 1475 */ 1476 if (keg->uk_ppera == 1) { 1477#ifdef UMA_MD_SMALL_ALLOC 1478 keg->uk_allocf = uma_small_alloc; 1479 keg->uk_freef = uma_small_free; 1480 1481 if (booted < UMA_STARTUP) 1482 keg->uk_allocf = startup_alloc; 1483#else 1484 if (booted < UMA_STARTUP2) 1485 keg->uk_allocf = startup_alloc; 1486#endif 1487 } else if (booted < UMA_STARTUP2 && 1488 (keg->uk_flags & UMA_ZFLAG_INTERNAL)) 1489 keg->uk_allocf = startup_alloc; 1490 1491 /* 1492 * Initialize keg's lock 1493 */ 1494 KEG_LOCK_INIT(keg, (arg->flags & UMA_ZONE_MTXCLASS)); 1495 1496 /* 1497 * If we're putting the slab header in the actual page we need to 1498 * figure out where in each page it goes. This calculates a right 1499 * justified offset into the memory on an ALIGN_PTR boundary. 1500 */ 1501 if (!(keg->uk_flags & UMA_ZONE_OFFPAGE)) { 1502 u_int totsize; 1503 1504 /* Size of the slab struct and free list */ 1505 totsize = sizeof(struct uma_slab); 1506 1507 /* Size of the reference counts. */ 1508 if (keg->uk_flags & UMA_ZONE_REFCNT) 1509 totsize += keg->uk_ipers * sizeof(uint32_t); 1510 1511 if (totsize & UMA_ALIGN_PTR) 1512 totsize = (totsize & ~UMA_ALIGN_PTR) + 1513 (UMA_ALIGN_PTR + 1); 1514 keg->uk_pgoff = (PAGE_SIZE * keg->uk_ppera) - totsize; 1515 1516 /* 1517 * The only way the following is possible is if with our 1518 * UMA_ALIGN_PTR adjustments we are now bigger than 1519 * UMA_SLAB_SIZE. I haven't checked whether this is 1520 * mathematically possible for all cases, so we make 1521 * sure here anyway. 1522 */ 1523 totsize = keg->uk_pgoff + sizeof(struct uma_slab); 1524 if (keg->uk_flags & UMA_ZONE_REFCNT) 1525 totsize += keg->uk_ipers * sizeof(uint32_t); 1526 if (totsize > PAGE_SIZE * keg->uk_ppera) { 1527 printf("zone %s ipers %d rsize %d size %d\n", 1528 zone->uz_name, keg->uk_ipers, keg->uk_rsize, 1529 keg->uk_size); 1530 panic("UMA slab won't fit."); 1531 } 1532 } 1533 1534 if (keg->uk_flags & UMA_ZONE_HASH) 1535 hash_alloc(&keg->uk_hash); 1536 1537#ifdef UMA_DEBUG 1538 printf("UMA: %s(%p) size %d(%d) flags %#x ipers %d ppera %d out %d free %d\n", 1539 zone->uz_name, zone, keg->uk_size, keg->uk_rsize, keg->uk_flags, 1540 keg->uk_ipers, keg->uk_ppera, 1541 (keg->uk_ipers * keg->uk_pages) - keg->uk_free, keg->uk_free); 1542#endif 1543 1544 LIST_INSERT_HEAD(&keg->uk_zones, zone, uz_link); 1545 1546 rw_wlock(&uma_rwlock); 1547 LIST_INSERT_HEAD(&uma_kegs, keg, uk_link); 1548 rw_wunlock(&uma_rwlock); 1549 return (0); 1550} 1551 1552/* 1553 * Zone header ctor. This initializes all fields, locks, etc. 1554 * 1555 * Arguments/Returns follow uma_ctor specifications 1556 * udata Actually uma_zctor_args 1557 */ 1558static int 1559zone_ctor(void *mem, int size, void *udata, int flags) 1560{ 1561 struct uma_zctor_args *arg = udata; 1562 uma_zone_t zone = mem; 1563 uma_zone_t z; 1564 uma_keg_t keg; 1565 1566 bzero(zone, size); 1567 zone->uz_name = arg->name; 1568 zone->uz_ctor = arg->ctor; 1569 zone->uz_dtor = arg->dtor; 1570 zone->uz_slab = zone_fetch_slab; 1571 zone->uz_init = NULL; 1572 zone->uz_fini = NULL; 1573 zone->uz_allocs = 0; 1574 zone->uz_frees = 0; 1575 zone->uz_fails = 0; 1576 zone->uz_sleeps = 0; 1577 zone->uz_count = 0; 1578 zone->uz_count_min = 0; 1579 zone->uz_flags = 0; 1580 zone->uz_warning = NULL; 1581 timevalclear(&zone->uz_ratecheck); 1582 keg = arg->keg; 1583 1584 ZONE_LOCK_INIT(zone, (arg->flags & UMA_ZONE_MTXCLASS)); 1585 1586 /* 1587 * This is a pure cache zone, no kegs. 1588 */ 1589 if (arg->import) { 1590 if (arg->flags & UMA_ZONE_VM) 1591 arg->flags |= UMA_ZFLAG_CACHEONLY; 1592 zone->uz_flags = arg->flags; 1593 zone->uz_size = arg->size; 1594 zone->uz_import = arg->import; 1595 zone->uz_release = arg->release; 1596 zone->uz_arg = arg->arg; 1597 zone->uz_lockptr = &zone->uz_lock; 1598 rw_wlock(&uma_rwlock); 1599 LIST_INSERT_HEAD(&uma_cachezones, zone, uz_link); 1600 rw_wunlock(&uma_rwlock); 1601 goto out; 1602 } 1603 1604 /* 1605 * Use the regular zone/keg/slab allocator. 1606 */ 1607 zone->uz_import = (uma_import)zone_import; 1608 zone->uz_release = (uma_release)zone_release; 1609 zone->uz_arg = zone; 1610 1611 if (arg->flags & UMA_ZONE_SECONDARY) { 1612 KASSERT(arg->keg != NULL, ("Secondary zone on zero'd keg")); 1613 zone->uz_init = arg->uminit; 1614 zone->uz_fini = arg->fini; 1615 zone->uz_lockptr = &keg->uk_lock; 1616 zone->uz_flags |= UMA_ZONE_SECONDARY; 1617 rw_wlock(&uma_rwlock); 1618 ZONE_LOCK(zone); 1619 LIST_FOREACH(z, &keg->uk_zones, uz_link) { 1620 if (LIST_NEXT(z, uz_link) == NULL) { 1621 LIST_INSERT_AFTER(z, zone, uz_link); 1622 break; 1623 } 1624 } 1625 ZONE_UNLOCK(zone); 1626 rw_wunlock(&uma_rwlock); 1627 } else if (keg == NULL) { 1628 if ((keg = uma_kcreate(zone, arg->size, arg->uminit, arg->fini, 1629 arg->align, arg->flags)) == NULL) 1630 return (ENOMEM); 1631 } else { 1632 struct uma_kctor_args karg; 1633 int error; 1634 1635 /* We should only be here from uma_startup() */ 1636 karg.size = arg->size; 1637 karg.uminit = arg->uminit; 1638 karg.fini = arg->fini; 1639 karg.align = arg->align; 1640 karg.flags = arg->flags; 1641 karg.zone = zone; 1642 error = keg_ctor(arg->keg, sizeof(struct uma_keg), &karg, 1643 flags); 1644 if (error) 1645 return (error); 1646 } 1647 1648 /* 1649 * Link in the first keg. 1650 */ 1651 zone->uz_klink.kl_keg = keg; 1652 LIST_INSERT_HEAD(&zone->uz_kegs, &zone->uz_klink, kl_link); 1653 zone->uz_lockptr = &keg->uk_lock; 1654 zone->uz_size = keg->uk_size; 1655 zone->uz_flags |= (keg->uk_flags & 1656 (UMA_ZONE_INHERIT | UMA_ZFLAG_INHERIT)); 1657 1658 /* 1659 * Some internal zones don't have room allocated for the per cpu 1660 * caches. If we're internal, bail out here. 1661 */ 1662 if (keg->uk_flags & UMA_ZFLAG_INTERNAL) { 1663 KASSERT((zone->uz_flags & UMA_ZONE_SECONDARY) == 0, 1664 ("Secondary zone requested UMA_ZFLAG_INTERNAL")); 1665 return (0); 1666 } 1667 1668out: 1669 if ((arg->flags & UMA_ZONE_MAXBUCKET) == 0) 1670 zone->uz_count = bucket_select(zone->uz_size); 1671 else 1672 zone->uz_count = BUCKET_MAX; 1673 zone->uz_count_min = zone->uz_count; 1674 1675 return (0); 1676} 1677 1678/* 1679 * Keg header dtor. This frees all data, destroys locks, frees the hash 1680 * table and removes the keg from the global list. 1681 * 1682 * Arguments/Returns follow uma_dtor specifications 1683 * udata unused 1684 */ 1685static void 1686keg_dtor(void *arg, int size, void *udata) 1687{ 1688 uma_keg_t keg; 1689 1690 keg = (uma_keg_t)arg; 1691 KEG_LOCK(keg); 1692 if (keg->uk_free != 0) { 1693 printf("Freed UMA keg (%s) was not empty (%d items). " 1694 " Lost %d pages of memory.\n", 1695 keg->uk_name ? keg->uk_name : "", 1696 keg->uk_free, keg->uk_pages); 1697 } 1698 KEG_UNLOCK(keg); 1699 1700 hash_free(&keg->uk_hash); 1701 1702 KEG_LOCK_FINI(keg); 1703} 1704 1705/* 1706 * Zone header dtor. 1707 * 1708 * Arguments/Returns follow uma_dtor specifications 1709 * udata unused 1710 */ 1711static void 1712zone_dtor(void *arg, int size, void *udata) 1713{ 1714 uma_klink_t klink; 1715 uma_zone_t zone; 1716 uma_keg_t keg; 1717 1718 zone = (uma_zone_t)arg; 1719 keg = zone_first_keg(zone); 1720 1721 if (!(zone->uz_flags & UMA_ZFLAG_INTERNAL)) 1722 cache_drain(zone); 1723 1724 rw_wlock(&uma_rwlock); 1725 LIST_REMOVE(zone, uz_link); 1726 rw_wunlock(&uma_rwlock); 1727 /* 1728 * XXX there are some races here where 1729 * the zone can be drained but zone lock 1730 * released and then refilled before we 1731 * remove it... we dont care for now 1732 */ 1733 zone_drain_wait(zone, M_WAITOK); 1734 /* 1735 * Unlink all of our kegs. 1736 */ 1737 while ((klink = LIST_FIRST(&zone->uz_kegs)) != NULL) { 1738 klink->kl_keg = NULL; 1739 LIST_REMOVE(klink, kl_link); 1740 if (klink == &zone->uz_klink) 1741 continue; 1742 free(klink, M_TEMP); 1743 } 1744 /* 1745 * We only destroy kegs from non secondary zones. 1746 */ 1747 if (keg != NULL && (zone->uz_flags & UMA_ZONE_SECONDARY) == 0) { 1748 rw_wlock(&uma_rwlock); 1749 LIST_REMOVE(keg, uk_link); 1750 rw_wunlock(&uma_rwlock); 1751 zone_free_item(kegs, keg, NULL, SKIP_NONE); 1752 } 1753 ZONE_LOCK_FINI(zone); 1754} 1755 1756/* 1757 * Traverses every zone in the system and calls a callback 1758 * 1759 * Arguments: 1760 * zfunc A pointer to a function which accepts a zone 1761 * as an argument. 1762 * 1763 * Returns: 1764 * Nothing 1765 */ 1766static void 1767zone_foreach(void (*zfunc)(uma_zone_t)) 1768{ 1769 uma_keg_t keg; 1770 uma_zone_t zone; 1771 1772 rw_rlock(&uma_rwlock); 1773 LIST_FOREACH(keg, &uma_kegs, uk_link) { 1774 LIST_FOREACH(zone, &keg->uk_zones, uz_link) 1775 zfunc(zone); 1776 } 1777 rw_runlock(&uma_rwlock); 1778} 1779 1780/* Public functions */ 1781/* See uma.h */ 1782void 1783uma_startup(void *bootmem, int boot_pages) 1784{ 1785 struct uma_zctor_args args; 1786 uma_slab_t slab; 1787 u_int slabsize; 1788 int i; 1789 1790#ifdef UMA_DEBUG 1791 printf("Creating uma keg headers zone and keg.\n"); 1792#endif 1793 rw_init(&uma_rwlock, "UMA lock"); 1794 1795 /* "manually" create the initial zone */ 1796 memset(&args, 0, sizeof(args)); 1797 args.name = "UMA Kegs"; 1798 args.size = sizeof(struct uma_keg); 1799 args.ctor = keg_ctor; 1800 args.dtor = keg_dtor; 1801 args.uminit = zero_init; 1802 args.fini = NULL; 1803 args.keg = &masterkeg; 1804 args.align = 32 - 1; 1805 args.flags = UMA_ZFLAG_INTERNAL; 1806 /* The initial zone has no Per cpu queues so it's smaller */ 1807 zone_ctor(kegs, sizeof(struct uma_zone), &args, M_WAITOK); 1808 1809#ifdef UMA_DEBUG 1810 printf("Filling boot free list.\n"); 1811#endif 1812 for (i = 0; i < boot_pages; i++) { 1813 slab = (uma_slab_t)((uint8_t *)bootmem + (i * UMA_SLAB_SIZE)); 1814 slab->us_data = (uint8_t *)slab; 1815 slab->us_flags = UMA_SLAB_BOOT; 1816 LIST_INSERT_HEAD(&uma_boot_pages, slab, us_link); 1817 } 1818 mtx_init(&uma_boot_pages_mtx, "UMA boot pages", NULL, MTX_DEF); 1819 1820#ifdef UMA_DEBUG 1821 printf("Creating uma zone headers zone and keg.\n"); 1822#endif 1823 args.name = "UMA Zones"; 1824 args.size = sizeof(struct uma_zone) + 1825 (sizeof(struct uma_cache) * (mp_maxid + 1)); 1826 args.ctor = zone_ctor; 1827 args.dtor = zone_dtor; 1828 args.uminit = zero_init; 1829 args.fini = NULL; 1830 args.keg = NULL; 1831 args.align = 32 - 1; 1832 args.flags = UMA_ZFLAG_INTERNAL; 1833 /* The initial zone has no Per cpu queues so it's smaller */ 1834 zone_ctor(zones, sizeof(struct uma_zone), &args, M_WAITOK); 1835 1836#ifdef UMA_DEBUG 1837 printf("Initializing pcpu cache locks.\n"); 1838#endif 1839#ifdef UMA_DEBUG 1840 printf("Creating slab and hash zones.\n"); 1841#endif 1842 1843 /* Now make a zone for slab headers */ 1844 slabzone = uma_zcreate("UMA Slabs", 1845 sizeof(struct uma_slab), 1846 NULL, NULL, NULL, NULL, 1847 UMA_ALIGN_PTR, UMA_ZFLAG_INTERNAL); 1848 1849 /* 1850 * We also create a zone for the bigger slabs with reference 1851 * counts in them, to accomodate UMA_ZONE_REFCNT zones. 1852 */ 1853 slabsize = sizeof(struct uma_slab_refcnt); 1854 slabsize += uma_max_ipers_ref * sizeof(uint32_t); 1855 slabrefzone = uma_zcreate("UMA RCntSlabs", 1856 slabsize, 1857 NULL, NULL, NULL, NULL, 1858 UMA_ALIGN_PTR, 1859 UMA_ZFLAG_INTERNAL); 1860 1861 hashzone = uma_zcreate("UMA Hash", 1862 sizeof(struct slabhead *) * UMA_HASH_SIZE_INIT, 1863 NULL, NULL, NULL, NULL, 1864 UMA_ALIGN_PTR, UMA_ZFLAG_INTERNAL); 1865 1866 bucket_init(); 1867 1868 booted = UMA_STARTUP; 1869 1870#ifdef UMA_DEBUG 1871 printf("UMA startup complete.\n"); 1872#endif 1873} 1874 1875/* see uma.h */ 1876void 1877uma_startup2(void) 1878{ 1879 booted = UMA_STARTUP2; 1880 bucket_enable(); 1881 sx_init(&uma_drain_lock, "umadrain"); 1882#ifdef UMA_DEBUG 1883 printf("UMA startup2 complete.\n"); 1884#endif 1885} 1886 1887/* 1888 * Initialize our callout handle 1889 * 1890 */ 1891 1892static void 1893uma_startup3(void) 1894{ 1895#ifdef UMA_DEBUG 1896 printf("Starting callout.\n"); 1897#endif 1898 callout_init(&uma_callout, 1); 1899 callout_reset(&uma_callout, UMA_TIMEOUT * hz, uma_timeout, NULL); 1900#ifdef UMA_DEBUG 1901 printf("UMA startup3 complete.\n"); 1902#endif 1903} 1904 1905static uma_keg_t 1906uma_kcreate(uma_zone_t zone, size_t size, uma_init uminit, uma_fini fini, 1907 int align, uint32_t flags) 1908{ 1909 struct uma_kctor_args args; 1910 1911 args.size = size; 1912 args.uminit = uminit; 1913 args.fini = fini; 1914 args.align = (align == UMA_ALIGN_CACHE) ? uma_align_cache : align; 1915 args.flags = flags; 1916 args.zone = zone; 1917 return (zone_alloc_item(kegs, &args, M_WAITOK)); 1918} 1919 1920/* See uma.h */ 1921void 1922uma_set_align(int align) 1923{ 1924 1925 if (align != UMA_ALIGN_CACHE) 1926 uma_align_cache = align; 1927} 1928 1929/* See uma.h */ 1930uma_zone_t 1931uma_zcreate(const char *name, size_t size, uma_ctor ctor, uma_dtor dtor, 1932 uma_init uminit, uma_fini fini, int align, uint32_t flags) 1933 1934{ 1935 struct uma_zctor_args args; 1936 uma_zone_t res; 1937 bool locked; 1938 1939 /* This stuff is essential for the zone ctor */ 1940 memset(&args, 0, sizeof(args)); 1941 args.name = name; 1942 args.size = size; 1943 args.ctor = ctor; 1944 args.dtor = dtor; 1945 args.uminit = uminit; 1946 args.fini = fini; 1947 args.align = align; 1948 args.flags = flags; 1949 args.keg = NULL; 1950 1951 if (booted < UMA_STARTUP2) { 1952 locked = false; 1953 } else { 1954 sx_slock(&uma_drain_lock); 1955 locked = true; 1956 } 1957 res = zone_alloc_item(zones, &args, M_WAITOK); 1958 if (locked) 1959 sx_sunlock(&uma_drain_lock); 1960 return (res); 1961} 1962 1963/* See uma.h */ 1964uma_zone_t 1965uma_zsecond_create(char *name, uma_ctor ctor, uma_dtor dtor, 1966 uma_init zinit, uma_fini zfini, uma_zone_t master) 1967{ 1968 struct uma_zctor_args args; 1969 uma_keg_t keg; 1970 uma_zone_t res; 1971 bool locked; 1972 1973 keg = zone_first_keg(master); 1974 memset(&args, 0, sizeof(args)); 1975 args.name = name; 1976 args.size = keg->uk_size; 1977 args.ctor = ctor; 1978 args.dtor = dtor; 1979 args.uminit = zinit; 1980 args.fini = zfini; 1981 args.align = keg->uk_align; 1982 args.flags = keg->uk_flags | UMA_ZONE_SECONDARY; 1983 args.keg = keg; 1984 1985 if (booted < UMA_STARTUP2) { 1986 locked = false; 1987 } else { 1988 sx_slock(&uma_drain_lock); 1989 locked = true; 1990 } 1991 /* XXX Attaches only one keg of potentially many. */ 1992 res = zone_alloc_item(zones, &args, M_WAITOK); 1993 if (locked) 1994 sx_sunlock(&uma_drain_lock); 1995 return (res); 1996} 1997 1998/* See uma.h */ 1999uma_zone_t 2000uma_zcache_create(char *name, int size, uma_ctor ctor, uma_dtor dtor, 2001 uma_init zinit, uma_fini zfini, uma_import zimport, 2002 uma_release zrelease, void *arg, int flags) 2003{ 2004 struct uma_zctor_args args; 2005 2006 memset(&args, 0, sizeof(args)); 2007 args.name = name; 2008 args.size = size; 2009 args.ctor = ctor; 2010 args.dtor = dtor; 2011 args.uminit = zinit; 2012 args.fini = zfini; 2013 args.import = zimport; 2014 args.release = zrelease; 2015 args.arg = arg; 2016 args.align = 0; 2017 args.flags = flags; 2018 2019 return (zone_alloc_item(zones, &args, M_WAITOK)); 2020} 2021 2022static void 2023zone_lock_pair(uma_zone_t a, uma_zone_t b) 2024{ 2025 if (a < b) { 2026 ZONE_LOCK(a); 2027 mtx_lock_flags(b->uz_lockptr, MTX_DUPOK); 2028 } else { 2029 ZONE_LOCK(b); 2030 mtx_lock_flags(a->uz_lockptr, MTX_DUPOK); 2031 } 2032} 2033 2034static void 2035zone_unlock_pair(uma_zone_t a, uma_zone_t b) 2036{ 2037 2038 ZONE_UNLOCK(a); 2039 ZONE_UNLOCK(b); 2040} 2041 2042int 2043uma_zsecond_add(uma_zone_t zone, uma_zone_t master) 2044{ 2045 uma_klink_t klink; 2046 uma_klink_t kl; 2047 int error; 2048 2049 error = 0; 2050 klink = malloc(sizeof(*klink), M_TEMP, M_WAITOK | M_ZERO); 2051 2052 zone_lock_pair(zone, master); 2053 /* 2054 * zone must use vtoslab() to resolve objects and must already be 2055 * a secondary. 2056 */ 2057 if ((zone->uz_flags & (UMA_ZONE_VTOSLAB | UMA_ZONE_SECONDARY)) 2058 != (UMA_ZONE_VTOSLAB | UMA_ZONE_SECONDARY)) { 2059 error = EINVAL; 2060 goto out; 2061 } 2062 /* 2063 * The new master must also use vtoslab(). 2064 */ 2065 if ((zone->uz_flags & UMA_ZONE_VTOSLAB) != UMA_ZONE_VTOSLAB) { 2066 error = EINVAL; 2067 goto out; 2068 } 2069 /* 2070 * Both must either be refcnt, or not be refcnt. 2071 */ 2072 if ((zone->uz_flags & UMA_ZONE_REFCNT) != 2073 (master->uz_flags & UMA_ZONE_REFCNT)) { 2074 error = EINVAL; 2075 goto out; 2076 } 2077 /* 2078 * The underlying object must be the same size. rsize 2079 * may be different. 2080 */ 2081 if (master->uz_size != zone->uz_size) { 2082 error = E2BIG; 2083 goto out; 2084 } 2085 /* 2086 * Put it at the end of the list. 2087 */ 2088 klink->kl_keg = zone_first_keg(master); 2089 LIST_FOREACH(kl, &zone->uz_kegs, kl_link) { 2090 if (LIST_NEXT(kl, kl_link) == NULL) { 2091 LIST_INSERT_AFTER(kl, klink, kl_link); 2092 break; 2093 } 2094 } 2095 klink = NULL; 2096 zone->uz_flags |= UMA_ZFLAG_MULTI; 2097 zone->uz_slab = zone_fetch_slab_multi; 2098 2099out: 2100 zone_unlock_pair(zone, master); 2101 if (klink != NULL) 2102 free(klink, M_TEMP); 2103 2104 return (error); 2105} 2106 2107 2108/* See uma.h */ 2109void 2110uma_zdestroy(uma_zone_t zone) 2111{ 2112 2113 sx_slock(&uma_drain_lock); 2114 zone_free_item(zones, zone, NULL, SKIP_NONE); 2115 sx_sunlock(&uma_drain_lock); 2116} 2117 2118/* See uma.h */ 2119void * 2120uma_zalloc_arg(uma_zone_t zone, void *udata, int flags) 2121{ 2122 void *item; 2123 uma_cache_t cache; 2124 uma_bucket_t bucket; 2125 int lockfail; 2126 int cpu; 2127 2128 /* This is the fast path allocation */ 2129#ifdef UMA_DEBUG_ALLOC_1 2130 printf("Allocating one item from %s(%p)\n", zone->uz_name, zone); 2131#endif 2132 CTR3(KTR_UMA, "uma_zalloc_arg thread %x zone %s flags %d", curthread, 2133 zone->uz_name, flags); 2134 2135 if (flags & M_WAITOK) { 2136 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, 2137 "uma_zalloc_arg: zone \"%s\"", zone->uz_name); 2138 } 2139#ifdef DEBUG_MEMGUARD 2140 if (memguard_cmp_zone(zone)) { 2141 item = memguard_alloc(zone->uz_size, flags); 2142 if (item != NULL) { 2143 /* 2144 * Avoid conflict with the use-after-free 2145 * protecting infrastructure from INVARIANTS. 2146 */ 2147 if (zone->uz_init != NULL && 2148 zone->uz_init != mtrash_init && 2149 zone->uz_init(item, zone->uz_size, flags) != 0) 2150 return (NULL); 2151 if (zone->uz_ctor != NULL && 2152 zone->uz_ctor != mtrash_ctor && 2153 zone->uz_ctor(item, zone->uz_size, udata, 2154 flags) != 0) { 2155 zone->uz_fini(item, zone->uz_size); 2156 return (NULL); 2157 } 2158 return (item); 2159 } 2160 /* This is unfortunate but should not be fatal. */ 2161 } 2162#endif 2163 /* 2164 * If possible, allocate from the per-CPU cache. There are two 2165 * requirements for safe access to the per-CPU cache: (1) the thread 2166 * accessing the cache must not be preempted or yield during access, 2167 * and (2) the thread must not migrate CPUs without switching which 2168 * cache it accesses. We rely on a critical section to prevent 2169 * preemption and migration. We release the critical section in 2170 * order to acquire the zone mutex if we are unable to allocate from 2171 * the current cache; when we re-acquire the critical section, we 2172 * must detect and handle migration if it has occurred. 2173 */ 2174 critical_enter(); 2175 cpu = curcpu; 2176 cache = &zone->uz_cpu[cpu]; 2177 2178zalloc_start: 2179 bucket = cache->uc_allocbucket; 2180 if (bucket != NULL && bucket->ub_cnt > 0) { 2181 bucket->ub_cnt--; 2182 item = bucket->ub_bucket[bucket->ub_cnt]; 2183#ifdef INVARIANTS 2184 bucket->ub_bucket[bucket->ub_cnt] = NULL; 2185#endif 2186 KASSERT(item != NULL, ("uma_zalloc: Bucket pointer mangled.")); 2187 cache->uc_allocs++; 2188 critical_exit(); 2189 if (zone->uz_ctor != NULL && 2190 zone->uz_ctor(item, zone->uz_size, udata, flags) != 0) { 2191 atomic_add_long(&zone->uz_fails, 1); 2192 zone_free_item(zone, item, udata, SKIP_DTOR); 2193 return (NULL); 2194 } 2195#ifdef INVARIANTS 2196 uma_dbg_alloc(zone, NULL, item); 2197#endif 2198 if (flags & M_ZERO) 2199 uma_zero_item(item, zone); 2200 return (item); 2201 } 2202 2203 /* 2204 * We have run out of items in our alloc bucket. 2205 * See if we can switch with our free bucket. 2206 */ 2207 bucket = cache->uc_freebucket; 2208 if (bucket != NULL && bucket->ub_cnt > 0) { 2209#ifdef UMA_DEBUG_ALLOC 2210 printf("uma_zalloc: Swapping empty with alloc.\n"); 2211#endif 2212 cache->uc_freebucket = cache->uc_allocbucket; 2213 cache->uc_allocbucket = bucket; 2214 goto zalloc_start; 2215 } 2216 2217 /* 2218 * Discard any empty allocation bucket while we hold no locks. 2219 */ 2220 bucket = cache->uc_allocbucket; 2221 cache->uc_allocbucket = NULL; 2222 critical_exit(); 2223 if (bucket != NULL) 2224 bucket_free(zone, bucket, udata); 2225 2226 /* Short-circuit for zones without buckets and low memory. */ 2227 if (zone->uz_count == 0 || bucketdisable) 2228 goto zalloc_item; 2229 2230 /* 2231 * Attempt to retrieve the item from the per-CPU cache has failed, so 2232 * we must go back to the zone. This requires the zone lock, so we 2233 * must drop the critical section, then re-acquire it when we go back 2234 * to the cache. Since the critical section is released, we may be 2235 * preempted or migrate. As such, make sure not to maintain any 2236 * thread-local state specific to the cache from prior to releasing 2237 * the critical section. 2238 */ 2239 lockfail = 0; 2240 if (ZONE_TRYLOCK(zone) == 0) { 2241 /* Record contention to size the buckets. */ 2242 ZONE_LOCK(zone); 2243 lockfail = 1; 2244 } 2245 critical_enter(); 2246 cpu = curcpu; 2247 cache = &zone->uz_cpu[cpu]; 2248 2249 /* 2250 * Since we have locked the zone we may as well send back our stats. 2251 */ 2252 atomic_add_long(&zone->uz_allocs, cache->uc_allocs); 2253 atomic_add_long(&zone->uz_frees, cache->uc_frees); 2254 cache->uc_allocs = 0; 2255 cache->uc_frees = 0; 2256 2257 /* See if we lost the race to fill the cache. */ 2258 if (cache->uc_allocbucket != NULL) { 2259 ZONE_UNLOCK(zone); 2260 goto zalloc_start; 2261 } 2262 2263 /* 2264 * Check the zone's cache of buckets. 2265 */ 2266 if ((bucket = LIST_FIRST(&zone->uz_buckets)) != NULL) { 2267 KASSERT(bucket->ub_cnt != 0, 2268 ("uma_zalloc_arg: Returning an empty bucket.")); 2269 2270 LIST_REMOVE(bucket, ub_link); 2271 cache->uc_allocbucket = bucket; 2272 ZONE_UNLOCK(zone); 2273 goto zalloc_start; 2274 } 2275 /* We are no longer associated with this CPU. */ 2276 critical_exit(); 2277 2278 /* 2279 * We bump the uz count when the cache size is insufficient to 2280 * handle the working set. 2281 */ 2282 if (lockfail && zone->uz_count < BUCKET_MAX) 2283 zone->uz_count++; 2284 ZONE_UNLOCK(zone); 2285 2286 /* 2287 * Now lets just fill a bucket and put it on the free list. If that 2288 * works we'll restart the allocation from the begining and it 2289 * will use the just filled bucket. 2290 */ 2291 bucket = zone_alloc_bucket(zone, udata, flags); 2292 if (bucket != NULL) { 2293 ZONE_LOCK(zone); 2294 critical_enter(); 2295 cpu = curcpu; 2296 cache = &zone->uz_cpu[cpu]; 2297 /* 2298 * See if we lost the race or were migrated. Cache the 2299 * initialized bucket to make this less likely or claim 2300 * the memory directly. 2301 */ 2302 if (cache->uc_allocbucket == NULL) 2303 cache->uc_allocbucket = bucket; 2304 else 2305 LIST_INSERT_HEAD(&zone->uz_buckets, bucket, ub_link); 2306 ZONE_UNLOCK(zone); 2307 goto zalloc_start; 2308 } 2309 2310 /* 2311 * We may not be able to get a bucket so return an actual item. 2312 */ 2313#ifdef UMA_DEBUG 2314 printf("uma_zalloc_arg: Bucketzone returned NULL\n"); 2315#endif 2316 2317zalloc_item: 2318 item = zone_alloc_item(zone, udata, flags); 2319 2320 return (item); 2321} 2322 2323static uma_slab_t 2324keg_fetch_slab(uma_keg_t keg, uma_zone_t zone, int flags) 2325{ 2326 uma_slab_t slab; 2327 int reserve; 2328 2329 mtx_assert(&keg->uk_lock, MA_OWNED); 2330 slab = NULL; 2331 reserve = 0; 2332 if ((flags & M_USE_RESERVE) == 0) 2333 reserve = keg->uk_reserve; 2334 2335 for (;;) { 2336 /* 2337 * Find a slab with some space. Prefer slabs that are partially 2338 * used over those that are totally full. This helps to reduce 2339 * fragmentation. 2340 */ 2341 if (keg->uk_free > reserve) { 2342 if (!LIST_EMPTY(&keg->uk_part_slab)) { 2343 slab = LIST_FIRST(&keg->uk_part_slab); 2344 } else { 2345 slab = LIST_FIRST(&keg->uk_free_slab); 2346 LIST_REMOVE(slab, us_link); 2347 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, 2348 us_link); 2349 } 2350 MPASS(slab->us_keg == keg); 2351 return (slab); 2352 } 2353 2354 /* 2355 * M_NOVM means don't ask at all! 2356 */ 2357 if (flags & M_NOVM) 2358 break; 2359 2360 if (keg->uk_maxpages && keg->uk_pages >= keg->uk_maxpages) { 2361 keg->uk_flags |= UMA_ZFLAG_FULL; 2362 /* 2363 * If this is not a multi-zone, set the FULL bit. 2364 * Otherwise slab_multi() takes care of it. 2365 */ 2366 if ((zone->uz_flags & UMA_ZFLAG_MULTI) == 0) { 2367 zone->uz_flags |= UMA_ZFLAG_FULL; 2368 zone_log_warning(zone); 2369 } 2370 if (flags & M_NOWAIT) 2371 break; 2372 zone->uz_sleeps++; 2373 msleep(keg, &keg->uk_lock, PVM, "keglimit", 0); 2374 continue; 2375 } 2376 slab = keg_alloc_slab(keg, zone, flags); 2377 /* 2378 * If we got a slab here it's safe to mark it partially used 2379 * and return. We assume that the caller is going to remove 2380 * at least one item. 2381 */ 2382 if (slab) { 2383 MPASS(slab->us_keg == keg); 2384 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, us_link); 2385 return (slab); 2386 } 2387 /* 2388 * We might not have been able to get a slab but another cpu 2389 * could have while we were unlocked. Check again before we 2390 * fail. 2391 */ 2392 flags |= M_NOVM; 2393 } 2394 return (slab); 2395} 2396 2397static uma_slab_t 2398zone_fetch_slab(uma_zone_t zone, uma_keg_t keg, int flags) 2399{ 2400 uma_slab_t slab; 2401 2402 if (keg == NULL) { 2403 keg = zone_first_keg(zone); 2404 KEG_LOCK(keg); 2405 } 2406 2407 for (;;) { 2408 slab = keg_fetch_slab(keg, zone, flags); 2409 if (slab) 2410 return (slab); 2411 if (flags & (M_NOWAIT | M_NOVM)) 2412 break; 2413 } 2414 KEG_UNLOCK(keg); 2415 return (NULL); 2416} 2417 2418/* 2419 * uma_zone_fetch_slab_multi: Fetches a slab from one available keg. Returns 2420 * with the keg locked. On NULL no lock is held. 2421 * 2422 * The last pointer is used to seed the search. It is not required. 2423 */ 2424static uma_slab_t 2425zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int rflags) 2426{ 2427 uma_klink_t klink; 2428 uma_slab_t slab; 2429 uma_keg_t keg; 2430 int flags; 2431 int empty; 2432 int full; 2433 2434 /* 2435 * Don't wait on the first pass. This will skip limit tests 2436 * as well. We don't want to block if we can find a provider 2437 * without blocking. 2438 */ 2439 flags = (rflags & ~M_WAITOK) | M_NOWAIT; 2440 /* 2441 * Use the last slab allocated as a hint for where to start 2442 * the search. 2443 */ 2444 if (last != NULL) { 2445 slab = keg_fetch_slab(last, zone, flags); 2446 if (slab) 2447 return (slab); 2448 KEG_UNLOCK(last); 2449 } 2450 /* 2451 * Loop until we have a slab incase of transient failures 2452 * while M_WAITOK is specified. I'm not sure this is 100% 2453 * required but we've done it for so long now. 2454 */ 2455 for (;;) { 2456 empty = 0; 2457 full = 0; 2458 /* 2459 * Search the available kegs for slabs. Be careful to hold the 2460 * correct lock while calling into the keg layer. 2461 */ 2462 LIST_FOREACH(klink, &zone->uz_kegs, kl_link) { 2463 keg = klink->kl_keg; 2464 KEG_LOCK(keg); 2465 if ((keg->uk_flags & UMA_ZFLAG_FULL) == 0) { 2466 slab = keg_fetch_slab(keg, zone, flags); 2467 if (slab) 2468 return (slab); 2469 } 2470 if (keg->uk_flags & UMA_ZFLAG_FULL) 2471 full++; 2472 else 2473 empty++; 2474 KEG_UNLOCK(keg); 2475 } 2476 if (rflags & (M_NOWAIT | M_NOVM)) 2477 break; 2478 flags = rflags; 2479 /* 2480 * All kegs are full. XXX We can't atomically check all kegs 2481 * and sleep so just sleep for a short period and retry. 2482 */ 2483 if (full && !empty) { 2484 ZONE_LOCK(zone); 2485 zone->uz_flags |= UMA_ZFLAG_FULL; 2486 zone->uz_sleeps++; 2487 zone_log_warning(zone); 2488 msleep(zone, zone->uz_lockptr, PVM, 2489 "zonelimit", hz/100); 2490 zone->uz_flags &= ~UMA_ZFLAG_FULL; 2491 ZONE_UNLOCK(zone); 2492 continue; 2493 } 2494 } 2495 return (NULL); 2496} 2497 2498static void * 2499slab_alloc_item(uma_keg_t keg, uma_slab_t slab) 2500{ 2501 void *item; 2502 uint8_t freei; 2503 2504 MPASS(keg == slab->us_keg); 2505 mtx_assert(&keg->uk_lock, MA_OWNED); 2506 2507 freei = BIT_FFS(SLAB_SETSIZE, &slab->us_free) - 1; 2508 BIT_CLR(SLAB_SETSIZE, freei, &slab->us_free); 2509 item = slab->us_data + (keg->uk_rsize * freei); 2510 slab->us_freecount--; 2511 keg->uk_free--; 2512 2513 /* Move this slab to the full list */ 2514 if (slab->us_freecount == 0) { 2515 LIST_REMOVE(slab, us_link); 2516 LIST_INSERT_HEAD(&keg->uk_full_slab, slab, us_link); 2517 } 2518 2519 return (item); 2520} 2521 2522static int 2523zone_import(uma_zone_t zone, void **bucket, int max, int flags) 2524{ 2525 uma_slab_t slab; 2526 uma_keg_t keg; 2527 int i; 2528 2529 slab = NULL; 2530 keg = NULL; 2531 /* Try to keep the buckets totally full */ 2532 for (i = 0; i < max; ) { 2533 if ((slab = zone->uz_slab(zone, keg, flags)) == NULL) 2534 break; 2535 keg = slab->us_keg; 2536 while (slab->us_freecount && i < max) { 2537 bucket[i++] = slab_alloc_item(keg, slab); 2538 if (keg->uk_free <= keg->uk_reserve) 2539 break; 2540 } 2541 /* Don't grab more than one slab at a time. */ 2542 flags &= ~M_WAITOK; 2543 flags |= M_NOWAIT; 2544 } 2545 if (slab != NULL) 2546 KEG_UNLOCK(keg); 2547 2548 return i; 2549} 2550 2551static uma_bucket_t 2552zone_alloc_bucket(uma_zone_t zone, void *udata, int flags) 2553{ 2554 uma_bucket_t bucket; 2555 int max; 2556 2557 /* Don't wait for buckets, preserve caller's NOVM setting. */ 2558 bucket = bucket_alloc(zone, udata, M_NOWAIT | (flags & M_NOVM)); 2559 if (bucket == NULL) 2560 return (NULL); 2561 2562 max = MIN(bucket->ub_entries, zone->uz_count); 2563 bucket->ub_cnt = zone->uz_import(zone->uz_arg, bucket->ub_bucket, 2564 max, flags); 2565 2566 /* 2567 * Initialize the memory if necessary. 2568 */ 2569 if (bucket->ub_cnt != 0 && zone->uz_init != NULL) { 2570 int i; 2571 2572 for (i = 0; i < bucket->ub_cnt; i++) 2573 if (zone->uz_init(bucket->ub_bucket[i], zone->uz_size, 2574 flags) != 0) 2575 break; 2576 /* 2577 * If we couldn't initialize the whole bucket, put the 2578 * rest back onto the freelist. 2579 */ 2580 if (i != bucket->ub_cnt) { 2581 zone->uz_release(zone->uz_arg, &bucket->ub_bucket[i], 2582 bucket->ub_cnt - i); 2583#ifdef INVARIANTS 2584 bzero(&bucket->ub_bucket[i], 2585 sizeof(void *) * (bucket->ub_cnt - i)); 2586#endif 2587 bucket->ub_cnt = i; 2588 } 2589 } 2590 2591 if (bucket->ub_cnt == 0) { 2592 bucket_free(zone, bucket, udata); 2593 atomic_add_long(&zone->uz_fails, 1); 2594 return (NULL); 2595 } 2596 2597 return (bucket); 2598} 2599 2600/* 2601 * Allocates a single item from a zone. 2602 * 2603 * Arguments 2604 * zone The zone to alloc for. 2605 * udata The data to be passed to the constructor. 2606 * flags M_WAITOK, M_NOWAIT, M_ZERO. 2607 * 2608 * Returns 2609 * NULL if there is no memory and M_NOWAIT is set 2610 * An item if successful 2611 */ 2612 2613static void * 2614zone_alloc_item(uma_zone_t zone, void *udata, int flags) 2615{ 2616 void *item; 2617 2618 item = NULL; 2619 2620#ifdef UMA_DEBUG_ALLOC 2621 printf("INTERNAL: Allocating one item from %s(%p)\n", zone->uz_name, zone); 2622#endif 2623 if (zone->uz_import(zone->uz_arg, &item, 1, flags) != 1) 2624 goto fail; 2625 atomic_add_long(&zone->uz_allocs, 1); 2626 2627 /* 2628 * We have to call both the zone's init (not the keg's init) 2629 * and the zone's ctor. This is because the item is going from 2630 * a keg slab directly to the user, and the user is expecting it 2631 * to be both zone-init'd as well as zone-ctor'd. 2632 */ 2633 if (zone->uz_init != NULL) { 2634 if (zone->uz_init(item, zone->uz_size, flags) != 0) { 2635 zone_free_item(zone, item, udata, SKIP_FINI); 2636 goto fail; 2637 } 2638 } 2639 if (zone->uz_ctor != NULL) { 2640 if (zone->uz_ctor(item, zone->uz_size, udata, flags) != 0) { 2641 zone_free_item(zone, item, udata, SKIP_DTOR); 2642 goto fail; 2643 } 2644 } 2645#ifdef INVARIANTS 2646 uma_dbg_alloc(zone, NULL, item); 2647#endif 2648 if (flags & M_ZERO) 2649 uma_zero_item(item, zone); 2650 2651 return (item); 2652 2653fail: 2654 atomic_add_long(&zone->uz_fails, 1); 2655 return (NULL); 2656} 2657 2658/* See uma.h */ 2659void 2660uma_zfree_arg(uma_zone_t zone, void *item, void *udata) 2661{ 2662 uma_cache_t cache; 2663 uma_bucket_t bucket; 2664 int lockfail; 2665 int cpu; 2666 2667#ifdef UMA_DEBUG_ALLOC_1 2668 printf("Freeing item %p to %s(%p)\n", item, zone->uz_name, zone); 2669#endif 2670 CTR2(KTR_UMA, "uma_zfree_arg thread %x zone %s", curthread, 2671 zone->uz_name); 2672 2673 /* uma_zfree(..., NULL) does nothing, to match free(9). */ 2674 if (item == NULL) 2675 return; 2676#ifdef DEBUG_MEMGUARD 2677 if (is_memguard_addr(item)) { 2678 if (zone->uz_dtor != NULL && zone->uz_dtor != mtrash_dtor) 2679 zone->uz_dtor(item, zone->uz_size, udata); 2680 if (zone->uz_fini != NULL && zone->uz_fini != mtrash_fini) 2681 zone->uz_fini(item, zone->uz_size); 2682 memguard_free(item); 2683 return; 2684 } 2685#endif 2686#ifdef INVARIANTS 2687 if (zone->uz_flags & UMA_ZONE_MALLOC) 2688 uma_dbg_free(zone, udata, item); 2689 else 2690 uma_dbg_free(zone, NULL, item); 2691#endif 2692 if (zone->uz_dtor != NULL) 2693 zone->uz_dtor(item, zone->uz_size, udata); 2694 2695 /* 2696 * The race here is acceptable. If we miss it we'll just have to wait 2697 * a little longer for the limits to be reset. 2698 */ 2699 if (zone->uz_flags & UMA_ZFLAG_FULL) 2700 goto zfree_item; 2701 2702 /* 2703 * If possible, free to the per-CPU cache. There are two 2704 * requirements for safe access to the per-CPU cache: (1) the thread 2705 * accessing the cache must not be preempted or yield during access, 2706 * and (2) the thread must not migrate CPUs without switching which 2707 * cache it accesses. We rely on a critical section to prevent 2708 * preemption and migration. We release the critical section in 2709 * order to acquire the zone mutex if we are unable to free to the 2710 * current cache; when we re-acquire the critical section, we must 2711 * detect and handle migration if it has occurred. 2712 */ 2713zfree_restart: 2714 critical_enter(); 2715 cpu = curcpu; 2716 cache = &zone->uz_cpu[cpu]; 2717 2718zfree_start: 2719 /* 2720 * Try to free into the allocbucket first to give LIFO ordering 2721 * for cache-hot datastructures. Spill over into the freebucket 2722 * if necessary. Alloc will swap them if one runs dry. 2723 */ 2724 bucket = cache->uc_allocbucket; 2725 if (bucket == NULL || bucket->ub_cnt >= bucket->ub_entries) 2726 bucket = cache->uc_freebucket; 2727 if (bucket != NULL && bucket->ub_cnt < bucket->ub_entries) { 2728 KASSERT(bucket->ub_bucket[bucket->ub_cnt] == NULL, 2729 ("uma_zfree: Freeing to non free bucket index.")); 2730 bucket->ub_bucket[bucket->ub_cnt] = item; 2731 bucket->ub_cnt++; 2732 cache->uc_frees++; 2733 critical_exit(); 2734 return; 2735 } 2736 2737 /* 2738 * We must go back the zone, which requires acquiring the zone lock, 2739 * which in turn means we must release and re-acquire the critical 2740 * section. Since the critical section is released, we may be 2741 * preempted or migrate. As such, make sure not to maintain any 2742 * thread-local state specific to the cache from prior to releasing 2743 * the critical section. 2744 */ 2745 critical_exit(); 2746 if (zone->uz_count == 0 || bucketdisable) 2747 goto zfree_item; 2748 2749 lockfail = 0; 2750 if (ZONE_TRYLOCK(zone) == 0) { 2751 /* Record contention to size the buckets. */ 2752 ZONE_LOCK(zone); 2753 lockfail = 1; 2754 } 2755 critical_enter(); 2756 cpu = curcpu; 2757 cache = &zone->uz_cpu[cpu]; 2758 2759 /* 2760 * Since we have locked the zone we may as well send back our stats. 2761 */ 2762 atomic_add_long(&zone->uz_allocs, cache->uc_allocs); 2763 atomic_add_long(&zone->uz_frees, cache->uc_frees); 2764 cache->uc_allocs = 0; 2765 cache->uc_frees = 0; 2766 2767 bucket = cache->uc_freebucket; 2768 if (bucket != NULL && bucket->ub_cnt < bucket->ub_entries) { 2769 ZONE_UNLOCK(zone); 2770 goto zfree_start; 2771 } 2772 cache->uc_freebucket = NULL; 2773 /* We are no longer associated with this CPU. */ 2774 critical_exit(); 2775 2776 /* Can we throw this on the zone full list? */ 2777 if (bucket != NULL) { 2778#ifdef UMA_DEBUG_ALLOC 2779 printf("uma_zfree: Putting old bucket on the free list.\n"); 2780#endif 2781 /* ub_cnt is pointing to the last free item */ 2782 KASSERT(bucket->ub_cnt != 0, 2783 ("uma_zfree: Attempting to insert an empty bucket onto the full list.\n")); 2784 LIST_INSERT_HEAD(&zone->uz_buckets, bucket, ub_link); 2785 } 2786 2787 /* 2788 * We bump the uz count when the cache size is insufficient to 2789 * handle the working set. 2790 */ 2791 if (lockfail && zone->uz_count < BUCKET_MAX) 2792 zone->uz_count++; 2793 ZONE_UNLOCK(zone); 2794 2795#ifdef UMA_DEBUG_ALLOC 2796 printf("uma_zfree: Allocating new free bucket.\n"); 2797#endif 2798 bucket = bucket_alloc(zone, udata, M_NOWAIT); 2799 if (bucket) { 2800 critical_enter(); 2801 cpu = curcpu; 2802 cache = &zone->uz_cpu[cpu]; 2803 if (cache->uc_freebucket == NULL) { 2804 cache->uc_freebucket = bucket; 2805 goto zfree_start; 2806 } 2807 /* 2808 * We lost the race, start over. We have to drop our 2809 * critical section to free the bucket. 2810 */ 2811 critical_exit(); 2812 bucket_free(zone, bucket, udata); 2813 goto zfree_restart; 2814 } 2815 2816 /* 2817 * If nothing else caught this, we'll just do an internal free. 2818 */ 2819zfree_item: 2820 zone_free_item(zone, item, udata, SKIP_DTOR); 2821 2822 return; 2823} 2824 2825static void 2826slab_free_item(uma_keg_t keg, uma_slab_t slab, void *item) 2827{ 2828 uint8_t freei; 2829 2830 mtx_assert(&keg->uk_lock, MA_OWNED); 2831 MPASS(keg == slab->us_keg); 2832 2833 /* Do we need to remove from any lists? */ 2834 if (slab->us_freecount+1 == keg->uk_ipers) { 2835 LIST_REMOVE(slab, us_link); 2836 LIST_INSERT_HEAD(&keg->uk_free_slab, slab, us_link); 2837 } else if (slab->us_freecount == 0) { 2838 LIST_REMOVE(slab, us_link); 2839 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, us_link); 2840 } 2841 2842 /* Slab management. */ 2843 freei = ((uintptr_t)item - (uintptr_t)slab->us_data) / keg->uk_rsize; 2844 BIT_SET(SLAB_SETSIZE, freei, &slab->us_free); 2845 slab->us_freecount++; 2846 2847 /* Keg statistics. */ 2848 keg->uk_free++; 2849} 2850 2851static void 2852zone_release(uma_zone_t zone, void **bucket, int cnt) 2853{ 2854 void *item; 2855 uma_slab_t slab; 2856 uma_keg_t keg; 2857 uint8_t *mem; 2858 int clearfull; 2859 int i; 2860 2861 clearfull = 0; 2862 keg = zone_first_keg(zone); 2863 KEG_LOCK(keg); 2864 for (i = 0; i < cnt; i++) { 2865 item = bucket[i]; 2866 if (!(zone->uz_flags & UMA_ZONE_VTOSLAB)) { 2867 mem = (uint8_t *)((uintptr_t)item & (~UMA_SLAB_MASK)); 2868 if (zone->uz_flags & UMA_ZONE_HASH) { 2869 slab = hash_sfind(&keg->uk_hash, mem); 2870 } else { 2871 mem += keg->uk_pgoff; 2872 slab = (uma_slab_t)mem; 2873 } 2874 } else { 2875 slab = vtoslab((vm_offset_t)item); 2876 if (slab->us_keg != keg) { 2877 KEG_UNLOCK(keg); 2878 keg = slab->us_keg; 2879 KEG_LOCK(keg); 2880 } 2881 } 2882 slab_free_item(keg, slab, item); 2883 if (keg->uk_flags & UMA_ZFLAG_FULL) { 2884 if (keg->uk_pages < keg->uk_maxpages) { 2885 keg->uk_flags &= ~UMA_ZFLAG_FULL; 2886 clearfull = 1; 2887 } 2888 2889 /* 2890 * We can handle one more allocation. Since we're 2891 * clearing ZFLAG_FULL, wake up all procs blocked 2892 * on pages. This should be uncommon, so keeping this 2893 * simple for now (rather than adding count of blocked 2894 * threads etc). 2895 */ 2896 wakeup(keg); 2897 } 2898 } 2899 KEG_UNLOCK(keg); 2900 if (clearfull) { 2901 ZONE_LOCK(zone); 2902 zone->uz_flags &= ~UMA_ZFLAG_FULL; 2903 wakeup(zone); 2904 ZONE_UNLOCK(zone); 2905 } 2906 2907} 2908 2909/* 2910 * Frees a single item to any zone. 2911 * 2912 * Arguments: 2913 * zone The zone to free to 2914 * item The item we're freeing 2915 * udata User supplied data for the dtor 2916 * skip Skip dtors and finis 2917 */ 2918static void 2919zone_free_item(uma_zone_t zone, void *item, void *udata, enum zfreeskip skip) 2920{ 2921 2922#ifdef INVARIANTS 2923 if (skip == SKIP_NONE) { 2924 if (zone->uz_flags & UMA_ZONE_MALLOC) 2925 uma_dbg_free(zone, udata, item); 2926 else 2927 uma_dbg_free(zone, NULL, item); 2928 } 2929#endif 2930 if (skip < SKIP_DTOR && zone->uz_dtor) 2931 zone->uz_dtor(item, zone->uz_size, udata); 2932 2933 if (skip < SKIP_FINI && zone->uz_fini) 2934 zone->uz_fini(item, zone->uz_size); 2935 2936 atomic_add_long(&zone->uz_frees, 1); 2937 zone->uz_release(zone->uz_arg, &item, 1); 2938} 2939 2940/* See uma.h */ 2941int 2942uma_zone_set_max(uma_zone_t zone, int nitems) 2943{ 2944 uma_keg_t keg; 2945 2946 keg = zone_first_keg(zone); 2947 if (keg == NULL) 2948 return (0); 2949 KEG_LOCK(keg); 2950 keg->uk_maxpages = (nitems / keg->uk_ipers) * keg->uk_ppera; 2951 if (keg->uk_maxpages * keg->uk_ipers < nitems) 2952 keg->uk_maxpages += keg->uk_ppera; 2953 nitems = keg->uk_maxpages * keg->uk_ipers; 2954 KEG_UNLOCK(keg); 2955 2956 return (nitems); 2957} 2958 2959/* See uma.h */ 2960int 2961uma_zone_get_max(uma_zone_t zone) 2962{ 2963 int nitems; 2964 uma_keg_t keg; 2965 2966 keg = zone_first_keg(zone); 2967 if (keg == NULL) 2968 return (0); 2969 KEG_LOCK(keg); 2970 nitems = keg->uk_maxpages * keg->uk_ipers; 2971 KEG_UNLOCK(keg); 2972 2973 return (nitems); 2974} 2975 2976/* See uma.h */ 2977void 2978uma_zone_set_warning(uma_zone_t zone, const char *warning) 2979{ 2980 2981 ZONE_LOCK(zone); 2982 zone->uz_warning = warning; 2983 ZONE_UNLOCK(zone); 2984} 2985 2986/* See uma.h */ 2987int 2988uma_zone_get_cur(uma_zone_t zone) 2989{ 2990 int64_t nitems; 2991 u_int i; 2992 2993 ZONE_LOCK(zone); 2994 nitems = zone->uz_allocs - zone->uz_frees; 2995 CPU_FOREACH(i) { 2996 /* 2997 * See the comment in sysctl_vm_zone_stats() regarding the 2998 * safety of accessing the per-cpu caches. With the zone lock 2999 * held, it is safe, but can potentially result in stale data. 3000 */ 3001 nitems += zone->uz_cpu[i].uc_allocs - 3002 zone->uz_cpu[i].uc_frees; 3003 } 3004 ZONE_UNLOCK(zone); 3005 3006 return (nitems < 0 ? 0 : nitems); 3007} 3008 3009/* See uma.h */ 3010void 3011uma_zone_set_init(uma_zone_t zone, uma_init uminit) 3012{ 3013 uma_keg_t keg; 3014 3015 keg = zone_first_keg(zone); 3016 KASSERT(keg != NULL, ("uma_zone_set_init: Invalid zone type")); 3017 KEG_LOCK(keg); 3018 KASSERT(keg->uk_pages == 0, 3019 ("uma_zone_set_init on non-empty keg")); 3020 keg->uk_init = uminit; 3021 KEG_UNLOCK(keg); 3022} 3023 3024/* See uma.h */ 3025void 3026uma_zone_set_fini(uma_zone_t zone, uma_fini fini) 3027{ 3028 uma_keg_t keg; 3029 3030 keg = zone_first_keg(zone); 3031 KASSERT(keg != NULL, ("uma_zone_set_fini: Invalid zone type")); 3032 KEG_LOCK(keg); 3033 KASSERT(keg->uk_pages == 0, 3034 ("uma_zone_set_fini on non-empty keg")); 3035 keg->uk_fini = fini; 3036 KEG_UNLOCK(keg); 3037} 3038 3039/* See uma.h */ 3040void 3041uma_zone_set_zinit(uma_zone_t zone, uma_init zinit) 3042{ 3043 3044 ZONE_LOCK(zone); 3045 KASSERT(zone_first_keg(zone)->uk_pages == 0, 3046 ("uma_zone_set_zinit on non-empty keg")); 3047 zone->uz_init = zinit; 3048 ZONE_UNLOCK(zone); 3049} 3050 3051/* See uma.h */ 3052void 3053uma_zone_set_zfini(uma_zone_t zone, uma_fini zfini) 3054{ 3055 3056 ZONE_LOCK(zone); 3057 KASSERT(zone_first_keg(zone)->uk_pages == 0, 3058 ("uma_zone_set_zfini on non-empty keg")); 3059 zone->uz_fini = zfini; 3060 ZONE_UNLOCK(zone); 3061} 3062 3063/* See uma.h */ 3064/* XXX uk_freef is not actually used with the zone locked */ 3065void 3066uma_zone_set_freef(uma_zone_t zone, uma_free freef) 3067{ 3068 uma_keg_t keg; 3069 3070 keg = zone_first_keg(zone); 3071 KASSERT(keg != NULL, ("uma_zone_set_freef: Invalid zone type")); 3072 KEG_LOCK(keg); 3073 keg->uk_freef = freef; 3074 KEG_UNLOCK(keg); 3075} 3076 3077/* See uma.h */ 3078/* XXX uk_allocf is not actually used with the zone locked */ 3079void 3080uma_zone_set_allocf(uma_zone_t zone, uma_alloc allocf) 3081{ 3082 uma_keg_t keg; 3083 3084 keg = zone_first_keg(zone); 3085 KEG_LOCK(keg); 3086 keg->uk_allocf = allocf; 3087 KEG_UNLOCK(keg); 3088} 3089 3090/* See uma.h */ 3091void 3092uma_zone_reserve(uma_zone_t zone, int items) 3093{ 3094 uma_keg_t keg; 3095 3096 keg = zone_first_keg(zone); 3097 if (keg == NULL) 3098 return; 3099 KEG_LOCK(keg); 3100 keg->uk_reserve = items; 3101 KEG_UNLOCK(keg); 3102 3103 return; 3104} 3105 3106/* See uma.h */ 3107int 3108uma_zone_reserve_kva(uma_zone_t zone, int count) 3109{ 3110 uma_keg_t keg; 3111 vm_offset_t kva; 3112 int pages; 3113 3114 keg = zone_first_keg(zone); 3115 if (keg == NULL) 3116 return (0); 3117 pages = count / keg->uk_ipers; 3118 3119 if (pages * keg->uk_ipers < count) 3120 pages++; 3121 3122#ifdef UMA_MD_SMALL_ALLOC 3123 if (keg->uk_ppera > 1) { 3124#else 3125 if (1) { 3126#endif 3127 kva = kva_alloc(pages * UMA_SLAB_SIZE); 3128 if (kva == 0) 3129 return (0); 3130 } else 3131 kva = 0; 3132 KEG_LOCK(keg); 3133 keg->uk_kva = kva; 3134 keg->uk_offset = 0; 3135 keg->uk_maxpages = pages; 3136#ifdef UMA_MD_SMALL_ALLOC 3137 keg->uk_allocf = (keg->uk_ppera > 1) ? noobj_alloc : uma_small_alloc; 3138#else 3139 keg->uk_allocf = noobj_alloc; 3140#endif 3141 keg->uk_flags |= UMA_ZONE_NOFREE; 3142 KEG_UNLOCK(keg); 3143 3144 return (1); 3145} 3146 3147/* See uma.h */ 3148void 3149uma_prealloc(uma_zone_t zone, int items) 3150{ 3151 int slabs; 3152 uma_slab_t slab; 3153 uma_keg_t keg; 3154 3155 keg = zone_first_keg(zone); 3156 if (keg == NULL) 3157 return; 3158 KEG_LOCK(keg); 3159 slabs = items / keg->uk_ipers; 3160 if (slabs * keg->uk_ipers < items) 3161 slabs++; 3162 while (slabs > 0) { 3163 slab = keg_alloc_slab(keg, zone, M_WAITOK); 3164 if (slab == NULL) 3165 break; 3166 MPASS(slab->us_keg == keg); 3167 LIST_INSERT_HEAD(&keg->uk_free_slab, slab, us_link); 3168 slabs--; 3169 } 3170 KEG_UNLOCK(keg); 3171} 3172 3173/* See uma.h */ 3174uint32_t * 3175uma_find_refcnt(uma_zone_t zone, void *item) 3176{ 3177 uma_slabrefcnt_t slabref; 3178 uma_slab_t slab; 3179 uma_keg_t keg; 3180 uint32_t *refcnt; 3181 int idx; 3182 3183 slab = vtoslab((vm_offset_t)item & (~UMA_SLAB_MASK)); 3184 slabref = (uma_slabrefcnt_t)slab; 3185 keg = slab->us_keg; 3186 KASSERT(keg->uk_flags & UMA_ZONE_REFCNT, 3187 ("uma_find_refcnt(): zone possibly not UMA_ZONE_REFCNT")); 3188 idx = ((uintptr_t)item - (uintptr_t)slab->us_data) / keg->uk_rsize; 3189 refcnt = &slabref->us_refcnt[idx]; 3190 return refcnt; 3191} 3192 3193/* See uma.h */ 3194static void 3195uma_reclaim_locked(bool kmem_danger) 3196{ 3197 3198#ifdef UMA_DEBUG 3199 printf("UMA: vm asked us to release pages!\n"); 3200#endif 3201 sx_assert(&uma_drain_lock, SA_XLOCKED); 3202 bucket_enable(); 3203 zone_foreach(zone_drain); 3204 if (vm_page_count_min() || kmem_danger) { 3205 cache_drain_safe(NULL); 3206 zone_foreach(zone_drain); 3207 } 3208 /* 3209 * Some slabs may have been freed but this zone will be visited early 3210 * we visit again so that we can free pages that are empty once other 3211 * zones are drained. We have to do the same for buckets. 3212 */ 3213 zone_drain(slabzone); 3214 zone_drain(slabrefzone); 3215 bucket_zone_drain(); 3216} 3217 3218void 3219uma_reclaim(void) 3220{ 3221 3222 sx_xlock(&uma_drain_lock); 3223 uma_reclaim_locked(false); 3224 sx_xunlock(&uma_drain_lock); 3225} 3226 3227static int uma_reclaim_needed; 3228 3229void 3230uma_reclaim_wakeup(void) 3231{ 3232 3233 uma_reclaim_needed = 1; 3234 wakeup(&uma_reclaim_needed); 3235} 3236 3237void 3238uma_reclaim_worker(void *arg __unused) 3239{ 3240 3241 sx_xlock(&uma_drain_lock); 3242 for (;;) { 3243 sx_sleep(&uma_reclaim_needed, &uma_drain_lock, PVM, 3244 "umarcl", 0); 3245 if (uma_reclaim_needed) { 3246 uma_reclaim_needed = 0; 3247 sx_xunlock(&uma_drain_lock); 3248 EVENTHANDLER_INVOKE(vm_lowmem, VM_LOW_KMEM); 3249 sx_xlock(&uma_drain_lock); 3250 uma_reclaim_locked(true); 3251 } 3252 } 3253} 3254 3255/* See uma.h */ 3256int 3257uma_zone_exhausted(uma_zone_t zone) 3258{ 3259 int full; 3260 3261 ZONE_LOCK(zone); 3262 full = (zone->uz_flags & UMA_ZFLAG_FULL); 3263 ZONE_UNLOCK(zone); 3264 return (full); 3265} 3266 3267int 3268uma_zone_exhausted_nolock(uma_zone_t zone) 3269{ 3270 return (zone->uz_flags & UMA_ZFLAG_FULL); 3271} 3272 3273void * 3274uma_large_malloc(vm_size_t size, int wait) 3275{ 3276 void *mem; 3277 uma_slab_t slab; 3278 uint8_t flags; 3279 3280 slab = zone_alloc_item(slabzone, NULL, wait); 3281 if (slab == NULL) 3282 return (NULL); 3283 mem = page_alloc(NULL, size, &flags, wait); 3284 if (mem) { 3285 vsetslab((vm_offset_t)mem, slab); 3286 slab->us_data = mem; 3287 slab->us_flags = flags | UMA_SLAB_MALLOC; 3288 slab->us_size = size; 3289 } else { 3290 zone_free_item(slabzone, slab, NULL, SKIP_NONE); 3291 } 3292 3293 return (mem); 3294} 3295 3296void 3297uma_large_free(uma_slab_t slab) 3298{ 3299 3300 page_free(slab->us_data, slab->us_size, slab->us_flags); 3301 zone_free_item(slabzone, slab, NULL, SKIP_NONE); 3302} 3303 3304static void 3305uma_zero_item(void *item, uma_zone_t zone) 3306{ 3307 3308 if (zone->uz_flags & UMA_ZONE_PCPU) { 3309 for (int i = 0; i < mp_ncpus; i++) 3310 bzero(zpcpu_get_cpu(item, i), zone->uz_size); 3311 } else 3312 bzero(item, zone->uz_size); 3313} 3314 3315void 3316uma_print_stats(void) 3317{ 3318 zone_foreach(uma_print_zone); 3319} 3320 3321static void 3322slab_print(uma_slab_t slab) 3323{ 3324 printf("slab: keg %p, data %p, freecount %d\n", 3325 slab->us_keg, slab->us_data, slab->us_freecount); 3326} 3327 3328static void 3329cache_print(uma_cache_t cache) 3330{ 3331 printf("alloc: %p(%d), free: %p(%d)\n", 3332 cache->uc_allocbucket, 3333 cache->uc_allocbucket?cache->uc_allocbucket->ub_cnt:0, 3334 cache->uc_freebucket, 3335 cache->uc_freebucket?cache->uc_freebucket->ub_cnt:0); 3336} 3337 3338static void 3339uma_print_keg(uma_keg_t keg) 3340{ 3341 uma_slab_t slab; 3342 3343 printf("keg: %s(%p) size %d(%d) flags %#x ipers %d ppera %d " 3344 "out %d free %d limit %d\n", 3345 keg->uk_name, keg, keg->uk_size, keg->uk_rsize, keg->uk_flags, 3346 keg->uk_ipers, keg->uk_ppera, 3347 (keg->uk_ipers * keg->uk_pages) - keg->uk_free, keg->uk_free, 3348 (keg->uk_maxpages / keg->uk_ppera) * keg->uk_ipers); 3349 printf("Part slabs:\n"); 3350 LIST_FOREACH(slab, &keg->uk_part_slab, us_link) 3351 slab_print(slab); 3352 printf("Free slabs:\n"); 3353 LIST_FOREACH(slab, &keg->uk_free_slab, us_link) 3354 slab_print(slab); 3355 printf("Full slabs:\n"); 3356 LIST_FOREACH(slab, &keg->uk_full_slab, us_link) 3357 slab_print(slab); 3358} 3359 3360void 3361uma_print_zone(uma_zone_t zone) 3362{ 3363 uma_cache_t cache; 3364 uma_klink_t kl; 3365 int i; 3366 3367 printf("zone: %s(%p) size %d flags %#x\n", 3368 zone->uz_name, zone, zone->uz_size, zone->uz_flags); 3369 LIST_FOREACH(kl, &zone->uz_kegs, kl_link) 3370 uma_print_keg(kl->kl_keg); 3371 CPU_FOREACH(i) { 3372 cache = &zone->uz_cpu[i]; 3373 printf("CPU %d Cache:\n", i); 3374 cache_print(cache); 3375 } 3376} 3377 3378#ifdef DDB 3379/* 3380 * Generate statistics across both the zone and its per-cpu cache's. Return 3381 * desired statistics if the pointer is non-NULL for that statistic. 3382 * 3383 * Note: does not update the zone statistics, as it can't safely clear the 3384 * per-CPU cache statistic. 3385 * 3386 * XXXRW: Following the uc_allocbucket and uc_freebucket pointers here isn't 3387 * safe from off-CPU; we should modify the caches to track this information 3388 * directly so that we don't have to. 3389 */ 3390static void 3391uma_zone_sumstat(uma_zone_t z, int *cachefreep, uint64_t *allocsp, 3392 uint64_t *freesp, uint64_t *sleepsp) 3393{ 3394 uma_cache_t cache; 3395 uint64_t allocs, frees, sleeps; 3396 int cachefree, cpu; 3397 3398 allocs = frees = sleeps = 0; 3399 cachefree = 0; 3400 CPU_FOREACH(cpu) { 3401 cache = &z->uz_cpu[cpu]; 3402 if (cache->uc_allocbucket != NULL) 3403 cachefree += cache->uc_allocbucket->ub_cnt; 3404 if (cache->uc_freebucket != NULL) 3405 cachefree += cache->uc_freebucket->ub_cnt; 3406 allocs += cache->uc_allocs; 3407 frees += cache->uc_frees; 3408 } 3409 allocs += z->uz_allocs; 3410 frees += z->uz_frees; 3411 sleeps += z->uz_sleeps; 3412 if (cachefreep != NULL) 3413 *cachefreep = cachefree; 3414 if (allocsp != NULL) 3415 *allocsp = allocs; 3416 if (freesp != NULL) 3417 *freesp = frees; 3418 if (sleepsp != NULL) 3419 *sleepsp = sleeps; 3420} 3421#endif /* DDB */ 3422 3423static int 3424sysctl_vm_zone_count(SYSCTL_HANDLER_ARGS) 3425{ 3426 uma_keg_t kz; 3427 uma_zone_t z; 3428 int count; 3429 3430 count = 0; 3431 rw_rlock(&uma_rwlock); 3432 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3433 LIST_FOREACH(z, &kz->uk_zones, uz_link) 3434 count++; 3435 } 3436 rw_runlock(&uma_rwlock); 3437 return (sysctl_handle_int(oidp, &count, 0, req)); 3438} 3439 3440static int 3441sysctl_vm_zone_stats(SYSCTL_HANDLER_ARGS) 3442{ 3443 struct uma_stream_header ush; 3444 struct uma_type_header uth; 3445 struct uma_percpu_stat ups; 3446 uma_bucket_t bucket; 3447 struct sbuf sbuf; 3448 uma_cache_t cache; 3449 uma_klink_t kl; 3450 uma_keg_t kz; 3451 uma_zone_t z; 3452 uma_keg_t k; 3453 int count, error, i; 3454 3455 error = sysctl_wire_old_buffer(req, 0); 3456 if (error != 0) 3457 return (error); 3458 sbuf_new_for_sysctl(&sbuf, NULL, 128, req); 3459 3460 count = 0; 3461 rw_rlock(&uma_rwlock); 3462 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3463 LIST_FOREACH(z, &kz->uk_zones, uz_link) 3464 count++; 3465 } 3466 3467 /* 3468 * Insert stream header. 3469 */ 3470 bzero(&ush, sizeof(ush)); 3471 ush.ush_version = UMA_STREAM_VERSION; 3472 ush.ush_maxcpus = (mp_maxid + 1); 3473 ush.ush_count = count; 3474 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush)); 3475 3476 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3477 LIST_FOREACH(z, &kz->uk_zones, uz_link) { 3478 bzero(&uth, sizeof(uth)); 3479 ZONE_LOCK(z); 3480 strlcpy(uth.uth_name, z->uz_name, UTH_MAX_NAME); 3481 uth.uth_align = kz->uk_align; 3482 uth.uth_size = kz->uk_size; 3483 uth.uth_rsize = kz->uk_rsize; 3484 LIST_FOREACH(kl, &z->uz_kegs, kl_link) { 3485 k = kl->kl_keg; 3486 uth.uth_maxpages += k->uk_maxpages; 3487 uth.uth_pages += k->uk_pages; 3488 uth.uth_keg_free += k->uk_free; 3489 uth.uth_limit = (k->uk_maxpages / k->uk_ppera) 3490 * k->uk_ipers; 3491 } 3492 3493 /* 3494 * A zone is secondary is it is not the first entry 3495 * on the keg's zone list. 3496 */ 3497 if ((z->uz_flags & UMA_ZONE_SECONDARY) && 3498 (LIST_FIRST(&kz->uk_zones) != z)) 3499 uth.uth_zone_flags = UTH_ZONE_SECONDARY; 3500 3501 LIST_FOREACH(bucket, &z->uz_buckets, ub_link) 3502 uth.uth_zone_free += bucket->ub_cnt; 3503 uth.uth_allocs = z->uz_allocs; 3504 uth.uth_frees = z->uz_frees; 3505 uth.uth_fails = z->uz_fails; 3506 uth.uth_sleeps = z->uz_sleeps; 3507 (void)sbuf_bcat(&sbuf, &uth, sizeof(uth)); 3508 /* 3509 * While it is not normally safe to access the cache 3510 * bucket pointers while not on the CPU that owns the 3511 * cache, we only allow the pointers to be exchanged 3512 * without the zone lock held, not invalidated, so 3513 * accept the possible race associated with bucket 3514 * exchange during monitoring. 3515 */ 3516 for (i = 0; i < (mp_maxid + 1); i++) { 3517 bzero(&ups, sizeof(ups)); 3518 if (kz->uk_flags & UMA_ZFLAG_INTERNAL) 3519 goto skip; 3520 if (CPU_ABSENT(i)) 3521 goto skip; 3522 cache = &z->uz_cpu[i]; 3523 if (cache->uc_allocbucket != NULL) 3524 ups.ups_cache_free += 3525 cache->uc_allocbucket->ub_cnt; 3526 if (cache->uc_freebucket != NULL) 3527 ups.ups_cache_free += 3528 cache->uc_freebucket->ub_cnt; 3529 ups.ups_allocs = cache->uc_allocs; 3530 ups.ups_frees = cache->uc_frees; 3531skip: 3532 (void)sbuf_bcat(&sbuf, &ups, sizeof(ups)); 3533 } 3534 ZONE_UNLOCK(z); 3535 } 3536 } 3537 rw_runlock(&uma_rwlock); 3538 error = sbuf_finish(&sbuf); 3539 sbuf_delete(&sbuf); 3540 return (error); 3541} 3542 3543int 3544sysctl_handle_uma_zone_max(SYSCTL_HANDLER_ARGS) 3545{ 3546 uma_zone_t zone = *(uma_zone_t *)arg1; 3547 int error, max, old; 3548 3549 old = max = uma_zone_get_max(zone); 3550 error = sysctl_handle_int(oidp, &max, 0, req); 3551 if (error || !req->newptr) 3552 return (error); 3553 3554 if (max < old) 3555 return (EINVAL); 3556 3557 uma_zone_set_max(zone, max); 3558 3559 return (0); 3560} 3561 3562int 3563sysctl_handle_uma_zone_cur(SYSCTL_HANDLER_ARGS) 3564{ 3565 uma_zone_t zone = *(uma_zone_t *)arg1; 3566 int cur; 3567 3568 cur = uma_zone_get_cur(zone); 3569 return (sysctl_handle_int(oidp, &cur, 0, req)); 3570} 3571 3572#ifdef DDB 3573DB_SHOW_COMMAND(uma, db_show_uma) 3574{ 3575 uint64_t allocs, frees, sleeps; 3576 uma_bucket_t bucket; 3577 uma_keg_t kz; 3578 uma_zone_t z; 3579 int cachefree; 3580 3581 db_printf("%18s %8s %8s %8s %12s %8s %8s\n", "Zone", "Size", "Used", 3582 "Free", "Requests", "Sleeps", "Bucket"); 3583 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3584 LIST_FOREACH(z, &kz->uk_zones, uz_link) { 3585 if (kz->uk_flags & UMA_ZFLAG_INTERNAL) { 3586 allocs = z->uz_allocs; 3587 frees = z->uz_frees; 3588 sleeps = z->uz_sleeps; 3589 cachefree = 0; 3590 } else 3591 uma_zone_sumstat(z, &cachefree, &allocs, 3592 &frees, &sleeps); 3593 if (!((z->uz_flags & UMA_ZONE_SECONDARY) && 3594 (LIST_FIRST(&kz->uk_zones) != z))) 3595 cachefree += kz->uk_free; 3596 LIST_FOREACH(bucket, &z->uz_buckets, ub_link) 3597 cachefree += bucket->ub_cnt; 3598 db_printf("%18s %8ju %8jd %8d %12ju %8ju %8u\n", 3599 z->uz_name, (uintmax_t)kz->uk_size, 3600 (intmax_t)(allocs - frees), cachefree, 3601 (uintmax_t)allocs, sleeps, z->uz_count); 3602 if (db_pager_quit) 3603 return; 3604 } 3605 } 3606} 3607 3608DB_SHOW_COMMAND(umacache, db_show_umacache) 3609{ 3610 uint64_t allocs, frees; 3611 uma_bucket_t bucket; 3612 uma_zone_t z; 3613 int cachefree; 3614 3615 db_printf("%18s %8s %8s %8s %12s %8s\n", "Zone", "Size", "Used", "Free", 3616 "Requests", "Bucket"); 3617 LIST_FOREACH(z, &uma_cachezones, uz_link) { 3618 uma_zone_sumstat(z, &cachefree, &allocs, &frees, NULL); 3619 LIST_FOREACH(bucket, &z->uz_buckets, ub_link) 3620 cachefree += bucket->ub_cnt; 3621 db_printf("%18s %8ju %8jd %8d %12ju %8u\n", 3622 z->uz_name, (uintmax_t)z->uz_size, 3623 (intmax_t)(allocs - frees), cachefree, 3624 (uintmax_t)allocs, z->uz_count); 3625 if (db_pager_quit) 3626 return; 3627 } 3628} 3629#endif 3630