95461b450d
of the various ad-hoc schemes. 2) When bringing in UPAGES, the pmap code needs to do another vm_page_lookup. 3) When appropriate, set the PG_A or PG_M bits a-priori to both avoid some processor errata, and to minimize redundant processor updating of page tables. 4) Modify pmap_protect so that it can only remove permissions (as it originally supported.) The additional capability is not needed. 5) Streamline read-only to read-write page mappings. 6) For pmap_copy_page, don't enable write mapping for source page. 7) Correct and clean-up pmap_incore. 8) Cluster initial kern_exec pagin. 9) Removal of some minor lint from kern_malloc. 10) Correct some ioopt code. 11) Remove some dead code from the MI swapout routine. 12) Correct vm_object_deallocate (to remove backing_object ref.) 13) Fix dead object handling, that had problems under heavy memory load. 14) Add minor vm_page_lookup improvements. 15) Some pages are not in objects, and make sure that the vm_page.c can properly support such pages. 16) Add some more page deficit handling. 17) Some minor code readability improvements.
129 lines
4.4 KiB
C
129 lines
4.4 KiB
C
/*-
|
|
* Copyright (c) 1990 The Regents of the University of California.
|
|
* All rights reserved.
|
|
* Copyright (c) 1994 John S. Dyson
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* William Jolitz.
|
|
*
|
|
* 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: @(#)vmparam.h 5.9 (Berkeley) 5/12/91
|
|
* $Id: vmparam.h,v 1.27 1997/10/27 00:38:46 jkh Exp $
|
|
*/
|
|
|
|
|
|
#ifndef _MACHINE_VMPARAM_H_
|
|
#define _MACHINE_VMPARAM_H_ 1
|
|
|
|
/*
|
|
* Machine dependent constants for 386.
|
|
*/
|
|
|
|
#define VM_PROT_READ_IS_EXEC /* if you can read -- then you can exec */
|
|
|
|
/*
|
|
* Virtual memory related constants, all in bytes
|
|
*/
|
|
#define MAXTSIZ (16UL*1024*1024) /* max text size */
|
|
#ifndef DFLDSIZ
|
|
#define DFLDSIZ (64UL*1024*1024) /* initial data size limit */
|
|
#endif
|
|
#ifndef MAXDSIZ
|
|
#define MAXDSIZ (512UL*1024*1024) /* max data size */
|
|
#endif
|
|
#ifndef DFLSSIZ
|
|
#define DFLSSIZ (8UL*1024*1024) /* initial stack size limit */
|
|
#endif
|
|
#ifndef MAXSSIZ
|
|
#define MAXSSIZ (64UL*1024*1024) /* max stack size */
|
|
#endif
|
|
#ifndef SGROWSIZ
|
|
#define SGROWSIZ (128UL*1024) /* amount to grow stack */
|
|
#endif
|
|
|
|
#define USRTEXT (1*PAGE_SIZE) /* base of user text XXX bogus */
|
|
|
|
/*
|
|
* Size of the Shared Memory Pages page table.
|
|
*/
|
|
#ifndef SHMMAXPGS
|
|
#define SHMMAXPGS 1024 /* XXX until we have more kmap space */
|
|
#endif
|
|
|
|
/*
|
|
* The time for a process to be blocked before being very swappable.
|
|
* This is a number of seconds which the system takes as being a non-trivial
|
|
* amount of real time. You probably shouldn't change this;
|
|
* it is used in subtle ways (fractions and multiples of it are, that is, like
|
|
* half of a ``long time'', almost a long time, etc.)
|
|
* It is related to human patience and other factors which don't really
|
|
* change over time.
|
|
*/
|
|
#define MAXSLP 20
|
|
|
|
|
|
/*
|
|
* Virtual addresses of things. Derived from the page directory and
|
|
* page table indexes from pmap.h for precision.
|
|
* Because of the page that is both a PD and PT, it looks a little
|
|
* messy at times, but hey, we'll do anything to save a page :-)
|
|
*/
|
|
|
|
#define VM_MAX_KERNEL_ADDRESS VADDR(KPTDI+NKPDE, 0)
|
|
#define VM_MIN_KERNEL_ADDRESS VADDR(PTDPTDI, PTDPTDI)
|
|
|
|
#define KERNBASE VADDR(KPTDI, 0)
|
|
|
|
#define KPT_MAX_ADDRESS VADDR(PTDPTDI, KPTDI+NKPT)
|
|
#define KPT_MIN_ADDRESS VADDR(PTDPTDI, KPTDI)
|
|
|
|
#define UPT_MAX_ADDRESS VADDR(PTDPTDI, PTDPTDI)
|
|
#define UPT_MIN_ADDRESS VADDR(PTDPTDI, 0)
|
|
|
|
#define VM_MAXUSER_ADDRESS VADDR(UMAXPTDI, UMAXPTEOFF)
|
|
|
|
#define USRSTACK VM_MAXUSER_ADDRESS
|
|
|
|
#define VM_MAX_ADDRESS VADDR(PTDPTDI, PTDPTDI)
|
|
#define VM_MIN_ADDRESS ((vm_offset_t)0)
|
|
|
|
/* virtual sizes (bytes) for various kernel submaps */
|
|
#ifndef VM_KMEM_SIZE
|
|
#define VM_KMEM_SIZE (32 * 1024 * 1024)
|
|
#endif
|
|
|
|
/* initial pagein size of beginning of executable file */
|
|
#ifndef VM_INITIAL_PAGEIN
|
|
#define VM_INITIAL_PAGEIN 16
|
|
#endif
|
|
|
|
#endif /* _MACHINE_VMPARAM_H_ */
|