Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.30
      1 /*	$NetBSD: vmparam.h,v 1.30 2001/05/01 02:19:16 thorpej Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1988 University of Utah.
      5  * Copyright (c) 1982, 1990 The Regents of the University of California.
      6  * 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.
     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 /*-
     41  * Copyright (C) 1993	Allen K. Briggs, Chris P. Caputo,
     42  *			Michael L. Finch, Bradley A. Grantham, and
     43  *			Lawrence A. Kesteloot
     44  * All rights reserved.
     45  *
     46  * Redistribution and use in source and binary forms, with or without
     47  * modification, are permitted provided that the following conditions
     48  * are met:
     49  * 1. Redistributions of source code must retain the above copyright
     50  *    notice, this list of conditions and the following disclaimer.
     51  * 2. Redistributions in binary form must reproduce the above copyright
     52  *    notice, this list of conditions and the following disclaimer in the
     53  *    documentation and/or other materials provided with the distribution.
     54  * 3. All advertising materials mentioning features or use of this software
     55  *    must display the following acknowledgement:
     56  *	This product includes software developed by the Alice Group.
     57  * 4. The names of the Alice Group or any of its members may not be used
     58  *    to endorse or promote products derived from this software without
     59  *    specific prior written permission.
     60  *
     61  * THIS SOFTWARE IS PROVIDED BY THE ALICE GROUP ``AS IS'' AND ANY EXPRESS OR
     62  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     63  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     64  * IN NO EVENT SHALL THE ALICE GROUP BE LIABLE FOR ANY DIRECT, INDIRECT,
     65  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     66  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     67  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     68  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     69  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
     70  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     71  *
     72  */
     73 /*
     74  * from: Utah $Hdr: vmparam.h 1.16 91/01/18$
     75  *
     76  *	@(#)vmparam.h	7.3 (Berkeley) 5/7/91
     77  */
     78 
     79 #ifndef _MAC68K_VMPARAM_H_
     80 #define	_MAC68K_VMPARAM_H_
     81 
     82 /*
     83  * Machine dependent constants for mac68k -- mostly derived from hp300.
     84  */
     85 
     86 /*
     87  * We use 4K pages on the mac68k.  Override the PAGE_* definitions
     88  * to be compile-time constants.
     89  */
     90 #define	PAGE_SHIFT	12
     91 #define	PAGE_SIZE	(1 << PAGE_SHIFT)
     92 #define	PAGE_MASK	(PAGE_SIZE - 1)
     93 
     94 /*
     95  * USRTEXT is the start of the user text/data space, while USRSTACK
     96  * is the top (end) of the user stack.  LOWPAGES and HIGHPAGES are
     97  * the number of pages from the beginning of the P0 region to the
     98  * beginning of the text and from the beginning of the P1 region to the
     99  * beginning of the stack respectively.
    100  *
    101  * NOTE: HP300 uses HIGHPAGES == (0x100000/NBPG) for HP/UX compatibility.
    102  * Do we care?  Obviously not at the moment.
    103  */
    104 #define	USRTEXT		8192
    105 #define	USRSTACK	(-HIGHPAGES*NBPG)	/* Start of user stack */
    106 #define	BTOPUSRSTACK	(0x100000-HIGHPAGES)	/* btop(USRSTACK) */
    107 #define P1PAGES		0x100000
    108 #define	LOWPAGES	0
    109 #define HIGHPAGES	3			/* UPAGES */
    110 
    111 /*
    112  * Virtual memory related constants, all in bytes
    113  */
    114 #ifndef MAXTSIZ
    115 #define	MAXTSIZ		(8*1024*1024)		/* max text size */
    116 #endif
    117 #ifndef DFLDSIZ
    118 #define	DFLDSIZ		(32*1024*1024)		/* initial data size limit */
    119 #endif
    120 #ifndef MAXDSIZ
    121 #define	MAXDSIZ		(64*1024*1024)		/* max data size */
    122 #endif
    123 #ifndef	DFLSSIZ
    124 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
    125 #endif
    126 #ifndef	MAXSSIZ
    127 #define	MAXSSIZ		(32*1024*1024)		/* max stack size */
    128 #endif
    129 
    130 /*
    131  * Sizes of the system and user portions of the system page table.
    132  */
    133 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */
    134 #define	SYSPTSIZE	(2 * NPTEPG)	/* 8mb */
    135 #define	USRPTSIZE 	(1 * NPTEPG)	/* 4mb */
    136 
    137 /*
    138  * PTEs for mapping user space into the kernel for phyio operations.
    139  * One page is enough to handle 4Mb of simultaneous raw IO operations.
    140  */
    141 #ifndef USRIOSIZE
    142 #define USRIOSIZE	(1 * NPTEPG)	/* 4mb */
    143 #endif
    144 
    145 /*
    146  * PTEs for system V style shared memory.
    147  * This is basically slop for kmempt which we actually allocate (malloc) from.
    148  */
    149 #ifndef SHMMAXPGS
    150 #define SHMMAXPGS	1024		/* 4mb */
    151 #endif
    152 
    153 /*
    154  * The time for a process to be blocked before being very swappable.
    155  * This is a number of seconds which the system takes as being a non-trivial
    156  * amount of real time.  You probably shouldn't change this;
    157  * it is used in subtle ways (fractions and multiples of it are, that is, like
    158  * half of a ``long time'', almost a long time, etc.)
    159  * It is related to human patience and other factors which don't really
    160  * change over time.
    161  */
    162 #define	MAXSLP 		20
    163 
    164 /*
    165  * Mach derived constants
    166  */
    167 
    168 /* user/kernel map constants */
    169 #define VM_MIN_ADDRESS		((vaddr_t)0)
    170 #define VM_MAXUSER_ADDRESS	((vaddr_t)(USRSTACK))
    171 #define VM_MAX_ADDRESS		((vaddr_t)(0-(UPAGES*NBPG)))
    172 #define VM_MIN_KERNEL_ADDRESS	((vaddr_t)0)
    173 #define VM_MAX_KERNEL_ADDRESS	((vaddr_t)(0-NBPG))
    174 
    175 /* virtual sizes (bytes) for various kernel submaps */
    176 #define VM_PHYS_SIZE		(USRIOSIZE*NBPG)
    177 
    178 /* # of kernel PT pages (initial only, can grow dynamically) */
    179 #define VM_KERNEL_PT_PAGES	((vsize_t)2)		/* XXX: SYSPTSIZE */
    180 
    181 /*
    182  * Constants which control the way the VM system deals with memory segments.
    183  * Most mac68k systems have only 1 physical memory segment, but some have 2.
    184  *
    185  * On the systems that have multiple segments, specifically the IIsi and
    186  * IIci, the optimal configuration is to put the higher-density SIMMs in
    187  * bank B.  This is because the on-board video uses main memory in bank A
    188  * for the framebuffer, and a memory controller prevents access during
    189  * video refresh cycles.  Even if both banks contain the same amount of
    190  * RAM, a minimum of ~320KB will be subtracted from the amount in bank A
    191  * for the framebuffer (if on-board video is in use).
    192  */
    193 #define	VM_PHYSSEG_MAX		2
    194 #define	VM_PHYSSEG_STRAT	VM_PSTRAT_BIGFIRST
    195 #define	VM_PHYSSEG_NOADD
    196 
    197 #define	VM_NFREELIST		1
    198 #define	VM_FREELIST_DEFAULT	0
    199 
    200 #define	__HAVE_PMAP_PHYSSEG
    201 
    202 /*
    203  * pmap-specific data stored in the vm_physmem[] array.
    204  */
    205 struct pmap_physseg {
    206 	struct pv_entry *pvent;		/* pv table for this seg */
    207 	char *attrs;			/* page attributes for this seg */
    208 };
    209 
    210 #endif /* _MAC68K_VMPARAM_H_ */
    211