136 lines
5.6 KiB
C
136 lines
5.6 KiB
C
/*
|
|
* Copyright (c) 1991, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* The Mach Operating System project at Carnegie-Mellon University.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* from: @(#)pmap.h 8.1 (Berkeley) 6/11/93
|
|
*
|
|
*
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
* All rights reserved.
|
|
*
|
|
* Author: Avadis Tevanian, Jr.
|
|
*
|
|
* Permission to use, copy, modify and distribute this software and
|
|
* its documentation is hereby granted, provided that both the copyright
|
|
* notice and this permission notice appear in all copies of the
|
|
* software, derivative works or modified versions, and any portions
|
|
* thereof, and that both notices appear in supporting documentation.
|
|
*
|
|
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
|
|
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
|
|
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
|
|
*
|
|
* Carnegie Mellon requests users of this software to return to
|
|
*
|
|
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
|
|
* School of Computer Science
|
|
* Carnegie Mellon University
|
|
* Pittsburgh PA 15213-3890
|
|
*
|
|
* any improvements or extensions that they make and grant Carnegie the
|
|
* rights to redistribute these changes.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Machine address mapping definitions -- machine-independent
|
|
* section. [For machine-dependent section, see "machine/pmap.h".]
|
|
*/
|
|
|
|
#ifndef _PMAP_VM_
|
|
#define _PMAP_VM_
|
|
|
|
/*
|
|
* Each machine dependent implementation is expected to
|
|
* keep certain statistics. They may do this anyway they
|
|
* so choose, but are expected to return the statistics
|
|
* in the following structure.
|
|
*/
|
|
struct pmap_statistics {
|
|
long resident_count; /* # of pages mapped (total) */
|
|
long wired_count; /* # of pages wired */
|
|
};
|
|
typedef struct pmap_statistics *pmap_statistics_t;
|
|
|
|
#include <machine/pmap.h>
|
|
|
|
#ifdef KERNEL
|
|
void pmap_change_wiring __P((pmap_t, vm_offset_t, boolean_t));
|
|
void pmap_clear_modify __P((vm_offset_t pa));
|
|
void pmap_clear_reference __P((vm_offset_t pa));
|
|
void pmap_copy __P((pmap_t, pmap_t, vm_offset_t, vm_size_t,
|
|
vm_offset_t));
|
|
void pmap_copy_page __P((vm_offset_t, vm_offset_t));
|
|
void pmap_destroy __P((pmap_t));
|
|
void pmap_enter __P((pmap_t, vm_offset_t, vm_offset_t, vm_prot_t,
|
|
boolean_t));
|
|
vm_offset_t pmap_extract __P((pmap_t, vm_offset_t));
|
|
void pmap_growkernel __P((vm_offset_t));
|
|
void pmap_init __P((vm_offset_t, vm_offset_t));
|
|
boolean_t pmap_is_modified __P((vm_offset_t pa));
|
|
boolean_t pmap_ts_referenced __P((vm_offset_t pa));
|
|
void pmap_kenter __P((vm_offset_t, vm_offset_t));
|
|
void pmap_kremove __P((vm_offset_t));
|
|
vm_offset_t pmap_map __P((vm_offset_t, vm_offset_t, vm_offset_t, int));
|
|
void pmap_object_init_pt __P((pmap_t pmap, vm_offset_t addr,
|
|
vm_object_t object, vm_pindex_t pindex, vm_offset_t size,
|
|
int pagelimit));
|
|
boolean_t pmap_page_exists __P((pmap_t, vm_offset_t));
|
|
void pmap_page_protect __P((vm_offset_t, vm_prot_t));
|
|
void pmap_pageable __P((pmap_t, vm_offset_t, vm_offset_t,
|
|
boolean_t));
|
|
vm_offset_t pmap_phys_address __P((int));
|
|
void pmap_pinit __P((pmap_t));
|
|
void pmap_protect __P((pmap_t, vm_offset_t, vm_offset_t,
|
|
vm_prot_t));
|
|
void pmap_qenter __P((vm_offset_t, vm_page_t *, int));
|
|
void pmap_qremove __P((vm_offset_t, int));
|
|
void pmap_reference __P((pmap_t));
|
|
void pmap_release __P((pmap_t));
|
|
void pmap_remove __P((pmap_t, vm_offset_t, vm_offset_t));
|
|
void pmap_remove_pages __P((pmap_t, vm_offset_t, vm_offset_t));
|
|
void pmap_zero_page __P((vm_offset_t));
|
|
void pmap_prefault __P((pmap_t pmap, vm_offset_t addra,
|
|
vm_map_entry_t entry, vm_object_t object));
|
|
int pmap_mincore __P((pmap_t pmap, vm_offset_t addr));
|
|
void pmap_new_proc __P((struct proc *p));
|
|
void pmap_dispose_proc __P((struct proc *p));
|
|
void pmap_swapout_proc __P((struct proc *p));
|
|
void pmap_swapin_proc __P((struct proc *p));
|
|
|
|
#endif /* KERNEL */
|
|
|
|
#endif /* _PMAP_VM_ */
|