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