9f0819bc54
Re-enables the RSS limiting, and the routine is now tail-recursive, making it much more safe (eliminates the possiblity of kernel stack overflow.) Also, the RSS limiting is a little more intelligent about finding the likely objects that are pushing the process over the limit. Added some sysctls that help with VM system tuning. New sysctl features: 1) Enable/disable lru pageout algorithm. vm.pageout_algorithm = 0, default algorithm that works well, especially using X windows and heavy memory loading. Can have adverse effects, sometimes slowing down program loading. vm.pageout_algorithm = 1, close to true LRU. Works much better than clock, etc. Does not work as well as the default algorithm in general. Certain memory "malloc" type benchmarks work a little better with this setting. Please give me feedback on the performance results associated with these. 2) Enable/disable swapping. vm.swapping_enabled = 1, default. vm.swapping_enabled = 0, useful for cases where swapping degrades performance. The config option "NO_SWAPPING" is still operative, and takes precedence over the sysctl. If "NO_SWAPPING" is specified, the sysctl still exists, but "vm.swapping_enabled" is hard-wired to "0". Each of these can be changed "on the fly."
166 lines
5.7 KiB
C
166 lines
5.7 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: @(#)vm_param.h 8.1 (Berkeley) 6/11/93
|
|
*
|
|
*
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
* All rights reserved.
|
|
*
|
|
* Authors: Avadis Tevanian, Jr., Michael Wayne Young
|
|
*
|
|
* 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: vm_param.h,v 1.5 1995/12/10 02:34:29 bde Exp $
|
|
*/
|
|
|
|
/*
|
|
* Machine independent virtual memory parameters.
|
|
*/
|
|
|
|
#ifndef _VM_PARAM_
|
|
#define _VM_PARAM_
|
|
|
|
#include <machine/vmparam.h>
|
|
|
|
/*
|
|
* The machine independent pages are refered to as PAGES. A page
|
|
* is some number of hardware pages, depending on the target machine.
|
|
*/
|
|
#define DEFAULT_PAGE_SIZE 4096
|
|
|
|
#if 0
|
|
|
|
/*
|
|
* All references to the size of a page should be done with PAGE_SIZE
|
|
* or PAGE_SHIFT. The fact they are variables is hidden here so that
|
|
* we can easily make them constant if we so desire.
|
|
*/
|
|
#ifndef PAGE_SIZE
|
|
#define PAGE_SIZE cnt.v_page_size /* size of page */
|
|
#endif
|
|
#ifndef PAGE_MASK
|
|
#define PAGE_MASK page_mask /* size of page - 1 */
|
|
#endif
|
|
#ifndef PAGE_SHIFT
|
|
#define PAGE_SHIFT page_shift /* bits to shift for pages */
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#ifdef KERNEL
|
|
extern vm_size_t page_mask;
|
|
extern int page_shift;
|
|
|
|
#endif
|
|
|
|
/*
|
|
* CTL_VM identifiers
|
|
*/
|
|
#define VM_METER 1 /* struct vmmeter */
|
|
#define VM_LOADAVG 2 /* struct loadavg */
|
|
#define VM_V_FREE_MIN 3 /* cnt.v_free_min */
|
|
#define VM_V_FREE_TARGET 4 /* cnt.v_free_target */
|
|
#define VM_V_FREE_RESERVED 5 /* cnt.v_free_reserved */
|
|
#define VM_V_INACTIVE_TARGET 6 /* cnt.v_inactive_target */
|
|
#define VM_V_CACHE_MIN 7 /* cnt.v_cache_max */
|
|
#define VM_V_CACHE_MAX 8 /* cnt.v_cache_min */
|
|
#define VM_V_PAGEOUT_FREE_MIN 9 /* cnt.v_pageout_free_min */
|
|
#define VM_PAGEOUT_ALGORITHM 10 /* pageout algorithm */
|
|
#define VM_SWAPPING_ENABLED 11 /* swapping enabled */
|
|
#define VM_MAXID 12 /* number of valid vm ids */
|
|
|
|
#define CTL_VM_NAMES { \
|
|
{ 0, 0 }, \
|
|
{ "vmmeter", CTLTYPE_STRUCT }, \
|
|
{ "loadavg", CTLTYPE_STRUCT }, \
|
|
{ "v_free_min", CTLTYPE_INT }, \
|
|
{ "v_free_target", CTLTYPE_INT }, \
|
|
{ "v_free_reserved", CTLTYPE_INT }, \
|
|
{ "v_inactive_target", CTLTYPE_INT }, \
|
|
{ "v_cache_min", CTLTYPE_INT }, \
|
|
{ "v_cache_max", CTLTYPE_INT }, \
|
|
{ "v_pageout_free_min", CTLTYPE_INT}, \
|
|
{ "pageout_algorithm", CTLTYPE_INT}, \
|
|
{ "swapping_enabled", CTLTYPE_INT},\
|
|
}
|
|
|
|
/*
|
|
* Return values from the VM routines.
|
|
*/
|
|
#define KERN_SUCCESS 0
|
|
#define KERN_INVALID_ADDRESS 1
|
|
#define KERN_PROTECTION_FAILURE 2
|
|
#define KERN_NO_SPACE 3
|
|
#define KERN_INVALID_ARGUMENT 4
|
|
#define KERN_FAILURE 5
|
|
#define KERN_RESOURCE_SHORTAGE 6
|
|
#define KERN_NOT_RECEIVER 7
|
|
#define KERN_NO_ACCESS 8
|
|
|
|
#ifndef ASSEMBLER
|
|
/*
|
|
* Convert addresses to pages and vice versa.
|
|
* No rounding is used.
|
|
*/
|
|
#ifdef KERNEL
|
|
#define num_pages(x) \
|
|
((vm_offset_t)((((vm_offset_t)(x)) + PAGE_MASK) >> PAGE_SHIFT))
|
|
|
|
extern vm_size_t mem_size; /* size of physical memory (bytes) */
|
|
extern vm_offset_t first_addr; /* first physical page */
|
|
extern vm_offset_t last_addr; /* last physical page */
|
|
#endif /* KERNEL */
|
|
#endif /* ASSEMBLER */
|
|
#endif /* _VM_PARAM_ */
|