1993-06-12 14:58:17 +00:00
|
|
|
/*-
|
|
|
|
|
* Copyright (c) 1990 The Regents of the University of California.
|
|
|
|
|
* All rights reserved.
|
1994-01-14 16:25:31 +00:00
|
|
|
* Copyright (c) 1994 John S. Dyson
|
|
|
|
|
* All rights reserved.
|
2003-11-08 04:39:22 +00:00
|
|
|
* Copyright (c) 2003 Peter Wemm
|
|
|
|
|
* All rights reserved.
|
1993-06-12 14:58:17 +00:00
|
|
|
*
|
|
|
|
|
* 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.
|
|
|
|
|
*
|
1993-10-15 10:07:45 +00:00
|
|
|
* from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1993-06-12 14:58:17 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
1993-11-07 17:43:17 +00:00
|
|
|
#ifndef _MACHINE_VMPARAM_H_
|
2003-05-23 05:04:54 +00:00
|
|
|
#define _MACHINE_VMPARAM_H_ 1
|
1993-11-07 17:43:17 +00:00
|
|
|
|
1993-06-12 14:58:17 +00:00
|
|
|
/*
|
2003-05-01 01:05:25 +00:00
|
|
|
* Machine dependent constants for AMD64.
|
1993-06-12 14:58:17 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Virtual memory related constants, all in bytes
|
|
|
|
|
*/
|
1998-06-12 09:10:22 +00:00
|
|
|
#define MAXTSIZ (128UL*1024*1024) /* max text size */
|
1993-06-12 14:58:17 +00:00
|
|
|
#ifndef DFLDSIZ
|
1998-06-12 09:10:22 +00:00
|
|
|
#define DFLDSIZ (128UL*1024*1024) /* initial data size limit */
|
1993-06-12 14:58:17 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef MAXDSIZ
|
2004-10-27 17:21:15 +00:00
|
|
|
#define MAXDSIZ (32768UL*1024*1024) /* max data size */
|
1993-06-12 14:58:17 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef DFLSSIZ
|
1994-03-21 09:35:24 +00:00
|
|
|
#define DFLSSIZ (8UL*1024*1024) /* initial stack size limit */
|
1993-06-12 14:58:17 +00:00
|
|
|
#endif
|
|
|
|
|
#ifndef MAXSSIZ
|
2003-09-25 01:11:17 +00:00
|
|
|
#define MAXSSIZ (512UL*1024*1024) /* max stack size */
|
1993-06-12 14:58:17 +00:00
|
|
|
#endif
|
1994-03-21 09:35:24 +00:00
|
|
|
#ifndef SGROWSIZ
|
2003-05-23 05:04:54 +00:00
|
|
|
#define SGROWSIZ (128UL*1024) /* amount to grow stack */
|
1994-03-21 09:35:24 +00:00
|
|
|
#endif
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* 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
|
|
|
|
|
|
2003-05-23 05:04:54 +00:00
|
|
|
/*
|
2003-05-23 06:36:46 +00:00
|
|
|
* We provide a machine specific single page allocator through the use
|
2003-05-23 05:04:54 +00:00
|
|
|
* of the direct mapped segment. This uses 2MB pages for reduced
|
|
|
|
|
* TLB pressure.
|
|
|
|
|
*/
|
|
|
|
|
#define UMA_MD_SMALL_ALLOC
|
1996-04-30 12:02:12 +00:00
|
|
|
|
2007-05-05 19:50:28 +00:00
|
|
|
/*
|
|
|
|
|
* The physical address space is densely populated.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_PHYSSEG_DENSE
|
|
|
|
|
|
2007-06-03 23:18:29 +00:00
|
|
|
/*
|
|
|
|
|
* The number of PHYSSEG entries must be one greater than the number
|
|
|
|
|
* of phys_avail entries because the phys_avail entry that spans the
|
|
|
|
|
* largest physical address that is accessible by ISA DMA is split
|
|
|
|
|
* into two PHYSSEG entries.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_PHYSSEG_MAX 31
|
|
|
|
|
|
|
|
|
|
/*
|
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-03 23:18:29 +00:00
|
|
|
* from which physical pages are allocated and VM_FREEPOOL_DIRECT is
|
|
|
|
|
* the pool from which physical pages for page tables and 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-03 23:18:29 +00:00
|
|
|
#define VM_FREEPOOL_DEFAULT 0
|
|
|
|
|
#define VM_FREEPOOL_DIRECT 1
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Create two free page lists: VM_FREELIST_DEFAULT is for physical
|
|
|
|
|
* pages that are above the largest physical address that is
|
|
|
|
|
* accessible by ISA DMA and VM_FREELIST_ISADMA is for physical pages
|
|
|
|
|
* that are below that address.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_NFREELIST 2
|
|
|
|
|
#define VM_FREELIST_DEFAULT 0
|
|
|
|
|
#define VM_FREELIST_ISADMA 1
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* An allocation size of 16MB is supported in order to optimize the
|
|
|
|
|
* use of the direct map by UMA. Specifically, a cache line contains
|
|
|
|
|
* at most 8 PDEs, collectively mapping 16MB of physical memory. By
|
|
|
|
|
* reducing the number of distinct 16MB "pages" that are used by UMA,
|
|
|
|
|
* the physical memory allocator reduces the likelihood of both 2MB
|
|
|
|
|
* page TLB misses and cache misses caused by 2MB page TLB misses.
|
|
|
|
|
*/
|
|
|
|
|
#define VM_NFREEORDER 13
|
|
|
|
|
|
2007-12-27 16:45:39 +00:00
|
|
|
/*
|
|
|
|
|
* Enable superpage reservations: 1 level.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_NRESERVLEVEL
|
|
|
|
|
#define VM_NRESERVLEVEL 1
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Level 0 reservations consist of 512 pages.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_LEVEL_0_ORDER
|
|
|
|
|
#define VM_LEVEL_0_ORDER 9
|
|
|
|
|
#endif
|
|
|
|
|
|
1993-06-12 14:58:17 +00:00
|
|
|
/*
|
1996-04-30 12:02:12 +00:00
|
|
|
* Virtual addresses of things. Derived from the page directory and
|
|
|
|
|
* page table indexes from pmap.h for precision.
|
2008-06-30 03:14:39 +00:00
|
|
|
*
|
|
|
|
|
* 0x0000000000000000 - 0x00007fffffffffff user map
|
|
|
|
|
* 0x0000800000000000 - 0xffff7fffffffffff does not exist (hole)
|
|
|
|
|
* 0xffff800000000000 - 0xffff804020100fff recursive page table (512GB slot)
|
|
|
|
|
* 0xffff804020101000 - 0xfffffeffffffffff unused
|
|
|
|
|
* 0xffffff0000000000 - 0xffffff7fffffffff 512GB direct map mappings
|
2008-07-05 20:44:55 +00:00
|
|
|
* 0xffffff8000000000 - 0xfffffffe3fffffff unused (505GB)
|
|
|
|
|
* 0xfffffffe40000000 - 0xffffffffffffffff 7GB kernel map
|
2008-06-30 03:14:39 +00:00
|
|
|
*
|
|
|
|
|
* Within the kernel map:
|
|
|
|
|
*
|
|
|
|
|
* 0xffffffff80000000 KERNBASE
|
1993-06-12 14:58:17 +00:00
|
|
|
*/
|
|
|
|
|
|
2008-06-29 19:13:27 +00:00
|
|
|
#define VM_MAX_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-1, NPDEPG-1, NPTEPG-1)
|
2008-07-08 22:59:17 +00:00
|
|
|
#define VM_MIN_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-7, 0, 0)
|
2003-05-23 05:04:54 +00:00
|
|
|
|
2003-07-09 23:04:23 +00:00
|
|
|
#define DMAP_MIN_ADDRESS KVADDR(DMPML4I, 0, 0, 0)
|
|
|
|
|
#define DMAP_MAX_ADDRESS KVADDR(DMPML4I+1, 0, 0, 0)
|
2003-05-23 05:04:54 +00:00
|
|
|
|
2008-07-08 22:59:17 +00:00
|
|
|
#define KERNBASE KVADDR(KPML4I, KPDPI, 0, 0)
|
1996-04-30 12:02:12 +00:00
|
|
|
|
2003-07-09 23:04:23 +00:00
|
|
|
#define UPT_MAX_ADDRESS KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I)
|
|
|
|
|
#define UPT_MIN_ADDRESS KVADDR(PML4PML4I, 0, 0, 0)
|
1996-04-30 12:02:12 +00:00
|
|
|
|
2003-07-09 23:04:23 +00:00
|
|
|
#define VM_MAXUSER_ADDRESS UVADDR(NUPML4E, 0, 0, 0)
|
1996-04-30 12:02:12 +00:00
|
|
|
|
2003-05-23 05:04:54 +00:00
|
|
|
#define USRSTACK VM_MAXUSER_ADDRESS
|
1996-04-30 12:02:12 +00:00
|
|
|
|
2003-05-23 05:04:54 +00:00
|
|
|
#define VM_MAX_ADDRESS UPT_MAX_ADDRESS
|
|
|
|
|
#define VM_MIN_ADDRESS (0)
|
1994-01-14 16:25:31 +00:00
|
|
|
|
2003-05-23 05:04:54 +00:00
|
|
|
#define PHYS_TO_DMAP(x) ((x) | DMAP_MIN_ADDRESS)
|
|
|
|
|
#define DMAP_TO_PHYS(x) ((x) & ~DMAP_MIN_ADDRESS)
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
|
/* virtual sizes (bytes) for various kernel submaps */
|
1997-06-25 20:18:58 +00:00
|
|
|
#ifndef VM_KMEM_SIZE
|
2003-05-23 05:04:54 +00:00
|
|
|
#define VM_KMEM_SIZE (12 * 1024 * 1024)
|
1998-02-23 07:42:43 +00:00
|
|
|
#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)
|
1998-02-23 07:42:43 +00:00
|
|
|
* is the total KVA space allocated for kmem_map.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_KMEM_SIZE_SCALE
|
|
|
|
|
#define VM_KMEM_SIZE_SCALE (3)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Ceiling on amount of kmem_map kva space.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef VM_KMEM_SIZE_MAX
|
2008-07-03 04:53:14 +00:00
|
|
|
#define VM_KMEM_SIZE_MAX ((VM_MAX_KERNEL_ADDRESS - \
|
|
|
|
|
VM_MIN_KERNEL_ADDRESS + 1) * 3 / 5)
|
1997-06-25 20:18:58 +00:00
|
|
|
#endif
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1998-02-05 03:32:49 +00:00
|
|
|
/* initial pagein size of beginning of executable file */
|
|
|
|
|
#ifndef VM_INITIAL_PAGEIN
|
|
|
|
|
#define VM_INITIAL_PAGEIN 16
|
|
|
|
|
#endif
|
|
|
|
|
|
1993-11-07 17:43:17 +00:00
|
|
|
#endif /* _MACHINE_VMPARAM_H_ */
|
