Home | History | Annotate | Line # | Download | only in include
pte.h revision 1.1 
      1 /*
      2  * Copyright (c) 1988 University of Utah.
      3  * Copyright (c) 1982, 1986, 1990 The Regents of the University of California.
      4  * All rights reserved.
      5  *
      6  * This code is derived from software contributed to Berkeley by
      7  * the Systems Programming Group of the University of Utah Computer
      8  * Science Department.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the University of
     21  *	California, Berkeley and its contributors.
     22  * 4. Neither the name of the University nor the names of its contributors
     23  *    may be used to endorse or promote products derived from this software
     24  *    without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  * SUCH DAMAGE.
     37  *
     38  * from: Utah $Hdr: pte.h 1.11 89/09/03$
     39  *
     40  *	@(#)pte.h	7.3 (Berkeley) 5/8/91
     41  */
     42 
     43 #ifndef _PTE_H
     44 #define _PTE_H
     45 /*
     46  * AMIGA hardware segment/page table entries
     47  */
     48 
     49 struct ste {
     50 	unsigned int	sg_pfnum:20;	/* page table frame number */
     51 	unsigned int	:8;		/* reserved at 0 */
     52 	unsigned int	:1;		/* reserved at 1 */
     53 	unsigned int	sg_prot:1;	/* write protect bit */
     54 	unsigned int	sg_v:2;		/* valid bits */
     55 };
     56 
     57 struct pte {
     58 	unsigned int	pg_pfnum:20;	/* page frame number or 0 */
     59 	unsigned int	:3;
     60 	unsigned int	pg_w:1;		/* is wired */
     61 	unsigned int	:1;		/* reserved at zero */
     62 	unsigned int	pg_ci:1;	/* cache inhibit bit */
     63 	unsigned int	pg_cm1:1;	/* cache mode, lsb (68040) */
     64 	unsigned int	pg_m:1;		/* hardware modified (dirty) bit */
     65 	unsigned int	pg_u:1;		/* hardware used (reference) bit */
     66 	unsigned int	pg_prot:1;	/* write protect bit */
     67 	unsigned int	pg_v:2;		/* valid bit */
     68 };
     69 
     70 typedef struct ste	st_entry_t;	/* segment table entry */
     71 typedef struct pte	pt_entry_t;	/* Mach page table entry */
     72 
     73 #define	PT_ENTRY_NULL	((pt_entry_t *) 0)
     74 #define	ST_ENTRY_NULL	((st_entry_t *) 0)
     75 
     76 #define	SG_V		0x00000002	/* segment is valid */
     77 #define	SG_NV		0x00000000
     78 #define	SG_PROT		0x00000004	/* access protection mask */
     79 #define	SG_RO		0x00000004
     80 #define	SG_RW		0x00000000
     81 #define	SG_FRAME	0xffffe000
     82 #define SG_IMASK1	0xfe000000
     83 #define SG_IMASK2	0x01fc0000
     84 #define SG_040IMASK	0xfffc0000
     85 #define SG_040PMASK	0x0003e000
     86 #define SG_ISHIFT1	25
     87 #define SG_040ISHIFT	18
     88 #define SG_IMASK	0xff000000
     89 #define SG_PMASK	0x00ffe000
     90 #define SG_ISHIFT	24
     91 #define SG_PSHIFT	13
     92 
     93 
     94 #define	PG_V		0x00000001
     95 #define	PG_NV		0x00000000
     96 #define	PG_PROT		0x00000004
     97 #define	PG_U		0x00000008
     98 #define	PG_M		0x00000010
     99 #define	PG_W		0x00000100
    100 #define	PG_RO		0x00000004
    101 #define	PG_RW		0x00000000
    102 #define	PG_CI		0x00000040
    103 #define PG_CC		0x00000020	/* Cachable, copyback */
    104 #define PG_CIN		0x00000060	/* Cache inhibited, nonserialized */
    105 #define PG_FRAME	0xffffe000
    106 #define PG_SHIFT	13
    107 #define	PG_PFNUM(x)	(((x) & PG_FRAME) >> PG_SHIFT)
    108 
    109 #define AMIGA_040RTSIZE		512		/* root (level 1) table size */
    110 #define AMIGA_040STSIZE		512		/* segment (level 2) table size */
    111 #define	AMIGA_040PTSIZE		128		/* page (level 3) table size */
    112 #define AMIGA_STSIZE		1024		/* segment table size */
    113 #define AMIGA_MAX_PTSIZE	(2*1024*1024)	/* max size of UPT */
    114 /* XXX probably have to reduce this to 512k */
    115 #define AMIGA_MAX_KPTSIZE	0x100000	/* max memory to allocate to KPT */
    116 #define AMIGA_PTBASE		0x10000000	/* UPT map base address */
    117 #define AMIGA_PTMAXSIZE		0x70000000	/* UPT map maximum size */
    118 
    119 /*
    120  * Kernel virtual address to page table entry and to physical address.
    121  */
    122 #define	kvtopte(va) \
    123 	(&Sysmap[((unsigned)(va) - VM_MIN_KERNEL_ADDRESS) >> PGSHIFT])
    124 #define	ptetokv(pt) \
    125 	((((pt_entry_t *)(pt) - Sysmap) << PGSHIFT) + VM_MIN_KERNEL_ADDRESS)
    126 #define	kvtophys(va) \
    127 	((kvtopte(va)->pg_pfnum << PGSHIFT) | ((int)(va) & PGOFSET))
    128 
    129 
    130 #endif /* _PTE_H */
    131