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 * 7 * This code is derived from software contributed to Berkeley by 8 * William Jolitz. 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 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 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: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 39 * $FreeBSD$ 40 */ 41 42 43 #ifndef _MACHINE_VMPARAM_H_ 44 #define _MACHINE_VMPARAM_H_ 1 45 46 /* 47 * Machine dependent constants for AMD64. 48 */ 49 50 /* 51 * Virtual memory related constants, all in bytes 52 */ 53 #define MAXTSIZ (128UL*1024*1024) /* max text size */ 54 #ifndef DFLDSIZ 55 #define DFLDSIZ (128UL*1024*1024) /* initial data size limit */ 56 #endif 57 #ifndef MAXDSIZ 58 #define MAXDSIZ (512UL*1024*1024) /* max data size */ 59 #endif 60 #ifndef DFLSSIZ 61 #define DFLSSIZ (8UL*1024*1024) /* initial stack size limit */ 62 #endif 63 #ifndef MAXSSIZ 64 #define MAXSSIZ (64UL*1024*1024) /* max stack size */ 65 #endif 66 #ifndef SGROWSIZ 67 #define SGROWSIZ (128UL*1024) /* amount to grow stack */ 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 * We provide a machine specific single page allocator through the use 83 * of the direct mapped segment. This uses 2MB pages for reduced 84 * TLB pressure. 85 */ 86 #define UMA_MD_SMALL_ALLOC 87 88 /* 89 * Virtual addresses of things. Derived from the page directory and 90 * page table indexes from pmap.h for precision. 91 * Because of the page that is both a PD and PT, it looks a little 92 * messy at times, but hey, we'll do anything to save a page :-) 93 */ 94 95 #define VM_MAX_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-1, NKPDE-1, NPTEPG-1) 96 #define VM_MIN_KERNEL_ADDRESS KVADDR(KPML4I, KPDPI, 0, 0) 97 98 #define DMAP_MIN_ADDRESS KVADDR(DMPML4I, 0, 0, 0) 99 #define DMAP_MAX_ADDRESS KVADDR(DMPML4I+1, 0, 0, 0) 100 101 #define KERNBASE KVADDR(KPML4I, KPDPI, 0, 0) 102 103 #define UPT_MAX_ADDRESS KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I) 104 #define UPT_MIN_ADDRESS KVADDR(PML4PML4I, 0, 0, 0) 105 106 #define VM_MAXUSER_ADDRESS UVADDR(NUPML4E, 0, 0, 0) 107 108 #define USRSTACK VM_MAXUSER_ADDRESS 109 110 #define VM_MAX_ADDRESS UPT_MAX_ADDRESS 111 #define VM_MIN_ADDRESS (0) 112 113 #define PHYS_TO_DMAP(x) ((x) | DMAP_MIN_ADDRESS) 114 #define DMAP_TO_PHYS(x) ((x) & ~DMAP_MIN_ADDRESS) 115 116 /* virtual sizes (bytes) for various kernel submaps */ 117 #ifndef VM_KMEM_SIZE 118 #define VM_KMEM_SIZE (12 * 1024 * 1024) 119 #endif 120 121 /* 122 * How many physical pages per KVA page allocated. 123 * min(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), VM_KMEM_SIZE_MAX) 124 * is the total KVA space allocated for kmem_map. 125 */ 126 #ifndef VM_KMEM_SIZE_SCALE 127 #define VM_KMEM_SIZE_SCALE (3) 128 #endif 129 130 /* 131 * Ceiling on amount of kmem_map kva space. 132 */ 133 #ifndef VM_KMEM_SIZE_MAX 134 #define VM_KMEM_SIZE_MAX (200 * 1024 * 1024) 135 #endif 136 137 /* initial pagein size of beginning of executable file */ 138 #ifndef VM_INITIAL_PAGEIN 139 #define VM_INITIAL_PAGEIN 16 140 #endif 141 142 #endif /* _MACHINE_VMPARAM_H_ */ 143