1 /*- 2 * Copyright (c) 1990 The Regents of the University of California. 3 * All rights reserved. 4 * Copyright (c) 1994 John S. Dyson 5 * All rights reserved. 6 * Copyright (c) 2003 Peter Wemm 7 * All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * William Jolitz. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 * 40 * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 41 * $FreeBSD$ 42 */ 43 44 45 #ifndef _MACHINE_VMPARAM_H_ 46 #define _MACHINE_VMPARAM_H_ 1 47 48 /* 49 * Machine dependent constants for AMD64. 50 */ 51 52 /* 53 * Virtual memory related constants, all in bytes 54 */ 55 #define MAXTSIZ (128UL*1024*1024) /* max text size */ 56 #ifndef DFLDSIZ 57 #define DFLDSIZ (128UL*1024*1024) /* initial data size limit */ 58 #endif 59 #ifndef MAXDSIZ 60 #define MAXDSIZ (32768UL*1024*1024) /* max data size */ 61 #endif 62 #ifndef DFLSSIZ 63 #define DFLSSIZ (8UL*1024*1024) /* initial stack size limit */ 64 #endif 65 #ifndef MAXSSIZ 66 #define MAXSSIZ (512UL*1024*1024) /* max stack size */ 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 provide a machine specific single page allocator through the use 85 * of the direct mapped segment. This uses 2MB pages for reduced 86 * TLB pressure. 87 */ 88 #define UMA_MD_SMALL_ALLOC 89 90 /* 91 * Virtual addresses of things. Derived from the page directory and 92 * page table indexes from pmap.h for precision. 93 * Because of the page that is both a PD and PT, it looks a little 94 * messy at times, but hey, we'll do anything to save a page :-) 95 */ 96 97 #define VM_MAX_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-1, NKPDE-1, NPTEPG-1) 98 #define VM_MIN_KERNEL_ADDRESS KVADDR(KPML4I, KPDPI, 0, 0) 99 100 #define DMAP_MIN_ADDRESS KVADDR(DMPML4I, 0, 0, 0) 101 #define DMAP_MAX_ADDRESS KVADDR(DMPML4I+1, 0, 0, 0) 102 103 #define KERNBASE KVADDR(KPML4I, KPDPI, 0, 0) 104 105 #define UPT_MAX_ADDRESS KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I) 106 #define UPT_MIN_ADDRESS KVADDR(PML4PML4I, 0, 0, 0) 107 108 #define VM_MAXUSER_ADDRESS UVADDR(NUPML4E, 0, 0, 0) 109 110 #define USRSTACK VM_MAXUSER_ADDRESS 111 112 #define VM_MAX_ADDRESS UPT_MAX_ADDRESS 113 #define VM_MIN_ADDRESS (0) 114 115 #define PHYS_TO_DMAP(x) ((x) | DMAP_MIN_ADDRESS) 116 #define DMAP_TO_PHYS(x) ((x) & ~DMAP_MIN_ADDRESS) 117 118 /* virtual sizes (bytes) for various kernel submaps */ 119 #ifndef VM_KMEM_SIZE 120 #define VM_KMEM_SIZE (12 * 1024 * 1024) 121 #endif 122 123 /* 124 * How many physical pages per KVA page allocated. 125 * min(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), VM_KMEM_SIZE_MAX) 126 * is the total KVA space allocated for kmem_map. 127 */ 128 #ifndef VM_KMEM_SIZE_SCALE 129 #define VM_KMEM_SIZE_SCALE (3) 130 #endif 131 132 /* 133 * Ceiling on amount of kmem_map kva space. 134 */ 135 #ifndef VM_KMEM_SIZE_MAX 136 #define VM_KMEM_SIZE_MAX (400 * 1024 * 1024) 137 #endif 138 139 /* initial pagein size of beginning of executable file */ 140 #ifndef VM_INITIAL_PAGEIN 141 #define VM_INITIAL_PAGEIN 16 142 #endif 143 144 #endif /* _MACHINE_VMPARAM_H_ */ 145