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