2 * Copyright (c) 2002-2006 Rice University
3 * Copyright (c) 2007 Alan L. Cox <alc@cs.rice.edu>
6 * This software was developed for the FreeBSD Project by Alan L. Cox,
7 * Olivier Crameri, Peter Druschel, Sitaram Iyer, and Juan Navarro.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
24 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
25 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
26 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
28 * WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
35 * Physical memory system definitions
43 /* Domains must be dense (non-sparse) and zero-based. */
60 struct vm_freelist (*free_queues)[VM_NFREEPOOL][VM_NFREEORDER];
63 extern struct mem_affinity *mem_affinity;
64 extern int vm_ndomains;
65 extern struct vm_phys_seg vm_phys_segs[];
66 extern int vm_phys_nsegs;
69 * The following functions are only to be used by the virtual memory system.
71 void vm_phys_add_page(vm_paddr_t pa);
72 vm_page_t vm_phys_alloc_contig(u_long npages, vm_paddr_t low, vm_paddr_t high,
73 u_long alignment, vm_paddr_t boundary);
74 vm_page_t vm_phys_alloc_freelist_pages(int flind, int pool, int order);
75 vm_page_t vm_phys_alloc_pages(int pool, int order);
76 boolean_t vm_phys_domain_intersects(long mask, vm_paddr_t low, vm_paddr_t high);
77 int vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end,
78 vm_memattr_t memattr);
79 void vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end);
80 vm_page_t vm_phys_fictitious_to_vm_page(vm_paddr_t pa);
81 void vm_phys_free_contig(vm_page_t m, u_long npages);
82 void vm_phys_free_pages(vm_page_t m, int order);
83 void vm_phys_init(void);
84 vm_page_t vm_phys_paddr_to_vm_page(vm_paddr_t pa);
85 void vm_phys_set_pool(int pool, vm_page_t m, int order);
86 boolean_t vm_phys_unfree_page(vm_page_t m);
87 boolean_t vm_phys_zero_pages_idle(void);
92 * Return the memory domain the page belongs to.
94 static inline struct vm_domain *
95 vm_phys_domain(vm_page_t m)
100 /* XXXKIB try to assert that the page is managed */
102 KASSERT(segind < vm_phys_nsegs, ("segind %d m %p", segind, m));
103 domn = vm_phys_segs[segind].domain;
104 KASSERT(domn < vm_ndomains, ("domain %d m %p", domn, m));
105 return (&vm_dom[domn]);
112 vm_phys_freecnt_adj(vm_page_t m, int adj)
115 mtx_assert(&vm_page_queue_free_mtx, MA_OWNED);
116 cnt.v_free_count += adj;
117 vm_phys_domain(m)->vmd_free_count += adj;
121 #endif /* !_VM_PHYS_H_ */