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 /* Domains must be dense (non-sparse) and zero-based. */ 46 struct mem_affinity { 47 vm_paddr_t start; 48 vm_paddr_t end; 49 int domain; 50 }; 51 52 struct vm_freelist { 53 struct pglist pl; 54 int lcnt; 55 }; 56 57 struct vm_phys_seg { 58 vm_paddr_t start; 59 vm_paddr_t end; 60 vm_page_t first_page; 61 int domain; 62 struct vm_freelist (*free_queues)[VM_NFREEPOOL][VM_NFREEORDER]; 63 }; 64 65 extern struct mem_affinity *mem_affinity; 66 extern int *mem_locality; 67 extern int vm_ndomains; 68 extern struct vm_phys_seg vm_phys_segs[]; 69 extern int vm_phys_nsegs; 70 71 /* 72 * The following functions are only to be used by the virtual memory system. 73 */ 74 void vm_phys_add_seg(vm_paddr_t start, vm_paddr_t end); 75 vm_page_t vm_phys_alloc_contig(int domain, u_long npages, vm_paddr_t low, 76 vm_paddr_t high, u_long alignment, vm_paddr_t boundary); 77 vm_page_t vm_phys_alloc_freelist_pages(int domain, int freelist, int pool, 78 int order); 79 vm_page_t vm_phys_alloc_pages(int domain, int pool, int order); 80 boolean_t vm_phys_domain_intersects(long mask, vm_paddr_t low, vm_paddr_t high); 81 int vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end, 82 vm_memattr_t memattr); 83 void vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end); 84 vm_page_t vm_phys_fictitious_to_vm_page(vm_paddr_t pa); 85 void vm_phys_free_contig(vm_page_t m, u_long npages); 86 void vm_phys_free_pages(vm_page_t m, int order); 87 void vm_phys_init(void); 88 vm_page_t vm_phys_paddr_to_vm_page(vm_paddr_t pa); 89 vm_page_t vm_phys_scan_contig(u_long npages, vm_paddr_t low, vm_paddr_t high, 90 u_long alignment, vm_paddr_t boundary, int options); 91 void vm_phys_set_pool(int pool, vm_page_t m, int order); 92 boolean_t vm_phys_unfree_page(vm_page_t m); 93 int vm_phys_mem_affinity(int f, int t); 94 95 /* 96 * 97 * vm_phys_domidx: 98 * 99 * Return the index of the domain the page belongs to. 100 */ 101 static inline int 102 vm_phys_domidx(vm_page_t m) 103 { 104 #ifdef VM_NUMA_ALLOC 105 int domn, segind; 106 107 /* XXXKIB try to assert that the page is managed */ 108 segind = m->segind; 109 KASSERT(segind < vm_phys_nsegs, ("segind %d m %p", segind, m)); 110 domn = vm_phys_segs[segind].domain; 111 KASSERT(domn < vm_ndomains, ("domain %d m %p", domn, m)); 112 return (domn); 113 #else 114 return (0); 115 #endif 116 } 117 118 /* 119 * vm_phys_domain: 120 * 121 * Return the memory domain the page belongs to. 122 */ 123 static inline struct vm_domain * 124 vm_phys_domain(vm_page_t m) 125 { 126 127 return (&vm_dom[vm_phys_domidx(m)]); 128 } 129 130 static inline u_int 131 vm_phys_freecnt_adj(vm_page_t m, int adj) 132 { 133 134 mtx_assert(&vm_page_queue_free_mtx, MA_OWNED); 135 vm_phys_domain(m)->vmd_free_count += adj; 136 return (vm_cnt.v_free_count += adj); 137 } 138 139 #endif /* _KERNEL */ 140 #endif /* !_VM_PHYS_H_ */ 141