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: src/sys/amd64/include/vmparam.h,v 1.44 2003/12/07 04:51:04 alc Exp $ 42 * $DragonFly: src/sys/platform/pc64/include/vmparam.h,v 1.1 2007/08/21 19:45:45 corecode Exp $ 43 */ 44 45 46 #ifndef _MACHINE_VMPARAM_H_ 47 #define _MACHINE_VMPARAM_H_ 48 49 /* 50 * Machine dependent constants for AMD64. 51 */ 52 53 /* 54 * Virtual memory related constants, all in bytes 55 */ 56 #define MAXTSIZ (128UL*1024*1024) /* max text size */ 57 #ifndef DFLDSIZ 58 #define DFLDSIZ (128UL*1024*1024) /* initial data size limit */ 59 #endif 60 #ifndef MAXDSIZ 61 #define MAXDSIZ (256UL*1024*1024*1024) /* max data size */ 62 #endif 63 #ifndef DFLSSIZ 64 #define DFLSSIZ (8UL*1024*1024) /* initial stack size limit */ 65 #endif 66 #ifndef MAXSSIZ 67 #define MAXSSIZ (128UL*1024*1024*1024) /* max stack size */ 68 #endif 69 #ifndef SGROWSIZ 70 #define SGROWSIZ (128UL*1024) /* amount to grow stack */ 71 #endif 72 73 /* 74 * The time for a process to be blocked before being very swappable. 75 * This is a number of seconds which the system takes as being a non-trivial 76 * amount of real time. You probably shouldn't change this; 77 * it is used in subtle ways (fractions and multiples of it are, that is, like 78 * half of a ``long time'', almost a long time, etc.) 79 * It is related to human patience and other factors which don't really 80 * change over time. 81 */ 82 #define MAXSLP 20 83 84 /* 85 * We provide a machine specific single page allocator through the use 86 * of the direct mapped segment. This uses 2MB pages for reduced 87 * TLB pressure. 88 */ 89 #define UMA_MD_SMALL_ALLOC 90 91 /* 92 * Virtual addresses of things. Derived from the page directory and 93 * page table indexes from pmap.h for precision. 94 * Because of the page that is both a PD and PT, it looks a little 95 * messy at times, but hey, we'll do anything to save a page :-) 96 */ 97 98 #define VM_MAX_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-1, NKPDE-1, NPTEPG-1) 99 #define VM_MIN_KERNEL_ADDRESS KVADDR(KPML4I, KPDPI, 0, 0) 100 101 #define DMAP_MIN_ADDRESS KVADDR(DMPML4I, 0, 0, 0) 102 #define DMAP_MAX_ADDRESS KVADDR(DMPML4I+1, 0, 0, 0) 103 104 #define KERNBASE KVADDR(KPML4I, KPDPI, 0, 0) 105 106 #define UPT_MAX_ADDRESS KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I) 107 #define UPT_MIN_ADDRESS KVADDR(PML4PML4I, 0, 0, 0) 108 109 #define VM_MAXUSER_ADDRESS UVADDR(NUPML4E, 0, 0, 0) 110 111 #define USRSTACK VM_MAXUSER_ADDRESS 112 113 #define VM_MAX_ADDRESS UPT_MAX_ADDRESS 114 #define VM_MIN_ADDRESS (0) 115 116 #define VM_MIN_USER_ADDRESS ((vm_offset_t)0) 117 #define VM_MAX_USER_ADDRESS UVADDR(PTDPTDI, 0, 0, 0) 118 119 #define PHYS_TO_DMAP(x) ((x) | DMAP_MIN_ADDRESS) 120 #define DMAP_TO_PHYS(x) ((x) & ~DMAP_MIN_ADDRESS) 121 122 123 /* initial pagein size of beginning of executable file */ 124 #ifndef VM_INITIAL_PAGEIN 125 #define VM_INITIAL_PAGEIN 16 126 #endif 127 128 #endif /* _MACHINE_VMPARAM_H_ */ 129