1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 3 * 4 * Copyright (c) 2002-2006 Rice University 5 * Copyright (c) 2007 Alan L. Cox <alc@cs.rice.edu> 6 * All rights reserved. 7 * 8 * This software was developed for the FreeBSD Project by Alan L. Cox, 9 * Olivier Crameri, Peter Druschel, Sitaram Iyer, and Juan Navarro. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 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. 19 * 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. 32 * 33 * $FreeBSD$ 34 */ 35 36 /* 37 * Physical memory system definitions 38 */ 39 40 #ifndef _VM_PHYS_H_ 41 #define _VM_PHYS_H_ 42 43 #ifdef _KERNEL 44 45 #ifndef VM_NFREEORDER_MAX 46 #define VM_NFREEORDER_MAX VM_NFREEORDER 47 #endif 48 49 /* Domains must be dense (non-sparse) and zero-based. */ 50 struct mem_affinity { 51 vm_paddr_t start; 52 vm_paddr_t end; 53 int domain; 54 }; 55 #ifdef NUMA 56 extern struct mem_affinity *mem_affinity; 57 extern int *mem_locality; 58 #endif 59 60 struct vm_freelist { 61 struct pglist pl; 62 int lcnt; 63 }; 64 65 struct vm_phys_seg { 66 vm_paddr_t start; 67 vm_paddr_t end; 68 vm_page_t first_page; 69 int domain; 70 struct vm_freelist (*free_queues)[VM_NFREEPOOL][VM_NFREEORDER_MAX]; 71 }; 72 73 extern struct vm_phys_seg vm_phys_segs[]; 74 extern int vm_phys_nsegs; 75 76 /* 77 * The following functions are only to be used by the virtual memory system. 78 */ 79 void vm_phys_add_seg(vm_paddr_t start, vm_paddr_t end); 80 vm_page_t vm_phys_alloc_contig(int domain, u_long npages, vm_paddr_t low, 81 vm_paddr_t high, u_long alignment, vm_paddr_t boundary); 82 vm_page_t vm_phys_alloc_freelist_pages(int domain, int freelist, int pool, 83 int order); 84 int vm_phys_alloc_npages(int domain, int pool, int npages, vm_page_t ma[]); 85 vm_page_t vm_phys_alloc_pages(int domain, int pool, int order); 86 int vm_phys_domain_match(int prefer, vm_paddr_t low, vm_paddr_t high); 87 int vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end, 88 vm_memattr_t memattr); 89 void vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end); 90 vm_page_t vm_phys_fictitious_to_vm_page(vm_paddr_t pa); 91 void vm_phys_free_contig(vm_page_t m, u_long npages); 92 void vm_phys_free_pages(vm_page_t m, int order); 93 void vm_phys_init(void); 94 vm_page_t vm_phys_paddr_to_vm_page(vm_paddr_t pa); 95 void vm_phys_register_domains(int ndomains, struct mem_affinity *affinity, 96 int *locality); 97 vm_page_t vm_phys_scan_contig(int domain, u_long npages, vm_paddr_t low, 98 vm_paddr_t high, u_long alignment, vm_paddr_t boundary, int options); 99 void vm_phys_set_pool(int pool, vm_page_t m, int order); 100 boolean_t vm_phys_unfree_page(vm_page_t m); 101 int vm_phys_mem_affinity(int f, int t); 102 103 /* 104 * 105 * vm_phys_domain: 106 * 107 * Return the index of the domain the page belongs to. 108 */ 109 static inline int 110 vm_phys_domain(vm_page_t m) 111 { 112 #ifdef NUMA 113 int domn, segind; 114 115 /* XXXKIB try to assert that the page is managed */ 116 segind = m->segind; 117 KASSERT(segind < vm_phys_nsegs, ("segind %d m %p", segind, m)); 118 domn = vm_phys_segs[segind].domain; 119 KASSERT(domn < vm_ndomains, ("domain %d m %p", domn, m)); 120 return (domn); 121 #else 122 return (0); 123 #endif 124 } 125 126 #endif /* _KERNEL */ 127 #endif /* !_VM_PHYS_H_ */ 128