Home | History | Annotate | Line # | Download | only in include
      1 /*	$NetBSD: vmparam.h,v 1.20 2025/02/08 23:44:53 tsutsui Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1988 University of Utah.
      5  * Copyright (c) 1982, 1986, 1990, 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.
     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	8.2 (Berkeley) 4/19/94
     39  */
     40 
     41 #ifndef _MACHINE_VMPARAM_H_
     42 #define	_MACHINE_VMPARAM_H_
     43 
     44 /*
     45  * Machine dependent constants for cesfic
     46  */
     47 
     48 /*
     49  * Use common m68k definitions to define PAGE_SIZE and related constants.
     50  */
     51 #include <m68k/vmparam.h>
     52 
     53 /*
     54  * USRSTACK is the top (end) of the user stack.
     55  *
     56  * NOTE: the ONLY reason that HIGHPAGES is 0x100 instead of UPAGES (3)
     57  * is for HPUX compatibility.  Why??  Because HPUX's debuggers
     58  * have the user's stack hard-wired at FFF00000 for post-mortems,
     59  * and we must be compatible...
     60  */
     61 #define	USRSTACK	(-HIGHPAGES*PAGE_SIZE)	/* Start of user stack */
     62 #define	BTOPUSRSTACK	(0x100000-HIGHPAGES)	/* btop(USRSTACK) */
     63 #define P1PAGES		0x100000
     64 #define HIGHPAGES	(0x100000/PAGE_SIZE)
     65 
     66 /*
     67  * Virtual memory related constants, all in bytes
     68  */
     69 #ifndef MAXTSIZ
     70 #define	MAXTSIZ		(32*1024*1024)		/* max text size */
     71 #endif
     72 #ifndef DFLDSIZ
     73 #define	DFLDSIZ		(32*1024*1024)		/* initial data size limit */
     74 #endif
     75 #ifndef MAXDSIZ
     76 #define	MAXDSIZ		(64*1024*1024)		/* max data size */
     77 #endif
     78 #ifndef	DFLSSIZ
     79 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
     80 #endif
     81 #ifndef	MAXSSIZ
     82 #define	MAXSSIZ		MAXDSIZ			/* max stack size */
     83 #endif
     84 
     85 /*
     86  * Default sizes of swap allocation chunks (see dmap.h).
     87  * The actual values may be changed in vminit() based on MAXDSIZ.
     88  * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024.
     89  * DMMIN should be at least ctod(1) so that vtod() works.
     90  * vminit() insures this.
     91  */
     92 #define	DMMIN	32			/* smallest swap allocation */
     93 #define	DMMAX	4096			/* largest potential swap allocation */
     94 
     95 /*
     96  * PTEs for mapping user space into the kernel for phyio operations.
     97  * One page is enough to handle 4Mb of simultaneous raw IO operations.
     98  */
     99 #ifndef USRIOSIZE
    100 #define USRIOSIZE	(1 * NPTEPG)	/* 4mb */
    101 #endif
    102 
    103 /*
    104  * Mach derived constants
    105  */
    106 
    107 /* user/kernel map constants */
    108 #define VM_MIN_ADDRESS		((vaddr_t)0)
    109 #define VM_MAXUSER_ADDRESS	((vaddr_t)0xFFF00000)
    110 #define VM_MAX_ADDRESS		((vaddr_t)0xFFF00000)
    111 #define VM_MIN_KERNEL_ADDRESS	((vaddr_t)0x00002000)
    112 #define VM_MAX_KERNEL_ADDRESS	((vaddr_t)(0-PAGE_SIZE*NPTEPG*2))
    113 
    114 /* virtual sizes (bytes) for various kernel submaps */
    115 #define VM_PHYS_SIZE		(USRIOSIZE*PAGE_SIZE)
    116 
    117 /* # of kernel PT pages (initial only, can grow dynamically) */
    118 #define VM_KERNEL_PT_PAGES	((vsize_t)2)
    119 
    120 /* Use new VM page bootstrap interface. */
    121 #define	MACHINE_NEW_NONCONTIG
    122 
    123 /*
    124  * Constants which control the way the VM system deals with memory segments.
    125  * The cesfic only has one usable physical memory segment.
    126  */
    127 #define	VM_PHYSSEG_MAX		1
    128 #define	VM_PHYSSEG_STRAT	VM_PSTRAT_BSEARCH
    129 
    130 #define	VM_NFREELIST		1
    131 #define	VM_FREELIST_DEFAULT	0
    132 
    133 #define	__HAVE_PMAP_PHYSSEG
    134 
    135 /*
    136  * pmap-specific data stored in the vm_physmem[] array.
    137  */
    138 struct pmap_physseg {
    139 	struct pv_header *pvheader;	/* pv table for this seg */
    140 };
    141 
    142 #endif /* _MACHINE_VMPARAM_H_ */
    143