1/*- 2 * Copyright (c) 2001 Jake Burkholder.
| 1/* 2 * Copyright (c) 1991 Regents of the University of California.
|
3 * All rights reserved. 4 *
| 3 * All rights reserved. 4 *
|
| 5 * This code is derived from software contributed to Berkeley by 6 * the Systems Programming Group of the University of Utah Computer 7 * Science Department and William Jolitz of UUNET Technologies Inc. 8 *
|
5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution.
| 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 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.
|
| 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by the University of 20 * California, Berkeley and its contributors. 21 * 4. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission.
|
13 *
| 24 *
|
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
| 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
| 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
| 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 *
| 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 *
|
26 * $FreeBSD: head/sys/sparc64/include/pmap.h 81334 2001-08-09 02:09:34Z obrien $
| 37 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90 38 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91 39 * from: FreeBSD: src/sys/i386/include/pmap.h,v 1.70 2000/11/30 40 * $FreeBSD: head/sys/sparc64/include/pmap.h 82899 2001-09-03 22:27:23Z jake $
|
27 */ 28 29#ifndef _MACHINE_PMAP_H_ 30#define _MACHINE_PMAP_H_ 31 32#include <machine/tte.h> 33 34#define PMAP_CONTEXT_MAX 8192 35 36#define pmap_resident_count(pm) (pm->pm_stats.resident_count) 37 38typedef struct pmap *pmap_t; 39 40struct md_page { 41}; 42 43struct pmap { 44 struct stte pm_stte; 45 vm_object_t pm_object; 46 u_int pm_active; 47 u_int pm_context; 48 u_int pm_count; 49 u_int pm_pages; 50 struct pmap_statistics pm_stats; 51}; 52 53void pmap_bootstrap(vm_offset_t skpa, vm_offset_t ekva); 54vm_offset_t pmap_kextract(vm_offset_t va); 55 56extern vm_offset_t avail_start; 57extern vm_offset_t avail_end;
| 41 */ 42 43#ifndef _MACHINE_PMAP_H_ 44#define _MACHINE_PMAP_H_ 45 46#include <machine/tte.h> 47 48#define PMAP_CONTEXT_MAX 8192 49 50#define pmap_resident_count(pm) (pm->pm_stats.resident_count) 51 52typedef struct pmap *pmap_t; 53 54struct md_page { 55}; 56 57struct pmap { 58 struct stte pm_stte; 59 vm_object_t pm_object; 60 u_int pm_active; 61 u_int pm_context; 62 u_int pm_count; 63 u_int pm_pages; 64 struct pmap_statistics pm_stats; 65}; 66 67void pmap_bootstrap(vm_offset_t skpa, vm_offset_t ekva); 68vm_offset_t pmap_kextract(vm_offset_t va); 69 70extern vm_offset_t avail_start; 71extern vm_offset_t avail_end;
|
58extern vm_offset_t clean_eva; 59extern vm_offset_t clean_sva;
| |
60extern struct pmap *kernel_pmap; 61extern vm_offset_t phys_avail[]; 62extern vm_offset_t virtual_avail; 63extern vm_offset_t virtual_end; 64 65static __inline int 66pmap_track_modified(vm_offset_t va) 67{
| 72extern struct pmap *kernel_pmap; 73extern vm_offset_t phys_avail[]; 74extern vm_offset_t virtual_avail; 75extern vm_offset_t virtual_end; 76 77static __inline int 78pmap_track_modified(vm_offset_t va) 79{
|
68 return ((va < clean_sva) || (va >= clean_eva));
| 80 return ((va < kmi.clean_sva) || (va >= kmi.clean_eva));
|
69} 70 71#endif /* !_MACHINE_PMAP_H_ */
| 81} 82 83#endif /* !_MACHINE_PMAP_H_ */
|