pmap.h revision 1.54.26.9 1 /* $NetBSD: pmap.h,v 1.54.26.9 2010/02/23 20:33:47 matt Exp $ */
2
3 /*
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Ralph Campbell.
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. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * @(#)pmap.h 8.1 (Berkeley) 6/10/93
35 */
36
37 /*
38 * Copyright (c) 1987 Carnegie-Mellon University
39 *
40 * This code is derived from software contributed to Berkeley by
41 * Ralph Campbell.
42 *
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions
45 * are met:
46 * 1. Redistributions of source code must retain the above copyright
47 * notice, this list of conditions and the following disclaimer.
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 * 3. All advertising materials mentioning features or use of this software
52 * must display the following acknowledgement:
53 * This product includes software developed by the University of
54 * California, Berkeley and its contributors.
55 * 4. Neither the name of the University nor the names of its contributors
56 * may be used to endorse or promote products derived from this software
57 * without specific prior written permission.
58 *
59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 * SUCH DAMAGE.
70 *
71 * @(#)pmap.h 8.1 (Berkeley) 6/10/93
72 */
73
74 #ifndef _MIPS_PMAP_H_
75 #define _MIPS_PMAP_H_
76
77 #include <mips/cpuregs.h> /* for KSEG0 below */
78 //#include <mips/pte.h>
79
80 /*
81 * The user address space is 2Gb (0x0 - 0x80000000).
82 * User programs are laid out in memory as follows:
83 * address
84 * USRTEXT 0x00001000
85 * USRDATA USRTEXT + text_size
86 * USRSTACK 0x7FFFFFFF
87 *
88 * The user address space is mapped using a two level structure where
89 * virtual address bits 30..22 are used to index into a segment table which
90 * points to a page worth of PTEs (4096 page can hold 1024 PTEs).
91 * Bits 21..12 are then used to index a PTE which describes a page within
92 * a segment.
93 *
94 * The wired entries in the TLB will contain the following:
95 * 0-1 (UPAGES) for curproc user struct and kernel stack.
96 *
97 * Note: The kernel doesn't use the same data structures as user programs.
98 * All the PTE entries are stored in a single array in Sysmap which is
99 * dynamically allocated at boot time.
100 */
101
102 #define mips_trunc_seg(x) ((vaddr_t)(x) & ~SEGOFSET)
103 #define mips_round_seg(x) (((vaddr_t)(x) + SEGOFSET) & ~SEGOFSET)
104
105 #define PMAP_SEGTABSIZE (1 << (31 - SEGSHIFT))
106
107 union pt_entry;
108
109 struct segtab {
110 union pt_entry *seg_tab[PMAP_SEGTABSIZE];
111 };
112
113 /*
114 * Structure defining an tlb entry data set.
115 */
116 struct tlb {
117 vaddr_t tlb_hi; /* should be 64 bits */
118 uint32_t tlb_lo0; /* XXX maybe 64 bits (only 32 really used) */
119 uint32_t tlb_lo1; /* XXX maybe 64 bits (only 32 really used) */
120 };
121
122 struct tlbmask {
123 vaddr_t tlb_hi; /* should be 64 bits */
124 uint32_t tlb_lo0; /* XXX maybe 64 bits (only 32 really used) */
125 uint32_t tlb_lo1; /* XXX maybe 64 bits (only 32 really used) */
126 uint32_t tlb_mask;
127 };
128
129 #ifdef _KERNEL
130 struct pmap;
131 typedef bool (*pte_callback_t)(struct pmap *, vaddr_t, vaddr_t,
132 union pt_entry *, uintptr_t);
133 union pt_entry *pmap_pte_lookup(struct pmap *, vaddr_t);
134 union pt_entry *pmap_pte_reserve(struct pmap *, vaddr_t, int);
135 void pmap_pte_process(struct pmap *, vaddr_t, vaddr_t, pte_callback_t,
136 uintptr_t);
137 void pmap_segtab_activate(struct pmap *, struct lwp *);
138 void pmap_segtab_alloc(struct pmap *);
139 void pmap_segtab_free(struct pmap *);
140 #endif /* _KERNEL */
141
142 /*
143 * Per TLB (normally same as CPU) asid info
144 */
145 struct pmap_asid_info {
146 #ifdef MULTIPROCESSOR
147 LIST_ENTRY(pmap_asid_info) pai_link;
148 #else
149 uint32_t pai_asid_generation; /* its generation number */
150 #endif
151 uint32_t pai_asid; /* TLB address space tag */
152 };
153
154 #ifdef MULTIPROCESSOR
155 #define TLBINFO_LOCK(ti) mutex_spin_enter((ti)->ti_lock)
156 #define TLBINFO_UNLOCK(ti) mutex_spin_exit((ti)->ti_lock)
157 #define PMAP_PAI_ASIDVALID_P(pai, ti) \
158 ((pai)->pai_asid != 0)
159 #else
160 #define TLBINFO_LOCK(ti) do { } while (/*CONSTCOND*/0)
161 #define TLBINFO_UNLOCK(ti) do { } while (/*CONSTCOND*/0)
162 #define PMAP_PAI_ASIDVALID_P(pai, ti) \
163 ((pai)->pai_asid != 0 \
164 && (pai)->pai_asid_generation == (ti)->ti_asid_generation)
165 #endif
166 #define PMAP_PAI(pmap, ti) (&(pmap)->pm_pai[tlbinfo_index(ti)])
167 #define PAI_PMAP(pai, ti) \
168 ((pmap_t)((intptr_t)(pai) \
169 - offsetof(struct pmap, pm_pai[tlbinfo_index(ti)])))
170
171 /*
172 * Machine dependent pmap structure.
173 */
174 typedef struct pmap {
175 #ifdef MULTIPROCESSOR
176 volatile uint32_t pm_active; /* pmap was active on ... */
177 volatile uint32_t pm_onproc; /* pmap is active on ... */
178 volatile u_int pm_shootdown_pending;
179 #endif
180 struct segtab *pm_segtab; /* pointers to pages of PTEs */
181 u_int pm_count; /* pmap reference count */
182 struct pmap_statistics pm_stats; /* pmap statistics */
183 struct pmap_asid_info pm_pai[1];
184 } *pmap_t;
185
186 enum tlb_invalidate_op {
187 TLBINV_NOBODY=0,
188 TLBINV_ONE=1,
189 TLBINV_ALLUSER=2,
190 TLBINV_ALLKERNEL=3,
191 TLBINV_ALL=4
192 };
193
194 struct pmap_tlb_info {
195 uint32_t ti_asid_hint; /* probable next ASID to use */
196 #ifdef MULTIPROCESSOR
197 uint32_t ti_asids_free; /* # of ASIDs free */
198 u_int ti_asid_bitmap[MIPS_TLB_NUM_PIDS / (sizeof(u_int) * 8)];
199 kmutex_t *ti_lock;
200 LIST_HEAD(, pmap_asid_info) ti_pais; /* list of active ASIDs */
201 pmap_t ti_victim;
202 uint32_t ti_cpu_mask; /* bitmask of CPUs sharing this TLB */
203 enum tlb_invalidate_op ti_tlbinvop;
204 u_int ti_index;
205 #define tlbinfo_index(ti) ((ti)->ti_index)
206 #define tlbinfo_noasids_p(ti) ((ti)->ti_asids_free == 0)
207 #else
208 #define tlbinfo_index(ti) (0)
209 #define tlbinfo_noasids_p(ti) ((ti)->ti_asid_hint == 0)
210 uint32_t ti_asid_generation;
211 #endif /* MULTIPROCESSOR */
212 u_int ti_wired; /* # of wired TLB entries */
213 };
214
215
216 #ifdef _KERNEL
217
218 struct pmap_kernel {
219 struct pmap kernel_pmap;
220 #ifdef MULTIPROCESSOR
221 struct pmap_asid_info kernel_pai[MAXCPUS-1];
222 #endif
223 };
224
225 extern struct pmap_kernel kernel_pmap_store;
226 extern struct pmap_tlb_info pmap_tlb_info;
227 extern paddr_t mips_avail_start;
228 extern paddr_t mips_avail_end;
229 extern vaddr_t mips_virtual_end;
230
231 #define pmap_kernel() (&kernel_pmap_store.kernel_pmap)
232 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count)
233 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
234
235 #define pmap_phys_address(x) mips_ptob(x)
236
237 static __inline void
238 pmap_remove_all(struct pmap *pmap)
239 {
240 /* Nothing. */
241 }
242
243 /*
244 * Bootstrap the system enough to run with virtual memory.
245 */
246 void pmap_bootstrap(void);
247
248 void pmap_set_modified(paddr_t);
249 void pmap_procwr(struct proc *, vaddr_t, size_t);
250 #define PMAP_NEED_PROCWR
251
252 #ifdef MULTIPROCESSOR
253 void pmap_tlb_shootdown_process(void);
254 bool pmap_tlb_shootdown_bystanders(pmap_t pmap);
255 void pmap_tlb_info_attach(struct pmap_tlb_info *, struct cpu_info *);
256 void pmap_tlb_info_init(struct pmap_tlb_info *);
257 #endif
258 void pmap_tlb_asid_acquire(pmap_t pmap, struct lwp *l);
259 void pmap_tlb_asid_deactivate(pmap_t pmap);
260 void pmap_tlb_asid_release_all(pmap_t pmap);
261 int pmap_tlb_update_addr(pmap_t pmap, vaddr_t, uint32_t, bool);
262 void pmap_tlb_invalidate_addr(pmap_t pmap, vaddr_t);
263
264 uint16_t pmap_pvlist_lock(struct vm_page *, bool);
265
266 /*
267 * pmap_prefer() helps reduce virtual-coherency exceptions in
268 * the virtually-indexed cache on mips3 CPUs.
269 */
270 #ifdef MIPS3_PLUS
271 #define PMAP_PREFER(pa, va, sz, td) pmap_prefer((pa), (va), (sz), (td))
272 void pmap_prefer(vaddr_t, vaddr_t *, vsize_t, int);
273 #endif /* MIPS3_PLUS */
274
275 #define PMAP_STEAL_MEMORY /* enable pmap_steal_memory() */
276
277 /*
278 * Alternate mapping hooks for pool pages. Avoids thrashing the TLB.
279 */
280 vaddr_t mips_pmap_map_poolpage(paddr_t);
281 paddr_t mips_pmap_unmap_poolpage(vaddr_t);
282 struct vm_page *mips_pmap_alloc_poolpage(int);
283 #define PMAP_ALLOC_POOLPAGE(flags) mips_pmap_alloc_poolpage(flags)
284 #define PMAP_MAP_POOLPAGE(pa) mips_pmap_map_poolpage(pa)
285 #define PMAP_UNMAP_POOLPAGE(va) mips_pmap_unmap_poolpage(va)
286
287 /*
288 * Other hooks for the pool allocator.
289 */
290 #ifdef _LP64
291 #define POOL_VTOPHYS(va) (MIPS_KSEG0_P(va) \
292 ? MIPS_KSEG0_TO_PHYS(va) \
293 : MIPS_XKPHYS_TO_PHYS(va))
294 #else
295 #define POOL_VTOPHYS(va) MIPS_KSEG0_TO_PHYS((vaddr_t)(va))
296 #endif
297
298 /*
299 * Select CCA to use for unmanaged pages.
300 */
301 #define PMAP_CCA_FOR_PA(pa) CCA_UNCACHED /* uncached */
302
303 #if defined(_MIPS_PADDR_T_64BIT) || defined(_LP64)
304 #define PMAP_NOCACHE 0x4000000000000000ULL
305 #endif
306
307 #endif /* _KERNEL */
308 #endif /* _MIPS_PMAP_H_ */
309