Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.11
      1 /* $NetBSD: vmparam.h,v 1.11 1998/07/08 04:35:24 thorpej Exp $ */
      2 
      3 /*
      4  * Copyright (c) 1988 University of Utah.
      5  * Copyright (c) 1992, 1993
      6  *	The Regents of the University of California.  All rights reserved.
      7  *
      8  * This code is derived from software contributed to Berkeley by
      9  * the Systems Programming Group of the University of Utah Computer
     10  * Science Department and Ralph Campbell.
     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: Utah $Hdr: vmparam.h 1.16 91/01/18$
     41  *
     42  *	@(#)vmparam.h	8.2 (Berkeley) 4/22/94
     43  */
     44 
     45 #ifndef	_ALPHA_VMPARAM_H_
     46 #define	_ALPHA_VMPARAM_H_
     47 
     48 /*
     49  * Machine dependent constants for Alpha.
     50  */
     51 
     52 /*
     53  * USRTEXT is the start of the user text/data space, while USRSTACK
     54  * is the top (end) of the user stack.  Immediately above the user stack
     55  * resides the user structure, which is UPAGES long and contains the
     56  * kernel stack.
     57  *
     58  * Digital UNIX (formerly DEC OSF/1) places the stack below the
     59  * text segment (i.e. growing downward from 4G).  We may want to
     60  * consider doing that at some point, but it might require changes
     61  * to the exec code.
     62  */
     63 #define	USRTEXT		CLBYTES
     64 #define	USRSTACK	((vm_offset_t)0x0000000200000000)	/* 8G */
     65 
     66 /*
     67  * Virtual memory related constants, all in bytes
     68  */
     69 #ifndef MAXTSIZ
     70 #define	MAXTSIZ		(1<<30)			/* max text size (1G) */
     71 #endif
     72 #ifndef DFLDSIZ
     73 #define	DFLDSIZ		(1<<27)			/* initial data size (128M) */
     74 #endif
     75 #ifndef MAXDSIZ
     76 #define	MAXDSIZ		(1<<30)			/* max data size (1G) */
     77 #endif
     78 #ifndef	DFLSSIZ
     79 #define	DFLSSIZ		(1<<21)			/* initial stack size (2M) */
     80 #endif
     81 #ifndef	MAXSSIZ
     82 #define	MAXSSIZ		(1<<25)			/* max stack size (32M) */
     83 #endif
     84 
     85 /*
     86  * PTEs for mapping user space into the kernel for phyio operations.
     87  * 64 pte's are enough to cover 8 disks * MAXBSIZE.
     88  */
     89 #ifndef USRIOSIZE
     90 #define USRIOSIZE	64
     91 #endif
     92 
     93 /*
     94  * PTEs for system V style shared memory.
     95  * This is basically slop for kmempt which we actually allocate (malloc) from.
     96  */
     97 #ifndef SHMMAXPGS
     98 #define SHMMAXPGS	1024		/* 8mb */
     99 #endif
    100 
    101 /*
    102  * Boundary at which to place first MAPMEM segment if not explicitly
    103  * specified.  Should be a power of two.  This allows some slop for
    104  * the data segment to grow underneath the first mapped segment.
    105  */
    106 #define MMSEG		0x200000
    107 
    108 /*
    109  * The size of the clock loop.
    110  */
    111 #define	LOOPPAGES	(maxfree - firstfree)
    112 
    113 /*
    114  * The time for a process to be blocked before being very swappable.
    115  * This is a number of seconds which the system takes as being a non-trivial
    116  * amount of real time.  You probably shouldn't change this;
    117  * it is used in subtle ways (fractions and multiples of it are, that is, like
    118  * half of a ``long time'', almost a long time, etc.)
    119  * It is related to human patience and other factors which don't really
    120  * change over time.
    121  */
    122 #define	MAXSLP 		20
    123 
    124 /*
    125  * A swapped in process is given a small amount of core without being bothered
    126  * by the page replacement algorithm.  Basically this says that if you are
    127  * swapped in you deserve some resources.  We protect the last SAFERSS
    128  * pages against paging and will just swap you out rather than paging you.
    129  * Note that each process has at least UPAGES+CLSIZE pages which are not
    130  * paged anyways, in addition to SAFERSS.
    131  */
    132 #define	SAFERSS		10		/* nominal ``small'' resident set size
    133 					   protected against replacement */
    134 
    135 /*
    136  * Mach derived constants
    137  */
    138 
    139 /* user/kernel map constants */
    140 #define VM_MIN_ADDRESS		((vm_offset_t)ALPHA_USEG_BASE)	     /* 0 */
    141 #define VM_MAXUSER_ADDRESS	((vm_offset_t)(ALPHA_USEG_END + 1L)) /* 4T */
    142 #define VM_MAX_ADDRESS		VM_MAXUSER_ADDRESS
    143 #define VM_MIN_KERNEL_ADDRESS	((vm_offset_t)ALPHA_K1SEG_BASE)
    144 #define VM_MAX_KERNEL_ADDRESS	((vm_offset_t)ALPHA_K1SEG_END)
    145 
    146 /* virtual sizes (bytes) for various kernel submaps */
    147 #define _VM_MBUF_SIZE		(NMBCLUSTERS*MCLBYTES)
    148 #define _VM_KMEM_SIZE		(NKMEMCLUSTERS*CLBYTES)
    149 #define _VM_PHYS_SIZE		(USRIOSIZE*CLBYTES)
    150 
    151 #ifndef	_KERNEL
    152 #define VM_MBUF_SIZE		_VM_MBUF_SIZE
    153 #define VM_KMEM_SIZE		_VM_KMEM_SIZE
    154 #define VM_PHYS_SIZE		_VM_PHYS_SIZE
    155 #else
    156 extern u_int32_t vm_mbuf_size, vm_kmem_size, vm_phys_size;
    157 #define VM_MBUF_SIZE		vm_mbuf_size
    158 #define VM_KMEM_SIZE		vm_kmem_size
    159 #define VM_PHYS_SIZE		vm_phys_size
    160 #endif /* _KERNEL */
    161 
    162 /* some Alpha-specific constants */
    163 #define	VPTBASE		((vm_offset_t)0xfffffffc00000000) /* Virt. pg table */
    164 
    165 /* Use new non-contiguous physical memory code. */
    166 #define	MACHINE_NEW_NONCONTIG
    167 
    168 #define	VM_PHYSSEG_MAX		16		/* XXX */
    169 #define	VM_PHYSSEG_STRAT	VM_PSTRAT_BSEARCH
    170 #define	VM_PHYSSEG_NOADD			/* no more after vm_mem_init */
    171 
    172 #define	VM_NFREELIST		1
    173 #define	VM_FREELIST_DEFAULT	0
    174 
    175 /*
    176  * pmap-specific data stored in the vm_physmem[] array.
    177  */
    178 struct pmap_physseg {
    179 	struct pv_head *pvhead;		/* pv list of this seg */
    180 };
    181 
    182 #endif	/* ! _ALPHA_VMPARAM_H_ */
    183