pte.h revision 1.7
1 /* $NetBSD: pte.h,v 1.7 1994/10/26 08:46:43 cgd 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: pte.h 1.11 89/09/03$ 75 * 76 * @(#)pte.h 7.3 (Berkeley) 5/8/91 77 */ 78 79 #ifndef _MACHINE_PTE_H_ 80 #define _MACHINE_PTE_H_ 1 81 82 /* 83 * Mac hardware segment/page table entries 84 */ 85 86 struct ste { 87 unsigned int sg_pfnum:20; /* page table frame number */ 88 unsigned int :8; /* reserved at 0 */ 89 unsigned int :1; /* reserved at 1 */ 90 unsigned int sg_prot:1; /* write protect bit */ 91 unsigned int sg_v:2; /* valid bits */ 92 }; 93 94 struct pte { 95 unsigned int pg_pfnum:20; /* page frame number or 0 */ 96 unsigned int :3; 97 unsigned int pg_w:1; /* is wired */ 98 unsigned int :1; /* reserved at zero */ 99 unsigned int pg_ci:1; /* cache inhibit bit */ 100 unsigned int pg_cm1:1; /* cache mode, lsb (68040) */ 101 unsigned int pg_m:1; /* hardware modified (dirty) bit */ 102 unsigned int pg_u:1; /* hardware used (reference) bit */ 103 unsigned int pg_prot:1; /* write protect bit */ 104 unsigned int pg_v:2; /* valid bit */ 105 }; 106 107 typedef struct ste st_entry_t; /* segment table entry */ 108 typedef struct pte pt_entry_t; /* Mach page table entry */ 109 110 #define PT_ENTRY_NULL ((pt_entry_t *) 0) 111 #define ST_ENTRY_NULL ((st_entry_t *) 0) 112 113 #define SG_V 0x00000002 /* segment is valid */ 114 #define SG_NV 0x00000000 115 #define SG_PROT 0x00000004 /* access protection mask */ 116 #define SG_RO 0x00000004 117 #define SG_RW 0x00000000 118 #define SG_FRAME 0xfffff000 119 #define SG_IMASK1 0xfe000000 120 #define SG_IMASK2 0x01fc0000 121 #define SG_040IMASK 0xfffc0000 122 #define SG_040PMASK 0x0003f000 123 #define SG_ISHIFT1 25 124 #define SG_040ISHIFT 18 125 #define SG_IMASK 0xffc00000 126 #define SG_PMASK 0x003ff000 127 #define SG_ISHIFT 22 128 #define SG_PSHIFT 12 129 130 #define PG_V 0x00000001 131 #define PG_NV 0x00000000 132 #define PG_PROT 0x00000004 133 #define PG_U 0x00000008 134 #define PG_M 0x00000010 135 #define PG_W 0x00000100 136 #define PG_RO 0x00000004 137 #define PG_RW 0x00000000 138 #define PG_CI 0x00000040 139 #define PG_CCB 0x00000020 140 #define PG_CIN 0x00000060 141 #define PG_FRAME 0xfffff000 142 #define PG_SHIFT 12 143 #define PG_PFNUM(x) (((x) & PG_FRAME) >> PG_SHIFT) 144 145 #define MAC_040RTSIZE 512 /* root (level 1) table size */ 146 #define MAC_040STSIZE 512 /* segment (level 2) table size */ 147 #define MAC_040PTSIZE 256 /* page (level 3) table size */ 148 #define MAC_STSIZE MAC_PAGE_SIZE /* segment table size */ 149 #define MAC_MAX_PTSIZE MAC_SEG_SIZE /* max size of UPT */ 150 #define MAC_MAX_KPTSIZE 0x100000 /* max memory to allocate to KPT */ 151 #define MAC_PTBASE 0x60100000 /* UPT map base address */ 152 #define MAC_PTMAXSIZE 0x70000000 /* UPT map maximum size */ 153 154 /* 155 * Kernel virtual address to page table entry and to physical address. 156 */ 157 #define kvtopte(va) \ 158 (&Sysmap[((unsigned)(va) - VM_MIN_KERNEL_ADDRESS) >> PGSHIFT]) 159 #define kvtoste(va) \ 160 (&Sysseg[((unsigned)(va) - VM_MIN_KERNEL_ADDRESS) >> SEGSHIFT]) 161 #define ptetokv(pt) \ 162 ((((pt_entry_t *)(pt) - Sysmap) << PGSHIFT) + VM_MIN_KERNEL_ADDRESS) 163 #define kvtophys(va) \ 164 ((kvtopte(va)->pg_pfnum << PGSHIFT) | ((int)(va) & PGOFSET)) 165 166 #endif /* _MACHINE_PTE_H_ */ 167
Indexes created Thu Oct 23 18:09:57 GMT 2025