Home | History | Annotate | Line # | Download | only in include
pte.h revision 1.1
      1  1.1  leo /*	$NetBSD: pte.h,v 1.1 1995/03/26 07:12:06 leo Exp $	*/
      2  1.1  leo 
      3  1.1  leo /*
      4  1.1  leo  * Copyright (c) 1988 University of Utah.
      5  1.1  leo  * Copyright (c) 1982, 1986, 1990 The Regents of the University of California.
      6  1.1  leo  * All rights reserved.
      7  1.1  leo  *
      8  1.1  leo  * This code is derived from software contributed to Berkeley by
      9  1.1  leo  * the Systems Programming Group of the University of Utah Computer
     10  1.1  leo  * Science Department.
     11  1.1  leo  *
     12  1.1  leo  * Redistribution and use in source and binary forms, with or without
     13  1.1  leo  * modification, are permitted provided that the following conditions
     14  1.1  leo  * are met:
     15  1.1  leo  * 1. Redistributions of source code must retain the above copyright
     16  1.1  leo  *    notice, this list of conditions and the following disclaimer.
     17  1.1  leo  * 2. Redistributions in binary form must reproduce the above copyright
     18  1.1  leo  *    notice, this list of conditions and the following disclaimer in the
     19  1.1  leo  *    documentation and/or other materials provided with the distribution.
     20  1.1  leo  * 3. All advertising materials mentioning features or use of this software
     21  1.1  leo  *    must display the following acknowledgement:
     22  1.1  leo  *	This product includes software developed by the University of
     23  1.1  leo  *	California, Berkeley and its contributors.
     24  1.1  leo  * 4. Neither the name of the University nor the names of its contributors
     25  1.1  leo  *    may be used to endorse or promote products derived from this software
     26  1.1  leo  *    without specific prior written permission.
     27  1.1  leo  *
     28  1.1  leo  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     29  1.1  leo  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30  1.1  leo  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31  1.1  leo  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     32  1.1  leo  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33  1.1  leo  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34  1.1  leo  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35  1.1  leo  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36  1.1  leo  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37  1.1  leo  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38  1.1  leo  * SUCH DAMAGE.
     39  1.1  leo  *
     40  1.1  leo  * from: Utah $Hdr: pte.h 1.11 89/09/03$
     41  1.1  leo  *
     42  1.1  leo  *	@(#)pte.h	7.3 (Berkeley) 5/8/91
     43  1.1  leo  */
     44  1.1  leo 
     45  1.1  leo #ifndef _MACHINE_PTE_H_
     46  1.1  leo #define _MACHINE_PTE_H_
     47  1.1  leo 
     48  1.1  leo /*
     49  1.1  leo  * ATARI hardware segment/page table entries
     50  1.1  leo  */
     51  1.1  leo 
     52  1.1  leo struct pte {
     53  1.1  leo 	u_int pte;
     54  1.1  leo };
     55  1.1  leo 
     56  1.1  leo typedef u_int	pt_entry_t;
     57  1.1  leo 
     58  1.1  leo struct ste {
     59  1.1  leo 	u_int ste;
     60  1.1  leo };
     61  1.1  leo 
     62  1.1  leo typedef u_int	st_entry_t;
     63  1.1  leo 
     64  1.1  leo #define	PT_ENTRY_NULL	((u_int *) 0)
     65  1.1  leo #define	ST_ENTRY_NULL	((u_int *) 0)
     66  1.1  leo 
     67  1.1  leo #define	SG_V		0x00000002	/* segment is valid */
     68  1.1  leo #define	SG_NV		0x00000000
     69  1.1  leo #define	SG_PROT		0x00000004	/* access protection mask */
     70  1.1  leo #define	SG_RO		0x00000004
     71  1.1  leo #define	SG_RW		0x00000000
     72  1.1  leo #define SG_U		0x00000008	/* modified bit (68040) */
     73  1.1  leo #define	SG_FRAME	0xffffe000
     74  1.1  leo #define SG_IMASK	0xff000000
     75  1.1  leo #define SG_ISHIFT	24
     76  1.1  leo #define SG_PMASK	0x00ffe000
     77  1.1  leo #define SG_PSHIFT	13
     78  1.1  leo 
     79  1.1  leo /* 68040 additions */
     80  1.1  leo #define SG4_IMASK1	0xfe000000
     81  1.1  leo #define SG4_ISHIFT1	25
     82  1.1  leo #define SG4_IMASK2	0x01fc0000
     83  1.1  leo #define SG4_IMASK	0xfffc0000
     84  1.1  leo #define SG4_PMASK	0x0003e000
     85  1.1  leo #define SG4_ISHIFT	18
     86  1.1  leo 
     87  1.1  leo #define	PG_V		0x00000001
     88  1.1  leo #define	PG_NV		0x00000000
     89  1.1  leo #define	PG_PROT		0x00000004
     90  1.1  leo #define	PG_U		0x00000008
     91  1.1  leo #define	PG_M		0x00000010
     92  1.1  leo #define	PG_W		0x00000100
     93  1.1  leo #define	PG_RO		0x00000004
     94  1.1  leo #define	PG_RW		0x00000000
     95  1.1  leo #define PG_FRAME	0xffffe000
     96  1.1  leo #define	PG_CI		0x00000040
     97  1.1  leo #define PG_SHIFT	13
     98  1.1  leo #define	PG_PFNUM(x)	(((x) & PG_FRAME) >> PG_SHIFT)
     99  1.1  leo 
    100  1.1  leo /* 68040 additions */
    101  1.1  leo #define PG_CMASK	0x00000060	/* cache mode mask */
    102  1.1  leo #define PG_CWT		0x00000000	/* writethrough caching */
    103  1.1  leo #define PG_CCB		0x00000020	/* copyback caching */
    104  1.1  leo #define PG_CIS		0x00000040	/* cache inhibited serialized */
    105  1.1  leo #define PG_CIN		0x00000060	/* cache inhibited nonserialized */
    106  1.1  leo #define PG_SO		0x00000080	/* supervisor only */
    107  1.1  leo 
    108  1.1  leo #define ATARI_040RTSIZE		512	/* root (level 1) table size */
    109  1.1  leo #define ATARI_040STSIZE		512	/* segment (level 2) table size */
    110  1.1  leo #define	ATARI_040PTSIZE		128	/* page (level 3) table size */
    111  1.1  leo #define ATARI_STSIZE		1024	/* segment table size */
    112  1.1  leo /*
    113  1.1  leo  * ATARI_MAX_COREUPT	maximum number of incore user page tables
    114  1.1  leo  * ATARI_USER_PTSIZE	the number of bytes for user pagetables
    115  1.1  leo  * ATARI_PTBASE		the VA start of the map from which upt's are allocated
    116  1.1  leo  * ATARI_PTSIZE		the size of the map from which upt's are allocated
    117  1.1  leo  * ATARI_KPTSIZE	size of kernel page table
    118  1.1  leo  * ATARI_MAX_KPTSIZE	the most number of bytes for kpt pages
    119  1.1  leo  * ATARI_MAX_PTSIZE	the number of bytes to map everything
    120  1.1  leo  */
    121  1.1  leo #define ATARI_MAX_COREUPT	1024
    122  1.1  leo #define ATARI_UPTSIZE		roundup(VM_MAXUSER_ADDRESS / NPTEPG, NBPG)
    123  1.1  leo #define ATARI_UPTBASE		0x10000000
    124  1.1  leo #define ATARI_UPTMAXSIZE \
    125  1.1  leo     roundup((ATARI_MAX_COREUPT * ATARI_UPTSIZE), NBPG)
    126  1.1  leo #define ATARI_MAX_KPTSIZE \
    127  1.1  leo     (ATARI_MAX_COREUPT * ATARI_UPTSIZE / NPTEPG)
    128  1.1  leo #define ATARI_KPTSIZE \
    129  1.1  leo     roundup((VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) / NPTEPG, NBPG)
    130  1.1  leo #define ATARI_MAX_PTSIZE	roundup(0xffffffff / NPTEPG, NBPG)
    131  1.1  leo 
    132  1.1  leo /*
    133  1.1  leo  * Kernel virtual address to page table entry and to physical address.
    134  1.1  leo  */
    135  1.1  leo #define	kvtopte(va) \
    136  1.1  leo 	(&Sysmap[((unsigned)(va) - VM_MIN_KERNEL_ADDRESS) >> PGSHIFT])
    137  1.1  leo #define	ptetokv(pt) \
    138  1.1  leo 	((((u_int *)(pt) - Sysmap) << PGSHIFT) + VM_MIN_KERNEL_ADDRESS)
    139  1.1  leo #define	kvtophys(va) \
    140  1.1  leo 	((kvtopte(va)->pg_pfnum << PGSHIFT) | ((int)(va) & PGOFSET))
    141  1.1  leo 
    142  1.1  leo 
    143  1.1  leo #endif /* !_MACHINE_PTE_H_ */
    144