2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2002-2006 Rice University
5 * Copyright (c) 2007 Alan L. Cox <alc@cs.rice.edu>
8 * This software was developed for the FreeBSD Project by Alan L. Cox,
9 * Olivier Crameri, Peter Druschel, Sitaram Iyer, and Juan Navarro.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
27 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
30 * WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 * POSSIBILITY OF SUCH DAMAGE.
35 * Physical memory system implementation
37 * Any external functions defined by this module are only to be used by the
38 * virtual memory system.
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
47 #include <sys/param.h>
48 #include <sys/systm.h>
49 #include <sys/domainset.h>
51 #include <sys/kernel.h>
52 #include <sys/malloc.h>
53 #include <sys/mutex.h>
55 #include <sys/queue.h>
56 #include <sys/rwlock.h>
58 #include <sys/sysctl.h>
60 #include <sys/vmmeter.h>
65 #include <vm/vm_param.h>
66 #include <vm/vm_kern.h>
67 #include <vm/vm_object.h>
68 #include <vm/vm_page.h>
69 #include <vm/vm_phys.h>
70 #include <vm/vm_pagequeue.h>
72 _Static_assert(sizeof(long) * NBBY >= VM_PHYSSEG_MAX,
73 "Too many physsegs.");
76 struct mem_affinity __read_mostly *mem_affinity;
77 int __read_mostly *mem_locality;
80 int __read_mostly vm_ndomains = 1;
81 domainset_t __read_mostly all_domains = DOMAINSET_T_INITIALIZER(0x1);
83 struct vm_phys_seg __read_mostly vm_phys_segs[VM_PHYSSEG_MAX];
84 int __read_mostly vm_phys_nsegs;
86 struct vm_phys_fictitious_seg;
87 static int vm_phys_fictitious_cmp(struct vm_phys_fictitious_seg *,
88 struct vm_phys_fictitious_seg *);
90 RB_HEAD(fict_tree, vm_phys_fictitious_seg) vm_phys_fictitious_tree =
91 RB_INITIALIZER(_vm_phys_fictitious_tree);
93 struct vm_phys_fictitious_seg {
94 RB_ENTRY(vm_phys_fictitious_seg) node;
95 /* Memory region data */
101 RB_GENERATE_STATIC(fict_tree, vm_phys_fictitious_seg, node,
102 vm_phys_fictitious_cmp);
104 static struct rwlock_padalign vm_phys_fictitious_reg_lock;
105 MALLOC_DEFINE(M_FICT_PAGES, "vm_fictitious", "Fictitious VM pages");
107 static struct vm_freelist __aligned(CACHE_LINE_SIZE)
108 vm_phys_free_queues[MAXMEMDOM][VM_NFREELIST][VM_NFREEPOOL]
111 static int __read_mostly vm_nfreelists;
114 * Provides the mapping from VM_FREELIST_* to free list indices (flind).
116 static int __read_mostly vm_freelist_to_flind[VM_NFREELIST];
118 CTASSERT(VM_FREELIST_DEFAULT == 0);
120 #ifdef VM_FREELIST_DMA32
121 #define VM_DMA32_BOUNDARY ((vm_paddr_t)1 << 32)
125 * Enforce the assumptions made by vm_phys_add_seg() and vm_phys_init() about
126 * the ordering of the free list boundaries.
128 #if defined(VM_LOWMEM_BOUNDARY) && defined(VM_DMA32_BOUNDARY)
129 CTASSERT(VM_LOWMEM_BOUNDARY < VM_DMA32_BOUNDARY);
132 static int sysctl_vm_phys_free(SYSCTL_HANDLER_ARGS);
133 SYSCTL_OID(_vm, OID_AUTO, phys_free, CTLTYPE_STRING | CTLFLAG_RD,
134 NULL, 0, sysctl_vm_phys_free, "A", "Phys Free Info");
136 static int sysctl_vm_phys_segs(SYSCTL_HANDLER_ARGS);
137 SYSCTL_OID(_vm, OID_AUTO, phys_segs, CTLTYPE_STRING | CTLFLAG_RD,
138 NULL, 0, sysctl_vm_phys_segs, "A", "Phys Seg Info");
141 static int sysctl_vm_phys_locality(SYSCTL_HANDLER_ARGS);
142 SYSCTL_OID(_vm, OID_AUTO, phys_locality, CTLTYPE_STRING | CTLFLAG_RD,
143 NULL, 0, sysctl_vm_phys_locality, "A", "Phys Locality Info");
146 SYSCTL_INT(_vm, OID_AUTO, ndomains, CTLFLAG_RD,
147 &vm_ndomains, 0, "Number of physical memory domains available.");
149 static vm_page_t vm_phys_alloc_seg_contig(struct vm_phys_seg *seg,
150 u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
151 vm_paddr_t boundary);
152 static void _vm_phys_create_seg(vm_paddr_t start, vm_paddr_t end, int domain);
153 static void vm_phys_create_seg(vm_paddr_t start, vm_paddr_t end);
154 static void vm_phys_split_pages(vm_page_t m, int oind, struct vm_freelist *fl,
155 int order, int tail);
158 * Red-black tree helpers for vm fictitious range management.
161 vm_phys_fictitious_in_range(struct vm_phys_fictitious_seg *p,
162 struct vm_phys_fictitious_seg *range)
165 KASSERT(range->start != 0 && range->end != 0,
166 ("Invalid range passed on search for vm_fictitious page"));
167 if (p->start >= range->end)
169 if (p->start < range->start)
176 vm_phys_fictitious_cmp(struct vm_phys_fictitious_seg *p1,
177 struct vm_phys_fictitious_seg *p2)
180 /* Check if this is a search for a page */
182 return (vm_phys_fictitious_in_range(p1, p2));
184 KASSERT(p2->end != 0,
185 ("Invalid range passed as second parameter to vm fictitious comparison"));
187 /* Searching to add a new range */
188 if (p1->end <= p2->start)
190 if (p1->start >= p2->end)
193 panic("Trying to add overlapping vm fictitious ranges:\n"
194 "[%#jx:%#jx] and [%#jx:%#jx]", (uintmax_t)p1->start,
195 (uintmax_t)p1->end, (uintmax_t)p2->start, (uintmax_t)p2->end);
199 vm_phys_domain_match(int prefer, vm_paddr_t low, vm_paddr_t high)
205 if (vm_ndomains == 1 || mem_affinity == NULL)
208 DOMAINSET_ZERO(&mask);
210 * Check for any memory that overlaps low, high.
212 for (i = 0; mem_affinity[i].end != 0; i++)
213 if (mem_affinity[i].start <= high &&
214 mem_affinity[i].end >= low)
215 DOMAINSET_SET(mem_affinity[i].domain, &mask);
216 if (prefer != -1 && DOMAINSET_ISSET(prefer, &mask))
218 if (DOMAINSET_EMPTY(&mask))
219 panic("vm_phys_domain_match: Impossible constraint");
220 return (DOMAINSET_FFS(&mask) - 1);
227 * Outputs the state of the physical memory allocator, specifically,
228 * the amount of physical memory in each free list.
231 sysctl_vm_phys_free(SYSCTL_HANDLER_ARGS)
234 struct vm_freelist *fl;
235 int dom, error, flind, oind, pind;
237 error = sysctl_wire_old_buffer(req, 0);
240 sbuf_new_for_sysctl(&sbuf, NULL, 128 * vm_ndomains, req);
241 for (dom = 0; dom < vm_ndomains; dom++) {
242 sbuf_printf(&sbuf,"\nDOMAIN %d:\n", dom);
243 for (flind = 0; flind < vm_nfreelists; flind++) {
244 sbuf_printf(&sbuf, "\nFREE LIST %d:\n"
245 "\n ORDER (SIZE) | NUMBER"
247 for (pind = 0; pind < VM_NFREEPOOL; pind++)
248 sbuf_printf(&sbuf, " | POOL %d", pind);
249 sbuf_printf(&sbuf, "\n-- ");
250 for (pind = 0; pind < VM_NFREEPOOL; pind++)
251 sbuf_printf(&sbuf, "-- -- ");
252 sbuf_printf(&sbuf, "--\n");
253 for (oind = VM_NFREEORDER - 1; oind >= 0; oind--) {
254 sbuf_printf(&sbuf, " %2d (%6dK)", oind,
255 1 << (PAGE_SHIFT - 10 + oind));
256 for (pind = 0; pind < VM_NFREEPOOL; pind++) {
257 fl = vm_phys_free_queues[dom][flind][pind];
258 sbuf_printf(&sbuf, " | %6d",
261 sbuf_printf(&sbuf, "\n");
265 error = sbuf_finish(&sbuf);
271 * Outputs the set of physical memory segments.
274 sysctl_vm_phys_segs(SYSCTL_HANDLER_ARGS)
277 struct vm_phys_seg *seg;
280 error = sysctl_wire_old_buffer(req, 0);
283 sbuf_new_for_sysctl(&sbuf, NULL, 128, req);
284 for (segind = 0; segind < vm_phys_nsegs; segind++) {
285 sbuf_printf(&sbuf, "\nSEGMENT %d:\n\n", segind);
286 seg = &vm_phys_segs[segind];
287 sbuf_printf(&sbuf, "start: %#jx\n",
288 (uintmax_t)seg->start);
289 sbuf_printf(&sbuf, "end: %#jx\n",
290 (uintmax_t)seg->end);
291 sbuf_printf(&sbuf, "domain: %d\n", seg->domain);
292 sbuf_printf(&sbuf, "free list: %p\n", seg->free_queues);
294 error = sbuf_finish(&sbuf);
300 * Return affinity, or -1 if there's no affinity information.
303 vm_phys_mem_affinity(int f, int t)
307 if (mem_locality == NULL)
309 if (f >= vm_ndomains || t >= vm_ndomains)
311 return (mem_locality[f * vm_ndomains + t]);
319 * Outputs the VM locality table.
322 sysctl_vm_phys_locality(SYSCTL_HANDLER_ARGS)
327 error = sysctl_wire_old_buffer(req, 0);
330 sbuf_new_for_sysctl(&sbuf, NULL, 128, req);
332 sbuf_printf(&sbuf, "\n");
334 for (i = 0; i < vm_ndomains; i++) {
335 sbuf_printf(&sbuf, "%d: ", i);
336 for (j = 0; j < vm_ndomains; j++) {
337 sbuf_printf(&sbuf, "%d ", vm_phys_mem_affinity(i, j));
339 sbuf_printf(&sbuf, "\n");
341 error = sbuf_finish(&sbuf);
348 vm_freelist_add(struct vm_freelist *fl, vm_page_t m, int order, int tail)
353 TAILQ_INSERT_TAIL(&fl[order].pl, m, listq);
355 TAILQ_INSERT_HEAD(&fl[order].pl, m, listq);
360 vm_freelist_rem(struct vm_freelist *fl, vm_page_t m, int order)
363 TAILQ_REMOVE(&fl[order].pl, m, listq);
365 m->order = VM_NFREEORDER;
369 * Create a physical memory segment.
372 _vm_phys_create_seg(vm_paddr_t start, vm_paddr_t end, int domain)
374 struct vm_phys_seg *seg;
376 KASSERT(vm_phys_nsegs < VM_PHYSSEG_MAX,
377 ("vm_phys_create_seg: increase VM_PHYSSEG_MAX"));
378 KASSERT(domain >= 0 && domain < vm_ndomains,
379 ("vm_phys_create_seg: invalid domain provided"));
380 seg = &vm_phys_segs[vm_phys_nsegs++];
381 while (seg > vm_phys_segs && (seg - 1)->start >= end) {
387 seg->domain = domain;
391 vm_phys_create_seg(vm_paddr_t start, vm_paddr_t end)
396 if (mem_affinity == NULL) {
397 _vm_phys_create_seg(start, end, 0);
402 if (mem_affinity[i].end == 0)
403 panic("Reached end of affinity info");
404 if (mem_affinity[i].end <= start)
406 if (mem_affinity[i].start > start)
407 panic("No affinity info for start %jx",
409 if (mem_affinity[i].end >= end) {
410 _vm_phys_create_seg(start, end,
411 mem_affinity[i].domain);
414 _vm_phys_create_seg(start, mem_affinity[i].end,
415 mem_affinity[i].domain);
416 start = mem_affinity[i].end;
419 _vm_phys_create_seg(start, end, 0);
424 * Add a physical memory segment.
427 vm_phys_add_seg(vm_paddr_t start, vm_paddr_t end)
431 KASSERT((start & PAGE_MASK) == 0,
432 ("vm_phys_define_seg: start is not page aligned"));
433 KASSERT((end & PAGE_MASK) == 0,
434 ("vm_phys_define_seg: end is not page aligned"));
437 * Split the physical memory segment if it spans two or more free
441 #ifdef VM_FREELIST_LOWMEM
442 if (paddr < VM_LOWMEM_BOUNDARY && end > VM_LOWMEM_BOUNDARY) {
443 vm_phys_create_seg(paddr, VM_LOWMEM_BOUNDARY);
444 paddr = VM_LOWMEM_BOUNDARY;
447 #ifdef VM_FREELIST_DMA32
448 if (paddr < VM_DMA32_BOUNDARY && end > VM_DMA32_BOUNDARY) {
449 vm_phys_create_seg(paddr, VM_DMA32_BOUNDARY);
450 paddr = VM_DMA32_BOUNDARY;
453 vm_phys_create_seg(paddr, end);
457 * Initialize the physical memory allocator.
459 * Requires that vm_page_array is initialized!
464 struct vm_freelist *fl;
465 struct vm_phys_seg *end_seg, *prev_seg, *seg, *tmp_seg;
467 int dom, flind, freelist, oind, pind, segind;
470 * Compute the number of free lists, and generate the mapping from the
471 * manifest constants VM_FREELIST_* to the free list indices.
473 * Initially, the entries of vm_freelist_to_flind[] are set to either
474 * 0 or 1 to indicate which free lists should be created.
477 for (segind = vm_phys_nsegs - 1; segind >= 0; segind--) {
478 seg = &vm_phys_segs[segind];
479 #ifdef VM_FREELIST_LOWMEM
480 if (seg->end <= VM_LOWMEM_BOUNDARY)
481 vm_freelist_to_flind[VM_FREELIST_LOWMEM] = 1;
484 #ifdef VM_FREELIST_DMA32
486 #ifdef VM_DMA32_NPAGES_THRESHOLD
488 * Create the DMA32 free list only if the amount of
489 * physical memory above physical address 4G exceeds the
492 npages > VM_DMA32_NPAGES_THRESHOLD &&
494 seg->end <= VM_DMA32_BOUNDARY)
495 vm_freelist_to_flind[VM_FREELIST_DMA32] = 1;
499 npages += atop(seg->end - seg->start);
500 vm_freelist_to_flind[VM_FREELIST_DEFAULT] = 1;
503 /* Change each entry into a running total of the free lists. */
504 for (freelist = 1; freelist < VM_NFREELIST; freelist++) {
505 vm_freelist_to_flind[freelist] +=
506 vm_freelist_to_flind[freelist - 1];
508 vm_nfreelists = vm_freelist_to_flind[VM_NFREELIST - 1];
509 KASSERT(vm_nfreelists > 0, ("vm_phys_init: no free lists"));
510 /* Change each entry into a free list index. */
511 for (freelist = 0; freelist < VM_NFREELIST; freelist++)
512 vm_freelist_to_flind[freelist]--;
515 * Initialize the first_page and free_queues fields of each physical
518 #ifdef VM_PHYSSEG_SPARSE
521 for (segind = 0; segind < vm_phys_nsegs; segind++) {
522 seg = &vm_phys_segs[segind];
523 #ifdef VM_PHYSSEG_SPARSE
524 seg->first_page = &vm_page_array[npages];
525 npages += atop(seg->end - seg->start);
527 seg->first_page = PHYS_TO_VM_PAGE(seg->start);
529 #ifdef VM_FREELIST_LOWMEM
530 if (seg->end <= VM_LOWMEM_BOUNDARY) {
531 flind = vm_freelist_to_flind[VM_FREELIST_LOWMEM];
533 ("vm_phys_init: LOWMEM flind < 0"));
536 #ifdef VM_FREELIST_DMA32
537 if (seg->end <= VM_DMA32_BOUNDARY) {
538 flind = vm_freelist_to_flind[VM_FREELIST_DMA32];
540 ("vm_phys_init: DMA32 flind < 0"));
544 flind = vm_freelist_to_flind[VM_FREELIST_DEFAULT];
546 ("vm_phys_init: DEFAULT flind < 0"));
548 seg->free_queues = &vm_phys_free_queues[seg->domain][flind];
552 * Coalesce physical memory segments that are contiguous and share the
553 * same per-domain free queues.
555 prev_seg = vm_phys_segs;
556 seg = &vm_phys_segs[1];
557 end_seg = &vm_phys_segs[vm_phys_nsegs];
558 while (seg < end_seg) {
559 if (prev_seg->end == seg->start &&
560 prev_seg->free_queues == seg->free_queues) {
561 prev_seg->end = seg->end;
562 KASSERT(prev_seg->domain == seg->domain,
563 ("vm_phys_init: free queues cannot span domains"));
566 for (tmp_seg = seg; tmp_seg < end_seg; tmp_seg++)
567 *tmp_seg = *(tmp_seg + 1);
575 * Initialize the free queues.
577 for (dom = 0; dom < vm_ndomains; dom++) {
578 for (flind = 0; flind < vm_nfreelists; flind++) {
579 for (pind = 0; pind < VM_NFREEPOOL; pind++) {
580 fl = vm_phys_free_queues[dom][flind][pind];
581 for (oind = 0; oind < VM_NFREEORDER; oind++)
582 TAILQ_INIT(&fl[oind].pl);
587 rw_init(&vm_phys_fictitious_reg_lock, "vmfctr");
591 * Register info about the NUMA topology of the system.
593 * Invoked by platform-dependent code prior to vm_phys_init().
596 vm_phys_register_domains(int ndomains, struct mem_affinity *affinity,
603 * For now the only override value that we support is 1, which
604 * effectively disables NUMA-awareness in the allocators.
607 TUNABLE_INT_FETCH("vm.numa.disabled", &d);
612 vm_ndomains = ndomains;
613 mem_affinity = affinity;
614 mem_locality = locality;
617 for (i = 0; i < vm_ndomains; i++)
618 DOMAINSET_SET(i, &all_domains);
627 * Split a contiguous, power of two-sized set of physical pages.
629 * When this function is called by a page allocation function, the caller
630 * should request insertion at the head unless the order [order, oind) queues
631 * are known to be empty. The objective being to reduce the likelihood of
632 * long-term fragmentation by promoting contemporaneous allocation and
633 * (hopefully) deallocation.
636 vm_phys_split_pages(vm_page_t m, int oind, struct vm_freelist *fl, int order,
641 while (oind > order) {
643 m_buddy = &m[1 << oind];
644 KASSERT(m_buddy->order == VM_NFREEORDER,
645 ("vm_phys_split_pages: page %p has unexpected order %d",
646 m_buddy, m_buddy->order));
647 vm_freelist_add(fl, m_buddy, oind, tail);
652 * Add the physical pages [m, m + npages) at the end of a power-of-two aligned
653 * and sized set to the specified free list.
655 * When this function is called by a page allocation function, the caller
656 * should request insertion at the head unless the lower-order queues are
657 * known to be empty. The objective being to reduce the likelihood of long-
658 * term fragmentation by promoting contemporaneous allocation and (hopefully)
661 * The physical page m's buddy must not be free.
664 vm_phys_enq_range(vm_page_t m, u_int npages, struct vm_freelist *fl, int tail)
669 KASSERT(npages > 0, ("vm_phys_enq_range: npages is 0"));
670 KASSERT(((VM_PAGE_TO_PHYS(m) + npages * PAGE_SIZE) &
671 ((PAGE_SIZE << (fls(npages) - 1)) - 1)) == 0,
672 ("vm_phys_enq_range: page %p and npages %u are misaligned",
675 KASSERT(m->order == VM_NFREEORDER,
676 ("vm_phys_enq_range: page %p has unexpected order %d",
678 order = ffs(npages) - 1;
679 KASSERT(order < VM_NFREEORDER,
680 ("vm_phys_enq_range: order %d is out of range", order));
681 vm_freelist_add(fl, m, order, tail);
685 } while (npages > 0);
689 * Tries to allocate the specified number of pages from the specified pool
690 * within the specified domain. Returns the actual number of allocated pages
691 * and a pointer to each page through the array ma[].
693 * The returned pages may not be physically contiguous. However, in contrast
694 * to performing multiple, back-to-back calls to vm_phys_alloc_pages(..., 0),
695 * calling this function once to allocate the desired number of pages will
696 * avoid wasted time in vm_phys_split_pages().
698 * The free page queues for the specified domain must be locked.
701 vm_phys_alloc_npages(int domain, int pool, int npages, vm_page_t ma[])
703 struct vm_freelist *alt, *fl;
705 int avail, end, flind, freelist, i, need, oind, pind;
707 KASSERT(domain >= 0 && domain < vm_ndomains,
708 ("vm_phys_alloc_npages: domain %d is out of range", domain));
709 KASSERT(pool < VM_NFREEPOOL,
710 ("vm_phys_alloc_npages: pool %d is out of range", pool));
711 KASSERT(npages <= 1 << (VM_NFREEORDER - 1),
712 ("vm_phys_alloc_npages: npages %d is out of range", npages));
713 vm_domain_free_assert_locked(VM_DOMAIN(domain));
715 for (freelist = 0; freelist < VM_NFREELIST; freelist++) {
716 flind = vm_freelist_to_flind[freelist];
719 fl = vm_phys_free_queues[domain][flind][pool];
720 for (oind = 0; oind < VM_NFREEORDER; oind++) {
721 while ((m = TAILQ_FIRST(&fl[oind].pl)) != NULL) {
722 vm_freelist_rem(fl, m, oind);
724 need = imin(npages - i, avail);
725 for (end = i + need; i < end;)
729 * Return excess pages to fl. Its
730 * order [0, oind) queues are empty.
732 vm_phys_enq_range(m, avail - need, fl,
735 } else if (i == npages)
739 for (oind = VM_NFREEORDER - 1; oind >= 0; oind--) {
740 for (pind = 0; pind < VM_NFREEPOOL; pind++) {
741 alt = vm_phys_free_queues[domain][flind][pind];
742 while ((m = TAILQ_FIRST(&alt[oind].pl)) !=
744 vm_freelist_rem(alt, m, oind);
745 vm_phys_set_pool(pool, m, oind);
747 need = imin(npages - i, avail);
748 for (end = i + need; i < end;)
752 * Return excess pages to fl.
753 * Its order [0, oind) queues
756 vm_phys_enq_range(m, avail -
759 } else if (i == npages)
769 * Allocate a contiguous, power of two-sized set of physical pages
770 * from the free lists.
772 * The free page queues must be locked.
775 vm_phys_alloc_pages(int domain, int pool, int order)
780 for (freelist = 0; freelist < VM_NFREELIST; freelist++) {
781 m = vm_phys_alloc_freelist_pages(domain, freelist, pool, order);
789 * Allocate a contiguous, power of two-sized set of physical pages from the
790 * specified free list. The free list must be specified using one of the
791 * manifest constants VM_FREELIST_*.
793 * The free page queues must be locked.
796 vm_phys_alloc_freelist_pages(int domain, int freelist, int pool, int order)
798 struct vm_freelist *alt, *fl;
800 int oind, pind, flind;
802 KASSERT(domain >= 0 && domain < vm_ndomains,
803 ("vm_phys_alloc_freelist_pages: domain %d is out of range",
805 KASSERT(freelist < VM_NFREELIST,
806 ("vm_phys_alloc_freelist_pages: freelist %d is out of range",
808 KASSERT(pool < VM_NFREEPOOL,
809 ("vm_phys_alloc_freelist_pages: pool %d is out of range", pool));
810 KASSERT(order < VM_NFREEORDER,
811 ("vm_phys_alloc_freelist_pages: order %d is out of range", order));
813 flind = vm_freelist_to_flind[freelist];
814 /* Check if freelist is present */
818 vm_domain_free_assert_locked(VM_DOMAIN(domain));
819 fl = &vm_phys_free_queues[domain][flind][pool][0];
820 for (oind = order; oind < VM_NFREEORDER; oind++) {
821 m = TAILQ_FIRST(&fl[oind].pl);
823 vm_freelist_rem(fl, m, oind);
824 /* The order [order, oind) queues are empty. */
825 vm_phys_split_pages(m, oind, fl, order, 1);
831 * The given pool was empty. Find the largest
832 * contiguous, power-of-two-sized set of pages in any
833 * pool. Transfer these pages to the given pool, and
834 * use them to satisfy the allocation.
836 for (oind = VM_NFREEORDER - 1; oind >= order; oind--) {
837 for (pind = 0; pind < VM_NFREEPOOL; pind++) {
838 alt = &vm_phys_free_queues[domain][flind][pind][0];
839 m = TAILQ_FIRST(&alt[oind].pl);
841 vm_freelist_rem(alt, m, oind);
842 vm_phys_set_pool(pool, m, oind);
843 /* The order [order, oind) queues are empty. */
844 vm_phys_split_pages(m, oind, fl, order, 1);
853 * Find the vm_page corresponding to the given physical address.
856 vm_phys_paddr_to_vm_page(vm_paddr_t pa)
858 struct vm_phys_seg *seg;
861 for (segind = 0; segind < vm_phys_nsegs; segind++) {
862 seg = &vm_phys_segs[segind];
863 if (pa >= seg->start && pa < seg->end)
864 return (&seg->first_page[atop(pa - seg->start)]);
870 vm_phys_fictitious_to_vm_page(vm_paddr_t pa)
872 struct vm_phys_fictitious_seg tmp, *seg;
879 rw_rlock(&vm_phys_fictitious_reg_lock);
880 seg = RB_FIND(fict_tree, &vm_phys_fictitious_tree, &tmp);
881 rw_runlock(&vm_phys_fictitious_reg_lock);
885 m = &seg->first_page[atop(pa - seg->start)];
886 KASSERT((m->flags & PG_FICTITIOUS) != 0, ("%p not fictitious", m));
892 vm_phys_fictitious_init_range(vm_page_t range, vm_paddr_t start,
893 long page_count, vm_memattr_t memattr)
897 bzero(range, page_count * sizeof(*range));
898 for (i = 0; i < page_count; i++) {
899 vm_page_initfake(&range[i], start + PAGE_SIZE * i, memattr);
900 range[i].oflags &= ~VPO_UNMANAGED;
901 range[i].busy_lock = VPB_UNBUSIED;
906 vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end,
907 vm_memattr_t memattr)
909 struct vm_phys_fictitious_seg *seg;
912 #ifdef VM_PHYSSEG_DENSE
918 ("Start of segment isn't less than end (start: %jx end: %jx)",
919 (uintmax_t)start, (uintmax_t)end));
921 page_count = (end - start) / PAGE_SIZE;
923 #ifdef VM_PHYSSEG_DENSE
926 if (pi >= first_page && (pi - first_page) < vm_page_array_size) {
927 fp = &vm_page_array[pi - first_page];
928 if ((pe - first_page) > vm_page_array_size) {
930 * We have a segment that starts inside
931 * of vm_page_array, but ends outside of it.
933 * Use vm_page_array pages for those that are
934 * inside of the vm_page_array range, and
935 * allocate the remaining ones.
937 dpage_count = vm_page_array_size - (pi - first_page);
938 vm_phys_fictitious_init_range(fp, start, dpage_count,
940 page_count -= dpage_count;
941 start += ptoa(dpage_count);
945 * We can allocate the full range from vm_page_array,
946 * so there's no need to register the range in the tree.
948 vm_phys_fictitious_init_range(fp, start, page_count, memattr);
950 } else if (pe > first_page && (pe - first_page) < vm_page_array_size) {
952 * We have a segment that ends inside of vm_page_array,
953 * but starts outside of it.
955 fp = &vm_page_array[0];
956 dpage_count = pe - first_page;
957 vm_phys_fictitious_init_range(fp, ptoa(first_page), dpage_count,
959 end -= ptoa(dpage_count);
960 page_count -= dpage_count;
962 } else if (pi < first_page && pe > (first_page + vm_page_array_size)) {
964 * Trying to register a fictitious range that expands before
965 * and after vm_page_array.
971 fp = malloc(page_count * sizeof(struct vm_page), M_FICT_PAGES,
973 #ifdef VM_PHYSSEG_DENSE
976 vm_phys_fictitious_init_range(fp, start, page_count, memattr);
978 seg = malloc(sizeof(*seg), M_FICT_PAGES, M_WAITOK | M_ZERO);
981 seg->first_page = fp;
983 rw_wlock(&vm_phys_fictitious_reg_lock);
984 RB_INSERT(fict_tree, &vm_phys_fictitious_tree, seg);
985 rw_wunlock(&vm_phys_fictitious_reg_lock);
991 vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end)
993 struct vm_phys_fictitious_seg *seg, tmp;
994 #ifdef VM_PHYSSEG_DENSE
999 ("Start of segment isn't less than end (start: %jx end: %jx)",
1000 (uintmax_t)start, (uintmax_t)end));
1002 #ifdef VM_PHYSSEG_DENSE
1005 if (pi >= first_page && (pi - first_page) < vm_page_array_size) {
1006 if ((pe - first_page) <= vm_page_array_size) {
1008 * This segment was allocated using vm_page_array
1009 * only, there's nothing to do since those pages
1010 * were never added to the tree.
1015 * We have a segment that starts inside
1016 * of vm_page_array, but ends outside of it.
1018 * Calculate how many pages were added to the
1019 * tree and free them.
1021 start = ptoa(first_page + vm_page_array_size);
1022 } else if (pe > first_page && (pe - first_page) < vm_page_array_size) {
1024 * We have a segment that ends inside of vm_page_array,
1025 * but starts outside of it.
1027 end = ptoa(first_page);
1028 } else if (pi < first_page && pe > (first_page + vm_page_array_size)) {
1029 /* Since it's not possible to register such a range, panic. */
1031 "Unregistering not registered fictitious range [%#jx:%#jx]",
1032 (uintmax_t)start, (uintmax_t)end);
1038 rw_wlock(&vm_phys_fictitious_reg_lock);
1039 seg = RB_FIND(fict_tree, &vm_phys_fictitious_tree, &tmp);
1040 if (seg->start != start || seg->end != end) {
1041 rw_wunlock(&vm_phys_fictitious_reg_lock);
1043 "Unregistering not registered fictitious range [%#jx:%#jx]",
1044 (uintmax_t)start, (uintmax_t)end);
1046 RB_REMOVE(fict_tree, &vm_phys_fictitious_tree, seg);
1047 rw_wunlock(&vm_phys_fictitious_reg_lock);
1048 free(seg->first_page, M_FICT_PAGES);
1049 free(seg, M_FICT_PAGES);
1053 * Free a contiguous, power of two-sized set of physical pages.
1055 * The free page queues must be locked.
1058 vm_phys_free_pages(vm_page_t m, int order)
1060 struct vm_freelist *fl;
1061 struct vm_phys_seg *seg;
1065 KASSERT(m->order == VM_NFREEORDER,
1066 ("vm_phys_free_pages: page %p has unexpected order %d",
1068 KASSERT(m->pool < VM_NFREEPOOL,
1069 ("vm_phys_free_pages: page %p has unexpected pool %d",
1071 KASSERT(order < VM_NFREEORDER,
1072 ("vm_phys_free_pages: order %d is out of range", order));
1073 seg = &vm_phys_segs[m->segind];
1074 vm_domain_free_assert_locked(VM_DOMAIN(seg->domain));
1075 if (order < VM_NFREEORDER - 1) {
1076 pa = VM_PAGE_TO_PHYS(m);
1078 pa ^= ((vm_paddr_t)1 << (PAGE_SHIFT + order));
1079 if (pa < seg->start || pa >= seg->end)
1081 m_buddy = &seg->first_page[atop(pa - seg->start)];
1082 if (m_buddy->order != order)
1084 fl = (*seg->free_queues)[m_buddy->pool];
1085 vm_freelist_rem(fl, m_buddy, order);
1086 if (m_buddy->pool != m->pool)
1087 vm_phys_set_pool(m->pool, m_buddy, order);
1089 pa &= ~(((vm_paddr_t)1 << (PAGE_SHIFT + order)) - 1);
1090 m = &seg->first_page[atop(pa - seg->start)];
1091 } while (order < VM_NFREEORDER - 1);
1093 fl = (*seg->free_queues)[m->pool];
1094 vm_freelist_add(fl, m, order, 1);
1098 * Free a contiguous, arbitrarily sized set of physical pages.
1100 * The free page queues must be locked.
1103 vm_phys_free_contig(vm_page_t m, u_long npages)
1109 * Avoid unnecessary coalescing by freeing the pages in the largest
1110 * possible power-of-two-sized subsets.
1112 vm_domain_free_assert_locked(vm_pagequeue_domain(m));
1113 for (;; npages -= n) {
1115 * Unsigned "min" is used here so that "order" is assigned
1116 * "VM_NFREEORDER - 1" when "m"'s physical address is zero
1117 * or the low-order bits of its physical address are zero
1118 * because the size of a physical address exceeds the size of
1121 order = min(ffsl(VM_PAGE_TO_PHYS(m) >> PAGE_SHIFT) - 1,
1126 vm_phys_free_pages(m, order);
1129 /* The residual "npages" is less than "1 << (VM_NFREEORDER - 1)". */
1130 for (; npages > 0; npages -= n) {
1131 order = flsl(npages) - 1;
1133 vm_phys_free_pages(m, order);
1139 * Scan physical memory between the specified addresses "low" and "high" for a
1140 * run of contiguous physical pages that satisfy the specified conditions, and
1141 * return the lowest page in the run. The specified "alignment" determines
1142 * the alignment of the lowest physical page in the run. If the specified
1143 * "boundary" is non-zero, then the run of physical pages cannot span a
1144 * physical address that is a multiple of "boundary".
1146 * "npages" must be greater than zero. Both "alignment" and "boundary" must
1147 * be a power of two.
1150 vm_phys_scan_contig(int domain, u_long npages, vm_paddr_t low, vm_paddr_t high,
1151 u_long alignment, vm_paddr_t boundary, int options)
1154 vm_page_t m_end, m_run, m_start;
1155 struct vm_phys_seg *seg;
1158 KASSERT(npages > 0, ("npages is 0"));
1159 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
1160 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
1163 for (segind = 0; segind < vm_phys_nsegs; segind++) {
1164 seg = &vm_phys_segs[segind];
1165 if (seg->domain != domain)
1167 if (seg->start >= high)
1169 if (low >= seg->end)
1171 if (low <= seg->start)
1172 m_start = seg->first_page;
1174 m_start = &seg->first_page[atop(low - seg->start)];
1175 if (high < seg->end)
1179 if (pa_end - VM_PAGE_TO_PHYS(m_start) < ptoa(npages))
1181 m_end = &seg->first_page[atop(pa_end - seg->start)];
1182 m_run = vm_page_scan_contig(npages, m_start, m_end,
1183 alignment, boundary, options);
1191 * Set the pool for a contiguous, power of two-sized set of physical pages.
1194 vm_phys_set_pool(int pool, vm_page_t m, int order)
1198 for (m_tmp = m; m_tmp < &m[1 << order]; m_tmp++)
1203 * Search for the given physical page "m" in the free lists. If the search
1204 * succeeds, remove "m" from the free lists and return TRUE. Otherwise, return
1205 * FALSE, indicating that "m" is not in the free lists.
1207 * The free page queues must be locked.
1210 vm_phys_unfree_page(vm_page_t m)
1212 struct vm_freelist *fl;
1213 struct vm_phys_seg *seg;
1214 vm_paddr_t pa, pa_half;
1215 vm_page_t m_set, m_tmp;
1219 * First, find the contiguous, power of two-sized set of free
1220 * physical pages containing the given physical page "m" and
1221 * assign it to "m_set".
1223 seg = &vm_phys_segs[m->segind];
1224 vm_domain_free_assert_locked(VM_DOMAIN(seg->domain));
1225 for (m_set = m, order = 0; m_set->order == VM_NFREEORDER &&
1226 order < VM_NFREEORDER - 1; ) {
1228 pa = m->phys_addr & (~(vm_paddr_t)0 << (PAGE_SHIFT + order));
1229 if (pa >= seg->start)
1230 m_set = &seg->first_page[atop(pa - seg->start)];
1234 if (m_set->order < order)
1236 if (m_set->order == VM_NFREEORDER)
1238 KASSERT(m_set->order < VM_NFREEORDER,
1239 ("vm_phys_unfree_page: page %p has unexpected order %d",
1240 m_set, m_set->order));
1243 * Next, remove "m_set" from the free lists. Finally, extract
1244 * "m" from "m_set" using an iterative algorithm: While "m_set"
1245 * is larger than a page, shrink "m_set" by returning the half
1246 * of "m_set" that does not contain "m" to the free lists.
1248 fl = (*seg->free_queues)[m_set->pool];
1249 order = m_set->order;
1250 vm_freelist_rem(fl, m_set, order);
1253 pa_half = m_set->phys_addr ^ (1 << (PAGE_SHIFT + order));
1254 if (m->phys_addr < pa_half)
1255 m_tmp = &seg->first_page[atop(pa_half - seg->start)];
1258 m_set = &seg->first_page[atop(pa_half - seg->start)];
1260 vm_freelist_add(fl, m_tmp, order, 0);
1262 KASSERT(m_set == m, ("vm_phys_unfree_page: fatal inconsistency"));
1267 * Allocate a contiguous set of physical pages of the given size
1268 * "npages" from the free lists. All of the physical pages must be at
1269 * or above the given physical address "low" and below the given
1270 * physical address "high". The given value "alignment" determines the
1271 * alignment of the first physical page in the set. If the given value
1272 * "boundary" is non-zero, then the set of physical pages cannot cross
1273 * any physical address boundary that is a multiple of that value. Both
1274 * "alignment" and "boundary" must be a power of two.
1277 vm_phys_alloc_contig(int domain, u_long npages, vm_paddr_t low, vm_paddr_t high,
1278 u_long alignment, vm_paddr_t boundary)
1280 vm_paddr_t pa_end, pa_start;
1282 struct vm_phys_seg *seg;
1285 KASSERT(npages > 0, ("npages is 0"));
1286 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
1287 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
1288 vm_domain_free_assert_locked(VM_DOMAIN(domain));
1292 for (segind = vm_phys_nsegs - 1; segind >= 0; segind--) {
1293 seg = &vm_phys_segs[segind];
1294 if (seg->start >= high || seg->domain != domain)
1296 if (low >= seg->end)
1298 if (low <= seg->start)
1299 pa_start = seg->start;
1302 if (high < seg->end)
1306 if (pa_end - pa_start < ptoa(npages))
1308 m_run = vm_phys_alloc_seg_contig(seg, npages, low, high,
1309 alignment, boundary);
1317 * Allocate a run of contiguous physical pages from the free list for the
1318 * specified segment.
1321 vm_phys_alloc_seg_contig(struct vm_phys_seg *seg, u_long npages,
1322 vm_paddr_t low, vm_paddr_t high, u_long alignment, vm_paddr_t boundary)
1324 struct vm_freelist *fl;
1325 vm_paddr_t pa, pa_end, size;
1328 int oind, order, pind;
1330 KASSERT(npages > 0, ("npages is 0"));
1331 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
1332 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
1333 vm_domain_free_assert_locked(VM_DOMAIN(seg->domain));
1334 /* Compute the queue that is the best fit for npages. */
1335 order = flsl(npages - 1);
1336 /* Search for a run satisfying the specified conditions. */
1337 size = npages << PAGE_SHIFT;
1338 for (oind = min(order, VM_NFREEORDER - 1); oind < VM_NFREEORDER;
1340 for (pind = 0; pind < VM_NFREEPOOL; pind++) {
1341 fl = (*seg->free_queues)[pind];
1342 TAILQ_FOREACH(m_ret, &fl[oind].pl, listq) {
1344 * Is the size of this allocation request
1345 * larger than the largest block size?
1347 if (order >= VM_NFREEORDER) {
1349 * Determine if a sufficient number of
1350 * subsequent blocks to satisfy the
1351 * allocation request are free.
1353 pa = VM_PAGE_TO_PHYS(m_ret);
1358 pa += 1 << (PAGE_SHIFT +
1364 m = &seg->first_page[atop(pa -
1366 if (m->order != VM_NFREEORDER -
1370 /* If not, go to the next block. */
1376 * Determine if the blocks are within the
1377 * given range, satisfy the given alignment,
1378 * and do not cross the given boundary.
1380 pa = VM_PAGE_TO_PHYS(m_ret);
1382 if (pa >= low && pa_end <= high &&
1383 (pa & (alignment - 1)) == 0 &&
1384 rounddown2(pa ^ (pa_end - 1), boundary) == 0)
1391 for (m = m_ret; m < &m_ret[npages]; m = &m[1 << oind]) {
1392 fl = (*seg->free_queues)[m->pool];
1393 vm_freelist_rem(fl, m, oind);
1394 if (m->pool != VM_FREEPOOL_DEFAULT)
1395 vm_phys_set_pool(VM_FREEPOOL_DEFAULT, m, oind);
1397 /* Return excess pages to the free lists. */
1398 npages_end = roundup2(npages, 1 << oind);
1399 if (npages < npages_end) {
1400 fl = (*seg->free_queues)[VM_FREEPOOL_DEFAULT];
1401 vm_phys_enq_range(&m_ret[npages], npages_end - npages, fl, 0);
1408 * Show the number of physical pages in each of the free lists.
1410 DB_SHOW_COMMAND(freepages, db_show_freepages)
1412 struct vm_freelist *fl;
1413 int flind, oind, pind, dom;
1415 for (dom = 0; dom < vm_ndomains; dom++) {
1416 db_printf("DOMAIN: %d\n", dom);
1417 for (flind = 0; flind < vm_nfreelists; flind++) {
1418 db_printf("FREE LIST %d:\n"
1419 "\n ORDER (SIZE) | NUMBER"
1421 for (pind = 0; pind < VM_NFREEPOOL; pind++)
1422 db_printf(" | POOL %d", pind);
1424 for (pind = 0; pind < VM_NFREEPOOL; pind++)
1425 db_printf("-- -- ");
1427 for (oind = VM_NFREEORDER - 1; oind >= 0; oind--) {
1428 db_printf(" %2.2d (%6.6dK)", oind,
1429 1 << (PAGE_SHIFT - 10 + oind));
1430 for (pind = 0; pind < VM_NFREEPOOL; pind++) {
1431 fl = vm_phys_free_queues[dom][flind][pind];
1432 db_printf(" | %6.6d", fl[oind].lcnt);