2005-01-06 22:18:23 +00:00
|
|
|
/*-
|
2000-09-29 13:46:07 +00:00
|
|
|
* Copyright (c) 1988 University of Utah.
|
|
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
|
* the Systems Programming Group of the University of Utah Computer
|
|
|
|
|
* Science Department and Ralph Campbell.
|
|
|
|
|
*
|
|
|
|
|
* 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.
|
|
|
|
|
* 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: Utah $Hdr: vmparam.h 1.16 91/01/18$
|
|
|
|
|
*
|
|
|
|
|
* @(#)vmparam.h 8.2 (Berkeley) 4/22/94
|
2008-04-18 02:21:11 +00:00
|
|
|
*
|
|
|
|
|
* $FreeBSD$
|
2000-09-29 13:46:07 +00:00
|
|
|
*/
|
|
|
|
|
|
2008-04-18 02:21:11 +00:00
|
|
|
#ifndef _MACHINE_VMPARAM_H_
|
|
|
|
|
#define _MACHINE_VMPARAM_H_
|
|
|
|
|
|
2000-09-29 13:46:07 +00:00
|
|
|
/*
|
|
|
|
|
* Virtual memory related constants, all in bytes
|
|
|
|
|
*/
|
|
|
|
|
#ifndef MAXTSIZ
|
|
|
|
|
#define MAXTSIZ (1<<30) /* max text size (1G) */
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef DFLDSIZ
|
|
|
|
|
#define DFLDSIZ (1<<27) /* initial data size (128M) */
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef MAXDSIZ
|
|
|
|
|
#define MAXDSIZ (1<<30) /* max data size (1G) */
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef DFLSSIZ
|
|
|
|
|
#define DFLSSIZ (1<<21) /* initial stack size (2M) */
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef MAXSSIZ
|
2002-03-19 11:07:09 +00:00
|
|
|
#define MAXSSIZ (1<<28) /* max stack size (256M) */
|
2000-09-29 13:46:07 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef SGROWSIZ
|
|
|
|
|
#define SGROWSIZ (128UL*1024) /* amount to grow stack */
|
|
|
|
|
#endif
|
|
|
|
|
|
2002-11-06 04:47:38 +00:00
|
|
|
/*
|
|
|
|
|
* We need region 7 virtual addresses for pagetables.
|
|
|
|
|
*/
|
|
|
|
|
#define UMA_MD_SMALL_ALLOC
|
|
|
|
|
|
2007-05-05 19:50:28 +00:00
|
|
|
/*
|
|
|
|
|
* The physical address space is sparsely populated.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_PHYSSEG_SPARSE
|
|
|
|
|
|
2007-06-10 23:39:07 +00:00
|
|
|
/*
|
|
|
|
|
* The number of PHYSSEG entries is equal to the number of phys_avail
|
|
|
|
|
* entries.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_PHYSSEG_MAX 49
|
|
|
|
|
|
|
|
|
|
/*
|
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-10 23:39:07 +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-10 23:39:07 +00:00
|
|
|
#define VM_FREEPOOL_DEFAULT 0
|
|
|
|
|
#define VM_FREEPOOL_DIRECT 1
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Create one free page list.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_NFREELIST 1
|
|
|
|
|
#define VM_FREELIST_DEFAULT 0
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* An allocation size of 256MB is supported in order to optimize the
|
|
|
|
|
* use of the identity mappings in region 7 by UMA.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_NFREEORDER 16
|
|
|
|
|
|
2007-12-27 16:45:39 +00:00
|
|
|
/*
|
|
|
|
|
* Disable superpage reservations.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_NRESERVLEVEL
|
|
|
|
|
#define VM_NRESERVLEVEL 0
|
|
|
|
|
#endif
|
|
|
|
|
|
2011-03-21 01:09:50 +00:00
|
|
|
#define IA64_VM_MINKERN_REGION 4
|
|
|
|
|
|
2002-05-19 04:42:19 +00:00
|
|
|
/*
|
|
|
|
|
* Manipulating region bits of an address.
|
|
|
|
|
*/
|
2010-05-19 00:23:10 +00:00
|
|
|
#define IA64_RR_BASE(n) (((uint64_t) (n)) << 61)
|
2002-05-19 04:42:19 +00:00
|
|
|
#define IA64_RR_MASK(x) ((x) & ((1L << 61) - 1))
|
|
|
|
|
|
2011-04-30 20:49:00 +00:00
|
|
|
#define IA64_PHYS_TO_RR6(x) ((x) | IA64_RR_BASE(6))
|
|
|
|
|
#define IA64_PHYS_TO_RR7(x) ((x) | IA64_RR_BASE(7))
|
2002-05-19 04:42:19 +00:00
|
|
|
|
2011-03-11 22:00:45 +00:00
|
|
|
/*
|
|
|
|
|
* The Itanium architecture defines that all implementations support at
|
|
|
|
|
* least 51 virtual address bits (i.e. IMPL_VA_MSB=50). The unimplemented
|
|
|
|
|
* bits are sign-extended from VA{IMPL_VA_MSB}. As such, there's a gap in
|
|
|
|
|
* the virtual address range, which extends at most from 0x0004000000000000
|
|
|
|
|
* to 0x1ffbffffffffffff. We define the top half of a region in terms of
|
|
|
|
|
* this worst-case gap.
|
|
|
|
|
*/
|
2011-03-21 01:09:50 +00:00
|
|
|
#define IA64_REGION_GAP_START 0x0004000000000000
|
|
|
|
|
#define IA64_REGION_GAP_EXTEND 0x1ffc000000000000
|
2011-03-11 22:00:45 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Parameters for Pre-Boot Virtual Memory (PBVM).
|
|
|
|
|
* The kernel, its modules and metadata are loaded in the PBVM by the loader.
|
|
|
|
|
* The PBVM consists of pages for which the mapping is maintained in a page
|
|
|
|
|
* table. The page table is at least 1 EFI page large (i.e. 4KB), but can be
|
|
|
|
|
* larger to accommodate more PBVM. The maximum page table size is 1MB. With
|
|
|
|
|
* 8 bytes per page table entry, this means that the PBVM has at least 512
|
|
|
|
|
* pages and at most 128K pages.
|
|
|
|
|
* The GNU toolchain (in particular GNU ld) does not support an alignment
|
|
|
|
|
* larger than 64K. This means that we cannot guarantee page alignment for
|
|
|
|
|
* a page size that's larger than 64K. We do want to have text and data in
|
|
|
|
|
* different pages, which means that the maximum usable page size is 64KB.
|
|
|
|
|
* Consequently:
|
|
|
|
|
* The maximum total PBVM size is 8GB -- enough for a DVD image. A page table
|
|
|
|
|
* of a single EFI page (4KB) allows for 32MB of PBVM.
|
|
|
|
|
*
|
|
|
|
|
* The kernel is given the PA and size of the page table that provides the
|
|
|
|
|
* mapping of the PBVM. The page table itself is assumed to be mapped at a
|
|
|
|
|
* known virtual address and using a single translation wired into the CPU.
|
|
|
|
|
* As such, the page table is assumed to be a power of 2 and naturally aligned.
|
|
|
|
|
* The kernel also assumes that a good portion of the kernel text is mapped
|
|
|
|
|
* and wired into the CPU, but does not assume that the mapping covers the
|
|
|
|
|
* whole of PBVM.
|
|
|
|
|
*/
|
2011-03-21 01:09:50 +00:00
|
|
|
#define IA64_PBVM_RR IA64_VM_MINKERN_REGION
|
2011-03-11 22:00:45 +00:00
|
|
|
#define IA64_PBVM_BASE \
|
2011-03-21 01:09:50 +00:00
|
|
|
(IA64_RR_BASE(IA64_PBVM_RR) + IA64_REGION_GAP_EXTEND)
|
2011-03-11 22:00:45 +00:00
|
|
|
|
|
|
|
|
#define IA64_PBVM_PGTBL_MAXSZ 1048576
|
|
|
|
|
#define IA64_PBVM_PGTBL \
|
|
|
|
|
(IA64_RR_BASE(IA64_PBVM_RR + 1) - IA64_PBVM_PGTBL_MAXSZ)
|
|
|
|
|
|
|
|
|
|
#define IA64_PBVM_PAGE_SHIFT 16 /* 64KB */
|
2011-03-14 23:49:41 +00:00
|
|
|
#define IA64_PBVM_PAGE_SIZE (1 << IA64_PBVM_PAGE_SHIFT)
|
2011-03-11 22:00:45 +00:00
|
|
|
#define IA64_PBVM_PAGE_MASK (IA64_PBVM_PAGE_SIZE - 1)
|
2003-10-20 05:34:10 +00:00
|
|
|
|
2000-09-29 13:46:07 +00:00
|
|
|
/*
|
|
|
|
|
* Mach derived constants
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* user/kernel map constants */
|
2011-03-21 01:09:50 +00:00
|
|
|
#define VM_MIN_ADDRESS 0
|
|
|
|
|
#define VM_MAXUSER_ADDRESS IA64_RR_BASE(IA64_VM_MINKERN_REGION)
|
2013-02-25 02:41:38 +00:00
|
|
|
#define VM_MIN_KERNEL_ADDRESS VM_MAXUSER_ADDRESS
|
|
|
|
|
#define VM_INIT_KERNEL_ADDRESS IA64_RR_BASE(IA64_VM_MINKERN_REGION + 1)
|
|
|
|
|
#define VM_MAX_KERNEL_ADDRESS (IA64_RR_BASE(IA64_VM_MINKERN_REGION + 2) - 1)
|
2011-03-18 15:36:28 +00:00
|
|
|
#define VM_MAX_ADDRESS ~0UL
|
2000-09-29 13:46:07 +00:00
|
|
|
|
2013-02-25 02:41:38 +00:00
|
|
|
/* We link the kernel at IA64_PBVM_BASE. */
|
|
|
|
|
#define KERNBASE IA64_PBVM_BASE
|
2002-05-19 04:42:19 +00:00
|
|
|
|
2011-03-21 01:09:50 +00:00
|
|
|
/*
|
|
|
|
|
* USRSTACK is the top (end) of the user stack. Immediately above the user
|
|
|
|
|
* stack resides the syscall gateway page.
|
|
|
|
|
*/
|
|
|
|
|
#define USRSTACK VM_MAXUSER_ADDRESS
|
|
|
|
|
#define IA64_BACKINGSTORE (USRSTACK - (2 * MAXSSIZ) - PAGE_SIZE)
|
|
|
|
|
|
2000-09-29 13:46:07 +00:00
|
|
|
/* virtual sizes (bytes) for various kernel submaps */
|
|
|
|
|
#ifndef VM_KMEM_SIZE
|
|
|
|
|
#define VM_KMEM_SIZE (12 * 1024 * 1024)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* How many physical pages per KVA page allocated.
|
2007-04-21 01:14:48 +00:00
|
|
|
* min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE),
|
|
|
|
|
* VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX)
|
2000-09-29 13:46:07 +00:00
|
|
|
* is the total KVA space allocated for kmem_map.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_KMEM_SIZE_SCALE
|
|
|
|
|
#define VM_KMEM_SIZE_SCALE (4) /* XXX 8192 byte pages */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* initial pagein size of beginning of executable file */
|
|
|
|
|
#ifndef VM_INITIAL_PAGEIN
|
|
|
|
|
#define VM_INITIAL_PAGEIN 16
|
|
|
|
|
#endif
|
|
|
|
|
|
2011-05-13 19:35:01 +00:00
|
|
|
#define ZERO_REGION_SIZE (2 * 1024 * 1024) /* 2MB */
|
|
|
|
|
|
2008-04-18 02:21:11 +00:00
|
|
|
#endif /* !_MACHINE_VMPARAM_H_ */
|
