2004-05-14 11:46:45 +00:00
|
|
|
/* $NetBSD: vmparam.h,v 1.26 2003/08/07 16:27:47 agc Exp $ */
|
|
|
|
|
|
2005-01-05 21:58:49 +00:00
|
|
|
/*-
|
2004-05-14 11:46:45 +00:00
|
|
|
* Copyright (c) 1988 The Regents of the University of California.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* 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. 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.
|
|
|
|
|
*
|
|
|
|
|
* $FreeBSD$
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef _MACHINE_VMPARAM_H_
|
|
|
|
|
#define _MACHINE_VMPARAM_H_
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*#include <arm/arm32/vmparam.h>
|
|
|
|
|
*/
|
|
|
|
|
/*
|
|
|
|
|
* Address space constants
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The line between user space and kernel space
|
|
|
|
|
* Mappings >= KERNEL_BASE are constant across all processes
|
|
|
|
|
*/
|
|
|
|
|
#define KERNBASE 0xc0000000
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* max number of non-contig chunks of physical RAM you can have
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define VM_PHYSSEG_MAX 32
|
|
|
|
|
|
2007-05-05 19:50:28 +00:00
|
|
|
/*
|
|
|
|
|
* The physical address space is densely populated.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_PHYSSEG_DENSE
|
|
|
|
|
|
2007-06-04 08:02:22 +00:00
|
|
|
/*
|
Change the management of cached pages (PQ_CACHE) in two fundamental
ways:
(1) Cached pages are no longer kept in the object's resident page
splay tree and memq. Instead, they are kept in a separate per-object
splay tree of cached pages. However, access to this new per-object
splay tree is synchronized by the _free_ page queues lock, not to be
confused with the heavily contended page queues lock. Consequently, a
cached page can be reclaimed by vm_page_alloc(9) without acquiring the
object's lock or the page queues lock.
This solves a problem independently reported by tegge@ and Isilon.
Specifically, they observed the page daemon consuming a great deal of
CPU time because of pages bouncing back and forth between the cache
queue (PQ_CACHE) and the inactive queue (PQ_INACTIVE). The source of
this problem turned out to be a deadlock avoidance strategy employed
when selecting a cached page to reclaim in vm_page_select_cache().
However, the root cause was really that reclaiming a cached page
required the acquisition of an object lock while the page queues lock
was already held. Thus, this change addresses the problem at its
root, by eliminating the need to acquire the object's lock.
Moreover, keeping cached pages in the object's primary splay tree and
memq was, in effect, optimizing for the uncommon case. Cached pages
are reclaimed far, far more often than they are reactivated. Instead,
this change makes reclamation cheaper, especially in terms of
synchronization overhead, and reactivation more expensive, because
reactivated pages will have to be reentered into the object's primary
splay tree and memq.
(2) Cached pages are now stored alongside free pages in the physical
memory allocator's buddy queues, increasing the likelihood that large
allocations of contiguous physical memory (i.e., superpages) will
succeed.
Finally, as a result of this change long-standing restrictions on when
and where a cached page can be reclaimed and returned by
vm_page_alloc(9) are eliminated. Specifically, calls to
vm_page_alloc(9) specifying VM_ALLOC_INTERRUPT can now reclaim and
return a formerly cached page. Consequently, a call to malloc(9)
specifying M_NOWAIT is less likely to fail.
Discussed with: many over the course of the summer, including jeff@,
Justin Husted @ Isilon, peter@, tegge@
Tested by: an earlier version by kris@
Approved by: re (kensmith)
2007-09-25 06:25:06 +00:00
|
|
|
* Create three free page pools: VM_FREEPOOL_DEFAULT is the default pool
|
2007-06-04 08:02:22 +00:00
|
|
|
* from which physical pages are allocated and VM_FREEPOOL_DIRECT is
|
|
|
|
|
* the pool from which physical pages for small UMA objects are
|
|
|
|
|
* allocated.
|
|
|
|
|
*/
|
Change the management of cached pages (PQ_CACHE) in two fundamental
ways:
(1) Cached pages are no longer kept in the object's resident page
splay tree and memq. Instead, they are kept in a separate per-object
splay tree of cached pages. However, access to this new per-object
splay tree is synchronized by the _free_ page queues lock, not to be
confused with the heavily contended page queues lock. Consequently, a
cached page can be reclaimed by vm_page_alloc(9) without acquiring the
object's lock or the page queues lock.
This solves a problem independently reported by tegge@ and Isilon.
Specifically, they observed the page daemon consuming a great deal of
CPU time because of pages bouncing back and forth between the cache
queue (PQ_CACHE) and the inactive queue (PQ_INACTIVE). The source of
this problem turned out to be a deadlock avoidance strategy employed
when selecting a cached page to reclaim in vm_page_select_cache().
However, the root cause was really that reclaiming a cached page
required the acquisition of an object lock while the page queues lock
was already held. Thus, this change addresses the problem at its
root, by eliminating the need to acquire the object's lock.
Moreover, keeping cached pages in the object's primary splay tree and
memq was, in effect, optimizing for the uncommon case. Cached pages
are reclaimed far, far more often than they are reactivated. Instead,
this change makes reclamation cheaper, especially in terms of
synchronization overhead, and reactivation more expensive, because
reactivated pages will have to be reentered into the object's primary
splay tree and memq.
(2) Cached pages are now stored alongside free pages in the physical
memory allocator's buddy queues, increasing the likelihood that large
allocations of contiguous physical memory (i.e., superpages) will
succeed.
Finally, as a result of this change long-standing restrictions on when
and where a cached page can be reclaimed and returned by
vm_page_alloc(9) are eliminated. Specifically, calls to
vm_page_alloc(9) specifying VM_ALLOC_INTERRUPT can now reclaim and
return a formerly cached page. Consequently, a call to malloc(9)
specifying M_NOWAIT is less likely to fail.
Discussed with: many over the course of the summer, including jeff@,
Justin Husted @ Isilon, peter@, tegge@
Tested by: an earlier version by kris@
Approved by: re (kensmith)
2007-09-25 06:25:06 +00:00
|
|
|
#define VM_NFREEPOOL 3
|
|
|
|
|
#define VM_FREEPOOL_CACHE 2
|
2007-06-04 08:02:22 +00:00
|
|
|
#define VM_FREEPOOL_DEFAULT 0
|
|
|
|
|
#define VM_FREEPOOL_DIRECT 1
|
|
|
|
|
|
2004-05-14 11:46:45 +00:00
|
|
|
/*
|
|
|
|
|
* we support 2 free lists:
|
|
|
|
|
*
|
|
|
|
|
* - DEFAULT for all systems
|
|
|
|
|
* - ISADMA for the ISA DMA range on Sharks only
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define VM_NFREELIST 2
|
|
|
|
|
#define VM_FREELIST_DEFAULT 0
|
|
|
|
|
#define VM_FREELIST_ISADMA 1
|
|
|
|
|
|
2007-06-04 08:02:22 +00:00
|
|
|
/*
|
|
|
|
|
* The largest allocation size is 1MB.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_NFREEORDER 9
|
|
|
|
|
|
2010-07-27 20:33:50 +00:00
|
|
|
/*
|
|
|
|
|
* Only one memory domain.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_NDOMAIN
|
|
|
|
|
#define VM_NDOMAIN 1
|
|
|
|
|
#endif
|
|
|
|
|
|
2007-12-27 16:45:39 +00:00
|
|
|
/*
|
|
|
|
|
* Disable superpage reservations.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_NRESERVLEVEL
|
|
|
|
|
#define VM_NRESERVLEVEL 0
|
|
|
|
|
#endif
|
|
|
|
|
|
2004-05-14 11:46:45 +00:00
|
|
|
#define UPT_MAX_ADDRESS VADDR(UPTPTDI + 3, 0)
|
|
|
|
|
#define UPT_MIN_ADDRESS VADDR(UPTPTDI, 0)
|
|
|
|
|
|
|
|
|
|
#define VM_MIN_ADDRESS (0x00001000)
|
2006-08-08 20:59:38 +00:00
|
|
|
#ifdef ARM_USE_SMALL_ALLOC
|
2012-06-13 05:02:51 +00:00
|
|
|
/*
|
2009-01-22 15:36:11 +00:00
|
|
|
* ARM_KERN_DIRECTMAP is used to make sure there's enough space between
|
|
|
|
|
* VM_MAXUSER_ADDRESS and KERNBASE to map the whole memory.
|
|
|
|
|
* It has to be a compile-time constant, even if arm_init_smallalloc(),
|
|
|
|
|
* which will do the mapping, gets the real amount of memory at runtime,
|
|
|
|
|
* because VM_MAXUSER_ADDRESS is a constant.
|
|
|
|
|
*/
|
2006-08-08 20:59:38 +00:00
|
|
|
#ifndef ARM_KERN_DIRECTMAP
|
|
|
|
|
#define ARM_KERN_DIRECTMAP 512 * 1024 * 1024 /* 512 MB */
|
|
|
|
|
#endif
|
|
|
|
|
#define VM_MAXUSER_ADDRESS KERNBASE - ARM_KERN_DIRECTMAP
|
|
|
|
|
#else /* ARM_USE_SMALL_ALLOC */
|
2012-08-15 03:03:03 +00:00
|
|
|
#ifndef VM_MAXUSER_ADDRESS
|
2004-05-14 11:46:45 +00:00
|
|
|
#define VM_MAXUSER_ADDRESS KERNBASE
|
2012-08-15 03:03:03 +00:00
|
|
|
#endif /* VM_MAXUSER_ADDRESS */
|
2006-08-08 20:59:38 +00:00
|
|
|
#endif /* ARM_USE_SMALL_ALLOC */
|
2004-05-14 11:46:45 +00:00
|
|
|
#define VM_MAX_ADDRESS VM_MAXUSER_ADDRESS
|
|
|
|
|
|
|
|
|
|
#define USRSTACK VM_MAXUSER_ADDRESS
|
|
|
|
|
|
|
|
|
|
/* initial pagein size of beginning of executable file */
|
|
|
|
|
#ifndef VM_INITIAL_PAGEIN
|
|
|
|
|
#define VM_INITIAL_PAGEIN 16
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef VM_MIN_KERNEL_ADDRESS
|
|
|
|
|
#define VM_MIN_KERNEL_ADDRESS KERNBASE
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define VM_MAX_KERNEL_ADDRESS 0xffffffff
|
|
|
|
|
/*
|
2004-08-02 12:23:53 +00:00
|
|
|
* Virtual size (bytes) for various kernel submaps.
|
|
|
|
|
*/
|
|
|
|
|
|
2004-05-14 11:46:45 +00:00
|
|
|
#ifndef VM_KMEM_SIZE
|
|
|
|
|
#define VM_KMEM_SIZE (12*1024*1024)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define MAXTSIZ (16*1024*1024)
|
2011-10-04 17:00:50 +00:00
|
|
|
#ifndef DFLDSIZ
|
2004-05-14 11:46:45 +00:00
|
|
|
#define DFLDSIZ (128*1024*1024)
|
2011-10-04 17:00:50 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef MAXDSIZ
|
2004-05-14 11:46:45 +00:00
|
|
|
#define MAXDSIZ (512*1024*1024)
|
2011-10-04 17:00:50 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef DFLSSIZ
|
2004-05-14 11:46:45 +00:00
|
|
|
#define DFLSSIZ (2*1024*1024)
|
2011-10-04 17:00:50 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef MAXSSIZ
|
2004-05-14 11:46:45 +00:00
|
|
|
#define MAXSSIZ (8*1024*1024)
|
2011-10-04 17:00:50 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef SGROWSIZ
|
2004-05-14 11:46:45 +00:00
|
|
|
#define SGROWSIZ (128*1024)
|
2011-10-04 17:00:50 +00:00
|
|
|
#endif
|
2004-05-14 11:46:45 +00:00
|
|
|
|
2005-06-07 23:04:24 +00:00
|
|
|
#ifdef ARM_USE_SMALL_ALLOC
|
|
|
|
|
#define UMA_MD_SMALL_ALLOC
|
|
|
|
|
#endif /* ARM_USE_SMALL_ALLOC */
|
2011-05-13 19:35:01 +00:00
|
|
|
|
|
|
|
|
#define ZERO_REGION_SIZE (64 * 1024) /* 64KB */
|
|
|
|
|
|
2004-05-14 11:46:45 +00:00
|
|
|
#endif /* _MACHINE_VMPARAM_H_ */
|
