f27c8b35e2
now it uses a very dumb first-touch allocation policy. This will change in the future. - Each architecture indicates the maximum number of supported memory domains via a new VM_NDOMAIN parameter in <machine/vmparam.h>. - Each cpu now has a PCPU_GET(domain) member to indicate the memory domain a CPU belongs to. Domain values are dense and numbered from 0. - When a platform supports multiple domains, the default freelist (VM_FREELIST_DEFAULT) is split up into N freelists, one for each domain. The MD code is required to populate an array of mem_affinity structures. Each entry in the array defines a range of memory (start and end) and a domain for the range. Multiple entries may be present for a single domain. The list is terminated by an entry where all fields are zero. This array of structures is used to split up phys_avail[] regions that fall in VM_FREELIST_DEFAULT into per-domain freelists. - Each memory domain has a separate lookup-array of freelists that is used when fulfulling a physical memory allocation. Right now the per-domain freelists are listed in a round-robin order for each domain. In the future a table such as the ACPI SLIT table may be used to order the per-domain lookup lists based on the penalty for each memory domain relative to a specific domain. The lookup lists may be examined via a new vm.phys.lookup_lists sysctl. - The first-touch policy is implemented by using PCPU_GET(domain) to pick a lookup list when allocating memory. Reviewed by: alc
192 lines
5.6 KiB
C
192 lines
5.6 KiB
C
/*-
|
|
* 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
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _MACHINE_VMPARAM_H_
|
|
#define _MACHINE_VMPARAM_H_
|
|
|
|
/*
|
|
* USRSTACK is the top (end) of the user stack. Immediately above the user
|
|
* stack resides the syscall gateway page.
|
|
*/
|
|
#define USRSTACK VM_MAX_ADDRESS
|
|
|
|
/*
|
|
* 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
|
|
#define MAXSSIZ (1<<28) /* max stack size (256M) */
|
|
#endif
|
|
#ifndef SGROWSIZ
|
|
#define SGROWSIZ (128UL*1024) /* amount to grow stack */
|
|
#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
|
|
|
|
/*
|
|
* We need region 7 virtual addresses for pagetables.
|
|
*/
|
|
#define UMA_MD_SMALL_ALLOC
|
|
|
|
/*
|
|
* The physical address space is sparsely populated.
|
|
*/
|
|
#define VM_PHYSSEG_SPARSE
|
|
|
|
/*
|
|
* The number of PHYSSEG entries is equal to the number of phys_avail
|
|
* entries.
|
|
*/
|
|
#define VM_PHYSSEG_MAX 49
|
|
|
|
/*
|
|
* Create three free page pools: VM_FREEPOOL_DEFAULT is the default pool
|
|
* from which physical pages are allocated and VM_FREEPOOL_DIRECT is
|
|
* the pool from which physical pages for small UMA objects are
|
|
* allocated.
|
|
*/
|
|
#define VM_NFREEPOOL 3
|
|
#define VM_FREEPOOL_CACHE 2
|
|
#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
|
|
|
|
/*
|
|
* Only one memory domain.
|
|
*/
|
|
#ifndef VM_NDOMAIN
|
|
#define VM_NDOMAIN 1
|
|
#endif
|
|
|
|
/*
|
|
* Disable superpage reservations.
|
|
*/
|
|
#ifndef VM_NRESERVLEVEL
|
|
#define VM_NRESERVLEVEL 0
|
|
#endif
|
|
|
|
/*
|
|
* Manipulating region bits of an address.
|
|
*/
|
|
#define IA64_RR_BASE(n) (((uint64_t) (n)) << 61)
|
|
#define IA64_RR_MASK(x) ((x) & ((1L << 61) - 1))
|
|
|
|
#define IA64_PHYS_TO_RR7(x) ((x) | IA64_RR_BASE(7))
|
|
|
|
/*
|
|
* Page size of the identity mappings in region 7.
|
|
*/
|
|
#ifndef LOG2_ID_PAGE_SIZE
|
|
#define LOG2_ID_PAGE_SIZE 28 /* 256M */
|
|
#endif
|
|
|
|
#define IA64_ID_PAGE_SHIFT (LOG2_ID_PAGE_SIZE)
|
|
#define IA64_ID_PAGE_SIZE (1<<(LOG2_ID_PAGE_SIZE))
|
|
#define IA64_ID_PAGE_MASK (IA64_ID_PAGE_SIZE-1)
|
|
|
|
#define IA64_BACKINGSTORE IA64_RR_BASE(4)
|
|
|
|
/*
|
|
* Mach derived constants
|
|
*/
|
|
|
|
/* user/kernel map constants */
|
|
#define VM_MIN_ADDRESS 0
|
|
#define VM_MAX_ADDRESS IA64_RR_BASE(5)
|
|
#define VM_GATEWAY_SIZE PAGE_SIZE
|
|
#define VM_MAXUSER_ADDRESS (VM_MAX_ADDRESS + VM_GATEWAY_SIZE)
|
|
#define VM_MIN_KERNEL_ADDRESS VM_MAXUSER_ADDRESS
|
|
#define VM_MAX_KERNEL_ADDRESS (IA64_RR_BASE(6) - 1)
|
|
|
|
#define KERNBASE VM_MAX_ADDRESS
|
|
|
|
/* 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.
|
|
* min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE),
|
|
* VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX)
|
|
* 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
|
|
|
|
#endif /* !_MACHINE_VMPARAM_H_ */
|