uma_core.c revision 318169
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 318169 2017-05-11 03:37:05Z jhb $"); 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_pages / keg->uk_ppera) * keg->uk_ipers - keg->uk_free, 1542 keg->uk_free); 1543#endif 1544 1545 LIST_INSERT_HEAD(&keg->uk_zones, zone, uz_link); 1546 1547 rw_wlock(&uma_rwlock); 1548 LIST_INSERT_HEAD(&uma_kegs, keg, uk_link); 1549 rw_wunlock(&uma_rwlock); 1550 return (0); 1551} 1552 1553/* 1554 * Zone header ctor. This initializes all fields, locks, etc. 1555 * 1556 * Arguments/Returns follow uma_ctor specifications 1557 * udata Actually uma_zctor_args 1558 */ 1559static int 1560zone_ctor(void *mem, int size, void *udata, int flags) 1561{ 1562 struct uma_zctor_args *arg = udata; 1563 uma_zone_t zone = mem; 1564 uma_zone_t z; 1565 uma_keg_t keg; 1566 1567 bzero(zone, size); 1568 zone->uz_name = arg->name; 1569 zone->uz_ctor = arg->ctor; 1570 zone->uz_dtor = arg->dtor; 1571 zone->uz_slab = zone_fetch_slab; 1572 zone->uz_init = NULL; 1573 zone->uz_fini = NULL; 1574 zone->uz_allocs = 0; 1575 zone->uz_frees = 0; 1576 zone->uz_fails = 0; 1577 zone->uz_sleeps = 0; 1578 zone->uz_count = 0; 1579 zone->uz_count_min = 0; 1580 zone->uz_flags = 0; 1581 zone->uz_warning = NULL; 1582 timevalclear(&zone->uz_ratecheck); 1583 keg = arg->keg; 1584 1585 ZONE_LOCK_INIT(zone, (arg->flags & UMA_ZONE_MTXCLASS)); 1586 1587 /* 1588 * This is a pure cache zone, no kegs. 1589 */ 1590 if (arg->import) { 1591 if (arg->flags & UMA_ZONE_VM) 1592 arg->flags |= UMA_ZFLAG_CACHEONLY; 1593 zone->uz_flags = arg->flags; 1594 zone->uz_size = arg->size; 1595 zone->uz_import = arg->import; 1596 zone->uz_release = arg->release; 1597 zone->uz_arg = arg->arg; 1598 zone->uz_lockptr = &zone->uz_lock; 1599 rw_wlock(&uma_rwlock); 1600 LIST_INSERT_HEAD(&uma_cachezones, zone, uz_link); 1601 rw_wunlock(&uma_rwlock); 1602 goto out; 1603 } 1604 1605 /* 1606 * Use the regular zone/keg/slab allocator. 1607 */ 1608 zone->uz_import = (uma_import)zone_import; 1609 zone->uz_release = (uma_release)zone_release; 1610 zone->uz_arg = zone; 1611 1612 if (arg->flags & UMA_ZONE_SECONDARY) { 1613 KASSERT(arg->keg != NULL, ("Secondary zone on zero'd keg")); 1614 zone->uz_init = arg->uminit; 1615 zone->uz_fini = arg->fini; 1616 zone->uz_lockptr = &keg->uk_lock; 1617 zone->uz_flags |= UMA_ZONE_SECONDARY; 1618 rw_wlock(&uma_rwlock); 1619 ZONE_LOCK(zone); 1620 LIST_FOREACH(z, &keg->uk_zones, uz_link) { 1621 if (LIST_NEXT(z, uz_link) == NULL) { 1622 LIST_INSERT_AFTER(z, zone, uz_link); 1623 break; 1624 } 1625 } 1626 ZONE_UNLOCK(zone); 1627 rw_wunlock(&uma_rwlock); 1628 } else if (keg == NULL) { 1629 if ((keg = uma_kcreate(zone, arg->size, arg->uminit, arg->fini, 1630 arg->align, arg->flags)) == NULL) 1631 return (ENOMEM); 1632 } else { 1633 struct uma_kctor_args karg; 1634 int error; 1635 1636 /* We should only be here from uma_startup() */ 1637 karg.size = arg->size; 1638 karg.uminit = arg->uminit; 1639 karg.fini = arg->fini; 1640 karg.align = arg->align; 1641 karg.flags = arg->flags; 1642 karg.zone = zone; 1643 error = keg_ctor(arg->keg, sizeof(struct uma_keg), &karg, 1644 flags); 1645 if (error) 1646 return (error); 1647 } 1648 1649 /* 1650 * Link in the first keg. 1651 */ 1652 zone->uz_klink.kl_keg = keg; 1653 LIST_INSERT_HEAD(&zone->uz_kegs, &zone->uz_klink, kl_link); 1654 zone->uz_lockptr = &keg->uk_lock; 1655 zone->uz_size = keg->uk_size; 1656 zone->uz_flags |= (keg->uk_flags & 1657 (UMA_ZONE_INHERIT | UMA_ZFLAG_INHERIT)); 1658 1659 /* 1660 * Some internal zones don't have room allocated for the per cpu 1661 * caches. If we're internal, bail out here. 1662 */ 1663 if (keg->uk_flags & UMA_ZFLAG_INTERNAL) { 1664 KASSERT((zone->uz_flags & UMA_ZONE_SECONDARY) == 0, 1665 ("Secondary zone requested UMA_ZFLAG_INTERNAL")); 1666 return (0); 1667 } 1668 1669out: 1670 if ((arg->flags & UMA_ZONE_MAXBUCKET) == 0) 1671 zone->uz_count = bucket_select(zone->uz_size); 1672 else 1673 zone->uz_count = BUCKET_MAX; 1674 zone->uz_count_min = zone->uz_count; 1675 1676 return (0); 1677} 1678 1679/* 1680 * Keg header dtor. This frees all data, destroys locks, frees the hash 1681 * table and removes the keg from the global list. 1682 * 1683 * Arguments/Returns follow uma_dtor specifications 1684 * udata unused 1685 */ 1686static void 1687keg_dtor(void *arg, int size, void *udata) 1688{ 1689 uma_keg_t keg; 1690 1691 keg = (uma_keg_t)arg; 1692 KEG_LOCK(keg); 1693 if (keg->uk_free != 0) { 1694 printf("Freed UMA keg (%s) was not empty (%d items). " 1695 " Lost %d pages of memory.\n", 1696 keg->uk_name ? keg->uk_name : "", 1697 keg->uk_free, keg->uk_pages); 1698 } 1699 KEG_UNLOCK(keg); 1700 1701 hash_free(&keg->uk_hash); 1702 1703 KEG_LOCK_FINI(keg); 1704} 1705 1706/* 1707 * Zone header dtor. 1708 * 1709 * Arguments/Returns follow uma_dtor specifications 1710 * udata unused 1711 */ 1712static void 1713zone_dtor(void *arg, int size, void *udata) 1714{ 1715 uma_klink_t klink; 1716 uma_zone_t zone; 1717 uma_keg_t keg; 1718 1719 zone = (uma_zone_t)arg; 1720 keg = zone_first_keg(zone); 1721 1722 if (!(zone->uz_flags & UMA_ZFLAG_INTERNAL)) 1723 cache_drain(zone); 1724 1725 rw_wlock(&uma_rwlock); 1726 LIST_REMOVE(zone, uz_link); 1727 rw_wunlock(&uma_rwlock); 1728 /* 1729 * XXX there are some races here where 1730 * the zone can be drained but zone lock 1731 * released and then refilled before we 1732 * remove it... we dont care for now 1733 */ 1734 zone_drain_wait(zone, M_WAITOK); 1735 /* 1736 * Unlink all of our kegs. 1737 */ 1738 while ((klink = LIST_FIRST(&zone->uz_kegs)) != NULL) { 1739 klink->kl_keg = NULL; 1740 LIST_REMOVE(klink, kl_link); 1741 if (klink == &zone->uz_klink) 1742 continue; 1743 free(klink, M_TEMP); 1744 } 1745 /* 1746 * We only destroy kegs from non secondary zones. 1747 */ 1748 if (keg != NULL && (zone->uz_flags & UMA_ZONE_SECONDARY) == 0) { 1749 rw_wlock(&uma_rwlock); 1750 LIST_REMOVE(keg, uk_link); 1751 rw_wunlock(&uma_rwlock); 1752 zone_free_item(kegs, keg, NULL, SKIP_NONE); 1753 } 1754 ZONE_LOCK_FINI(zone); 1755} 1756 1757/* 1758 * Traverses every zone in the system and calls a callback 1759 * 1760 * Arguments: 1761 * zfunc A pointer to a function which accepts a zone 1762 * as an argument. 1763 * 1764 * Returns: 1765 * Nothing 1766 */ 1767static void 1768zone_foreach(void (*zfunc)(uma_zone_t)) 1769{ 1770 uma_keg_t keg; 1771 uma_zone_t zone; 1772 1773 rw_rlock(&uma_rwlock); 1774 LIST_FOREACH(keg, &uma_kegs, uk_link) { 1775 LIST_FOREACH(zone, &keg->uk_zones, uz_link) 1776 zfunc(zone); 1777 } 1778 rw_runlock(&uma_rwlock); 1779} 1780 1781/* Public functions */ 1782/* See uma.h */ 1783void 1784uma_startup(void *bootmem, int boot_pages) 1785{ 1786 struct uma_zctor_args args; 1787 uma_slab_t slab; 1788 u_int slabsize; 1789 int i; 1790 1791#ifdef UMA_DEBUG 1792 printf("Creating uma keg headers zone and keg.\n"); 1793#endif 1794 rw_init(&uma_rwlock, "UMA lock"); 1795 1796 /* "manually" create the initial zone */ 1797 memset(&args, 0, sizeof(args)); 1798 args.name = "UMA Kegs"; 1799 args.size = sizeof(struct uma_keg); 1800 args.ctor = keg_ctor; 1801 args.dtor = keg_dtor; 1802 args.uminit = zero_init; 1803 args.fini = NULL; 1804 args.keg = &masterkeg; 1805 args.align = 32 - 1; 1806 args.flags = UMA_ZFLAG_INTERNAL; 1807 /* The initial zone has no Per cpu queues so it's smaller */ 1808 zone_ctor(kegs, sizeof(struct uma_zone), &args, M_WAITOK); 1809 1810#ifdef UMA_DEBUG 1811 printf("Filling boot free list.\n"); 1812#endif 1813 for (i = 0; i < boot_pages; i++) { 1814 slab = (uma_slab_t)((uint8_t *)bootmem + (i * UMA_SLAB_SIZE)); 1815 slab->us_data = (uint8_t *)slab; 1816 slab->us_flags = UMA_SLAB_BOOT; 1817 LIST_INSERT_HEAD(&uma_boot_pages, slab, us_link); 1818 } 1819 mtx_init(&uma_boot_pages_mtx, "UMA boot pages", NULL, MTX_DEF); 1820 1821#ifdef UMA_DEBUG 1822 printf("Creating uma zone headers zone and keg.\n"); 1823#endif 1824 args.name = "UMA Zones"; 1825 args.size = sizeof(struct uma_zone) + 1826 (sizeof(struct uma_cache) * (mp_maxid + 1)); 1827 args.ctor = zone_ctor; 1828 args.dtor = zone_dtor; 1829 args.uminit = zero_init; 1830 args.fini = NULL; 1831 args.keg = NULL; 1832 args.align = 32 - 1; 1833 args.flags = UMA_ZFLAG_INTERNAL; 1834 /* The initial zone has no Per cpu queues so it's smaller */ 1835 zone_ctor(zones, sizeof(struct uma_zone), &args, M_WAITOK); 1836 1837#ifdef UMA_DEBUG 1838 printf("Initializing pcpu cache locks.\n"); 1839#endif 1840#ifdef UMA_DEBUG 1841 printf("Creating slab and hash zones.\n"); 1842#endif 1843 1844 /* Now make a zone for slab headers */ 1845 slabzone = uma_zcreate("UMA Slabs", 1846 sizeof(struct uma_slab), 1847 NULL, NULL, NULL, NULL, 1848 UMA_ALIGN_PTR, UMA_ZFLAG_INTERNAL); 1849 1850 /* 1851 * We also create a zone for the bigger slabs with reference 1852 * counts in them, to accomodate UMA_ZONE_REFCNT zones. 1853 */ 1854 slabsize = sizeof(struct uma_slab_refcnt); 1855 slabsize += uma_max_ipers_ref * sizeof(uint32_t); 1856 slabrefzone = uma_zcreate("UMA RCntSlabs", 1857 slabsize, 1858 NULL, NULL, NULL, NULL, 1859 UMA_ALIGN_PTR, 1860 UMA_ZFLAG_INTERNAL); 1861 1862 hashzone = uma_zcreate("UMA Hash", 1863 sizeof(struct slabhead *) * UMA_HASH_SIZE_INIT, 1864 NULL, NULL, NULL, NULL, 1865 UMA_ALIGN_PTR, UMA_ZFLAG_INTERNAL); 1866 1867 bucket_init(); 1868 1869 booted = UMA_STARTUP; 1870 1871#ifdef UMA_DEBUG 1872 printf("UMA startup complete.\n"); 1873#endif 1874} 1875 1876/* see uma.h */ 1877void 1878uma_startup2(void) 1879{ 1880 booted = UMA_STARTUP2; 1881 bucket_enable(); 1882 sx_init(&uma_drain_lock, "umadrain"); 1883#ifdef UMA_DEBUG 1884 printf("UMA startup2 complete.\n"); 1885#endif 1886} 1887 1888/* 1889 * Initialize our callout handle 1890 * 1891 */ 1892 1893static void 1894uma_startup3(void) 1895{ 1896#ifdef UMA_DEBUG 1897 printf("Starting callout.\n"); 1898#endif 1899 callout_init(&uma_callout, 1); 1900 callout_reset(&uma_callout, UMA_TIMEOUT * hz, uma_timeout, NULL); 1901#ifdef UMA_DEBUG 1902 printf("UMA startup3 complete.\n"); 1903#endif 1904} 1905 1906static uma_keg_t 1907uma_kcreate(uma_zone_t zone, size_t size, uma_init uminit, uma_fini fini, 1908 int align, uint32_t flags) 1909{ 1910 struct uma_kctor_args args; 1911 1912 args.size = size; 1913 args.uminit = uminit; 1914 args.fini = fini; 1915 args.align = (align == UMA_ALIGN_CACHE) ? uma_align_cache : align; 1916 args.flags = flags; 1917 args.zone = zone; 1918 return (zone_alloc_item(kegs, &args, M_WAITOK)); 1919} 1920 1921/* See uma.h */ 1922void 1923uma_set_align(int align) 1924{ 1925 1926 if (align != UMA_ALIGN_CACHE) 1927 uma_align_cache = align; 1928} 1929 1930/* See uma.h */ 1931uma_zone_t 1932uma_zcreate(const char *name, size_t size, uma_ctor ctor, uma_dtor dtor, 1933 uma_init uminit, uma_fini fini, int align, uint32_t flags) 1934 1935{ 1936 struct uma_zctor_args args; 1937 uma_zone_t res; 1938 bool locked; 1939 1940 KASSERT(powerof2(align + 1), ("invalid zone alignment %d for \"%s\"", 1941 align, name)); 1942 1943 /* This stuff is essential for the zone ctor */ 1944 memset(&args, 0, sizeof(args)); 1945 args.name = name; 1946 args.size = size; 1947 args.ctor = ctor; 1948 args.dtor = dtor; 1949 args.uminit = uminit; 1950 args.fini = fini; 1951 args.align = align; 1952 args.flags = flags; 1953 args.keg = NULL; 1954 1955 if (booted < UMA_STARTUP2) { 1956 locked = false; 1957 } else { 1958 sx_slock(&uma_drain_lock); 1959 locked = true; 1960 } 1961 res = zone_alloc_item(zones, &args, M_WAITOK); 1962 if (locked) 1963 sx_sunlock(&uma_drain_lock); 1964 return (res); 1965} 1966 1967/* See uma.h */ 1968uma_zone_t 1969uma_zsecond_create(char *name, uma_ctor ctor, uma_dtor dtor, 1970 uma_init zinit, uma_fini zfini, uma_zone_t master) 1971{ 1972 struct uma_zctor_args args; 1973 uma_keg_t keg; 1974 uma_zone_t res; 1975 bool locked; 1976 1977 keg = zone_first_keg(master); 1978 memset(&args, 0, sizeof(args)); 1979 args.name = name; 1980 args.size = keg->uk_size; 1981 args.ctor = ctor; 1982 args.dtor = dtor; 1983 args.uminit = zinit; 1984 args.fini = zfini; 1985 args.align = keg->uk_align; 1986 args.flags = keg->uk_flags | UMA_ZONE_SECONDARY; 1987 args.keg = keg; 1988 1989 if (booted < UMA_STARTUP2) { 1990 locked = false; 1991 } else { 1992 sx_slock(&uma_drain_lock); 1993 locked = true; 1994 } 1995 /* XXX Attaches only one keg of potentially many. */ 1996 res = zone_alloc_item(zones, &args, M_WAITOK); 1997 if (locked) 1998 sx_sunlock(&uma_drain_lock); 1999 return (res); 2000} 2001 2002/* See uma.h */ 2003uma_zone_t 2004uma_zcache_create(char *name, int size, uma_ctor ctor, uma_dtor dtor, 2005 uma_init zinit, uma_fini zfini, uma_import zimport, 2006 uma_release zrelease, void *arg, int flags) 2007{ 2008 struct uma_zctor_args args; 2009 2010 memset(&args, 0, sizeof(args)); 2011 args.name = name; 2012 args.size = size; 2013 args.ctor = ctor; 2014 args.dtor = dtor; 2015 args.uminit = zinit; 2016 args.fini = zfini; 2017 args.import = zimport; 2018 args.release = zrelease; 2019 args.arg = arg; 2020 args.align = 0; 2021 args.flags = flags; 2022 2023 return (zone_alloc_item(zones, &args, M_WAITOK)); 2024} 2025 2026static void 2027zone_lock_pair(uma_zone_t a, uma_zone_t b) 2028{ 2029 if (a < b) { 2030 ZONE_LOCK(a); 2031 mtx_lock_flags(b->uz_lockptr, MTX_DUPOK); 2032 } else { 2033 ZONE_LOCK(b); 2034 mtx_lock_flags(a->uz_lockptr, MTX_DUPOK); 2035 } 2036} 2037 2038static void 2039zone_unlock_pair(uma_zone_t a, uma_zone_t b) 2040{ 2041 2042 ZONE_UNLOCK(a); 2043 ZONE_UNLOCK(b); 2044} 2045 2046int 2047uma_zsecond_add(uma_zone_t zone, uma_zone_t master) 2048{ 2049 uma_klink_t klink; 2050 uma_klink_t kl; 2051 int error; 2052 2053 error = 0; 2054 klink = malloc(sizeof(*klink), M_TEMP, M_WAITOK | M_ZERO); 2055 2056 zone_lock_pair(zone, master); 2057 /* 2058 * zone must use vtoslab() to resolve objects and must already be 2059 * a secondary. 2060 */ 2061 if ((zone->uz_flags & (UMA_ZONE_VTOSLAB | UMA_ZONE_SECONDARY)) 2062 != (UMA_ZONE_VTOSLAB | UMA_ZONE_SECONDARY)) { 2063 error = EINVAL; 2064 goto out; 2065 } 2066 /* 2067 * The new master must also use vtoslab(). 2068 */ 2069 if ((zone->uz_flags & UMA_ZONE_VTOSLAB) != UMA_ZONE_VTOSLAB) { 2070 error = EINVAL; 2071 goto out; 2072 } 2073 /* 2074 * Both must either be refcnt, or not be refcnt. 2075 */ 2076 if ((zone->uz_flags & UMA_ZONE_REFCNT) != 2077 (master->uz_flags & UMA_ZONE_REFCNT)) { 2078 error = EINVAL; 2079 goto out; 2080 } 2081 /* 2082 * The underlying object must be the same size. rsize 2083 * may be different. 2084 */ 2085 if (master->uz_size != zone->uz_size) { 2086 error = E2BIG; 2087 goto out; 2088 } 2089 /* 2090 * Put it at the end of the list. 2091 */ 2092 klink->kl_keg = zone_first_keg(master); 2093 LIST_FOREACH(kl, &zone->uz_kegs, kl_link) { 2094 if (LIST_NEXT(kl, kl_link) == NULL) { 2095 LIST_INSERT_AFTER(kl, klink, kl_link); 2096 break; 2097 } 2098 } 2099 klink = NULL; 2100 zone->uz_flags |= UMA_ZFLAG_MULTI; 2101 zone->uz_slab = zone_fetch_slab_multi; 2102 2103out: 2104 zone_unlock_pair(zone, master); 2105 if (klink != NULL) 2106 free(klink, M_TEMP); 2107 2108 return (error); 2109} 2110 2111 2112/* See uma.h */ 2113void 2114uma_zdestroy(uma_zone_t zone) 2115{ 2116 2117 sx_slock(&uma_drain_lock); 2118 zone_free_item(zones, zone, NULL, SKIP_NONE); 2119 sx_sunlock(&uma_drain_lock); 2120} 2121 2122/* See uma.h */ 2123void * 2124uma_zalloc_arg(uma_zone_t zone, void *udata, int flags) 2125{ 2126 void *item; 2127 uma_cache_t cache; 2128 uma_bucket_t bucket; 2129 int lockfail; 2130 int cpu; 2131 2132 /* This is the fast path allocation */ 2133#ifdef UMA_DEBUG_ALLOC_1 2134 printf("Allocating one item from %s(%p)\n", zone->uz_name, zone); 2135#endif 2136 CTR3(KTR_UMA, "uma_zalloc_arg thread %x zone %s flags %d", curthread, 2137 zone->uz_name, flags); 2138 2139 if (flags & M_WAITOK) { 2140 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, 2141 "uma_zalloc_arg: zone \"%s\"", zone->uz_name); 2142 } 2143#ifdef DEBUG_MEMGUARD 2144 if (memguard_cmp_zone(zone)) { 2145 item = memguard_alloc(zone->uz_size, flags); 2146 if (item != NULL) { 2147 /* 2148 * Avoid conflict with the use-after-free 2149 * protecting infrastructure from INVARIANTS. 2150 */ 2151 if (zone->uz_init != NULL && 2152 zone->uz_init != mtrash_init && 2153 zone->uz_init(item, zone->uz_size, flags) != 0) 2154 return (NULL); 2155 if (zone->uz_ctor != NULL && 2156 zone->uz_ctor != mtrash_ctor && 2157 zone->uz_ctor(item, zone->uz_size, udata, 2158 flags) != 0) { 2159 zone->uz_fini(item, zone->uz_size); 2160 return (NULL); 2161 } 2162 return (item); 2163 } 2164 /* This is unfortunate but should not be fatal. */ 2165 } 2166#endif 2167 /* 2168 * If possible, allocate from the per-CPU cache. There are two 2169 * requirements for safe access to the per-CPU cache: (1) the thread 2170 * accessing the cache must not be preempted or yield during access, 2171 * and (2) the thread must not migrate CPUs without switching which 2172 * cache it accesses. We rely on a critical section to prevent 2173 * preemption and migration. We release the critical section in 2174 * order to acquire the zone mutex if we are unable to allocate from 2175 * the current cache; when we re-acquire the critical section, we 2176 * must detect and handle migration if it has occurred. 2177 */ 2178 critical_enter(); 2179 cpu = curcpu; 2180 cache = &zone->uz_cpu[cpu]; 2181 2182zalloc_start: 2183 bucket = cache->uc_allocbucket; 2184 if (bucket != NULL && bucket->ub_cnt > 0) { 2185 bucket->ub_cnt--; 2186 item = bucket->ub_bucket[bucket->ub_cnt]; 2187#ifdef INVARIANTS 2188 bucket->ub_bucket[bucket->ub_cnt] = NULL; 2189#endif 2190 KASSERT(item != NULL, ("uma_zalloc: Bucket pointer mangled.")); 2191 cache->uc_allocs++; 2192 critical_exit(); 2193 if (zone->uz_ctor != NULL && 2194 zone->uz_ctor(item, zone->uz_size, udata, flags) != 0) { 2195 atomic_add_long(&zone->uz_fails, 1); 2196 zone_free_item(zone, item, udata, SKIP_DTOR); 2197 return (NULL); 2198 } 2199#ifdef INVARIANTS 2200 uma_dbg_alloc(zone, NULL, item); 2201#endif 2202 if (flags & M_ZERO) 2203 uma_zero_item(item, zone); 2204 return (item); 2205 } 2206 2207 /* 2208 * We have run out of items in our alloc bucket. 2209 * See if we can switch with our free bucket. 2210 */ 2211 bucket = cache->uc_freebucket; 2212 if (bucket != NULL && bucket->ub_cnt > 0) { 2213#ifdef UMA_DEBUG_ALLOC 2214 printf("uma_zalloc: Swapping empty with alloc.\n"); 2215#endif 2216 cache->uc_freebucket = cache->uc_allocbucket; 2217 cache->uc_allocbucket = bucket; 2218 goto zalloc_start; 2219 } 2220 2221 /* 2222 * Discard any empty allocation bucket while we hold no locks. 2223 */ 2224 bucket = cache->uc_allocbucket; 2225 cache->uc_allocbucket = NULL; 2226 critical_exit(); 2227 if (bucket != NULL) 2228 bucket_free(zone, bucket, udata); 2229 2230 /* Short-circuit for zones without buckets and low memory. */ 2231 if (zone->uz_count == 0 || bucketdisable) 2232 goto zalloc_item; 2233 2234 /* 2235 * Attempt to retrieve the item from the per-CPU cache has failed, so 2236 * we must go back to the zone. This requires the zone lock, so we 2237 * must drop the critical section, then re-acquire it when we go back 2238 * to the cache. Since the critical section is released, we may be 2239 * preempted or migrate. As such, make sure not to maintain any 2240 * thread-local state specific to the cache from prior to releasing 2241 * the critical section. 2242 */ 2243 lockfail = 0; 2244 if (ZONE_TRYLOCK(zone) == 0) { 2245 /* Record contention to size the buckets. */ 2246 ZONE_LOCK(zone); 2247 lockfail = 1; 2248 } 2249 critical_enter(); 2250 cpu = curcpu; 2251 cache = &zone->uz_cpu[cpu]; 2252 2253 /* 2254 * Since we have locked the zone we may as well send back our stats. 2255 */ 2256 atomic_add_long(&zone->uz_allocs, cache->uc_allocs); 2257 atomic_add_long(&zone->uz_frees, cache->uc_frees); 2258 cache->uc_allocs = 0; 2259 cache->uc_frees = 0; 2260 2261 /* See if we lost the race to fill the cache. */ 2262 if (cache->uc_allocbucket != NULL) { 2263 ZONE_UNLOCK(zone); 2264 goto zalloc_start; 2265 } 2266 2267 /* 2268 * Check the zone's cache of buckets. 2269 */ 2270 if ((bucket = LIST_FIRST(&zone->uz_buckets)) != NULL) { 2271 KASSERT(bucket->ub_cnt != 0, 2272 ("uma_zalloc_arg: Returning an empty bucket.")); 2273 2274 LIST_REMOVE(bucket, ub_link); 2275 cache->uc_allocbucket = bucket; 2276 ZONE_UNLOCK(zone); 2277 goto zalloc_start; 2278 } 2279 /* We are no longer associated with this CPU. */ 2280 critical_exit(); 2281 2282 /* 2283 * We bump the uz count when the cache size is insufficient to 2284 * handle the working set. 2285 */ 2286 if (lockfail && zone->uz_count < BUCKET_MAX) 2287 zone->uz_count++; 2288 ZONE_UNLOCK(zone); 2289 2290 /* 2291 * Now lets just fill a bucket and put it on the free list. If that 2292 * works we'll restart the allocation from the begining and it 2293 * will use the just filled bucket. 2294 */ 2295 bucket = zone_alloc_bucket(zone, udata, flags); 2296 if (bucket != NULL) { 2297 ZONE_LOCK(zone); 2298 critical_enter(); 2299 cpu = curcpu; 2300 cache = &zone->uz_cpu[cpu]; 2301 /* 2302 * See if we lost the race or were migrated. Cache the 2303 * initialized bucket to make this less likely or claim 2304 * the memory directly. 2305 */ 2306 if (cache->uc_allocbucket == NULL) 2307 cache->uc_allocbucket = bucket; 2308 else 2309 LIST_INSERT_HEAD(&zone->uz_buckets, bucket, ub_link); 2310 ZONE_UNLOCK(zone); 2311 goto zalloc_start; 2312 } 2313 2314 /* 2315 * We may not be able to get a bucket so return an actual item. 2316 */ 2317#ifdef UMA_DEBUG 2318 printf("uma_zalloc_arg: Bucketzone returned NULL\n"); 2319#endif 2320 2321zalloc_item: 2322 item = zone_alloc_item(zone, udata, flags); 2323 2324 return (item); 2325} 2326 2327static uma_slab_t 2328keg_fetch_slab(uma_keg_t keg, uma_zone_t zone, int flags) 2329{ 2330 uma_slab_t slab; 2331 int reserve; 2332 2333 mtx_assert(&keg->uk_lock, MA_OWNED); 2334 slab = NULL; 2335 reserve = 0; 2336 if ((flags & M_USE_RESERVE) == 0) 2337 reserve = keg->uk_reserve; 2338 2339 for (;;) { 2340 /* 2341 * Find a slab with some space. Prefer slabs that are partially 2342 * used over those that are totally full. This helps to reduce 2343 * fragmentation. 2344 */ 2345 if (keg->uk_free > reserve) { 2346 if (!LIST_EMPTY(&keg->uk_part_slab)) { 2347 slab = LIST_FIRST(&keg->uk_part_slab); 2348 } else { 2349 slab = LIST_FIRST(&keg->uk_free_slab); 2350 LIST_REMOVE(slab, us_link); 2351 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, 2352 us_link); 2353 } 2354 MPASS(slab->us_keg == keg); 2355 return (slab); 2356 } 2357 2358 /* 2359 * M_NOVM means don't ask at all! 2360 */ 2361 if (flags & M_NOVM) 2362 break; 2363 2364 if (keg->uk_maxpages && keg->uk_pages >= keg->uk_maxpages) { 2365 keg->uk_flags |= UMA_ZFLAG_FULL; 2366 /* 2367 * If this is not a multi-zone, set the FULL bit. 2368 * Otherwise slab_multi() takes care of it. 2369 */ 2370 if ((zone->uz_flags & UMA_ZFLAG_MULTI) == 0) { 2371 zone->uz_flags |= UMA_ZFLAG_FULL; 2372 zone_log_warning(zone); 2373 } 2374 if (flags & M_NOWAIT) 2375 break; 2376 zone->uz_sleeps++; 2377 msleep(keg, &keg->uk_lock, PVM, "keglimit", 0); 2378 continue; 2379 } 2380 slab = keg_alloc_slab(keg, zone, flags); 2381 /* 2382 * If we got a slab here it's safe to mark it partially used 2383 * and return. We assume that the caller is going to remove 2384 * at least one item. 2385 */ 2386 if (slab) { 2387 MPASS(slab->us_keg == keg); 2388 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, us_link); 2389 return (slab); 2390 } 2391 /* 2392 * We might not have been able to get a slab but another cpu 2393 * could have while we were unlocked. Check again before we 2394 * fail. 2395 */ 2396 flags |= M_NOVM; 2397 } 2398 return (slab); 2399} 2400 2401static uma_slab_t 2402zone_fetch_slab(uma_zone_t zone, uma_keg_t keg, int flags) 2403{ 2404 uma_slab_t slab; 2405 2406 if (keg == NULL) { 2407 keg = zone_first_keg(zone); 2408 KEG_LOCK(keg); 2409 } 2410 2411 for (;;) { 2412 slab = keg_fetch_slab(keg, zone, flags); 2413 if (slab) 2414 return (slab); 2415 if (flags & (M_NOWAIT | M_NOVM)) 2416 break; 2417 } 2418 KEG_UNLOCK(keg); 2419 return (NULL); 2420} 2421 2422/* 2423 * uma_zone_fetch_slab_multi: Fetches a slab from one available keg. Returns 2424 * with the keg locked. On NULL no lock is held. 2425 * 2426 * The last pointer is used to seed the search. It is not required. 2427 */ 2428static uma_slab_t 2429zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int rflags) 2430{ 2431 uma_klink_t klink; 2432 uma_slab_t slab; 2433 uma_keg_t keg; 2434 int flags; 2435 int empty; 2436 int full; 2437 2438 /* 2439 * Don't wait on the first pass. This will skip limit tests 2440 * as well. We don't want to block if we can find a provider 2441 * without blocking. 2442 */ 2443 flags = (rflags & ~M_WAITOK) | M_NOWAIT; 2444 /* 2445 * Use the last slab allocated as a hint for where to start 2446 * the search. 2447 */ 2448 if (last != NULL) { 2449 slab = keg_fetch_slab(last, zone, flags); 2450 if (slab) 2451 return (slab); 2452 KEG_UNLOCK(last); 2453 } 2454 /* 2455 * Loop until we have a slab incase of transient failures 2456 * while M_WAITOK is specified. I'm not sure this is 100% 2457 * required but we've done it for so long now. 2458 */ 2459 for (;;) { 2460 empty = 0; 2461 full = 0; 2462 /* 2463 * Search the available kegs for slabs. Be careful to hold the 2464 * correct lock while calling into the keg layer. 2465 */ 2466 LIST_FOREACH(klink, &zone->uz_kegs, kl_link) { 2467 keg = klink->kl_keg; 2468 KEG_LOCK(keg); 2469 if ((keg->uk_flags & UMA_ZFLAG_FULL) == 0) { 2470 slab = keg_fetch_slab(keg, zone, flags); 2471 if (slab) 2472 return (slab); 2473 } 2474 if (keg->uk_flags & UMA_ZFLAG_FULL) 2475 full++; 2476 else 2477 empty++; 2478 KEG_UNLOCK(keg); 2479 } 2480 if (rflags & (M_NOWAIT | M_NOVM)) 2481 break; 2482 flags = rflags; 2483 /* 2484 * All kegs are full. XXX We can't atomically check all kegs 2485 * and sleep so just sleep for a short period and retry. 2486 */ 2487 if (full && !empty) { 2488 ZONE_LOCK(zone); 2489 zone->uz_flags |= UMA_ZFLAG_FULL; 2490 zone->uz_sleeps++; 2491 zone_log_warning(zone); 2492 msleep(zone, zone->uz_lockptr, PVM, 2493 "zonelimit", hz/100); 2494 zone->uz_flags &= ~UMA_ZFLAG_FULL; 2495 ZONE_UNLOCK(zone); 2496 continue; 2497 } 2498 } 2499 return (NULL); 2500} 2501 2502static void * 2503slab_alloc_item(uma_keg_t keg, uma_slab_t slab) 2504{ 2505 void *item; 2506 uint8_t freei; 2507 2508 MPASS(keg == slab->us_keg); 2509 mtx_assert(&keg->uk_lock, MA_OWNED); 2510 2511 freei = BIT_FFS(SLAB_SETSIZE, &slab->us_free) - 1; 2512 BIT_CLR(SLAB_SETSIZE, freei, &slab->us_free); 2513 item = slab->us_data + (keg->uk_rsize * freei); 2514 slab->us_freecount--; 2515 keg->uk_free--; 2516 2517 /* Move this slab to the full list */ 2518 if (slab->us_freecount == 0) { 2519 LIST_REMOVE(slab, us_link); 2520 LIST_INSERT_HEAD(&keg->uk_full_slab, slab, us_link); 2521 } 2522 2523 return (item); 2524} 2525 2526static int 2527zone_import(uma_zone_t zone, void **bucket, int max, int flags) 2528{ 2529 uma_slab_t slab; 2530 uma_keg_t keg; 2531 int i; 2532 2533 slab = NULL; 2534 keg = NULL; 2535 /* Try to keep the buckets totally full */ 2536 for (i = 0; i < max; ) { 2537 if ((slab = zone->uz_slab(zone, keg, flags)) == NULL) 2538 break; 2539 keg = slab->us_keg; 2540 while (slab->us_freecount && i < max) { 2541 bucket[i++] = slab_alloc_item(keg, slab); 2542 if (keg->uk_free <= keg->uk_reserve) 2543 break; 2544 } 2545 /* Don't grab more than one slab at a time. */ 2546 flags &= ~M_WAITOK; 2547 flags |= M_NOWAIT; 2548 } 2549 if (slab != NULL) 2550 KEG_UNLOCK(keg); 2551 2552 return i; 2553} 2554 2555static uma_bucket_t 2556zone_alloc_bucket(uma_zone_t zone, void *udata, int flags) 2557{ 2558 uma_bucket_t bucket; 2559 int max; 2560 2561 /* Don't wait for buckets, preserve caller's NOVM setting. */ 2562 bucket = bucket_alloc(zone, udata, M_NOWAIT | (flags & M_NOVM)); 2563 if (bucket == NULL) 2564 return (NULL); 2565 2566 max = MIN(bucket->ub_entries, zone->uz_count); 2567 bucket->ub_cnt = zone->uz_import(zone->uz_arg, bucket->ub_bucket, 2568 max, flags); 2569 2570 /* 2571 * Initialize the memory if necessary. 2572 */ 2573 if (bucket->ub_cnt != 0 && zone->uz_init != NULL) { 2574 int i; 2575 2576 for (i = 0; i < bucket->ub_cnt; i++) 2577 if (zone->uz_init(bucket->ub_bucket[i], zone->uz_size, 2578 flags) != 0) 2579 break; 2580 /* 2581 * If we couldn't initialize the whole bucket, put the 2582 * rest back onto the freelist. 2583 */ 2584 if (i != bucket->ub_cnt) { 2585 zone->uz_release(zone->uz_arg, &bucket->ub_bucket[i], 2586 bucket->ub_cnt - i); 2587#ifdef INVARIANTS 2588 bzero(&bucket->ub_bucket[i], 2589 sizeof(void *) * (bucket->ub_cnt - i)); 2590#endif 2591 bucket->ub_cnt = i; 2592 } 2593 } 2594 2595 if (bucket->ub_cnt == 0) { 2596 bucket_free(zone, bucket, udata); 2597 atomic_add_long(&zone->uz_fails, 1); 2598 return (NULL); 2599 } 2600 2601 return (bucket); 2602} 2603 2604/* 2605 * Allocates a single item from a zone. 2606 * 2607 * Arguments 2608 * zone The zone to alloc for. 2609 * udata The data to be passed to the constructor. 2610 * flags M_WAITOK, M_NOWAIT, M_ZERO. 2611 * 2612 * Returns 2613 * NULL if there is no memory and M_NOWAIT is set 2614 * An item if successful 2615 */ 2616 2617static void * 2618zone_alloc_item(uma_zone_t zone, void *udata, int flags) 2619{ 2620 void *item; 2621 2622 item = NULL; 2623 2624#ifdef UMA_DEBUG_ALLOC 2625 printf("INTERNAL: Allocating one item from %s(%p)\n", zone->uz_name, zone); 2626#endif 2627 if (zone->uz_import(zone->uz_arg, &item, 1, flags) != 1) 2628 goto fail; 2629 atomic_add_long(&zone->uz_allocs, 1); 2630 2631 /* 2632 * We have to call both the zone's init (not the keg's init) 2633 * and the zone's ctor. This is because the item is going from 2634 * a keg slab directly to the user, and the user is expecting it 2635 * to be both zone-init'd as well as zone-ctor'd. 2636 */ 2637 if (zone->uz_init != NULL) { 2638 if (zone->uz_init(item, zone->uz_size, flags) != 0) { 2639 zone_free_item(zone, item, udata, SKIP_FINI); 2640 goto fail; 2641 } 2642 } 2643 if (zone->uz_ctor != NULL) { 2644 if (zone->uz_ctor(item, zone->uz_size, udata, flags) != 0) { 2645 zone_free_item(zone, item, udata, SKIP_DTOR); 2646 goto fail; 2647 } 2648 } 2649#ifdef INVARIANTS 2650 uma_dbg_alloc(zone, NULL, item); 2651#endif 2652 if (flags & M_ZERO) 2653 uma_zero_item(item, zone); 2654 2655 return (item); 2656 2657fail: 2658 atomic_add_long(&zone->uz_fails, 1); 2659 return (NULL); 2660} 2661 2662/* See uma.h */ 2663void 2664uma_zfree_arg(uma_zone_t zone, void *item, void *udata) 2665{ 2666 uma_cache_t cache; 2667 uma_bucket_t bucket; 2668 int lockfail; 2669 int cpu; 2670 2671#ifdef UMA_DEBUG_ALLOC_1 2672 printf("Freeing item %p to %s(%p)\n", item, zone->uz_name, zone); 2673#endif 2674 CTR2(KTR_UMA, "uma_zfree_arg thread %x zone %s", curthread, 2675 zone->uz_name); 2676 2677 /* uma_zfree(..., NULL) does nothing, to match free(9). */ 2678 if (item == NULL) 2679 return; 2680#ifdef DEBUG_MEMGUARD 2681 if (is_memguard_addr(item)) { 2682 if (zone->uz_dtor != NULL && zone->uz_dtor != mtrash_dtor) 2683 zone->uz_dtor(item, zone->uz_size, udata); 2684 if (zone->uz_fini != NULL && zone->uz_fini != mtrash_fini) 2685 zone->uz_fini(item, zone->uz_size); 2686 memguard_free(item); 2687 return; 2688 } 2689#endif 2690#ifdef INVARIANTS 2691 if (zone->uz_flags & UMA_ZONE_MALLOC) 2692 uma_dbg_free(zone, udata, item); 2693 else 2694 uma_dbg_free(zone, NULL, item); 2695#endif 2696 if (zone->uz_dtor != NULL) 2697 zone->uz_dtor(item, zone->uz_size, udata); 2698 2699 /* 2700 * The race here is acceptable. If we miss it we'll just have to wait 2701 * a little longer for the limits to be reset. 2702 */ 2703 if (zone->uz_flags & UMA_ZFLAG_FULL) 2704 goto zfree_item; 2705 2706 /* 2707 * If possible, free to the per-CPU cache. There are two 2708 * requirements for safe access to the per-CPU cache: (1) the thread 2709 * accessing the cache must not be preempted or yield during access, 2710 * and (2) the thread must not migrate CPUs without switching which 2711 * cache it accesses. We rely on a critical section to prevent 2712 * preemption and migration. We release the critical section in 2713 * order to acquire the zone mutex if we are unable to free to the 2714 * current cache; when we re-acquire the critical section, we must 2715 * detect and handle migration if it has occurred. 2716 */ 2717zfree_restart: 2718 critical_enter(); 2719 cpu = curcpu; 2720 cache = &zone->uz_cpu[cpu]; 2721 2722zfree_start: 2723 /* 2724 * Try to free into the allocbucket first to give LIFO ordering 2725 * for cache-hot datastructures. Spill over into the freebucket 2726 * if necessary. Alloc will swap them if one runs dry. 2727 */ 2728 bucket = cache->uc_allocbucket; 2729 if (bucket == NULL || bucket->ub_cnt >= bucket->ub_entries) 2730 bucket = cache->uc_freebucket; 2731 if (bucket != NULL && bucket->ub_cnt < bucket->ub_entries) { 2732 KASSERT(bucket->ub_bucket[bucket->ub_cnt] == NULL, 2733 ("uma_zfree: Freeing to non free bucket index.")); 2734 bucket->ub_bucket[bucket->ub_cnt] = item; 2735 bucket->ub_cnt++; 2736 cache->uc_frees++; 2737 critical_exit(); 2738 return; 2739 } 2740 2741 /* 2742 * We must go back the zone, which requires acquiring the zone lock, 2743 * which in turn means we must release and re-acquire the critical 2744 * section. Since the critical section is released, we may be 2745 * preempted or migrate. As such, make sure not to maintain any 2746 * thread-local state specific to the cache from prior to releasing 2747 * the critical section. 2748 */ 2749 critical_exit(); 2750 if (zone->uz_count == 0 || bucketdisable) 2751 goto zfree_item; 2752 2753 lockfail = 0; 2754 if (ZONE_TRYLOCK(zone) == 0) { 2755 /* Record contention to size the buckets. */ 2756 ZONE_LOCK(zone); 2757 lockfail = 1; 2758 } 2759 critical_enter(); 2760 cpu = curcpu; 2761 cache = &zone->uz_cpu[cpu]; 2762 2763 /* 2764 * Since we have locked the zone we may as well send back our stats. 2765 */ 2766 atomic_add_long(&zone->uz_allocs, cache->uc_allocs); 2767 atomic_add_long(&zone->uz_frees, cache->uc_frees); 2768 cache->uc_allocs = 0; 2769 cache->uc_frees = 0; 2770 2771 bucket = cache->uc_freebucket; 2772 if (bucket != NULL && bucket->ub_cnt < bucket->ub_entries) { 2773 ZONE_UNLOCK(zone); 2774 goto zfree_start; 2775 } 2776 cache->uc_freebucket = NULL; 2777 /* We are no longer associated with this CPU. */ 2778 critical_exit(); 2779 2780 /* Can we throw this on the zone full list? */ 2781 if (bucket != NULL) { 2782#ifdef UMA_DEBUG_ALLOC 2783 printf("uma_zfree: Putting old bucket on the free list.\n"); 2784#endif 2785 /* ub_cnt is pointing to the last free item */ 2786 KASSERT(bucket->ub_cnt != 0, 2787 ("uma_zfree: Attempting to insert an empty bucket onto the full list.\n")); 2788 LIST_INSERT_HEAD(&zone->uz_buckets, bucket, ub_link); 2789 } 2790 2791 /* 2792 * We bump the uz count when the cache size is insufficient to 2793 * handle the working set. 2794 */ 2795 if (lockfail && zone->uz_count < BUCKET_MAX) 2796 zone->uz_count++; 2797 ZONE_UNLOCK(zone); 2798 2799#ifdef UMA_DEBUG_ALLOC 2800 printf("uma_zfree: Allocating new free bucket.\n"); 2801#endif 2802 bucket = bucket_alloc(zone, udata, M_NOWAIT); 2803 if (bucket) { 2804 critical_enter(); 2805 cpu = curcpu; 2806 cache = &zone->uz_cpu[cpu]; 2807 if (cache->uc_freebucket == NULL) { 2808 cache->uc_freebucket = bucket; 2809 goto zfree_start; 2810 } 2811 /* 2812 * We lost the race, start over. We have to drop our 2813 * critical section to free the bucket. 2814 */ 2815 critical_exit(); 2816 bucket_free(zone, bucket, udata); 2817 goto zfree_restart; 2818 } 2819 2820 /* 2821 * If nothing else caught this, we'll just do an internal free. 2822 */ 2823zfree_item: 2824 zone_free_item(zone, item, udata, SKIP_DTOR); 2825 2826 return; 2827} 2828 2829static void 2830slab_free_item(uma_keg_t keg, uma_slab_t slab, void *item) 2831{ 2832 uint8_t freei; 2833 2834 mtx_assert(&keg->uk_lock, MA_OWNED); 2835 MPASS(keg == slab->us_keg); 2836 2837 /* Do we need to remove from any lists? */ 2838 if (slab->us_freecount+1 == keg->uk_ipers) { 2839 LIST_REMOVE(slab, us_link); 2840 LIST_INSERT_HEAD(&keg->uk_free_slab, slab, us_link); 2841 } else if (slab->us_freecount == 0) { 2842 LIST_REMOVE(slab, us_link); 2843 LIST_INSERT_HEAD(&keg->uk_part_slab, slab, us_link); 2844 } 2845 2846 /* Slab management. */ 2847 freei = ((uintptr_t)item - (uintptr_t)slab->us_data) / keg->uk_rsize; 2848 BIT_SET(SLAB_SETSIZE, freei, &slab->us_free); 2849 slab->us_freecount++; 2850 2851 /* Keg statistics. */ 2852 keg->uk_free++; 2853} 2854 2855static void 2856zone_release(uma_zone_t zone, void **bucket, int cnt) 2857{ 2858 void *item; 2859 uma_slab_t slab; 2860 uma_keg_t keg; 2861 uint8_t *mem; 2862 int clearfull; 2863 int i; 2864 2865 clearfull = 0; 2866 keg = zone_first_keg(zone); 2867 KEG_LOCK(keg); 2868 for (i = 0; i < cnt; i++) { 2869 item = bucket[i]; 2870 if (!(zone->uz_flags & UMA_ZONE_VTOSLAB)) { 2871 mem = (uint8_t *)((uintptr_t)item & (~UMA_SLAB_MASK)); 2872 if (zone->uz_flags & UMA_ZONE_HASH) { 2873 slab = hash_sfind(&keg->uk_hash, mem); 2874 } else { 2875 mem += keg->uk_pgoff; 2876 slab = (uma_slab_t)mem; 2877 } 2878 } else { 2879 slab = vtoslab((vm_offset_t)item); 2880 if (slab->us_keg != keg) { 2881 KEG_UNLOCK(keg); 2882 keg = slab->us_keg; 2883 KEG_LOCK(keg); 2884 } 2885 } 2886 slab_free_item(keg, slab, item); 2887 if (keg->uk_flags & UMA_ZFLAG_FULL) { 2888 if (keg->uk_pages < keg->uk_maxpages) { 2889 keg->uk_flags &= ~UMA_ZFLAG_FULL; 2890 clearfull = 1; 2891 } 2892 2893 /* 2894 * We can handle one more allocation. Since we're 2895 * clearing ZFLAG_FULL, wake up all procs blocked 2896 * on pages. This should be uncommon, so keeping this 2897 * simple for now (rather than adding count of blocked 2898 * threads etc). 2899 */ 2900 wakeup(keg); 2901 } 2902 } 2903 KEG_UNLOCK(keg); 2904 if (clearfull) { 2905 ZONE_LOCK(zone); 2906 zone->uz_flags &= ~UMA_ZFLAG_FULL; 2907 wakeup(zone); 2908 ZONE_UNLOCK(zone); 2909 } 2910 2911} 2912 2913/* 2914 * Frees a single item to any zone. 2915 * 2916 * Arguments: 2917 * zone The zone to free to 2918 * item The item we're freeing 2919 * udata User supplied data for the dtor 2920 * skip Skip dtors and finis 2921 */ 2922static void 2923zone_free_item(uma_zone_t zone, void *item, void *udata, enum zfreeskip skip) 2924{ 2925 2926#ifdef INVARIANTS 2927 if (skip == SKIP_NONE) { 2928 if (zone->uz_flags & UMA_ZONE_MALLOC) 2929 uma_dbg_free(zone, udata, item); 2930 else 2931 uma_dbg_free(zone, NULL, item); 2932 } 2933#endif 2934 if (skip < SKIP_DTOR && zone->uz_dtor) 2935 zone->uz_dtor(item, zone->uz_size, udata); 2936 2937 if (skip < SKIP_FINI && zone->uz_fini) 2938 zone->uz_fini(item, zone->uz_size); 2939 2940 atomic_add_long(&zone->uz_frees, 1); 2941 zone->uz_release(zone->uz_arg, &item, 1); 2942} 2943 2944/* See uma.h */ 2945int 2946uma_zone_set_max(uma_zone_t zone, int nitems) 2947{ 2948 uma_keg_t keg; 2949 2950 keg = zone_first_keg(zone); 2951 if (keg == NULL) 2952 return (0); 2953 KEG_LOCK(keg); 2954 keg->uk_maxpages = (nitems / keg->uk_ipers) * keg->uk_ppera; 2955 if (keg->uk_maxpages * keg->uk_ipers < nitems) 2956 keg->uk_maxpages += keg->uk_ppera; 2957 nitems = (keg->uk_maxpages / keg->uk_ppera) * keg->uk_ipers; 2958 KEG_UNLOCK(keg); 2959 2960 return (nitems); 2961} 2962 2963/* See uma.h */ 2964int 2965uma_zone_get_max(uma_zone_t zone) 2966{ 2967 int nitems; 2968 uma_keg_t keg; 2969 2970 keg = zone_first_keg(zone); 2971 if (keg == NULL) 2972 return (0); 2973 KEG_LOCK(keg); 2974 nitems = (keg->uk_maxpages / keg->uk_ppera) * keg->uk_ipers; 2975 KEG_UNLOCK(keg); 2976 2977 return (nitems); 2978} 2979 2980/* See uma.h */ 2981void 2982uma_zone_set_warning(uma_zone_t zone, const char *warning) 2983{ 2984 2985 ZONE_LOCK(zone); 2986 zone->uz_warning = warning; 2987 ZONE_UNLOCK(zone); 2988} 2989 2990/* See uma.h */ 2991int 2992uma_zone_get_cur(uma_zone_t zone) 2993{ 2994 int64_t nitems; 2995 u_int i; 2996 2997 ZONE_LOCK(zone); 2998 nitems = zone->uz_allocs - zone->uz_frees; 2999 CPU_FOREACH(i) { 3000 /* 3001 * See the comment in sysctl_vm_zone_stats() regarding the 3002 * safety of accessing the per-cpu caches. With the zone lock 3003 * held, it is safe, but can potentially result in stale data. 3004 */ 3005 nitems += zone->uz_cpu[i].uc_allocs - 3006 zone->uz_cpu[i].uc_frees; 3007 } 3008 ZONE_UNLOCK(zone); 3009 3010 return (nitems < 0 ? 0 : nitems); 3011} 3012 3013/* See uma.h */ 3014void 3015uma_zone_set_init(uma_zone_t zone, uma_init uminit) 3016{ 3017 uma_keg_t keg; 3018 3019 keg = zone_first_keg(zone); 3020 KASSERT(keg != NULL, ("uma_zone_set_init: Invalid zone type")); 3021 KEG_LOCK(keg); 3022 KASSERT(keg->uk_pages == 0, 3023 ("uma_zone_set_init on non-empty keg")); 3024 keg->uk_init = uminit; 3025 KEG_UNLOCK(keg); 3026} 3027 3028/* See uma.h */ 3029void 3030uma_zone_set_fini(uma_zone_t zone, uma_fini fini) 3031{ 3032 uma_keg_t keg; 3033 3034 keg = zone_first_keg(zone); 3035 KASSERT(keg != NULL, ("uma_zone_set_fini: Invalid zone type")); 3036 KEG_LOCK(keg); 3037 KASSERT(keg->uk_pages == 0, 3038 ("uma_zone_set_fini on non-empty keg")); 3039 keg->uk_fini = fini; 3040 KEG_UNLOCK(keg); 3041} 3042 3043/* See uma.h */ 3044void 3045uma_zone_set_zinit(uma_zone_t zone, uma_init zinit) 3046{ 3047 3048 ZONE_LOCK(zone); 3049 KASSERT(zone_first_keg(zone)->uk_pages == 0, 3050 ("uma_zone_set_zinit on non-empty keg")); 3051 zone->uz_init = zinit; 3052 ZONE_UNLOCK(zone); 3053} 3054 3055/* See uma.h */ 3056void 3057uma_zone_set_zfini(uma_zone_t zone, uma_fini zfini) 3058{ 3059 3060 ZONE_LOCK(zone); 3061 KASSERT(zone_first_keg(zone)->uk_pages == 0, 3062 ("uma_zone_set_zfini on non-empty keg")); 3063 zone->uz_fini = zfini; 3064 ZONE_UNLOCK(zone); 3065} 3066 3067/* See uma.h */ 3068/* XXX uk_freef is not actually used with the zone locked */ 3069void 3070uma_zone_set_freef(uma_zone_t zone, uma_free freef) 3071{ 3072 uma_keg_t keg; 3073 3074 keg = zone_first_keg(zone); 3075 KASSERT(keg != NULL, ("uma_zone_set_freef: Invalid zone type")); 3076 KEG_LOCK(keg); 3077 keg->uk_freef = freef; 3078 KEG_UNLOCK(keg); 3079} 3080 3081/* See uma.h */ 3082/* XXX uk_allocf is not actually used with the zone locked */ 3083void 3084uma_zone_set_allocf(uma_zone_t zone, uma_alloc allocf) 3085{ 3086 uma_keg_t keg; 3087 3088 keg = zone_first_keg(zone); 3089 KEG_LOCK(keg); 3090 keg->uk_allocf = allocf; 3091 KEG_UNLOCK(keg); 3092} 3093 3094/* See uma.h */ 3095void 3096uma_zone_reserve(uma_zone_t zone, int items) 3097{ 3098 uma_keg_t keg; 3099 3100 keg = zone_first_keg(zone); 3101 if (keg == NULL) 3102 return; 3103 KEG_LOCK(keg); 3104 keg->uk_reserve = items; 3105 KEG_UNLOCK(keg); 3106 3107 return; 3108} 3109 3110/* See uma.h */ 3111int 3112uma_zone_reserve_kva(uma_zone_t zone, int count) 3113{ 3114 uma_keg_t keg; 3115 vm_offset_t kva; 3116 u_int pages; 3117 3118 keg = zone_first_keg(zone); 3119 if (keg == NULL) 3120 return (0); 3121 pages = count / keg->uk_ipers; 3122 3123 if (pages * keg->uk_ipers < count) 3124 pages++; 3125 pages *= keg->uk_ppera; 3126 3127#ifdef UMA_MD_SMALL_ALLOC 3128 if (keg->uk_ppera > 1) { 3129#else 3130 if (1) { 3131#endif 3132 kva = kva_alloc((vm_size_t)pages * PAGE_SIZE); 3133 if (kva == 0) 3134 return (0); 3135 } else 3136 kva = 0; 3137 KEG_LOCK(keg); 3138 keg->uk_kva = kva; 3139 keg->uk_offset = 0; 3140 keg->uk_maxpages = pages; 3141#ifdef UMA_MD_SMALL_ALLOC 3142 keg->uk_allocf = (keg->uk_ppera > 1) ? noobj_alloc : uma_small_alloc; 3143#else 3144 keg->uk_allocf = noobj_alloc; 3145#endif 3146 keg->uk_flags |= UMA_ZONE_NOFREE; 3147 KEG_UNLOCK(keg); 3148 3149 return (1); 3150} 3151 3152/* See uma.h */ 3153void 3154uma_prealloc(uma_zone_t zone, int items) 3155{ 3156 int slabs; 3157 uma_slab_t slab; 3158 uma_keg_t keg; 3159 3160 keg = zone_first_keg(zone); 3161 if (keg == NULL) 3162 return; 3163 KEG_LOCK(keg); 3164 slabs = items / keg->uk_ipers; 3165 if (slabs * keg->uk_ipers < items) 3166 slabs++; 3167 while (slabs > 0) { 3168 slab = keg_alloc_slab(keg, zone, M_WAITOK); 3169 if (slab == NULL) 3170 break; 3171 MPASS(slab->us_keg == keg); 3172 LIST_INSERT_HEAD(&keg->uk_free_slab, slab, us_link); 3173 slabs--; 3174 } 3175 KEG_UNLOCK(keg); 3176} 3177 3178/* See uma.h */ 3179uint32_t * 3180uma_find_refcnt(uma_zone_t zone, void *item) 3181{ 3182 uma_slabrefcnt_t slabref; 3183 uma_slab_t slab; 3184 uma_keg_t keg; 3185 uint32_t *refcnt; 3186 int idx; 3187 3188 slab = vtoslab((vm_offset_t)item & (~UMA_SLAB_MASK)); 3189 slabref = (uma_slabrefcnt_t)slab; 3190 keg = slab->us_keg; 3191 KASSERT(keg->uk_flags & UMA_ZONE_REFCNT, 3192 ("uma_find_refcnt(): zone possibly not UMA_ZONE_REFCNT")); 3193 idx = ((uintptr_t)item - (uintptr_t)slab->us_data) / keg->uk_rsize; 3194 refcnt = &slabref->us_refcnt[idx]; 3195 return refcnt; 3196} 3197 3198/* See uma.h */ 3199static void 3200uma_reclaim_locked(bool kmem_danger) 3201{ 3202 3203#ifdef UMA_DEBUG 3204 printf("UMA: vm asked us to release pages!\n"); 3205#endif 3206 sx_assert(&uma_drain_lock, SA_XLOCKED); 3207 bucket_enable(); 3208 zone_foreach(zone_drain); 3209 if (vm_page_count_min() || kmem_danger) { 3210 cache_drain_safe(NULL); 3211 zone_foreach(zone_drain); 3212 } 3213 /* 3214 * Some slabs may have been freed but this zone will be visited early 3215 * we visit again so that we can free pages that are empty once other 3216 * zones are drained. We have to do the same for buckets. 3217 */ 3218 zone_drain(slabzone); 3219 zone_drain(slabrefzone); 3220 bucket_zone_drain(); 3221} 3222 3223void 3224uma_reclaim(void) 3225{ 3226 3227 sx_xlock(&uma_drain_lock); 3228 uma_reclaim_locked(false); 3229 sx_xunlock(&uma_drain_lock); 3230} 3231 3232static int uma_reclaim_needed; 3233 3234void 3235uma_reclaim_wakeup(void) 3236{ 3237 3238 uma_reclaim_needed = 1; 3239 wakeup(&uma_reclaim_needed); 3240} 3241 3242void 3243uma_reclaim_worker(void *arg __unused) 3244{ 3245 3246 sx_xlock(&uma_drain_lock); 3247 for (;;) { 3248 sx_sleep(&uma_reclaim_needed, &uma_drain_lock, PVM, 3249 "umarcl", 0); 3250 if (uma_reclaim_needed) { 3251 uma_reclaim_needed = 0; 3252 sx_xunlock(&uma_drain_lock); 3253 EVENTHANDLER_INVOKE(vm_lowmem, VM_LOW_KMEM); 3254 sx_xlock(&uma_drain_lock); 3255 uma_reclaim_locked(true); 3256 } 3257 } 3258} 3259 3260/* See uma.h */ 3261int 3262uma_zone_exhausted(uma_zone_t zone) 3263{ 3264 int full; 3265 3266 ZONE_LOCK(zone); 3267 full = (zone->uz_flags & UMA_ZFLAG_FULL); 3268 ZONE_UNLOCK(zone); 3269 return (full); 3270} 3271 3272int 3273uma_zone_exhausted_nolock(uma_zone_t zone) 3274{ 3275 return (zone->uz_flags & UMA_ZFLAG_FULL); 3276} 3277 3278void * 3279uma_large_malloc(vm_size_t size, int wait) 3280{ 3281 void *mem; 3282 uma_slab_t slab; 3283 uint8_t flags; 3284 3285 slab = zone_alloc_item(slabzone, NULL, wait); 3286 if (slab == NULL) 3287 return (NULL); 3288 mem = page_alloc(NULL, size, &flags, wait); 3289 if (mem) { 3290 vsetslab((vm_offset_t)mem, slab); 3291 slab->us_data = mem; 3292 slab->us_flags = flags | UMA_SLAB_MALLOC; 3293 slab->us_size = size; 3294 } else { 3295 zone_free_item(slabzone, slab, NULL, SKIP_NONE); 3296 } 3297 3298 return (mem); 3299} 3300 3301void 3302uma_large_free(uma_slab_t slab) 3303{ 3304 3305 page_free(slab->us_data, slab->us_size, slab->us_flags); 3306 zone_free_item(slabzone, slab, NULL, SKIP_NONE); 3307} 3308 3309static void 3310uma_zero_item(void *item, uma_zone_t zone) 3311{ 3312 3313 if (zone->uz_flags & UMA_ZONE_PCPU) { 3314 for (int i = 0; i < mp_ncpus; i++) 3315 bzero(zpcpu_get_cpu(item, i), zone->uz_size); 3316 } else 3317 bzero(item, zone->uz_size); 3318} 3319 3320void 3321uma_print_stats(void) 3322{ 3323 zone_foreach(uma_print_zone); 3324} 3325 3326static void 3327slab_print(uma_slab_t slab) 3328{ 3329 printf("slab: keg %p, data %p, freecount %d\n", 3330 slab->us_keg, slab->us_data, slab->us_freecount); 3331} 3332 3333static void 3334cache_print(uma_cache_t cache) 3335{ 3336 printf("alloc: %p(%d), free: %p(%d)\n", 3337 cache->uc_allocbucket, 3338 cache->uc_allocbucket?cache->uc_allocbucket->ub_cnt:0, 3339 cache->uc_freebucket, 3340 cache->uc_freebucket?cache->uc_freebucket->ub_cnt:0); 3341} 3342 3343static void 3344uma_print_keg(uma_keg_t keg) 3345{ 3346 uma_slab_t slab; 3347 3348 printf("keg: %s(%p) size %d(%d) flags %#x ipers %d ppera %d " 3349 "out %d free %d limit %d\n", 3350 keg->uk_name, keg, keg->uk_size, keg->uk_rsize, keg->uk_flags, 3351 keg->uk_ipers, keg->uk_ppera, 3352 (keg->uk_pages / keg->uk_ppera) * keg->uk_ipers - keg->uk_free, 3353 keg->uk_free, (keg->uk_maxpages / keg->uk_ppera) * keg->uk_ipers); 3354 printf("Part slabs:\n"); 3355 LIST_FOREACH(slab, &keg->uk_part_slab, us_link) 3356 slab_print(slab); 3357 printf("Free slabs:\n"); 3358 LIST_FOREACH(slab, &keg->uk_free_slab, us_link) 3359 slab_print(slab); 3360 printf("Full slabs:\n"); 3361 LIST_FOREACH(slab, &keg->uk_full_slab, us_link) 3362 slab_print(slab); 3363} 3364 3365void 3366uma_print_zone(uma_zone_t zone) 3367{ 3368 uma_cache_t cache; 3369 uma_klink_t kl; 3370 int i; 3371 3372 printf("zone: %s(%p) size %d flags %#x\n", 3373 zone->uz_name, zone, zone->uz_size, zone->uz_flags); 3374 LIST_FOREACH(kl, &zone->uz_kegs, kl_link) 3375 uma_print_keg(kl->kl_keg); 3376 CPU_FOREACH(i) { 3377 cache = &zone->uz_cpu[i]; 3378 printf("CPU %d Cache:\n", i); 3379 cache_print(cache); 3380 } 3381} 3382 3383#ifdef DDB 3384/* 3385 * Generate statistics across both the zone and its per-cpu cache's. Return 3386 * desired statistics if the pointer is non-NULL for that statistic. 3387 * 3388 * Note: does not update the zone statistics, as it can't safely clear the 3389 * per-CPU cache statistic. 3390 * 3391 * XXXRW: Following the uc_allocbucket and uc_freebucket pointers here isn't 3392 * safe from off-CPU; we should modify the caches to track this information 3393 * directly so that we don't have to. 3394 */ 3395static void 3396uma_zone_sumstat(uma_zone_t z, int *cachefreep, uint64_t *allocsp, 3397 uint64_t *freesp, uint64_t *sleepsp) 3398{ 3399 uma_cache_t cache; 3400 uint64_t allocs, frees, sleeps; 3401 int cachefree, cpu; 3402 3403 allocs = frees = sleeps = 0; 3404 cachefree = 0; 3405 CPU_FOREACH(cpu) { 3406 cache = &z->uz_cpu[cpu]; 3407 if (cache->uc_allocbucket != NULL) 3408 cachefree += cache->uc_allocbucket->ub_cnt; 3409 if (cache->uc_freebucket != NULL) 3410 cachefree += cache->uc_freebucket->ub_cnt; 3411 allocs += cache->uc_allocs; 3412 frees += cache->uc_frees; 3413 } 3414 allocs += z->uz_allocs; 3415 frees += z->uz_frees; 3416 sleeps += z->uz_sleeps; 3417 if (cachefreep != NULL) 3418 *cachefreep = cachefree; 3419 if (allocsp != NULL) 3420 *allocsp = allocs; 3421 if (freesp != NULL) 3422 *freesp = frees; 3423 if (sleepsp != NULL) 3424 *sleepsp = sleeps; 3425} 3426#endif /* DDB */ 3427 3428static int 3429sysctl_vm_zone_count(SYSCTL_HANDLER_ARGS) 3430{ 3431 uma_keg_t kz; 3432 uma_zone_t z; 3433 int count; 3434 3435 count = 0; 3436 rw_rlock(&uma_rwlock); 3437 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3438 LIST_FOREACH(z, &kz->uk_zones, uz_link) 3439 count++; 3440 } 3441 rw_runlock(&uma_rwlock); 3442 return (sysctl_handle_int(oidp, &count, 0, req)); 3443} 3444 3445static int 3446sysctl_vm_zone_stats(SYSCTL_HANDLER_ARGS) 3447{ 3448 struct uma_stream_header ush; 3449 struct uma_type_header uth; 3450 struct uma_percpu_stat ups; 3451 uma_bucket_t bucket; 3452 struct sbuf sbuf; 3453 uma_cache_t cache; 3454 uma_klink_t kl; 3455 uma_keg_t kz; 3456 uma_zone_t z; 3457 uma_keg_t k; 3458 int count, error, i; 3459 3460 error = sysctl_wire_old_buffer(req, 0); 3461 if (error != 0) 3462 return (error); 3463 sbuf_new_for_sysctl(&sbuf, NULL, 128, req); 3464 3465 count = 0; 3466 rw_rlock(&uma_rwlock); 3467 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3468 LIST_FOREACH(z, &kz->uk_zones, uz_link) 3469 count++; 3470 } 3471 3472 /* 3473 * Insert stream header. 3474 */ 3475 bzero(&ush, sizeof(ush)); 3476 ush.ush_version = UMA_STREAM_VERSION; 3477 ush.ush_maxcpus = (mp_maxid + 1); 3478 ush.ush_count = count; 3479 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush)); 3480 3481 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3482 LIST_FOREACH(z, &kz->uk_zones, uz_link) { 3483 bzero(&uth, sizeof(uth)); 3484 ZONE_LOCK(z); 3485 strlcpy(uth.uth_name, z->uz_name, UTH_MAX_NAME); 3486 uth.uth_align = kz->uk_align; 3487 uth.uth_size = kz->uk_size; 3488 uth.uth_rsize = kz->uk_rsize; 3489 LIST_FOREACH(kl, &z->uz_kegs, kl_link) { 3490 k = kl->kl_keg; 3491 uth.uth_maxpages += k->uk_maxpages; 3492 uth.uth_pages += k->uk_pages; 3493 uth.uth_keg_free += k->uk_free; 3494 uth.uth_limit = (k->uk_maxpages / k->uk_ppera) 3495 * k->uk_ipers; 3496 } 3497 3498 /* 3499 * A zone is secondary is it is not the first entry 3500 * on the keg's zone list. 3501 */ 3502 if ((z->uz_flags & UMA_ZONE_SECONDARY) && 3503 (LIST_FIRST(&kz->uk_zones) != z)) 3504 uth.uth_zone_flags = UTH_ZONE_SECONDARY; 3505 3506 LIST_FOREACH(bucket, &z->uz_buckets, ub_link) 3507 uth.uth_zone_free += bucket->ub_cnt; 3508 uth.uth_allocs = z->uz_allocs; 3509 uth.uth_frees = z->uz_frees; 3510 uth.uth_fails = z->uz_fails; 3511 uth.uth_sleeps = z->uz_sleeps; 3512 (void)sbuf_bcat(&sbuf, &uth, sizeof(uth)); 3513 /* 3514 * While it is not normally safe to access the cache 3515 * bucket pointers while not on the CPU that owns the 3516 * cache, we only allow the pointers to be exchanged 3517 * without the zone lock held, not invalidated, so 3518 * accept the possible race associated with bucket 3519 * exchange during monitoring. 3520 */ 3521 for (i = 0; i < (mp_maxid + 1); i++) { 3522 bzero(&ups, sizeof(ups)); 3523 if (kz->uk_flags & UMA_ZFLAG_INTERNAL) 3524 goto skip; 3525 if (CPU_ABSENT(i)) 3526 goto skip; 3527 cache = &z->uz_cpu[i]; 3528 if (cache->uc_allocbucket != NULL) 3529 ups.ups_cache_free += 3530 cache->uc_allocbucket->ub_cnt; 3531 if (cache->uc_freebucket != NULL) 3532 ups.ups_cache_free += 3533 cache->uc_freebucket->ub_cnt; 3534 ups.ups_allocs = cache->uc_allocs; 3535 ups.ups_frees = cache->uc_frees; 3536skip: 3537 (void)sbuf_bcat(&sbuf, &ups, sizeof(ups)); 3538 } 3539 ZONE_UNLOCK(z); 3540 } 3541 } 3542 rw_runlock(&uma_rwlock); 3543 error = sbuf_finish(&sbuf); 3544 sbuf_delete(&sbuf); 3545 return (error); 3546} 3547 3548int 3549sysctl_handle_uma_zone_max(SYSCTL_HANDLER_ARGS) 3550{ 3551 uma_zone_t zone = *(uma_zone_t *)arg1; 3552 int error, max, old; 3553 3554 old = max = uma_zone_get_max(zone); 3555 error = sysctl_handle_int(oidp, &max, 0, req); 3556 if (error || !req->newptr) 3557 return (error); 3558 3559 if (max < old) 3560 return (EINVAL); 3561 3562 uma_zone_set_max(zone, max); 3563 3564 return (0); 3565} 3566 3567int 3568sysctl_handle_uma_zone_cur(SYSCTL_HANDLER_ARGS) 3569{ 3570 uma_zone_t zone = *(uma_zone_t *)arg1; 3571 int cur; 3572 3573 cur = uma_zone_get_cur(zone); 3574 return (sysctl_handle_int(oidp, &cur, 0, req)); 3575} 3576 3577#ifdef DDB 3578DB_SHOW_COMMAND(uma, db_show_uma) 3579{ 3580 uint64_t allocs, frees, sleeps; 3581 uma_bucket_t bucket; 3582 uma_keg_t kz; 3583 uma_zone_t z; 3584 int cachefree; 3585 3586 db_printf("%18s %8s %8s %8s %12s %8s %8s\n", "Zone", "Size", "Used", 3587 "Free", "Requests", "Sleeps", "Bucket"); 3588 LIST_FOREACH(kz, &uma_kegs, uk_link) { 3589 LIST_FOREACH(z, &kz->uk_zones, uz_link) { 3590 if (kz->uk_flags & UMA_ZFLAG_INTERNAL) { 3591 allocs = z->uz_allocs; 3592 frees = z->uz_frees; 3593 sleeps = z->uz_sleeps; 3594 cachefree = 0; 3595 } else 3596 uma_zone_sumstat(z, &cachefree, &allocs, 3597 &frees, &sleeps); 3598 if (!((z->uz_flags & UMA_ZONE_SECONDARY) && 3599 (LIST_FIRST(&kz->uk_zones) != z))) 3600 cachefree += kz->uk_free; 3601 LIST_FOREACH(bucket, &z->uz_buckets, ub_link) 3602 cachefree += bucket->ub_cnt; 3603 db_printf("%18s %8ju %8jd %8d %12ju %8ju %8u\n", 3604 z->uz_name, (uintmax_t)kz->uk_size, 3605 (intmax_t)(allocs - frees), cachefree, 3606 (uintmax_t)allocs, sleeps, z->uz_count); 3607 if (db_pager_quit) 3608 return; 3609 } 3610 } 3611} 3612 3613DB_SHOW_COMMAND(umacache, db_show_umacache) 3614{ 3615 uint64_t allocs, frees; 3616 uma_bucket_t bucket; 3617 uma_zone_t z; 3618 int cachefree; 3619 3620 db_printf("%18s %8s %8s %8s %12s %8s\n", "Zone", "Size", "Used", "Free", 3621 "Requests", "Bucket"); 3622 LIST_FOREACH(z, &uma_cachezones, uz_link) { 3623 uma_zone_sumstat(z, &cachefree, &allocs, &frees, NULL); 3624 LIST_FOREACH(bucket, &z->uz_buckets, ub_link) 3625 cachefree += bucket->ub_cnt; 3626 db_printf("%18s %8ju %8jd %8d %12ju %8u\n", 3627 z->uz_name, (uintmax_t)z->uz_size, 3628 (intmax_t)(allocs - frees), cachefree, 3629 (uintmax_t)allocs, z->uz_count); 3630 if (db_pager_quit) 3631 return; 3632 } 3633} 3634#endif 3635