vmparam.h revision 208283
1/*- 2 * Copyright (c) 1988 University of Utah. 3 * Copyright (c) 1992, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * the Systems Programming Group of the University of Utah Computer 8 * Science Department and Ralph Campbell. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 4. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 35 * 36 * @(#)vmparam.h 8.2 (Berkeley) 4/22/94 37 * 38 * $FreeBSD: head/sys/ia64/include/vmparam.h 208283 2010-05-19 00:23:10Z marcel $ 39 */ 40 41#ifndef _MACHINE_VMPARAM_H_ 42#define _MACHINE_VMPARAM_H_ 43 44/* 45 * USRSTACK is the top (end) of the user stack. Immediately above the user 46 * stack resides the syscall gateway page. 47 */ 48#define USRSTACK VM_MAX_ADDRESS 49 50/* 51 * Virtual memory related constants, all in bytes 52 */ 53#ifndef MAXTSIZ 54#define MAXTSIZ (1<<30) /* max text size (1G) */ 55#endif 56#ifndef DFLDSIZ 57#define DFLDSIZ (1<<27) /* initial data size (128M) */ 58#endif 59#ifndef MAXDSIZ 60#define MAXDSIZ (1<<30) /* max data size (1G) */ 61#endif 62#ifndef DFLSSIZ 63#define DFLSSIZ (1<<21) /* initial stack size (2M) */ 64#endif 65#ifndef MAXSSIZ 66#define MAXSSIZ (1<<28) /* max stack size (256M) */ 67#endif 68#ifndef SGROWSIZ 69#define SGROWSIZ (128UL*1024) /* amount to grow stack */ 70#endif 71 72/* 73 * The time for a process to be blocked before being very swappable. 74 * This is a number of seconds which the system takes as being a non-trivial 75 * amount of real time. You probably shouldn't change this; 76 * it is used in subtle ways (fractions and multiples of it are, that is, like 77 * half of a ``long time'', almost a long time, etc.) 78 * It is related to human patience and other factors which don't really 79 * change over time. 80 */ 81#define MAXSLP 20 82 83/* 84 * We need region 7 virtual addresses for pagetables. 85 */ 86#define UMA_MD_SMALL_ALLOC 87 88/* 89 * The physical address space is sparsely populated. 90 */ 91#define VM_PHYSSEG_SPARSE 92 93/* 94 * The number of PHYSSEG entries is equal to the number of phys_avail 95 * entries. 96 */ 97#define VM_PHYSSEG_MAX 49 98 99/* 100 * Create three free page pools: VM_FREEPOOL_DEFAULT is the default pool 101 * from which physical pages are allocated and VM_FREEPOOL_DIRECT is 102 * the pool from which physical pages for small UMA objects are 103 * allocated. 104 */ 105#define VM_NFREEPOOL 3 106#define VM_FREEPOOL_CACHE 2 107#define VM_FREEPOOL_DEFAULT 0 108#define VM_FREEPOOL_DIRECT 1 109 110/* 111 * Create one free page list. 112 */ 113#define VM_NFREELIST 1 114#define VM_FREELIST_DEFAULT 0 115 116/* 117 * An allocation size of 256MB is supported in order to optimize the 118 * use of the identity mappings in region 7 by UMA. 119 */ 120#define VM_NFREEORDER 16 121 122/* 123 * Disable superpage reservations. 124 */ 125#ifndef VM_NRESERVLEVEL 126#define VM_NRESERVLEVEL 0 127#endif 128 129/* 130 * Manipulating region bits of an address. 131 */ 132#define IA64_RR_BASE(n) (((uint64_t) (n)) << 61) 133#define IA64_RR_MASK(x) ((x) & ((1L << 61) - 1)) 134 135#define IA64_PHYS_TO_RR7(x) ((x) | IA64_RR_BASE(7)) 136 137/* 138 * Page size of the identity mappings in region 7. 139 */ 140#ifndef LOG2_ID_PAGE_SIZE 141#define LOG2_ID_PAGE_SIZE 28 /* 256M */ 142#endif 143 144#define IA64_ID_PAGE_SHIFT (LOG2_ID_PAGE_SIZE) 145#define IA64_ID_PAGE_SIZE (1<<(LOG2_ID_PAGE_SIZE)) 146#define IA64_ID_PAGE_MASK (IA64_ID_PAGE_SIZE-1) 147 148#define IA64_BACKINGSTORE IA64_RR_BASE(4) 149 150/* 151 * Mach derived constants 152 */ 153 154/* user/kernel map constants */ 155#define VM_MIN_ADDRESS 0 156#define VM_MAX_ADDRESS IA64_RR_BASE(5) 157#define VM_GATEWAY_SIZE PAGE_SIZE 158#define VM_MAXUSER_ADDRESS (VM_MAX_ADDRESS + VM_GATEWAY_SIZE) 159#define VM_MIN_KERNEL_ADDRESS VM_MAXUSER_ADDRESS 160#define VM_MAX_KERNEL_ADDRESS (IA64_RR_BASE(6) - 1) 161 162#define KERNBASE VM_MAX_ADDRESS 163 164/* virtual sizes (bytes) for various kernel submaps */ 165#ifndef VM_KMEM_SIZE 166#define VM_KMEM_SIZE (12 * 1024 * 1024) 167#endif 168 169/* 170 * How many physical pages per KVA page allocated. 171 * min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), 172 * VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX) 173 * is the total KVA space allocated for kmem_map. 174 */ 175#ifndef VM_KMEM_SIZE_SCALE 176#define VM_KMEM_SIZE_SCALE (4) /* XXX 8192 byte pages */ 177#endif 178 179/* initial pagein size of beginning of executable file */ 180#ifndef VM_INITIAL_PAGEIN 181#define VM_INITIAL_PAGEIN 16 182#endif 183 184#endif /* !_MACHINE_VMPARAM_H_ */ 185