vmparam.h revision 1.1
1/* $NetBSD: vmparam.h,v 1.1 2001/06/08 22:23:03 chris Exp $ */ 2 3/* 4 * Copyright (c) 1988 The Regents of the University of California. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36#ifndef _ARM32_VMPARAM_H_ 37#define _ARM32_VMPARAM_H_ 38 39/* for pt_entry_t definition */ 40#include <machine/pte.h> 41 42#define USRTEXT VM_MIN_ADDRESS 43#define USRSTACK VM_MAXUSER_ADDRESS 44 45/* 46 * Note that MAXTSIZ mustn't be greater than 32M. Otherwise you'd have 47 * to change the compiler to not generate bl instructions 48 */ 49#define MAXTSIZ (16*1024*1024) /* max text size */ 50#ifndef DFLDSIZ 51#define DFLDSIZ (128*1024*1024) /* initial data size limit */ 52#endif 53#ifndef MAXDSIZ 54#define MAXDSIZ (512*1024*1024) /* max data size */ 55#endif 56#ifndef DFLSSIZ 57#define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 58#endif 59#ifndef MAXSSIZ 60#define MAXSSIZ (8*1024*1024) /* max stack size */ 61#endif 62 63/* 64 * Size of shared memory map 65 */ 66#ifndef SHMMAXPGS 67#define SHMMAXPGS 1024 68#endif 69 70/* 71 * The time for a process to be blocked before being very swappable. 72 * This is a number of seconds which the system takes as being a non-trivial 73 * amount of real time. You probably shouldn't change this; 74 * it is used in subtle ways (fractions and multiples of it are, that is, like 75 * half of a `long time'', almost a long time, etc.) 76 * It is related to human patience and other factors which don't really 77 * change over time. 78 */ 79#define MAXSLP 20 80 81/* 82 * Address space constants 83 */ 84 85/* 86 * The line between user space and kernel space 87 * Mappings >= KERNEL_SPACE_START are constant across all processes 88 */ 89#define KERNEL_SPACE_START 0xf0000000 90 91/* total number of page table entries to map 4GB * size of each entry*/ 92#define PAGE_TABLE_SPACE ((1 << (32 - PGSHIFT)) * sizeof(pt_entry_t)) 93 94/* Address where the page tables are mapped */ 95#define PAGE_TABLE_SPACE_START (KERNEL_SPACE_START - PAGE_TABLE_SPACE) 96 97/* Various constants used by the MD code*/ 98#define KERNEL_BASE 0xf0000000 99#define KERNEL_TEXT_BASE KERNEL_BASE 100#define ALT_PAGE_TBLS_BASE 0xf0c00000 101#define KERNEL_VM_BASE 0xf1000000 102/* 103 * The Kernel VM Size varies depending on the machine depending on how 104 * much space is needed (and where) for other mappings. 105 * In some cases the chosen value may not be the maximum in order that 106 * we don't waste memory with kernel pages tables as we can't currently 107 * grow the kernel page tables after booting. 108 * You only need to increase these values if you find that the number of 109 * buffers is being limited due to lack of VA space. 110 */ 111#if defined(FOOTBRIDGE) 112/* 113 * The range 0xf1000000 - 0xfcffffff is available for kernel VM space 114 * Footbridge registers and I/O mappings occupy 0xfd000000 - 0xffffffff 115 */ 116#define KERNEL_VM_SIZE 0x07000000 117#elif defined(SHARK) 118/* 119 * The range 0xf1000000 - 0xf6ffffff is available for kernel VM space 120 * OFW sites at 0xf7000000 121 */ 122#define KERNEL_VM_SIZE 0x04000000 123#else 124/* 125 * The range 0xf1000000 - 0xf5ffffff is available for kernel VM space 126 * Fixed mappings exist from 0xf6000000 - 0xffffffff 127 */ 128#define KERNEL_VM_SIZE 0x05000000 129#endif 130#define PROCESS_PAGE_TBLS_BASE PAGE_TABLE_SPACE_START 131 132/* 133 * Override the default pager_map size, there's not enough KVA. 134 */ 135#define PAGER_MAP_SIZE (4 * 1024 * 1024) 136 137/* 138 * Mach derived constants 139 */ 140 141#define VM_MIN_ADDRESS ((vm_offset_t)0x00001000) 142#define VM_MAXUSER_ADDRESS ((vm_offset_t)(PAGE_TABLE_SPACE_START - UPAGES * NBPG)) 143#define VM_MAX_ADDRESS ((vm_offset_t)(PAGE_TABLE_SPACE_START + (KERNEL_SPACE_START >> PGSHIFT) * sizeof(pt_entry_t))) 144 145#define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNEL_TEXT_BASE) 146#define VM_MAXKERN_ADDRESS ((vm_offset_t)(KERNEL_VM_BASE + KERNEL_VM_SIZE)) 147#define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xffffffff) 148 149/* 150 * Size of User Raw I/O map 151 */ 152 153#define USRIOSIZE 300 154 155/* XXX max. amount of KVM to be used by buffers. */ 156#ifndef VM_MAX_KERNEL_BUF 157#define VM_MAX_KERNEL_BUF \ 158 ((VM_MAXKERN_ADDRESS - KERNEL_VM_BASE) * 4 / 10) 159#endif 160 161/* virtual sizes (bytes) for various kernel submaps */ 162 163#define VM_PHYS_SIZE (USRIOSIZE*NBPG) 164 165/* 166 * max number of non-contig chunks of physical RAM you can have 167 */ 168 169#define VM_PHYSSEG_MAX 32 170 171/* 172 * when converting a physical address to a vm_page structure, we 173 * want to use a binary search on the chunks of physical memory 174 * to find our RAM 175 */ 176 177#define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH 178 179/* 180 * this indicates that we can't add RAM to the VM system after the 181 * vm system is init'd. 182 */ 183 184#define VM_PHYSSEG_NOADD 185 186/* 187 * we support 2 free lists: 188 * 189 * - DEFAULT for all systems 190 * - ISADMA for the ISA DMA range on Sharks only 191 * - RPCDMA for the DMA range on RiscPC's + Kinetic cards 192 */ 193 194#define VM_NFREELIST 2 195#define VM_FREELIST_DEFAULT 0 196#define VM_FREELIST_ISADMA 1 197#define VM_FREELIST_RPCDMA 1 198 199/* 200 * define structure pmap_physseg: there is one of these structures 201 * for each chunk of noncontig RAM you have. 202 */ 203 204#define __HAVE_PMAP_PHYSSEG 205 206struct pmap_physseg { 207 struct pv_entry *pvent; /* pv_entry array */ 208 char *attrs; /* attrs array */ 209}; 210 211#endif /* _ARM32_VMPARAM_H_ */ 212 213/* End of vmparam.h */ 214