Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.45
      1 /*	$NetBSD: vmparam.h,v 1.45 2015/06/19 14:55:51 mlelstv Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1988 University of Utah.
      5  * Copyright (c) 1982, 1986, 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. Neither the name of the University nor the names of its contributors
     21  *    may be used to endorse or promote products derived from this software
     22  *    without specific prior written permission.
     23  *
     24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  * SUCH DAMAGE.
     35  *
     36  * from: Utah $Hdr: vmparam.h 1.16 91/01/18$
     37  *
     38  *	@(#)vmparam.h	7.3 (Berkeley) 5/7/91
     39  */
     40 
     41 #ifndef _MACHINE_VMPARAM_H_
     42 #define _MACHINE_VMPARAM_H_
     43 
     44 #include <machine/pte.h>
     45 
     46 /*
     47  * Machine dependent constants for amiga
     48  */
     49 
     50 /*
     51  * We use 8K pages on the Amiga.  Override the PAGE_* definitions
     52  * to be compie-time constants.
     53  */
     54 #define	PAGE_SHIFT	PGSHIFT
     55 #define	PAGE_SIZE	(1 << PAGE_SHIFT)
     56 #define	PAGE_MASK	(PAGE_SIZE - 1)
     57 
     58 /*
     59  * USRSTACK is the top (end) of the user stack.
     60  */
     61 
     62 #ifndef USRSTACK
     63 #define	USRSTACK	0x1E000000
     64 #endif
     65 
     66 /*
     67  * Virtual memory related constants, all in bytes
     68  */
     69 
     70 #ifndef MAXTSIZ
     71 #define	MAXTSIZ		(32*1024*1024)		/* max text size */
     72 #endif
     73 #ifndef DFLDSIZ
     74 #define	DFLDSIZ		(64*1024*1024)		/* initial data size limit */
     75 #endif
     76 #ifndef MAXDSIZ
     77 #define	MAXDSIZ		(416*1024*1024)		/* max data size */
     78 #endif
     79 #ifndef	DFLSSIZ
     80 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
     81 #endif
     82 #ifndef	MAXSSIZ
     83 #define	MAXSSIZ		(32*1024*1024)		/* max stack size */
     84 #endif
     85 
     86 /*
     87  * PTEs for mapping user space into the kernel for phyio operations.
     88  * One page is enough to handle 16Mb of simultaneous raw IO operations.
     89  */
     90 #ifndef USRIOSIZE
     91 #define USRIOSIZE	(1 * NPTEPG)	/* 16mb */
     92 #endif
     93 
     94 /*
     95  * user/kernel map constants
     96  */
     97 #define VM_MIN_ADDRESS		((vaddr_t)0)		/* user min */
     98 #define VM_MAX_ADDRESS		((vaddr_t)(USRSTACK))	/* user max */
     99 #define VM_MAXUSER_ADDRESS	((vaddr_t)(VM_MAX_ADDRESS))	/* same */
    100 #define VM_MIN_KERNEL_ADDRESS	((vaddr_t)0)
    101 #define VM_MAX_KERNEL_ADDRESS	((vaddr_t)-(NPTEPG * PAGE_SIZE))
    102 
    103 /*
    104  * virtual sizes (bytes) for various kernel submaps
    105  */
    106 #define VM_PHYS_SIZE		(USRIOSIZE*PAGE_SIZE)
    107 
    108 /*
    109  * Our bootloader currently passes up to 16 segments (but this is variable)
    110  * Normally, the biggest of them is used for the kernel, and the kernel
    111  * segment is given to VM first.
    112  */
    113 #define VM_PHYSSEG_MAX		(16)
    114 #define VM_PHYSSEG_STRAT	VM_PSTRAT_RANDOM
    115 
    116 /*
    117  * Allow supporting Zorro-II memory as lower priority:
    118  *
    119  *	- DEFAULT for Zorro-III memory (presumably 32 bit)
    120  *	- ZORROII for Zorro-II memory (16 bit, Zorro-II DMA)
    121  */
    122 
    123 #define VM_NFREELIST		2
    124 #define VM_FREELIST_DEFAULT	0
    125 #define VM_FREELIST_ZORROII	1
    126 
    127 #define	__HAVE_PMAP_PHYSSEG
    128 
    129 /*
    130  * pmap-specific data stored in the vm_physmem[] array.
    131  */
    132 struct pmap_physseg {
    133 	struct pv_header *pvheader;	/* pv table for this seg */
    134 };
    135 
    136 /*
    137  * number of kernel PT pages (initial only, can grow dynamically)
    138  */
    139 #define VM_KERNEL_PT_PAGES	((vm_size_t)10)
    140 #endif /* !_MACHINE_VMPARAM_H_ */
    141