1 /* $NetBSD: pmap.h,v 1.82 2020/03/21 18:47:54 ad Exp $ */
2
3 /*
4 * Copyright (c) 1991 Regents of the University of California.
5 * All rights reserved.
6 *
7 * Changed for the VAX port. /IC
8 *
9 * This code is derived from software contributed to Berkeley by
10 * the Systems Programming Group of the University of Utah Computer
11 * Science Department.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 *
37 * @(#)pmap.h 7.6 (Berkeley) 5/10/91
38 */
39
40 /*
41 * Copyright (c) 1987 Carnegie-Mellon University
42 *
43 * Changed for the VAX port. /IC
44 *
45 * This code is derived from software contributed to Berkeley by
46 * the Systems Programming Group of the University of Utah Computer
47 * Science Department.
48 *
49 * Redistribution and use in source and binary forms, with or without
50 * modification, are permitted provided that the following conditions
51 * are met:
52 * 1. Redistributions of source code must retain the above copyright
53 * notice, this list of conditions and the following disclaimer.
54 * 2. Redistributions in binary form must reproduce the above copyright
55 * notice, this list of conditions and the following disclaimer in the
56 * documentation and/or other materials provided with the distribution.
57 * 3. All advertising materials mentioning features or use of this software
58 * must display the following acknowledgement:
59 * This product includes software developed by the University of
60 * California, Berkeley and its contributors.
61 * 4. Neither the name of the University nor the names of its contributors
62 * may be used to endorse or promote products derived from this software
63 * without specific prior written permission.
64 *
65 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
66 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
67 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
68 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
69 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
70 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
71 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
72 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
73 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
74 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
75 * SUCH DAMAGE.
76 *
77 * @(#)pmap.h 7.6 (Berkeley) 5/10/91
78 */
79
80
81 #ifndef PMAP_H
82 #define PMAP_H
83
84 #include <sys/atomic.h>
85
86 #include <uvm/uvm_page.h>
87
88 #include <machine/pte.h>
89 #include <machine/mtpr.h>
90 #include <machine/pcb.h>
91
92 /*
93 * Some constants to make life easier.
94 */
95 #define LTOHPS (PGSHIFT - VAX_PGSHIFT)
96 #define LTOHPN (1 << LTOHPS)
97
98 /*
99 * Pmap structure
100 * pm_stack holds lowest allocated memory for the process stack.
101 */
102
103 struct pmap {
104 struct pte *pm_p1ap; /* Base of alloced p1 pte space */
105 u_int pm_count; /* reference count */
106 struct pcb *pm_pcbs; /* PCBs using this pmap */
107 struct pte *pm_p0br; /* page 0 base register */
108 long pm_p0lr; /* page 0 length register */
109 struct pte *pm_p1br; /* page 1 base register */
110 long pm_p1lr; /* page 1 length register */
111 struct pmap_statistics pm_stats; /* Some statistics */
112 };
113
114 /*
115 * For each struct vm_page, there is a list of all currently valid virtual
116 * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
117 */
118
119 struct pv_entry {
120 struct pv_entry *pv_next; /* next pv_entry */
121 vaddr_t pv_vaddr; /* address for this physical page */
122 struct pmap *pv_pmap; /* pmap this entry belongs to */
123 int pv_attr; /* write/modified bits */
124 };
125
126 extern struct pv_entry *pv_table;
127
128 /* Mapping macros used when allocating SPT */
129 #define MAPVIRT(ptr, count) \
130 ptr = virtual_avail; \
131 virtual_avail += (count) * VAX_NBPG;
132
133 #define MAPPHYS(ptr, count, perm) \
134 ptr = avail_start + KERNBASE; \
135 avail_start += (count) * VAX_NBPG;
136
137
138 /*
139 * Real nice (fast) routines to get the virtual address of a physical page
140 * (and vice versa).
141 */
142 #define PMAP_VTOPHYS(va) ((va) & ~KERNBASE)
143 #define PMAP_MAP_POOLPAGE(pa) ((pa) | KERNBASE)
144 #define PMAP_UNMAP_POOLPAGE(va) ((va) & ~KERNBASE)
145
146 #define PMAP_STEAL_MEMORY
147
148 /*
149 * This is the by far most used pmap routine. Make it inline.
150 */
151 static __inline bool
pmap_extract(pmap_t pmap,vaddr_t va,paddr_t * pap)152 pmap_extract(pmap_t pmap, vaddr_t va, paddr_t *pap)
153 {
154 int *pte, sva;
155
156 if (va & KERNBASE) {
157 paddr_t pa;
158
159 pa = kvtophys(va); /* Is 0 if not mapped */
160 if (pap)
161 *pap = pa;
162 if (pa)
163 return (true);
164 return (false);
165 }
166
167 sva = PG_PFNUM(va);
168 if (va < 0x40000000) {
169 if (sva >= (pmap->pm_p0lr & ~AST_MASK))
170 goto fail;
171 pte = (int *)pmap->pm_p0br;
172 } else {
173 if (sva < pmap->pm_p1lr)
174 goto fail;
175 pte = (int *)pmap->pm_p1br;
176 }
177 /*
178 * Since the PTE tables are sparsely allocated, make sure the page
179 * table page actually exists before deferencing the pte itself.
180 */
181 if (kvtopte(&pte[sva])->pg_v && (pte[sva] & PG_FRAME)) {
182 if (pap)
183 *pap = (pte[sva] & PG_FRAME) << VAX_PGSHIFT;
184 return (true);
185 }
186 fail:
187 if (pap)
188 *pap = 0;
189 return (false);
190 }
191
192 void pmap_page_protect_long(struct pv_entry *, vm_prot_t);
193 void pmap_protect_long(pmap_t, vaddr_t, vaddr_t, vm_prot_t);
194
195 static __inline struct pv_entry *
pmap_pg_to_pv(const struct vm_page * pg)196 pmap_pg_to_pv(const struct vm_page *pg)
197 {
198 return pv_table + (VM_PAGE_TO_PHYS(pg) >> PGSHIFT);
199 }
200
201 static __inline bool
pmap_is_referenced(struct vm_page * pg)202 pmap_is_referenced(struct vm_page *pg)
203 {
204 const struct pv_entry * const pv = pmap_pg_to_pv(pg);
205
206 return (pv->pv_attr & PG_V) != 0;
207 }
208
209 static __inline void
pmap_page_protect(struct vm_page * pg,vm_prot_t prot)210 pmap_page_protect(struct vm_page *pg, vm_prot_t prot)
211 {
212 struct pv_entry * const pv = pmap_pg_to_pv(pg);
213
214 if (pv->pv_pmap != NULL || pv->pv_next != NULL)
215 pmap_page_protect_long(pv, prot);
216 }
217
218 static __inline void
pmap_protect(pmap_t pmap,vaddr_t start,vaddr_t end,vm_prot_t prot)219 pmap_protect(pmap_t pmap, vaddr_t start, vaddr_t end, vm_prot_t prot)
220 {
221 if (pmap->pm_p0lr != 0 || pmap->pm_p1lr != 0x200000 ||
222 (start & KERNBASE) != 0)
223 pmap_protect_long(pmap, start, end, prot);
224 }
225
226 static __inline bool
pmap_remove_all(struct pmap * pmap)227 pmap_remove_all(struct pmap *pmap)
228 {
229 /* Nothing. */
230 return false;
231 }
232
233 /* Routines that are best to define as macros */
234 #define pmap_phys_address(phys) ((u_int)(phys) << PGSHIFT)
235 #define pmap_copy(a,b,c,d,e) /* Dont do anything */
236 #define pmap_update(pmap) /* nothing (yet) */
237 #define pmap_remove(pmap, start, end) pmap_protect(pmap, start, end, 0)
238 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
239 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count)
240 #define pmap_reference(pmap) atomic_inc_uint(&(pmap)->pm_count)
241
242 /* These can be done as efficient inline macros */
243 #define pmap_copy_page(src, dst) \
244 __asm("addl3 $0x80000000,%0,%%r0;" \
245 "addl3 $0x80000000,%1,%%r1;" \
246 "movc3 $4096,(%%r0),(%%r1)" \
247 :: "r"(src), "r"(dst) \
248 : "r0","r1","r2","r3","r4","r5");
249
250 #define pmap_zero_page(phys) \
251 __asm("addl3 $0x80000000,%0,%%r0;" \
252 "movc5 $0,(%%r0),$0,$4096,(%%r0)" \
253 :: "r"(phys) \
254 : "r0","r1","r2","r3","r4","r5");
255
256 /* Prototypes */
257 void pmap_bootstrap(void);
258 vaddr_t pmap_map(vaddr_t, vaddr_t, vaddr_t, int);
259
260 #if 0
261 #define __HAVE_VM_PAGE_MD
262
263 struct vm_page_md {
264 unsigned int md_attrs;
265 };
266
267 #define VM_MDPAGE_INIT(pg) ((pg)->mdpage.md_attrs = 0)
268 #endif
269
270 #endif /* PMAP_H */
271