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