xref: /freebsd/sys/vm/vm_phys.h (revision 8881d206f4e68b564c2c5f50fc717086fc3e827a)
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 extern vm_paddr_t phys_avail[];
46 
47 /* Domains must be dense (non-sparse) and zero-based. */
48 struct mem_affinity {
49 	vm_paddr_t start;
50 	vm_paddr_t end;
51 	int domain;
52 };
53 #ifdef NUMA
54 extern struct mem_affinity *mem_affinity;
55 extern int *mem_locality;
56 #endif
57 
58 /*
59  * The following functions are only to be used by the virtual memory system.
60  */
61 void vm_phys_add_seg(vm_paddr_t start, vm_paddr_t end);
62 vm_page_t vm_phys_alloc_contig(int domain, u_long npages, vm_paddr_t low,
63     vm_paddr_t high, u_long alignment, vm_paddr_t boundary);
64 vm_page_t vm_phys_alloc_freelist_pages(int domain, int freelist, int pool,
65     int order);
66 int vm_phys_alloc_npages(int domain, int pool, int npages, vm_page_t ma[]);
67 vm_page_t vm_phys_alloc_pages(int domain, int pool, int order);
68 int vm_phys_domain_match(int prefer, vm_paddr_t low, vm_paddr_t high);
69 void vm_phys_enqueue_contig(vm_page_t m, u_long npages);
70 int vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end,
71     vm_memattr_t memattr);
72 void vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end);
73 vm_page_t vm_phys_fictitious_to_vm_page(vm_paddr_t pa);
74 void vm_phys_free_contig(vm_page_t m, u_long npages);
75 void vm_phys_free_pages(vm_page_t m, int order);
76 void vm_phys_init(void);
77 vm_page_t vm_phys_paddr_to_vm_page(vm_paddr_t pa);
78 void vm_phys_register_domains(int ndomains, struct mem_affinity *affinity,
79     int *locality);
80 vm_page_t vm_phys_scan_contig(int domain, u_long npages, vm_paddr_t low,
81     vm_paddr_t high, u_long alignment, vm_paddr_t boundary, int options);
82 boolean_t vm_phys_unfree_page(vm_page_t m);
83 int vm_phys_mem_affinity(int f, int t);
84 void vm_phys_early_add_seg(vm_paddr_t start, vm_paddr_t end);
85 vm_paddr_t vm_phys_early_alloc(int domain, size_t alloc_size);
86 void vm_phys_early_startup(void);
87 int vm_phys_avail_largest(void);
88 vm_paddr_t vm_phys_avail_size(int i);
89 bool vm_phys_is_dumpable(vm_paddr_t pa);
90 
91 static inline int
92 vm_phys_domain(vm_paddr_t pa)
93 {
94 #ifdef NUMA
95 	int i;
96 
97 	if (vm_ndomains == 1)
98 		return (0);
99 	for (i = 0; mem_affinity[i].end != 0; i++)
100 		if (mem_affinity[i].start <= pa &&
101 		    mem_affinity[i].end >= pa)
102 			return (mem_affinity[i].domain);
103 	return (-1);
104 #else
105 	return (0);
106 #endif
107 }
108 
109 #endif	/* _KERNEL */
110 #endif	/* !_VM_PHYS_H_ */
111