1170477Salc/*- 2170477Salc * Copyright (c) 2002-2006 Rice University 3172317Salc * Copyright (c) 2007 Alan L. Cox <alc@cs.rice.edu> 4170477Salc * All rights reserved. 5170477Salc * 6170477Salc * This software was developed for the FreeBSD Project by Alan L. Cox, 7170477Salc * Olivier Crameri, Peter Druschel, Sitaram Iyer, and Juan Navarro. 8170477Salc * 9170477Salc * Redistribution and use in source and binary forms, with or without 10170477Salc * modification, are permitted provided that the following conditions 11170477Salc * are met: 12170477Salc * 1. Redistributions of source code must retain the above copyright 13170477Salc * notice, this list of conditions and the following disclaimer. 14170477Salc * 2. Redistributions in binary form must reproduce the above copyright 15170477Salc * notice, this list of conditions and the following disclaimer in the 16170477Salc * documentation and/or other materials provided with the distribution. 17170477Salc * 18170477Salc * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19170477Salc * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20170477Salc * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21170477Salc * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22170477Salc * HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 23170477Salc * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 24170477Salc * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 25170477Salc * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 26170477Salc * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27170477Salc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY 28170477Salc * WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29170477Salc * POSSIBILITY OF SUCH DAMAGE. 30170477Salc * 31170477Salc * $FreeBSD$ 32170477Salc */ 33170477Salc 34170477Salc/* 35170477Salc * Physical memory system definitions 36170477Salc */ 37170477Salc 38170477Salc#ifndef _VM_PHYS_H_ 39170477Salc#define _VM_PHYS_H_ 40170477Salc 41174821Salc#ifdef _KERNEL 42174821Salc 43210550Sjhb/* Domains must be dense (non-sparse) and zero-based. */ 44210550Sjhbstruct mem_affinity { 45210550Sjhb vm_paddr_t start; 46210550Sjhb vm_paddr_t end; 47210550Sjhb int domain; 48210550Sjhb}; 49210550Sjhb 50254065Skibstruct vm_freelist { 51254065Skib struct pglist pl; 52254065Skib int lcnt; 53254065Skib}; 54254065Skib 55254065Skibstruct vm_phys_seg { 56254065Skib vm_paddr_t start; 57254065Skib vm_paddr_t end; 58254065Skib vm_page_t first_page; 59254065Skib int domain; 60254065Skib struct vm_freelist (*free_queues)[VM_NFREEPOOL][VM_NFREEORDER]; 61254065Skib}; 62254065Skib 63210550Sjhbextern struct mem_affinity *mem_affinity; 64250601Sattilioextern int vm_ndomains; 65254065Skibextern struct vm_phys_seg vm_phys_segs[]; 66254065Skibextern int vm_phys_nsegs; 67210550Sjhb 68227568Salc/* 69227568Salc * The following functions are only to be used by the virtual memory system. 70227568Salc */ 71170477Salcvoid vm_phys_add_page(vm_paddr_t pa); 72276546Salcvoid vm_phys_add_seg(vm_paddr_t start, vm_paddr_t end); 73226928Salcvm_page_t vm_phys_alloc_contig(u_long npages, vm_paddr_t low, vm_paddr_t high, 74226928Salc u_long alignment, vm_paddr_t boundary); 75285634Skibvm_page_t vm_phys_alloc_freelist_pages(int freelist, int pool, int order); 76170477Salcvm_page_t vm_phys_alloc_pages(int pool, int order); 77254065Skibboolean_t vm_phys_domain_intersects(long mask, vm_paddr_t low, vm_paddr_t high); 78235372Skibint vm_phys_fictitious_reg_range(vm_paddr_t start, vm_paddr_t end, 79235372Skib vm_memattr_t memattr); 80235372Skibvoid vm_phys_fictitious_unreg_range(vm_paddr_t start, vm_paddr_t end); 81235372Skibvm_page_t vm_phys_fictitious_to_vm_page(vm_paddr_t pa); 82226928Salcvoid vm_phys_free_contig(vm_page_t m, u_long npages); 83170477Salcvoid vm_phys_free_pages(vm_page_t m, int order); 84170477Salcvoid vm_phys_init(void); 85243132Skibvm_page_t vm_phys_paddr_to_vm_page(vm_paddr_t pa); 86172317Salcvoid vm_phys_set_pool(int pool, vm_page_t m, int order); 87174821Salcboolean_t vm_phys_unfree_page(vm_page_t m); 88170477Salcboolean_t vm_phys_zero_pages_idle(void); 89170477Salc 90254065Skib/* 91254065Skib * vm_phys_domain: 92254065Skib * 93254065Skib * Return the memory domain the page belongs to. 94254065Skib */ 95254065Skibstatic inline struct vm_domain * 96254065Skibvm_phys_domain(vm_page_t m) 97254065Skib{ 98254065Skib#if MAXMEMDOM > 1 99254065Skib int domn, segind; 100254065Skib 101254065Skib /* XXXKIB try to assert that the page is managed */ 102254065Skib segind = m->segind; 103254065Skib KASSERT(segind < vm_phys_nsegs, ("segind %d m %p", segind, m)); 104254065Skib domn = vm_phys_segs[segind].domain; 105254065Skib KASSERT(domn < vm_ndomains, ("domain %d m %p", domn, m)); 106254065Skib return (&vm_dom[domn]); 107254065Skib#else 108254065Skib return (&vm_dom[0]); 109254065Skib#endif 110254065Skib} 111254065Skib 112254065Skibstatic inline void 113254065Skibvm_phys_freecnt_adj(vm_page_t m, int adj) 114254065Skib{ 115254065Skib 116254065Skib mtx_assert(&vm_page_queue_free_mtx, MA_OWNED); 117254065Skib cnt.v_free_count += adj; 118254065Skib vm_phys_domain(m)->vmd_free_count += adj; 119254065Skib} 120254065Skib 121174821Salc#endif /* _KERNEL */ 122170477Salc#endif /* !_VM_PHYS_H_ */ 123