pte.h revision 1.10 1 /* $NetBSD: pte.h,v 1.10 1994/10/26 02:06:33 cgd 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. 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 * from: Utah $Hdr: pte.h 1.11 89/09/03$
41 *
42 * @(#)pte.h 7.3 (Berkeley) 5/8/91
43 */
44 #ifndef _MACHINE_PTE_H_
45 #define _MACHINE_PTE_H_
46
47 /*
48 * AMIGA hardware segment/page table entries
49 */
50
51 struct pte {
52 u_int pte;
53 };
54
55 struct ste {
56 u_int ste;
57 };
58
59 #define PT_ENTRY_NULL ((u_int *) 0)
60 #define ST_ENTRY_NULL ((u_int *) 0)
61
62 #define SG_V 0x00000002 /* segment is valid */
63 #define SG_NV 0x00000000
64 #define SG_PROT 0x00000004 /* access protection mask */
65 #define SG_RO 0x00000004
66 #define SG_RW 0x00000000
67 #define SG_U 0x00000008 /* modified bit (68040) */
68 #define SG_FRAME 0xffffe000
69 #define SG_IMASK 0xff000000
70 #define SG_ISHIFT 24
71 #define SG_PMASK 0x00ffe000
72 #define SG_PSHIFT 13
73
74 /* 68040 additions */
75 #define SG4_IMASK1 0xfe000000
76 #define SG4_ISHIFT1 25
77 #define SG4_IMASK2 0x01fc0000
78 #define SG4_IMASK 0xfffc0000
79 #define SG4_PMASK 0x0003e000
80 #define SG4_ISHIFT 18
81
82 #define PG_V 0x00000001
83 #define PG_NV 0x00000000
84 #define PG_PROT 0x00000004
85 #define PG_U 0x00000008
86 #define PG_M 0x00000010
87 #define PG_W 0x00000100
88 #define PG_RO 0x00000004
89 #define PG_RW 0x00000000
90 #define PG_FRAME 0xffffe000
91 #define PG_CI 0x00000040
92 #define PG_SHIFT 13
93 #define PG_PFNUM(x) (((x) & PG_FRAME) >> PG_SHIFT)
94
95 /* 68040 additions */
96 #define PG_CMASK 0x00000060 /* cache mode mask */
97 #define PG_CWT 0x00000000 /* writethrough caching */
98 #define PG_CCB 0x00000020 /* copyback caching */
99 #define PG_CIS 0x00000040 /* cache inhibited serialized */
100 #define PG_CIN 0x00000060 /* cache inhibited nonserialized */
101 #define PG_SO 0x00000080 /* supervisor only */
102
103 #define AMIGA_040RTSIZE 512 /* root (level 1) table size */
104 #define AMIGA_040STSIZE 512 /* segment (level 2) table size */
105 #define AMIGA_040PTSIZE 128 /* page (level 3) table size */
106 #define AMIGA_STSIZE 1024 /* segment table size */
107 /*
108 * AMIGA_MAX_COREUPT maximum number of incore user page tables
109 * AMIGA_USER_PTSIZE the number of bytes for user pagetables
110 * AMIGA_PTBASE the VA start of the map from which upt's are allocated
111 * AMIGA_PTSIZE the size of the map from which upt's are allocated
112 * AMIGA_KPTSIZE size of kernel page table
113 * AMIGA_MAX_KPTSIZE the most number of bytes for kpt pages
114 * AMIGA_MAX_PTSIZE the number of bytes to map everything
115 */
116 #define AMIGA_MAX_COREUPT 1024
117 #define AMIGA_UPTSIZE roundup(VM_MAXUSER_ADDRESS / NPTEPG, NBPG)
118 #define AMIGA_UPTBASE 0x10000000
119 #define AMIGA_UPTMAXSIZE \
120 roundup((AMIGA_MAX_COREUPT * AMIGA_UPTSIZE), NBPG)
121 #define AMIGA_MAX_KPTSIZE \
122 (AMIGA_MAX_COREUPT * AMIGA_UPTSIZE / NPTEPG)
123 #define AMIGA_KPTSIZE \
124 roundup((VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) / NPTEPG, NBPG)
125 #define AMIGA_MAX_PTSIZE roundup(0xffffffff / NPTEPG, NBPG)
126
127 /*
128 * Kernel virtual address to page table entry and to physical address.
129 */
130 #define kvtopte(va) \
131 (&Sysmap[((unsigned)(va) - VM_MIN_KERNEL_ADDRESS) >> PGSHIFT])
132 #define ptetokv(pt) \
133 ((((u_int *)(pt) - Sysmap) << PGSHIFT) + VM_MIN_KERNEL_ADDRESS)
134 #define kvtophys(va) \
135 ((kvtopte(va)->pg_pfnum << PGSHIFT) | ((int)(va) & PGOFSET))
136
137
138 #endif /* !_MACHINE_PTE_H_ */
139