2 * Copyright (c) 2001 The NetBSD Foundation, Inc.
5 * This code is derived from software contributed to The NetBSD Foundation
6 * by Matt Thomas <matt@3am-software.com> of Allegro Networks, Inc.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the NetBSD
19 * Foundation, Inc. and its contributors.
20 * 4. Neither the name of The NetBSD Foundation nor the names of its
21 * contributors may be used to endorse or promote products derived
22 * from this software without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
25 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
26 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
27 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
28 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
37 * Copyright (C) 1995, 1996 Wolfgang Solfrank.
38 * Copyright (C) 1995, 1996 TooLs GmbH.
39 * All rights reserved.
41 * Redistribution and use in source and binary forms, with or without
42 * modification, are permitted provided that the following conditions
44 * 1. Redistributions of source code must retain the above copyright
45 * notice, this list of conditions and the following disclaimer.
46 * 2. Redistributions in binary form must reproduce the above copyright
47 * notice, this list of conditions and the following disclaimer in the
48 * documentation and/or other materials provided with the distribution.
49 * 3. All advertising materials mentioning features or use of this software
50 * must display the following acknowledgement:
51 * This product includes software developed by TooLs GmbH.
52 * 4. The name of TooLs GmbH may not be used to endorse or promote products
53 * derived from this software without specific prior written permission.
55 * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
56 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
57 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
58 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
59 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
60 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
61 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
62 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
63 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
64 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
66 * $NetBSD: pmap.c,v 1.28 2000/03/26 20:42:36 kleink Exp $
69 * Copyright (C) 2001 Benno Rice.
70 * All rights reserved.
72 * Redistribution and use in source and binary forms, with or without
73 * modification, are permitted provided that the following conditions
75 * 1. Redistributions of source code must retain the above copyright
76 * notice, this list of conditions and the following disclaimer.
77 * 2. Redistributions in binary form must reproduce the above copyright
78 * notice, this list of conditions and the following disclaimer in the
79 * documentation and/or other materials provided with the distribution.
81 * THIS SOFTWARE IS PROVIDED BY Benno Rice ``AS IS'' AND ANY EXPRESS OR
82 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
83 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
84 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
85 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
86 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
87 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
88 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
89 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
90 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
93 #include <sys/cdefs.h>
94 __FBSDID("$FreeBSD$");
97 * Manages physical address maps.
99 * Since the information managed by this module is also stored by the
100 * logical address mapping module, this module may throw away valid virtual
101 * to physical mappings at almost any time. However, invalidations of
102 * mappings must be done as requested.
104 * In order to cope with hardware architectures which make virtual to
105 * physical map invalidates expensive, this module may delay invalidate
106 * reduced protection operations until such time as they are actually
107 * necessary. This module is given full information as to which processors
108 * are currently using which maps, and to when physical maps must be made
112 #include "opt_kstack_pages.h"
114 #include <sys/param.h>
115 #include <sys/kernel.h>
116 #include <sys/queue.h>
117 #include <sys/cpuset.h>
119 #include <sys/lock.h>
120 #include <sys/msgbuf.h>
121 #include <sys/mutex.h>
122 #include <sys/proc.h>
123 #include <sys/rwlock.h>
124 #include <sys/sched.h>
125 #include <sys/sysctl.h>
126 #include <sys/systm.h>
127 #include <sys/vmmeter.h>
129 #include <dev/ofw/openfirm.h>
132 #include <vm/vm_param.h>
133 #include <vm/vm_kern.h>
134 #include <vm/vm_page.h>
135 #include <vm/vm_map.h>
136 #include <vm/vm_object.h>
137 #include <vm/vm_extern.h>
138 #include <vm/vm_pageout.h>
141 #include <machine/cpu.h>
142 #include <machine/platform.h>
143 #include <machine/bat.h>
144 #include <machine/frame.h>
145 #include <machine/md_var.h>
146 #include <machine/psl.h>
147 #include <machine/pte.h>
148 #include <machine/smp.h>
149 #include <machine/sr.h>
150 #include <machine/mmuvar.h>
151 #include <machine/trap_aim.h>
157 #define TODO panic("%s: not implemented", __func__);
159 #define VSID_MAKE(sr, hash) ((sr) | (((hash) & 0xfffff) << 4))
160 #define VSID_TO_SR(vsid) ((vsid) & 0xf)
161 #define VSID_TO_HASH(vsid) (((vsid) >> 4) & 0xfffff)
170 extern unsigned char _etext[];
171 extern unsigned char _end[];
173 extern int dumpsys_minidump;
176 * Map of physical memory regions.
178 static struct mem_region *regions;
179 static struct mem_region *pregions;
180 static u_int phys_avail_count;
181 static int regions_sz, pregions_sz;
182 static struct ofw_map *translations;
185 * Lock for the pteg and pvo tables.
187 struct mtx moea_table_mutex;
188 struct mtx moea_vsid_mutex;
190 /* tlbie instruction synchronization */
191 static struct mtx tlbie_mtx;
196 static struct pteg *moea_pteg_table;
197 u_int moea_pteg_count;
198 u_int moea_pteg_mask;
203 struct pvo_head *moea_pvo_table; /* pvo entries by pteg index */
204 struct pvo_head moea_pvo_kunmanaged =
205 LIST_HEAD_INITIALIZER(moea_pvo_kunmanaged); /* list of unmanaged pages */
207 static struct rwlock_padalign pvh_global_lock;
209 uma_zone_t moea_upvo_zone; /* zone for pvo entries for unmanaged pages */
210 uma_zone_t moea_mpvo_zone; /* zone for pvo entries for managed pages */
212 #define BPVO_POOL_SIZE 32768
213 static struct pvo_entry *moea_bpvo_pool;
214 static int moea_bpvo_pool_index = 0;
216 #define VSID_NBPW (sizeof(u_int32_t) * 8)
217 static u_int moea_vsid_bitmap[NPMAPS / VSID_NBPW];
219 static boolean_t moea_initialized = FALSE;
224 u_int moea_pte_valid = 0;
225 u_int moea_pte_overflow = 0;
226 u_int moea_pte_replacements = 0;
227 u_int moea_pvo_entries = 0;
228 u_int moea_pvo_enter_calls = 0;
229 u_int moea_pvo_remove_calls = 0;
230 u_int moea_pte_spills = 0;
231 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_valid, CTLFLAG_RD, &moea_pte_valid,
233 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_overflow, CTLFLAG_RD,
234 &moea_pte_overflow, 0, "");
235 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_replacements, CTLFLAG_RD,
236 &moea_pte_replacements, 0, "");
237 SYSCTL_INT(_machdep, OID_AUTO, moea_pvo_entries, CTLFLAG_RD, &moea_pvo_entries,
239 SYSCTL_INT(_machdep, OID_AUTO, moea_pvo_enter_calls, CTLFLAG_RD,
240 &moea_pvo_enter_calls, 0, "");
241 SYSCTL_INT(_machdep, OID_AUTO, moea_pvo_remove_calls, CTLFLAG_RD,
242 &moea_pvo_remove_calls, 0, "");
243 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_spills, CTLFLAG_RD,
244 &moea_pte_spills, 0, "");
247 * Allocate physical memory for use in moea_bootstrap.
249 static vm_offset_t moea_bootstrap_alloc(vm_size_t, u_int);
254 static int moea_pte_insert(u_int, struct pte *);
259 static int moea_pvo_enter(pmap_t, uma_zone_t, struct pvo_head *,
260 vm_offset_t, vm_offset_t, u_int, int);
261 static void moea_pvo_remove(struct pvo_entry *, int);
262 static struct pvo_entry *moea_pvo_find_va(pmap_t, vm_offset_t, int *);
263 static struct pte *moea_pvo_to_pte(const struct pvo_entry *, int);
268 static void moea_enter_locked(pmap_t, vm_offset_t, vm_page_t,
269 vm_prot_t, boolean_t);
270 static void moea_syncicache(vm_offset_t, vm_size_t);
271 static boolean_t moea_query_bit(vm_page_t, int);
272 static u_int moea_clear_bit(vm_page_t, int);
273 static void moea_kremove(mmu_t, vm_offset_t);
274 int moea_pte_spill(vm_offset_t);
277 * Kernel MMU interface
279 void moea_change_wiring(mmu_t, pmap_t, vm_offset_t, boolean_t);
280 void moea_clear_modify(mmu_t, vm_page_t);
281 void moea_copy_page(mmu_t, vm_page_t, vm_page_t);
282 void moea_copy_pages(mmu_t mmu, vm_page_t *ma, vm_offset_t a_offset,
283 vm_page_t *mb, vm_offset_t b_offset, int xfersize);
284 void moea_enter(mmu_t, pmap_t, vm_offset_t, vm_page_t, vm_prot_t, boolean_t);
285 void moea_enter_object(mmu_t, pmap_t, vm_offset_t, vm_offset_t, vm_page_t,
287 void moea_enter_quick(mmu_t, pmap_t, vm_offset_t, vm_page_t, vm_prot_t);
288 vm_paddr_t moea_extract(mmu_t, pmap_t, vm_offset_t);
289 vm_page_t moea_extract_and_hold(mmu_t, pmap_t, vm_offset_t, vm_prot_t);
290 void moea_init(mmu_t);
291 boolean_t moea_is_modified(mmu_t, vm_page_t);
292 boolean_t moea_is_prefaultable(mmu_t, pmap_t, vm_offset_t);
293 boolean_t moea_is_referenced(mmu_t, vm_page_t);
294 int moea_ts_referenced(mmu_t, vm_page_t);
295 vm_offset_t moea_map(mmu_t, vm_offset_t *, vm_paddr_t, vm_paddr_t, int);
296 boolean_t moea_page_exists_quick(mmu_t, pmap_t, vm_page_t);
297 int moea_page_wired_mappings(mmu_t, vm_page_t);
298 void moea_pinit(mmu_t, pmap_t);
299 void moea_pinit0(mmu_t, pmap_t);
300 void moea_protect(mmu_t, pmap_t, vm_offset_t, vm_offset_t, vm_prot_t);
301 void moea_qenter(mmu_t, vm_offset_t, vm_page_t *, int);
302 void moea_qremove(mmu_t, vm_offset_t, int);
303 void moea_release(mmu_t, pmap_t);
304 void moea_remove(mmu_t, pmap_t, vm_offset_t, vm_offset_t);
305 void moea_remove_all(mmu_t, vm_page_t);
306 void moea_remove_write(mmu_t, vm_page_t);
307 void moea_zero_page(mmu_t, vm_page_t);
308 void moea_zero_page_area(mmu_t, vm_page_t, int, int);
309 void moea_zero_page_idle(mmu_t, vm_page_t);
310 void moea_activate(mmu_t, struct thread *);
311 void moea_deactivate(mmu_t, struct thread *);
312 void moea_cpu_bootstrap(mmu_t, int);
313 void moea_bootstrap(mmu_t, vm_offset_t, vm_offset_t);
314 void *moea_mapdev(mmu_t, vm_paddr_t, vm_size_t);
315 void *moea_mapdev_attr(mmu_t, vm_offset_t, vm_size_t, vm_memattr_t);
316 void moea_unmapdev(mmu_t, vm_offset_t, vm_size_t);
317 vm_paddr_t moea_kextract(mmu_t, vm_offset_t);
318 void moea_kenter_attr(mmu_t, vm_offset_t, vm_offset_t, vm_memattr_t);
319 void moea_kenter(mmu_t, vm_offset_t, vm_paddr_t);
320 void moea_page_set_memattr(mmu_t mmu, vm_page_t m, vm_memattr_t ma);
321 boolean_t moea_dev_direct_mapped(mmu_t, vm_paddr_t, vm_size_t);
322 static void moea_sync_icache(mmu_t, pmap_t, vm_offset_t, vm_size_t);
323 vm_offset_t moea_dumpsys_map(mmu_t mmu, struct pmap_md *md, vm_size_t ofs,
325 struct pmap_md * moea_scan_md(mmu_t mmu, struct pmap_md *prev);
327 static mmu_method_t moea_methods[] = {
328 MMUMETHOD(mmu_change_wiring, moea_change_wiring),
329 MMUMETHOD(mmu_clear_modify, moea_clear_modify),
330 MMUMETHOD(mmu_copy_page, moea_copy_page),
331 MMUMETHOD(mmu_copy_pages, moea_copy_pages),
332 MMUMETHOD(mmu_enter, moea_enter),
333 MMUMETHOD(mmu_enter_object, moea_enter_object),
334 MMUMETHOD(mmu_enter_quick, moea_enter_quick),
335 MMUMETHOD(mmu_extract, moea_extract),
336 MMUMETHOD(mmu_extract_and_hold, moea_extract_and_hold),
337 MMUMETHOD(mmu_init, moea_init),
338 MMUMETHOD(mmu_is_modified, moea_is_modified),
339 MMUMETHOD(mmu_is_prefaultable, moea_is_prefaultable),
340 MMUMETHOD(mmu_is_referenced, moea_is_referenced),
341 MMUMETHOD(mmu_ts_referenced, moea_ts_referenced),
342 MMUMETHOD(mmu_map, moea_map),
343 MMUMETHOD(mmu_page_exists_quick,moea_page_exists_quick),
344 MMUMETHOD(mmu_page_wired_mappings,moea_page_wired_mappings),
345 MMUMETHOD(mmu_pinit, moea_pinit),
346 MMUMETHOD(mmu_pinit0, moea_pinit0),
347 MMUMETHOD(mmu_protect, moea_protect),
348 MMUMETHOD(mmu_qenter, moea_qenter),
349 MMUMETHOD(mmu_qremove, moea_qremove),
350 MMUMETHOD(mmu_release, moea_release),
351 MMUMETHOD(mmu_remove, moea_remove),
352 MMUMETHOD(mmu_remove_all, moea_remove_all),
353 MMUMETHOD(mmu_remove_write, moea_remove_write),
354 MMUMETHOD(mmu_sync_icache, moea_sync_icache),
355 MMUMETHOD(mmu_zero_page, moea_zero_page),
356 MMUMETHOD(mmu_zero_page_area, moea_zero_page_area),
357 MMUMETHOD(mmu_zero_page_idle, moea_zero_page_idle),
358 MMUMETHOD(mmu_activate, moea_activate),
359 MMUMETHOD(mmu_deactivate, moea_deactivate),
360 MMUMETHOD(mmu_page_set_memattr, moea_page_set_memattr),
362 /* Internal interfaces */
363 MMUMETHOD(mmu_bootstrap, moea_bootstrap),
364 MMUMETHOD(mmu_cpu_bootstrap, moea_cpu_bootstrap),
365 MMUMETHOD(mmu_mapdev_attr, moea_mapdev_attr),
366 MMUMETHOD(mmu_mapdev, moea_mapdev),
367 MMUMETHOD(mmu_unmapdev, moea_unmapdev),
368 MMUMETHOD(mmu_kextract, moea_kextract),
369 MMUMETHOD(mmu_kenter, moea_kenter),
370 MMUMETHOD(mmu_kenter_attr, moea_kenter_attr),
371 MMUMETHOD(mmu_dev_direct_mapped,moea_dev_direct_mapped),
372 MMUMETHOD(mmu_scan_md, moea_scan_md),
373 MMUMETHOD(mmu_dumpsys_map, moea_dumpsys_map),
378 MMU_DEF(oea_mmu, MMU_TYPE_OEA, moea_methods, 0);
380 static __inline uint32_t
381 moea_calc_wimg(vm_offset_t pa, vm_memattr_t ma)
386 if (ma != VM_MEMATTR_DEFAULT) {
388 case VM_MEMATTR_UNCACHEABLE:
389 return (PTE_I | PTE_G);
390 case VM_MEMATTR_WRITE_COMBINING:
391 case VM_MEMATTR_WRITE_BACK:
392 case VM_MEMATTR_PREFETCHABLE:
394 case VM_MEMATTR_WRITE_THROUGH:
395 return (PTE_W | PTE_M);
400 * Assume the page is cache inhibited and access is guarded unless
401 * it's in our available memory array.
403 pte_lo = PTE_I | PTE_G;
404 for (i = 0; i < pregions_sz; i++) {
405 if ((pa >= pregions[i].mr_start) &&
406 (pa < (pregions[i].mr_start + pregions[i].mr_size))) {
416 tlbie(vm_offset_t va)
419 mtx_lock_spin(&tlbie_mtx);
420 __asm __volatile("ptesync");
421 __asm __volatile("tlbie %0" :: "r"(va));
422 __asm __volatile("eieio; tlbsync; ptesync");
423 mtx_unlock_spin(&tlbie_mtx);
431 for (va = 0; va < 0x00040000; va += 0x00001000) {
432 __asm __volatile("tlbie %0" :: "r"(va));
435 __asm __volatile("tlbsync");
440 va_to_sr(u_int *sr, vm_offset_t va)
442 return (sr[(uintptr_t)va >> ADDR_SR_SHFT]);
445 static __inline u_int
446 va_to_pteg(u_int sr, vm_offset_t addr)
450 hash = (sr & SR_VSID_MASK) ^ (((u_int)addr & ADDR_PIDX) >>
452 return (hash & moea_pteg_mask);
455 static __inline struct pvo_head *
456 vm_page_to_pvoh(vm_page_t m)
459 return (&m->md.mdpg_pvoh);
463 moea_attr_clear(vm_page_t m, int ptebit)
466 rw_assert(&pvh_global_lock, RA_WLOCKED);
467 m->md.mdpg_attrs &= ~ptebit;
471 moea_attr_fetch(vm_page_t m)
474 return (m->md.mdpg_attrs);
478 moea_attr_save(vm_page_t m, int ptebit)
481 rw_assert(&pvh_global_lock, RA_WLOCKED);
482 m->md.mdpg_attrs |= ptebit;
486 moea_pte_compare(const struct pte *pt, const struct pte *pvo_pt)
488 if (pt->pte_hi == pvo_pt->pte_hi)
495 moea_pte_match(struct pte *pt, u_int sr, vm_offset_t va, int which)
497 return (pt->pte_hi & ~PTE_VALID) ==
498 (((sr & SR_VSID_MASK) << PTE_VSID_SHFT) |
499 ((va >> ADDR_API_SHFT) & PTE_API) | which);
503 moea_pte_create(struct pte *pt, u_int sr, vm_offset_t va, u_int pte_lo)
506 mtx_assert(&moea_table_mutex, MA_OWNED);
509 * Construct a PTE. Default to IMB initially. Valid bit only gets
510 * set when the real pte is set in memory.
512 * Note: Don't set the valid bit for correct operation of tlb update.
514 pt->pte_hi = ((sr & SR_VSID_MASK) << PTE_VSID_SHFT) |
515 (((va & ADDR_PIDX) >> ADDR_API_SHFT) & PTE_API);
520 moea_pte_synch(struct pte *pt, struct pte *pvo_pt)
523 mtx_assert(&moea_table_mutex, MA_OWNED);
524 pvo_pt->pte_lo |= pt->pte_lo & (PTE_REF | PTE_CHG);
528 moea_pte_clear(struct pte *pt, vm_offset_t va, int ptebit)
531 mtx_assert(&moea_table_mutex, MA_OWNED);
534 * As shown in Section 7.6.3.2.3
536 pt->pte_lo &= ~ptebit;
541 moea_pte_set(struct pte *pt, struct pte *pvo_pt)
544 mtx_assert(&moea_table_mutex, MA_OWNED);
545 pvo_pt->pte_hi |= PTE_VALID;
548 * Update the PTE as defined in section 7.6.3.1.
549 * Note that the REF/CHG bits are from pvo_pt and thus should have
550 * been saved so this routine can restore them (if desired).
552 pt->pte_lo = pvo_pt->pte_lo;
554 pt->pte_hi = pvo_pt->pte_hi;
560 moea_pte_unset(struct pte *pt, struct pte *pvo_pt, vm_offset_t va)
563 mtx_assert(&moea_table_mutex, MA_OWNED);
564 pvo_pt->pte_hi &= ~PTE_VALID;
567 * Force the reg & chg bits back into the PTEs.
572 * Invalidate the pte.
574 pt->pte_hi &= ~PTE_VALID;
579 * Save the reg & chg bits.
581 moea_pte_synch(pt, pvo_pt);
586 moea_pte_change(struct pte *pt, struct pte *pvo_pt, vm_offset_t va)
592 moea_pte_unset(pt, pvo_pt, va);
593 moea_pte_set(pt, pvo_pt);
597 * Quick sort callout for comparing memory regions.
599 static int om_cmp(const void *a, const void *b);
602 om_cmp(const void *a, const void *b)
604 const struct ofw_map *mapa;
605 const struct ofw_map *mapb;
609 if (mapa->om_pa < mapb->om_pa)
611 else if (mapa->om_pa > mapb->om_pa)
618 moea_cpu_bootstrap(mmu_t mmup, int ap)
625 __asm __volatile("mtdbatu 0,%0" :: "r"(battable[0].batu));
626 __asm __volatile("mtdbatl 0,%0" :: "r"(battable[0].batl));
628 __asm __volatile("mtibatu 0,%0" :: "r"(battable[0].batu));
629 __asm __volatile("mtibatl 0,%0" :: "r"(battable[0].batl));
635 * Special case for the Wii: don't install the PCI BAT.
637 if (strcmp(installed_platform(), "wii") != 0) {
639 __asm __volatile("mtdbatu 1,%0" :: "r"(battable[8].batu));
640 __asm __volatile("mtdbatl 1,%0" :: "r"(battable[8].batl));
646 __asm __volatile("mtibatu 1,%0" :: "r"(0));
647 __asm __volatile("mtdbatu 2,%0" :: "r"(0));
648 __asm __volatile("mtibatu 2,%0" :: "r"(0));
649 __asm __volatile("mtdbatu 3,%0" :: "r"(0));
650 __asm __volatile("mtibatu 3,%0" :: "r"(0));
653 for (i = 0; i < 16; i++)
654 mtsrin(i << ADDR_SR_SHFT, kernel_pmap->pm_sr[i]);
657 sdr = (u_int)moea_pteg_table | (moea_pteg_mask >> 10);
658 __asm __volatile("mtsdr1 %0" :: "r"(sdr));
665 moea_bootstrap(mmu_t mmup, vm_offset_t kernelstart, vm_offset_t kernelend)
668 phandle_t chosen, mmu;
671 vm_size_t size, physsz, hwphyssz;
672 vm_offset_t pa, va, off;
677 * Set up BAT0 to map the lowest 256 MB area
679 battable[0x0].batl = BATL(0x00000000, BAT_M, BAT_PP_RW);
680 battable[0x0].batu = BATU(0x00000000, BAT_BL_256M, BAT_Vs);
683 * Map PCI memory space.
685 battable[0x8].batl = BATL(0x80000000, BAT_I|BAT_G, BAT_PP_RW);
686 battable[0x8].batu = BATU(0x80000000, BAT_BL_256M, BAT_Vs);
688 battable[0x9].batl = BATL(0x90000000, BAT_I|BAT_G, BAT_PP_RW);
689 battable[0x9].batu = BATU(0x90000000, BAT_BL_256M, BAT_Vs);
691 battable[0xa].batl = BATL(0xa0000000, BAT_I|BAT_G, BAT_PP_RW);
692 battable[0xa].batu = BATU(0xa0000000, BAT_BL_256M, BAT_Vs);
694 battable[0xb].batl = BATL(0xb0000000, BAT_I|BAT_G, BAT_PP_RW);
695 battable[0xb].batu = BATU(0xb0000000, BAT_BL_256M, BAT_Vs);
700 battable[0xf].batl = BATL(0xf0000000, BAT_I|BAT_G, BAT_PP_RW);
701 battable[0xf].batu = BATU(0xf0000000, BAT_BL_256M, BAT_Vs);
704 * Use an IBAT and a DBAT to map the bottom segment of memory
705 * where we are. Turn off instruction relocation temporarily
706 * to prevent faults while reprogramming the IBAT.
709 mtmsr(msr & ~PSL_IR);
710 __asm (".balign 32; \n"
711 "mtibatu 0,%0; mtibatl 0,%1; isync; \n"
712 "mtdbatu 0,%0; mtdbatl 0,%1; isync"
713 :: "r"(battable[0].batu), "r"(battable[0].batl));
717 if (strcmp(installed_platform(), "wii") != 0) {
720 __asm __volatile("mtdbatu 1,%0" :: "r"(battable[8].batu));
721 __asm __volatile("mtdbatl 1,%0" :: "r"(battable[8].batl));
727 /* set global direct map flag */
730 mem_regions(&pregions, &pregions_sz, ®ions, ®ions_sz);
731 CTR0(KTR_PMAP, "moea_bootstrap: physical memory");
733 for (i = 0; i < pregions_sz; i++) {
737 CTR3(KTR_PMAP, "physregion: %#x - %#x (%#x)",
738 pregions[i].mr_start,
739 pregions[i].mr_start + pregions[i].mr_size,
740 pregions[i].mr_size);
742 * Install entries into the BAT table to allow all
743 * of physmem to be convered by on-demand BAT entries.
744 * The loop will sometimes set the same battable element
745 * twice, but that's fine since they won't be used for
748 pa = pregions[i].mr_start & 0xf0000000;
749 end = pregions[i].mr_start + pregions[i].mr_size;
751 u_int n = pa >> ADDR_SR_SHFT;
753 battable[n].batl = BATL(pa, BAT_M, BAT_PP_RW);
754 battable[n].batu = BATU(pa, BAT_BL_256M, BAT_Vs);
755 pa += SEGMENT_LENGTH;
759 if (sizeof(phys_avail)/sizeof(phys_avail[0]) < regions_sz)
760 panic("moea_bootstrap: phys_avail too small");
762 phys_avail_count = 0;
765 TUNABLE_ULONG_FETCH("hw.physmem", (u_long *) &hwphyssz);
766 for (i = 0, j = 0; i < regions_sz; i++, j += 2) {
767 CTR3(KTR_PMAP, "region: %#x - %#x (%#x)", regions[i].mr_start,
768 regions[i].mr_start + regions[i].mr_size,
771 (physsz + regions[i].mr_size) >= hwphyssz) {
772 if (physsz < hwphyssz) {
773 phys_avail[j] = regions[i].mr_start;
774 phys_avail[j + 1] = regions[i].mr_start +
781 phys_avail[j] = regions[i].mr_start;
782 phys_avail[j + 1] = regions[i].mr_start + regions[i].mr_size;
784 physsz += regions[i].mr_size;
787 /* Check for overlap with the kernel and exception vectors */
788 for (j = 0; j < 2*phys_avail_count; j+=2) {
789 if (phys_avail[j] < EXC_LAST)
790 phys_avail[j] += EXC_LAST;
792 if (kernelstart >= phys_avail[j] &&
793 kernelstart < phys_avail[j+1]) {
794 if (kernelend < phys_avail[j+1]) {
795 phys_avail[2*phys_avail_count] =
796 (kernelend & ~PAGE_MASK) + PAGE_SIZE;
797 phys_avail[2*phys_avail_count + 1] =
802 phys_avail[j+1] = kernelstart & ~PAGE_MASK;
805 if (kernelend >= phys_avail[j] &&
806 kernelend < phys_avail[j+1]) {
807 if (kernelstart > phys_avail[j]) {
808 phys_avail[2*phys_avail_count] = phys_avail[j];
809 phys_avail[2*phys_avail_count + 1] =
810 kernelstart & ~PAGE_MASK;
814 phys_avail[j] = (kernelend & ~PAGE_MASK) + PAGE_SIZE;
818 physmem = btoc(physsz);
821 * Allocate PTEG table.
824 moea_pteg_count = PTEGCOUNT;
826 moea_pteg_count = 0x1000;
828 while (moea_pteg_count < physmem)
829 moea_pteg_count <<= 1;
831 moea_pteg_count >>= 1;
832 #endif /* PTEGCOUNT */
834 size = moea_pteg_count * sizeof(struct pteg);
835 CTR2(KTR_PMAP, "moea_bootstrap: %d PTEGs, %d bytes", moea_pteg_count,
837 moea_pteg_table = (struct pteg *)moea_bootstrap_alloc(size, size);
838 CTR1(KTR_PMAP, "moea_bootstrap: PTEG table at %p", moea_pteg_table);
839 bzero((void *)moea_pteg_table, moea_pteg_count * sizeof(struct pteg));
840 moea_pteg_mask = moea_pteg_count - 1;
843 * Allocate pv/overflow lists.
845 size = sizeof(struct pvo_head) * moea_pteg_count;
846 moea_pvo_table = (struct pvo_head *)moea_bootstrap_alloc(size,
848 CTR1(KTR_PMAP, "moea_bootstrap: PVO table at %p", moea_pvo_table);
849 for (i = 0; i < moea_pteg_count; i++)
850 LIST_INIT(&moea_pvo_table[i]);
853 * Initialize the lock that synchronizes access to the pteg and pvo
856 mtx_init(&moea_table_mutex, "pmap table", NULL, MTX_DEF |
858 mtx_init(&moea_vsid_mutex, "VSID table", NULL, MTX_DEF);
860 mtx_init(&tlbie_mtx, "tlbie", NULL, MTX_SPIN);
863 * Initialise the unmanaged pvo pool.
865 moea_bpvo_pool = (struct pvo_entry *)moea_bootstrap_alloc(
866 BPVO_POOL_SIZE*sizeof(struct pvo_entry), 0);
867 moea_bpvo_pool_index = 0;
870 * Make sure kernel vsid is allocated as well as VSID 0.
872 moea_vsid_bitmap[(KERNEL_VSIDBITS & (NPMAPS - 1)) / VSID_NBPW]
873 |= 1 << (KERNEL_VSIDBITS % VSID_NBPW);
874 moea_vsid_bitmap[0] |= 1;
877 * Initialize the kernel pmap (which is statically allocated).
879 PMAP_LOCK_INIT(kernel_pmap);
880 for (i = 0; i < 16; i++)
881 kernel_pmap->pm_sr[i] = EMPTY_SEGMENT + i;
882 CPU_FILL(&kernel_pmap->pm_active);
883 RB_INIT(&kernel_pmap->pmap_pvo);
886 * Initialize the global pv list lock.
888 rw_init(&pvh_global_lock, "pmap pv global");
891 * Set up the Open Firmware mappings
893 chosen = OF_finddevice("/chosen");
894 if (chosen != -1 && OF_getprop(chosen, "mmu", &mmui, 4) != -1 &&
895 (mmu = OF_instance_to_package(mmui)) != -1 &&
896 (sz = OF_getproplen(mmu, "translations")) != -1) {
898 for (i = 0; phys_avail[i] != 0; i += 2) {
899 if (phys_avail[i + 1] >= sz) {
900 translations = (struct ofw_map *)phys_avail[i];
904 if (translations == NULL)
905 panic("moea_bootstrap: no space to copy translations");
906 bzero(translations, sz);
907 if (OF_getprop(mmu, "translations", translations, sz) == -1)
908 panic("moea_bootstrap: can't get ofw translations");
909 CTR0(KTR_PMAP, "moea_bootstrap: translations");
910 sz /= sizeof(*translations);
911 qsort(translations, sz, sizeof (*translations), om_cmp);
912 for (i = 0; i < sz; i++) {
913 CTR3(KTR_PMAP, "translation: pa=%#x va=%#x len=%#x",
914 translations[i].om_pa, translations[i].om_va,
915 translations[i].om_len);
918 * If the mapping is 1:1, let the RAM and device
919 * on-demand BAT tables take care of the translation.
921 if (translations[i].om_va == translations[i].om_pa)
924 /* Enter the pages */
925 for (off = 0; off < translations[i].om_len;
927 moea_kenter(mmup, translations[i].om_va + off,
928 translations[i].om_pa + off);
933 * Calculate the last available physical address.
935 for (i = 0; phys_avail[i + 2] != 0; i += 2)
937 Maxmem = powerpc_btop(phys_avail[i + 1]);
939 moea_cpu_bootstrap(mmup,0);
944 * Set the start and end of kva.
946 virtual_avail = VM_MIN_KERNEL_ADDRESS;
947 virtual_end = VM_MAX_SAFE_KERNEL_ADDRESS;
950 * Allocate a kernel stack with a guard page for thread0 and map it
951 * into the kernel page map.
953 pa = moea_bootstrap_alloc(KSTACK_PAGES * PAGE_SIZE, PAGE_SIZE);
954 va = virtual_avail + KSTACK_GUARD_PAGES * PAGE_SIZE;
955 virtual_avail = va + KSTACK_PAGES * PAGE_SIZE;
956 CTR2(KTR_PMAP, "moea_bootstrap: kstack0 at %#x (%#x)", pa, va);
957 thread0.td_kstack = va;
958 thread0.td_kstack_pages = KSTACK_PAGES;
959 for (i = 0; i < KSTACK_PAGES; i++) {
960 moea_kenter(mmup, va, pa);
966 * Allocate virtual address space for the message buffer.
968 pa = msgbuf_phys = moea_bootstrap_alloc(msgbufsize, PAGE_SIZE);
969 msgbufp = (struct msgbuf *)virtual_avail;
971 virtual_avail += round_page(msgbufsize);
972 while (va < virtual_avail) {
973 moea_kenter(mmup, va, pa);
979 * Allocate virtual address space for the dynamic percpu area.
981 pa = moea_bootstrap_alloc(DPCPU_SIZE, PAGE_SIZE);
982 dpcpu = (void *)virtual_avail;
984 virtual_avail += DPCPU_SIZE;
985 while (va < virtual_avail) {
986 moea_kenter(mmup, va, pa);
990 dpcpu_init(dpcpu, 0);
994 * Activate a user pmap. The pmap must be activated before it's address
995 * space can be accessed in any way.
998 moea_activate(mmu_t mmu, struct thread *td)
1003 * Load all the data we need up front to encourage the compiler to
1004 * not issue any loads while we have interrupts disabled below.
1006 pm = &td->td_proc->p_vmspace->vm_pmap;
1007 pmr = pm->pmap_phys;
1009 CPU_SET(PCPU_GET(cpuid), &pm->pm_active);
1010 PCPU_SET(curpmap, pmr);
1014 moea_deactivate(mmu_t mmu, struct thread *td)
1018 pm = &td->td_proc->p_vmspace->vm_pmap;
1019 CPU_CLR(PCPU_GET(cpuid), &pm->pm_active);
1020 PCPU_SET(curpmap, NULL);
1024 moea_change_wiring(mmu_t mmu, pmap_t pm, vm_offset_t va, boolean_t wired)
1026 struct pvo_entry *pvo;
1029 pvo = moea_pvo_find_va(pm, va & ~ADDR_POFF, NULL);
1033 if ((pvo->pvo_vaddr & PVO_WIRED) == 0)
1034 pm->pm_stats.wired_count++;
1035 pvo->pvo_vaddr |= PVO_WIRED;
1037 if ((pvo->pvo_vaddr & PVO_WIRED) != 0)
1038 pm->pm_stats.wired_count--;
1039 pvo->pvo_vaddr &= ~PVO_WIRED;
1046 moea_copy_page(mmu_t mmu, vm_page_t msrc, vm_page_t mdst)
1051 dst = VM_PAGE_TO_PHYS(mdst);
1052 src = VM_PAGE_TO_PHYS(msrc);
1054 bcopy((void *)src, (void *)dst, PAGE_SIZE);
1058 moea_copy_pages(mmu_t mmu, vm_page_t *ma, vm_offset_t a_offset,
1059 vm_page_t *mb, vm_offset_t b_offset, int xfersize)
1062 vm_offset_t a_pg_offset, b_pg_offset;
1065 while (xfersize > 0) {
1066 a_pg_offset = a_offset & PAGE_MASK;
1067 cnt = min(xfersize, PAGE_SIZE - a_pg_offset);
1068 a_cp = (char *)VM_PAGE_TO_PHYS(ma[a_offset >> PAGE_SHIFT]) +
1070 b_pg_offset = b_offset & PAGE_MASK;
1071 cnt = min(cnt, PAGE_SIZE - b_pg_offset);
1072 b_cp = (char *)VM_PAGE_TO_PHYS(mb[b_offset >> PAGE_SHIFT]) +
1074 bcopy(a_cp, b_cp, cnt);
1082 * Zero a page of physical memory by temporarily mapping it into the tlb.
1085 moea_zero_page(mmu_t mmu, vm_page_t m)
1087 vm_offset_t pa = VM_PAGE_TO_PHYS(m);
1088 void *va = (void *)pa;
1090 bzero(va, PAGE_SIZE);
1094 moea_zero_page_area(mmu_t mmu, vm_page_t m, int off, int size)
1096 vm_offset_t pa = VM_PAGE_TO_PHYS(m);
1097 void *va = (void *)(pa + off);
1103 moea_zero_page_idle(mmu_t mmu, vm_page_t m)
1105 vm_offset_t pa = VM_PAGE_TO_PHYS(m);
1106 void *va = (void *)pa;
1108 bzero(va, PAGE_SIZE);
1112 * Map the given physical page at the specified virtual address in the
1113 * target pmap with the protection requested. If specified the page
1114 * will be wired down.
1117 moea_enter(mmu_t mmu, pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
1121 rw_wlock(&pvh_global_lock);
1123 moea_enter_locked(pmap, va, m, prot, wired);
1124 rw_wunlock(&pvh_global_lock);
1129 * Map the given physical page at the specified virtual address in the
1130 * target pmap with the protection requested. If specified the page
1131 * will be wired down.
1133 * The page queues and pmap must be locked.
1136 moea_enter_locked(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
1139 struct pvo_head *pvo_head;
1142 u_int pte_lo, pvo_flags;
1145 if (!moea_initialized) {
1146 pvo_head = &moea_pvo_kunmanaged;
1147 zone = moea_upvo_zone;
1151 pvo_head = vm_page_to_pvoh(m);
1153 zone = moea_mpvo_zone;
1154 pvo_flags = PVO_MANAGED;
1156 if (pmap_bootstrapped)
1157 rw_assert(&pvh_global_lock, RA_WLOCKED);
1158 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1159 if ((m->oflags & VPO_UNMANAGED) == 0 && !vm_page_xbusied(m))
1160 VM_OBJECT_ASSERT_LOCKED(m->object);
1162 /* XXX change the pvo head for fake pages */
1163 if ((m->oflags & VPO_UNMANAGED) != 0) {
1164 pvo_flags &= ~PVO_MANAGED;
1165 pvo_head = &moea_pvo_kunmanaged;
1166 zone = moea_upvo_zone;
1169 pte_lo = moea_calc_wimg(VM_PAGE_TO_PHYS(m), pmap_page_get_memattr(m));
1171 if (prot & VM_PROT_WRITE) {
1173 if (pmap_bootstrapped &&
1174 (m->oflags & VPO_UNMANAGED) == 0)
1175 vm_page_aflag_set(m, PGA_WRITEABLE);
1179 if (prot & VM_PROT_EXECUTE)
1180 pvo_flags |= PVO_EXECUTABLE;
1183 pvo_flags |= PVO_WIRED;
1185 error = moea_pvo_enter(pmap, zone, pvo_head, va, VM_PAGE_TO_PHYS(m),
1189 * Flush the real page from the instruction cache. This has be done
1190 * for all user mappings to prevent information leakage via the
1191 * instruction cache. moea_pvo_enter() returns ENOENT for the first
1192 * mapping for a page.
1194 if (pmap != kernel_pmap && error == ENOENT &&
1195 (pte_lo & (PTE_I | PTE_G)) == 0)
1196 moea_syncicache(VM_PAGE_TO_PHYS(m), PAGE_SIZE);
1200 * Maps a sequence of resident pages belonging to the same object.
1201 * The sequence begins with the given page m_start. This page is
1202 * mapped at the given virtual address start. Each subsequent page is
1203 * mapped at a virtual address that is offset from start by the same
1204 * amount as the page is offset from m_start within the object. The
1205 * last page in the sequence is the page with the largest offset from
1206 * m_start that can be mapped at a virtual address less than the given
1207 * virtual address end. Not every virtual page between start and end
1208 * is mapped; only those for which a resident page exists with the
1209 * corresponding offset from m_start are mapped.
1212 moea_enter_object(mmu_t mmu, pmap_t pm, vm_offset_t start, vm_offset_t end,
1213 vm_page_t m_start, vm_prot_t prot)
1216 vm_pindex_t diff, psize;
1218 VM_OBJECT_ASSERT_LOCKED(m_start->object);
1220 psize = atop(end - start);
1222 rw_wlock(&pvh_global_lock);
1224 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
1225 moea_enter_locked(pm, start + ptoa(diff), m, prot &
1226 (VM_PROT_READ | VM_PROT_EXECUTE), FALSE);
1227 m = TAILQ_NEXT(m, listq);
1229 rw_wunlock(&pvh_global_lock);
1234 moea_enter_quick(mmu_t mmu, pmap_t pm, vm_offset_t va, vm_page_t m,
1238 rw_wlock(&pvh_global_lock);
1240 moea_enter_locked(pm, va, m, prot & (VM_PROT_READ | VM_PROT_EXECUTE),
1242 rw_wunlock(&pvh_global_lock);
1247 moea_extract(mmu_t mmu, pmap_t pm, vm_offset_t va)
1249 struct pvo_entry *pvo;
1253 pvo = moea_pvo_find_va(pm, va & ~ADDR_POFF, NULL);
1257 pa = (pvo->pvo_pte.pte.pte_lo & PTE_RPGN) | (va & ADDR_POFF);
1263 * Atomically extract and hold the physical page with the given
1264 * pmap and virtual address pair if that mapping permits the given
1268 moea_extract_and_hold(mmu_t mmu, pmap_t pmap, vm_offset_t va, vm_prot_t prot)
1270 struct pvo_entry *pvo;
1278 pvo = moea_pvo_find_va(pmap, va & ~ADDR_POFF, NULL);
1279 if (pvo != NULL && (pvo->pvo_pte.pte.pte_hi & PTE_VALID) &&
1280 ((pvo->pvo_pte.pte.pte_lo & PTE_PP) == PTE_RW ||
1281 (prot & VM_PROT_WRITE) == 0)) {
1282 if (vm_page_pa_tryrelock(pmap, pvo->pvo_pte.pte.pte_lo & PTE_RPGN, &pa))
1284 m = PHYS_TO_VM_PAGE(pvo->pvo_pte.pte.pte_lo & PTE_RPGN);
1293 moea_init(mmu_t mmu)
1296 moea_upvo_zone = uma_zcreate("UPVO entry", sizeof (struct pvo_entry),
1297 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
1298 UMA_ZONE_VM | UMA_ZONE_NOFREE);
1299 moea_mpvo_zone = uma_zcreate("MPVO entry", sizeof(struct pvo_entry),
1300 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
1301 UMA_ZONE_VM | UMA_ZONE_NOFREE);
1302 moea_initialized = TRUE;
1306 moea_is_referenced(mmu_t mmu, vm_page_t m)
1310 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1311 ("moea_is_referenced: page %p is not managed", m));
1312 rw_wlock(&pvh_global_lock);
1313 rv = moea_query_bit(m, PTE_REF);
1314 rw_wunlock(&pvh_global_lock);
1319 moea_is_modified(mmu_t mmu, vm_page_t m)
1323 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1324 ("moea_is_modified: page %p is not managed", m));
1327 * If the page is not exclusive busied, then PGA_WRITEABLE cannot be
1328 * concurrently set while the object is locked. Thus, if PGA_WRITEABLE
1329 * is clear, no PTEs can have PTE_CHG set.
1331 VM_OBJECT_ASSERT_WLOCKED(m->object);
1332 if (!vm_page_xbusied(m) && (m->aflags & PGA_WRITEABLE) == 0)
1334 rw_wlock(&pvh_global_lock);
1335 rv = moea_query_bit(m, PTE_CHG);
1336 rw_wunlock(&pvh_global_lock);
1341 moea_is_prefaultable(mmu_t mmu, pmap_t pmap, vm_offset_t va)
1343 struct pvo_entry *pvo;
1347 pvo = moea_pvo_find_va(pmap, va & ~ADDR_POFF, NULL);
1348 rv = pvo == NULL || (pvo->pvo_pte.pte.pte_hi & PTE_VALID) == 0;
1354 moea_clear_modify(mmu_t mmu, vm_page_t m)
1357 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1358 ("moea_clear_modify: page %p is not managed", m));
1359 VM_OBJECT_ASSERT_WLOCKED(m->object);
1360 KASSERT(!vm_page_xbusied(m),
1361 ("moea_clear_modify: page %p is exclusive busy", m));
1364 * If the page is not PGA_WRITEABLE, then no PTEs can have PTE_CHG
1365 * set. If the object containing the page is locked and the page is
1366 * not exclusive busied, then PGA_WRITEABLE cannot be concurrently set.
1368 if ((m->aflags & PGA_WRITEABLE) == 0)
1370 rw_wlock(&pvh_global_lock);
1371 moea_clear_bit(m, PTE_CHG);
1372 rw_wunlock(&pvh_global_lock);
1376 * Clear the write and modified bits in each of the given page's mappings.
1379 moea_remove_write(mmu_t mmu, vm_page_t m)
1381 struct pvo_entry *pvo;
1386 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1387 ("moea_remove_write: page %p is not managed", m));
1390 * If the page is not exclusive busied, then PGA_WRITEABLE cannot be
1391 * set by another thread while the object is locked. Thus,
1392 * if PGA_WRITEABLE is clear, no page table entries need updating.
1394 VM_OBJECT_ASSERT_WLOCKED(m->object);
1395 if (!vm_page_xbusied(m) && (m->aflags & PGA_WRITEABLE) == 0)
1397 rw_wlock(&pvh_global_lock);
1398 lo = moea_attr_fetch(m);
1400 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
1401 pmap = pvo->pvo_pmap;
1403 if ((pvo->pvo_pte.pte.pte_lo & PTE_PP) != PTE_BR) {
1404 pt = moea_pvo_to_pte(pvo, -1);
1405 pvo->pvo_pte.pte.pte_lo &= ~PTE_PP;
1406 pvo->pvo_pte.pte.pte_lo |= PTE_BR;
1408 moea_pte_synch(pt, &pvo->pvo_pte.pte);
1409 lo |= pvo->pvo_pte.pte.pte_lo;
1410 pvo->pvo_pte.pte.pte_lo &= ~PTE_CHG;
1411 moea_pte_change(pt, &pvo->pvo_pte.pte,
1413 mtx_unlock(&moea_table_mutex);
1418 if ((lo & PTE_CHG) != 0) {
1419 moea_attr_clear(m, PTE_CHG);
1422 vm_page_aflag_clear(m, PGA_WRITEABLE);
1423 rw_wunlock(&pvh_global_lock);
1427 * moea_ts_referenced:
1429 * Return a count of reference bits for a page, clearing those bits.
1430 * It is not necessary for every reference bit to be cleared, but it
1431 * is necessary that 0 only be returned when there are truly no
1432 * reference bits set.
1434 * XXX: The exact number of bits to check and clear is a matter that
1435 * should be tested and standardized at some point in the future for
1436 * optimal aging of shared pages.
1439 moea_ts_referenced(mmu_t mmu, vm_page_t m)
1443 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1444 ("moea_ts_referenced: page %p is not managed", m));
1445 rw_wlock(&pvh_global_lock);
1446 count = moea_clear_bit(m, PTE_REF);
1447 rw_wunlock(&pvh_global_lock);
1452 * Modify the WIMG settings of all mappings for a page.
1455 moea_page_set_memattr(mmu_t mmu, vm_page_t m, vm_memattr_t ma)
1457 struct pvo_entry *pvo;
1458 struct pvo_head *pvo_head;
1463 if ((m->oflags & VPO_UNMANAGED) != 0) {
1464 m->md.mdpg_cache_attrs = ma;
1468 rw_wlock(&pvh_global_lock);
1469 pvo_head = vm_page_to_pvoh(m);
1470 lo = moea_calc_wimg(VM_PAGE_TO_PHYS(m), ma);
1472 LIST_FOREACH(pvo, pvo_head, pvo_vlink) {
1473 pmap = pvo->pvo_pmap;
1475 pt = moea_pvo_to_pte(pvo, -1);
1476 pvo->pvo_pte.pte.pte_lo &= ~PTE_WIMG;
1477 pvo->pvo_pte.pte.pte_lo |= lo;
1479 moea_pte_change(pt, &pvo->pvo_pte.pte,
1481 if (pvo->pvo_pmap == kernel_pmap)
1484 mtx_unlock(&moea_table_mutex);
1487 m->md.mdpg_cache_attrs = ma;
1488 rw_wunlock(&pvh_global_lock);
1492 * Map a wired page into kernel virtual address space.
1495 moea_kenter(mmu_t mmu, vm_offset_t va, vm_paddr_t pa)
1498 moea_kenter_attr(mmu, va, pa, VM_MEMATTR_DEFAULT);
1502 moea_kenter_attr(mmu_t mmu, vm_offset_t va, vm_offset_t pa, vm_memattr_t ma)
1508 if (va < VM_MIN_KERNEL_ADDRESS)
1509 panic("moea_kenter: attempt to enter non-kernel address %#x",
1513 pte_lo = moea_calc_wimg(pa, ma);
1515 PMAP_LOCK(kernel_pmap);
1516 error = moea_pvo_enter(kernel_pmap, moea_upvo_zone,
1517 &moea_pvo_kunmanaged, va, pa, pte_lo, PVO_WIRED);
1519 if (error != 0 && error != ENOENT)
1520 panic("moea_kenter: failed to enter va %#x pa %#x: %d", va,
1523 PMAP_UNLOCK(kernel_pmap);
1527 * Extract the physical page address associated with the given kernel virtual
1531 moea_kextract(mmu_t mmu, vm_offset_t va)
1533 struct pvo_entry *pvo;
1537 * Allow direct mappings on 32-bit OEA
1539 if (va < VM_MIN_KERNEL_ADDRESS) {
1543 PMAP_LOCK(kernel_pmap);
1544 pvo = moea_pvo_find_va(kernel_pmap, va & ~ADDR_POFF, NULL);
1545 KASSERT(pvo != NULL, ("moea_kextract: no addr found"));
1546 pa = (pvo->pvo_pte.pte.pte_lo & PTE_RPGN) | (va & ADDR_POFF);
1547 PMAP_UNLOCK(kernel_pmap);
1552 * Remove a wired page from kernel virtual address space.
1555 moea_kremove(mmu_t mmu, vm_offset_t va)
1558 moea_remove(mmu, kernel_pmap, va, va + PAGE_SIZE);
1562 * Map a range of physical addresses into kernel virtual address space.
1564 * The value passed in *virt is a suggested virtual address for the mapping.
1565 * Architectures which can support a direct-mapped physical to virtual region
1566 * can return the appropriate address within that region, leaving '*virt'
1567 * unchanged. We cannot and therefore do not; *virt is updated with the
1568 * first usable address after the mapped region.
1571 moea_map(mmu_t mmu, vm_offset_t *virt, vm_paddr_t pa_start,
1572 vm_paddr_t pa_end, int prot)
1574 vm_offset_t sva, va;
1578 for (; pa_start < pa_end; pa_start += PAGE_SIZE, va += PAGE_SIZE)
1579 moea_kenter(mmu, va, pa_start);
1585 * Returns true if the pmap's pv is one of the first
1586 * 16 pvs linked to from this page. This count may
1587 * be changed upwards or downwards in the future; it
1588 * is only necessary that true be returned for a small
1589 * subset of pmaps for proper page aging.
1592 moea_page_exists_quick(mmu_t mmu, pmap_t pmap, vm_page_t m)
1595 struct pvo_entry *pvo;
1598 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1599 ("moea_page_exists_quick: page %p is not managed", m));
1602 rw_wlock(&pvh_global_lock);
1603 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
1604 if (pvo->pvo_pmap == pmap) {
1611 rw_wunlock(&pvh_global_lock);
1616 * Return the number of managed mappings to the given physical page
1620 moea_page_wired_mappings(mmu_t mmu, vm_page_t m)
1622 struct pvo_entry *pvo;
1626 if ((m->oflags & VPO_UNMANAGED) != 0)
1628 rw_wlock(&pvh_global_lock);
1629 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink)
1630 if ((pvo->pvo_vaddr & PVO_WIRED) != 0)
1632 rw_wunlock(&pvh_global_lock);
1636 static u_int moea_vsidcontext;
1639 moea_pinit(mmu_t mmu, pmap_t pmap)
1644 KASSERT((int)pmap < VM_MIN_KERNEL_ADDRESS, ("moea_pinit: virt pmap"));
1645 RB_INIT(&pmap->pmap_pvo);
1648 __asm __volatile("mftb %0" : "=r"(entropy));
1650 if ((pmap->pmap_phys = (pmap_t)moea_kextract(mmu, (vm_offset_t)pmap))
1652 pmap->pmap_phys = pmap;
1656 mtx_lock(&moea_vsid_mutex);
1658 * Allocate some segment registers for this pmap.
1660 for (i = 0; i < NPMAPS; i += VSID_NBPW) {
1664 * Create a new value by mutiplying by a prime and adding in
1665 * entropy from the timebase register. This is to make the
1666 * VSID more random so that the PT hash function collides
1667 * less often. (Note that the prime casues gcc to do shifts
1668 * instead of a multiply.)
1670 moea_vsidcontext = (moea_vsidcontext * 0x1105) + entropy;
1671 hash = moea_vsidcontext & (NPMAPS - 1);
1672 if (hash == 0) /* 0 is special, avoid it */
1675 mask = 1 << (hash & (VSID_NBPW - 1));
1676 hash = (moea_vsidcontext & 0xfffff);
1677 if (moea_vsid_bitmap[n] & mask) { /* collision? */
1678 /* anything free in this bucket? */
1679 if (moea_vsid_bitmap[n] == 0xffffffff) {
1680 entropy = (moea_vsidcontext >> 20);
1683 i = ffs(~moea_vsid_bitmap[n]) - 1;
1685 hash &= 0xfffff & ~(VSID_NBPW - 1);
1688 KASSERT(!(moea_vsid_bitmap[n] & mask),
1689 ("Allocating in-use VSID group %#x\n", hash));
1690 moea_vsid_bitmap[n] |= mask;
1691 for (i = 0; i < 16; i++)
1692 pmap->pm_sr[i] = VSID_MAKE(i, hash);
1693 mtx_unlock(&moea_vsid_mutex);
1697 mtx_unlock(&moea_vsid_mutex);
1698 panic("moea_pinit: out of segments");
1702 * Initialize the pmap associated with process 0.
1705 moea_pinit0(mmu_t mmu, pmap_t pm)
1709 moea_pinit(mmu, pm);
1710 bzero(&pm->pm_stats, sizeof(pm->pm_stats));
1714 * Set the physical protection on the specified range of this map as requested.
1717 moea_protect(mmu_t mmu, pmap_t pm, vm_offset_t sva, vm_offset_t eva,
1720 struct pvo_entry *pvo, *tpvo, key;
1723 KASSERT(pm == &curproc->p_vmspace->vm_pmap || pm == kernel_pmap,
1724 ("moea_protect: non current pmap"));
1726 if ((prot & VM_PROT_READ) == VM_PROT_NONE) {
1727 moea_remove(mmu, pm, sva, eva);
1731 rw_wlock(&pvh_global_lock);
1733 key.pvo_vaddr = sva;
1734 for (pvo = RB_NFIND(pvo_tree, &pm->pmap_pvo, &key);
1735 pvo != NULL && PVO_VADDR(pvo) < eva; pvo = tpvo) {
1736 tpvo = RB_NEXT(pvo_tree, &pm->pmap_pvo, pvo);
1737 if ((prot & VM_PROT_EXECUTE) == 0)
1738 pvo->pvo_vaddr &= ~PVO_EXECUTABLE;
1741 * Grab the PTE pointer before we diddle with the cached PTE
1744 pt = moea_pvo_to_pte(pvo, -1);
1746 * Change the protection of the page.
1748 pvo->pvo_pte.pte.pte_lo &= ~PTE_PP;
1749 pvo->pvo_pte.pte.pte_lo |= PTE_BR;
1752 * If the PVO is in the page table, update that pte as well.
1755 moea_pte_change(pt, &pvo->pvo_pte.pte, pvo->pvo_vaddr);
1756 mtx_unlock(&moea_table_mutex);
1759 rw_wunlock(&pvh_global_lock);
1764 * Map a list of wired pages into kernel virtual address space. This is
1765 * intended for temporary mappings which do not need page modification or
1766 * references recorded. Existing mappings in the region are overwritten.
1769 moea_qenter(mmu_t mmu, vm_offset_t sva, vm_page_t *m, int count)
1774 while (count-- > 0) {
1775 moea_kenter(mmu, va, VM_PAGE_TO_PHYS(*m));
1782 * Remove page mappings from kernel virtual address space. Intended for
1783 * temporary mappings entered by moea_qenter.
1786 moea_qremove(mmu_t mmu, vm_offset_t sva, int count)
1791 while (count-- > 0) {
1792 moea_kremove(mmu, va);
1798 moea_release(mmu_t mmu, pmap_t pmap)
1803 * Free segment register's VSID
1805 if (pmap->pm_sr[0] == 0)
1806 panic("moea_release");
1808 mtx_lock(&moea_vsid_mutex);
1809 idx = VSID_TO_HASH(pmap->pm_sr[0]) & (NPMAPS-1);
1810 mask = 1 << (idx % VSID_NBPW);
1812 moea_vsid_bitmap[idx] &= ~mask;
1813 mtx_unlock(&moea_vsid_mutex);
1817 * Remove the given range of addresses from the specified map.
1820 moea_remove(mmu_t mmu, pmap_t pm, vm_offset_t sva, vm_offset_t eva)
1822 struct pvo_entry *pvo, *tpvo, key;
1824 rw_wlock(&pvh_global_lock);
1826 key.pvo_vaddr = sva;
1827 for (pvo = RB_NFIND(pvo_tree, &pm->pmap_pvo, &key);
1828 pvo != NULL && PVO_VADDR(pvo) < eva; pvo = tpvo) {
1829 tpvo = RB_NEXT(pvo_tree, &pm->pmap_pvo, pvo);
1830 moea_pvo_remove(pvo, -1);
1833 rw_wunlock(&pvh_global_lock);
1837 * Remove physical page from all pmaps in which it resides. moea_pvo_remove()
1838 * will reflect changes in pte's back to the vm_page.
1841 moea_remove_all(mmu_t mmu, vm_page_t m)
1843 struct pvo_head *pvo_head;
1844 struct pvo_entry *pvo, *next_pvo;
1847 rw_wlock(&pvh_global_lock);
1848 pvo_head = vm_page_to_pvoh(m);
1849 for (pvo = LIST_FIRST(pvo_head); pvo != NULL; pvo = next_pvo) {
1850 next_pvo = LIST_NEXT(pvo, pvo_vlink);
1852 pmap = pvo->pvo_pmap;
1854 moea_pvo_remove(pvo, -1);
1857 if ((m->aflags & PGA_WRITEABLE) && moea_query_bit(m, PTE_CHG)) {
1858 moea_attr_clear(m, PTE_CHG);
1861 vm_page_aflag_clear(m, PGA_WRITEABLE);
1862 rw_wunlock(&pvh_global_lock);
1866 * Allocate a physical page of memory directly from the phys_avail map.
1867 * Can only be called from moea_bootstrap before avail start and end are
1871 moea_bootstrap_alloc(vm_size_t size, u_int align)
1876 size = round_page(size);
1877 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
1879 s = (phys_avail[i] + align - 1) & ~(align - 1);
1884 if (s < phys_avail[i] || e > phys_avail[i + 1])
1887 if (s == phys_avail[i]) {
1888 phys_avail[i] += size;
1889 } else if (e == phys_avail[i + 1]) {
1890 phys_avail[i + 1] -= size;
1892 for (j = phys_avail_count * 2; j > i; j -= 2) {
1893 phys_avail[j] = phys_avail[j - 2];
1894 phys_avail[j + 1] = phys_avail[j - 1];
1897 phys_avail[i + 3] = phys_avail[i + 1];
1898 phys_avail[i + 1] = s;
1899 phys_avail[i + 2] = e;
1905 panic("moea_bootstrap_alloc: could not allocate memory");
1909 moea_syncicache(vm_offset_t pa, vm_size_t len)
1911 __syncicache((void *)pa, len);
1915 moea_pvo_enter(pmap_t pm, uma_zone_t zone, struct pvo_head *pvo_head,
1916 vm_offset_t va, vm_offset_t pa, u_int pte_lo, int flags)
1918 struct pvo_entry *pvo;
1925 moea_pvo_enter_calls++;
1930 * Compute the PTE Group index.
1933 sr = va_to_sr(pm->pm_sr, va);
1934 ptegidx = va_to_pteg(sr, va);
1937 * Remove any existing mapping for this page. Reuse the pvo entry if
1938 * there is a mapping.
1940 mtx_lock(&moea_table_mutex);
1941 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx], pvo_olink) {
1942 if (pvo->pvo_pmap == pm && PVO_VADDR(pvo) == va) {
1943 if ((pvo->pvo_pte.pte.pte_lo & PTE_RPGN) == pa &&
1944 (pvo->pvo_pte.pte.pte_lo & PTE_PP) ==
1945 (pte_lo & PTE_PP)) {
1946 mtx_unlock(&moea_table_mutex);
1949 moea_pvo_remove(pvo, -1);
1955 * If we aren't overwriting a mapping, try to allocate.
1957 if (moea_initialized) {
1958 pvo = uma_zalloc(zone, M_NOWAIT);
1960 if (moea_bpvo_pool_index >= BPVO_POOL_SIZE) {
1961 panic("moea_enter: bpvo pool exhausted, %d, %d, %d",
1962 moea_bpvo_pool_index, BPVO_POOL_SIZE,
1963 BPVO_POOL_SIZE * sizeof(struct pvo_entry));
1965 pvo = &moea_bpvo_pool[moea_bpvo_pool_index];
1966 moea_bpvo_pool_index++;
1971 mtx_unlock(&moea_table_mutex);
1976 pvo->pvo_vaddr = va;
1978 LIST_INSERT_HEAD(&moea_pvo_table[ptegidx], pvo, pvo_olink);
1979 pvo->pvo_vaddr &= ~ADDR_POFF;
1980 if (flags & VM_PROT_EXECUTE)
1981 pvo->pvo_vaddr |= PVO_EXECUTABLE;
1982 if (flags & PVO_WIRED)
1983 pvo->pvo_vaddr |= PVO_WIRED;
1984 if (pvo_head != &moea_pvo_kunmanaged)
1985 pvo->pvo_vaddr |= PVO_MANAGED;
1987 pvo->pvo_vaddr |= PVO_BOOTSTRAP;
1989 moea_pte_create(&pvo->pvo_pte.pte, sr, va, pa | pte_lo);
1994 RB_INSERT(pvo_tree, &pm->pmap_pvo, pvo);
1997 * Remember if the list was empty and therefore will be the first
2000 if (LIST_FIRST(pvo_head) == NULL)
2002 LIST_INSERT_HEAD(pvo_head, pvo, pvo_vlink);
2004 if (pvo->pvo_pte.pte.pte_lo & PVO_WIRED)
2005 pm->pm_stats.wired_count++;
2006 pm->pm_stats.resident_count++;
2008 i = moea_pte_insert(ptegidx, &pvo->pvo_pte.pte);
2009 KASSERT(i < 8, ("Invalid PTE index"));
2011 PVO_PTEGIDX_SET(pvo, i);
2013 panic("moea_pvo_enter: overflow");
2014 moea_pte_overflow++;
2016 mtx_unlock(&moea_table_mutex);
2018 return (first ? ENOENT : 0);
2022 moea_pvo_remove(struct pvo_entry *pvo, int pteidx)
2027 * If there is an active pte entry, we need to deactivate it (and
2028 * save the ref & cfg bits).
2030 pt = moea_pvo_to_pte(pvo, pteidx);
2032 moea_pte_unset(pt, &pvo->pvo_pte.pte, pvo->pvo_vaddr);
2033 mtx_unlock(&moea_table_mutex);
2034 PVO_PTEGIDX_CLR(pvo);
2036 moea_pte_overflow--;
2040 * Update our statistics.
2042 pvo->pvo_pmap->pm_stats.resident_count--;
2043 if (pvo->pvo_pte.pte.pte_lo & PVO_WIRED)
2044 pvo->pvo_pmap->pm_stats.wired_count--;
2047 * Save the REF/CHG bits into their cache if the page is managed.
2049 if ((pvo->pvo_vaddr & PVO_MANAGED) == PVO_MANAGED) {
2052 pg = PHYS_TO_VM_PAGE(pvo->pvo_pte.pte.pte_lo & PTE_RPGN);
2054 moea_attr_save(pg, pvo->pvo_pte.pte.pte_lo &
2055 (PTE_REF | PTE_CHG));
2060 * Remove this PVO from the PV and pmap lists.
2062 LIST_REMOVE(pvo, pvo_vlink);
2063 RB_REMOVE(pvo_tree, &pvo->pvo_pmap->pmap_pvo, pvo);
2066 * Remove this from the overflow list and return it to the pool
2067 * if we aren't going to reuse it.
2069 LIST_REMOVE(pvo, pvo_olink);
2070 if (!(pvo->pvo_vaddr & PVO_BOOTSTRAP))
2071 uma_zfree(pvo->pvo_vaddr & PVO_MANAGED ? moea_mpvo_zone :
2072 moea_upvo_zone, pvo);
2074 moea_pvo_remove_calls++;
2078 moea_pvo_pte_index(const struct pvo_entry *pvo, int ptegidx)
2083 * We can find the actual pte entry without searching by grabbing
2084 * the PTEG index from 3 unused bits in pte_lo[11:9] and by
2085 * noticing the HID bit.
2087 pteidx = ptegidx * 8 + PVO_PTEGIDX_GET(pvo);
2088 if (pvo->pvo_pte.pte.pte_hi & PTE_HID)
2089 pteidx ^= moea_pteg_mask * 8;
2094 static struct pvo_entry *
2095 moea_pvo_find_va(pmap_t pm, vm_offset_t va, int *pteidx_p)
2097 struct pvo_entry *pvo;
2102 sr = va_to_sr(pm->pm_sr, va);
2103 ptegidx = va_to_pteg(sr, va);
2105 mtx_lock(&moea_table_mutex);
2106 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx], pvo_olink) {
2107 if (pvo->pvo_pmap == pm && PVO_VADDR(pvo) == va) {
2109 *pteidx_p = moea_pvo_pte_index(pvo, ptegidx);
2113 mtx_unlock(&moea_table_mutex);
2119 moea_pvo_to_pte(const struct pvo_entry *pvo, int pteidx)
2124 * If we haven't been supplied the ptegidx, calculate it.
2130 sr = va_to_sr(pvo->pvo_pmap->pm_sr, pvo->pvo_vaddr);
2131 ptegidx = va_to_pteg(sr, pvo->pvo_vaddr);
2132 pteidx = moea_pvo_pte_index(pvo, ptegidx);
2135 pt = &moea_pteg_table[pteidx >> 3].pt[pteidx & 7];
2136 mtx_lock(&moea_table_mutex);
2138 if ((pvo->pvo_pte.pte.pte_hi & PTE_VALID) && !PVO_PTEGIDX_ISSET(pvo)) {
2139 panic("moea_pvo_to_pte: pvo %p has valid pte in pvo but no "
2140 "valid pte index", pvo);
2143 if ((pvo->pvo_pte.pte.pte_hi & PTE_VALID) == 0 && PVO_PTEGIDX_ISSET(pvo)) {
2144 panic("moea_pvo_to_pte: pvo %p has valid pte index in pvo "
2145 "pvo but no valid pte", pvo);
2148 if ((pt->pte_hi ^ (pvo->pvo_pte.pte.pte_hi & ~PTE_VALID)) == PTE_VALID) {
2149 if ((pvo->pvo_pte.pte.pte_hi & PTE_VALID) == 0) {
2150 panic("moea_pvo_to_pte: pvo %p has valid pte in "
2151 "moea_pteg_table %p but invalid in pvo", pvo, pt);
2154 if (((pt->pte_lo ^ pvo->pvo_pte.pte.pte_lo) & ~(PTE_CHG|PTE_REF))
2156 panic("moea_pvo_to_pte: pvo %p pte does not match "
2157 "pte %p in moea_pteg_table", pvo, pt);
2160 mtx_assert(&moea_table_mutex, MA_OWNED);
2164 if (pvo->pvo_pte.pte.pte_hi & PTE_VALID) {
2165 panic("moea_pvo_to_pte: pvo %p has invalid pte %p in "
2166 "moea_pteg_table but valid in pvo: %8x, %8x", pvo, pt, pvo->pvo_pte.pte.pte_hi, pt->pte_hi);
2169 mtx_unlock(&moea_table_mutex);
2174 * XXX: THIS STUFF SHOULD BE IN pte.c?
2177 moea_pte_spill(vm_offset_t addr)
2179 struct pvo_entry *source_pvo, *victim_pvo;
2180 struct pvo_entry *pvo;
2189 ptegidx = va_to_pteg(sr, addr);
2192 * Have to substitute some entry. Use the primary hash for this.
2193 * Use low bits of timebase as random generator.
2195 pteg = &moea_pteg_table[ptegidx];
2196 mtx_lock(&moea_table_mutex);
2197 __asm __volatile("mftb %0" : "=r"(i));
2203 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx], pvo_olink) {
2205 * We need to find a pvo entry for this address.
2207 if (source_pvo == NULL &&
2208 moea_pte_match(&pvo->pvo_pte.pte, sr, addr,
2209 pvo->pvo_pte.pte.pte_hi & PTE_HID)) {
2211 * Now found an entry to be spilled into the pteg.
2212 * The PTE is now valid, so we know it's active.
2214 j = moea_pte_insert(ptegidx, &pvo->pvo_pte.pte);
2217 PVO_PTEGIDX_SET(pvo, j);
2218 moea_pte_overflow--;
2219 mtx_unlock(&moea_table_mutex);
2225 if (victim_pvo != NULL)
2230 * We also need the pvo entry of the victim we are replacing
2231 * so save the R & C bits of the PTE.
2233 if ((pt->pte_hi & PTE_HID) == 0 && victim_pvo == NULL &&
2234 moea_pte_compare(pt, &pvo->pvo_pte.pte)) {
2236 if (source_pvo != NULL)
2241 if (source_pvo == NULL) {
2242 mtx_unlock(&moea_table_mutex);
2246 if (victim_pvo == NULL) {
2247 if ((pt->pte_hi & PTE_HID) == 0)
2248 panic("moea_pte_spill: victim p-pte (%p) has no pvo"
2252 * If this is a secondary PTE, we need to search it's primary
2253 * pvo bucket for the matching PVO.
2255 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx ^ moea_pteg_mask],
2258 * We also need the pvo entry of the victim we are
2259 * replacing so save the R & C bits of the PTE.
2261 if (moea_pte_compare(pt, &pvo->pvo_pte.pte)) {
2267 if (victim_pvo == NULL)
2268 panic("moea_pte_spill: victim s-pte (%p) has no pvo"
2273 * We are invalidating the TLB entry for the EA we are replacing even
2274 * though it's valid. If we don't, we lose any ref/chg bit changes
2275 * contained in the TLB entry.
2277 source_pvo->pvo_pte.pte.pte_hi &= ~PTE_HID;
2279 moea_pte_unset(pt, &victim_pvo->pvo_pte.pte, victim_pvo->pvo_vaddr);
2280 moea_pte_set(pt, &source_pvo->pvo_pte.pte);
2282 PVO_PTEGIDX_CLR(victim_pvo);
2283 PVO_PTEGIDX_SET(source_pvo, i);
2284 moea_pte_replacements++;
2286 mtx_unlock(&moea_table_mutex);
2290 static __inline struct pvo_entry *
2291 moea_pte_spillable_ident(u_int ptegidx)
2294 struct pvo_entry *pvo_walk, *pvo = NULL;
2296 LIST_FOREACH(pvo_walk, &moea_pvo_table[ptegidx], pvo_olink) {
2297 if (pvo_walk->pvo_vaddr & PVO_WIRED)
2300 if (!(pvo_walk->pvo_pte.pte.pte_hi & PTE_VALID))
2303 pt = moea_pvo_to_pte(pvo_walk, -1);
2310 mtx_unlock(&moea_table_mutex);
2311 if (!(pt->pte_lo & PTE_REF))
2319 moea_pte_insert(u_int ptegidx, struct pte *pvo_pt)
2322 struct pvo_entry *victim_pvo;
2325 u_int pteg_bkpidx = ptegidx;
2327 mtx_assert(&moea_table_mutex, MA_OWNED);
2330 * First try primary hash.
2332 for (pt = moea_pteg_table[ptegidx].pt, i = 0; i < 8; i++, pt++) {
2333 if ((pt->pte_hi & PTE_VALID) == 0) {
2334 pvo_pt->pte_hi &= ~PTE_HID;
2335 moea_pte_set(pt, pvo_pt);
2341 * Now try secondary hash.
2343 ptegidx ^= moea_pteg_mask;
2345 for (pt = moea_pteg_table[ptegidx].pt, i = 0; i < 8; i++, pt++) {
2346 if ((pt->pte_hi & PTE_VALID) == 0) {
2347 pvo_pt->pte_hi |= PTE_HID;
2348 moea_pte_set(pt, pvo_pt);
2353 /* Try again, but this time try to force a PTE out. */
2354 ptegidx = pteg_bkpidx;
2356 victim_pvo = moea_pte_spillable_ident(ptegidx);
2357 if (victim_pvo == NULL) {
2358 ptegidx ^= moea_pteg_mask;
2359 victim_pvo = moea_pte_spillable_ident(ptegidx);
2362 if (victim_pvo == NULL) {
2363 panic("moea_pte_insert: overflow");
2367 victim_idx = moea_pvo_pte_index(victim_pvo, ptegidx);
2369 if (pteg_bkpidx == ptegidx)
2370 pvo_pt->pte_hi &= ~PTE_HID;
2372 pvo_pt->pte_hi |= PTE_HID;
2375 * Synchronize the sacrifice PTE with its PVO, then mark both
2376 * invalid. The PVO will be reused when/if the VM system comes
2377 * here after a fault.
2379 pt = &moea_pteg_table[victim_idx >> 3].pt[victim_idx & 7];
2381 if (pt->pte_hi != victim_pvo->pvo_pte.pte.pte_hi)
2382 panic("Victim PVO doesn't match PTE! PVO: %8x, PTE: %8x", victim_pvo->pvo_pte.pte.pte_hi, pt->pte_hi);
2387 moea_pte_unset(pt, &victim_pvo->pvo_pte.pte, victim_pvo->pvo_vaddr);
2388 PVO_PTEGIDX_CLR(victim_pvo);
2389 moea_pte_overflow++;
2390 moea_pte_set(pt, pvo_pt);
2392 return (victim_idx & 7);
2396 moea_query_bit(vm_page_t m, int ptebit)
2398 struct pvo_entry *pvo;
2401 rw_assert(&pvh_global_lock, RA_WLOCKED);
2402 if (moea_attr_fetch(m) & ptebit)
2405 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
2408 * See if we saved the bit off. If so, cache it and return
2411 if (pvo->pvo_pte.pte.pte_lo & ptebit) {
2412 moea_attr_save(m, ptebit);
2418 * No luck, now go through the hard part of looking at the PTEs
2419 * themselves. Sync so that any pending REF/CHG bits are flushed to
2423 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
2426 * See if this pvo has a valid PTE. if so, fetch the
2427 * REF/CHG bits from the valid PTE. If the appropriate
2428 * ptebit is set, cache it and return success.
2430 pt = moea_pvo_to_pte(pvo, -1);
2432 moea_pte_synch(pt, &pvo->pvo_pte.pte);
2433 mtx_unlock(&moea_table_mutex);
2434 if (pvo->pvo_pte.pte.pte_lo & ptebit) {
2435 moea_attr_save(m, ptebit);
2445 moea_clear_bit(vm_page_t m, int ptebit)
2448 struct pvo_entry *pvo;
2451 rw_assert(&pvh_global_lock, RA_WLOCKED);
2454 * Clear the cached value.
2456 moea_attr_clear(m, ptebit);
2459 * Sync so that any pending REF/CHG bits are flushed to the PTEs (so
2460 * we can reset the right ones). note that since the pvo entries and
2461 * list heads are accessed via BAT0 and are never placed in the page
2462 * table, we don't have to worry about further accesses setting the
2468 * For each pvo entry, clear the pvo's ptebit. If this pvo has a
2469 * valid pte clear the ptebit from the valid pte.
2472 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
2473 pt = moea_pvo_to_pte(pvo, -1);
2475 moea_pte_synch(pt, &pvo->pvo_pte.pte);
2476 if (pvo->pvo_pte.pte.pte_lo & ptebit) {
2478 moea_pte_clear(pt, PVO_VADDR(pvo), ptebit);
2480 mtx_unlock(&moea_table_mutex);
2482 pvo->pvo_pte.pte.pte_lo &= ~ptebit;
2489 * Return true if the physical range is encompassed by the battable[idx]
2492 moea_bat_mapped(int idx, vm_offset_t pa, vm_size_t size)
2500 * Return immediately if not a valid mapping
2502 if (!(battable[idx].batu & BAT_Vs))
2506 * The BAT entry must be cache-inhibited, guarded, and r/w
2507 * so it can function as an i/o page
2509 prot = battable[idx].batl & (BAT_I|BAT_G|BAT_PP_RW);
2510 if (prot != (BAT_I|BAT_G|BAT_PP_RW))
2514 * The address should be within the BAT range. Assume that the
2515 * start address in the BAT has the correct alignment (thus
2516 * not requiring masking)
2518 start = battable[idx].batl & BAT_PBS;
2519 bat_ble = (battable[idx].batu & ~(BAT_EBS)) | 0x03;
2520 end = start | (bat_ble << 15) | 0x7fff;
2522 if ((pa < start) || ((pa + size) > end))
2529 moea_dev_direct_mapped(mmu_t mmu, vm_paddr_t pa, vm_size_t size)
2534 * This currently does not work for entries that
2535 * overlap 256M BAT segments.
2538 for(i = 0; i < 16; i++)
2539 if (moea_bat_mapped(i, pa, size) == 0)
2546 * Map a set of physical memory pages into the kernel virtual
2547 * address space. Return a pointer to where it is mapped. This
2548 * routine is intended to be used for mapping device memory,
2552 moea_mapdev(mmu_t mmu, vm_paddr_t pa, vm_size_t size)
2555 return (moea_mapdev_attr(mmu, pa, size, VM_MEMATTR_DEFAULT));
2559 moea_mapdev_attr(mmu_t mmu, vm_offset_t pa, vm_size_t size, vm_memattr_t ma)
2561 vm_offset_t va, tmpva, ppa, offset;
2564 ppa = trunc_page(pa);
2565 offset = pa & PAGE_MASK;
2566 size = roundup(offset + size, PAGE_SIZE);
2569 * If the physical address lies within a valid BAT table entry,
2570 * return the 1:1 mapping. This currently doesn't work
2571 * for regions that overlap 256M BAT segments.
2573 for (i = 0; i < 16; i++) {
2574 if (moea_bat_mapped(i, pa, size) == 0)
2575 return ((void *) pa);
2578 va = kva_alloc(size);
2580 panic("moea_mapdev: Couldn't alloc kernel virtual memory");
2582 for (tmpva = va; size > 0;) {
2583 moea_kenter_attr(mmu, tmpva, ppa, ma);
2590 return ((void *)(va + offset));
2594 moea_unmapdev(mmu_t mmu, vm_offset_t va, vm_size_t size)
2596 vm_offset_t base, offset;
2599 * If this is outside kernel virtual space, then it's a
2600 * battable entry and doesn't require unmapping
2602 if ((va >= VM_MIN_KERNEL_ADDRESS) && (va <= virtual_end)) {
2603 base = trunc_page(va);
2604 offset = va & PAGE_MASK;
2605 size = roundup(offset + size, PAGE_SIZE);
2606 kva_free(base, size);
2611 moea_sync_icache(mmu_t mmu, pmap_t pm, vm_offset_t va, vm_size_t sz)
2613 struct pvo_entry *pvo;
2620 lim = round_page(va);
2621 len = MIN(lim - va, sz);
2622 pvo = moea_pvo_find_va(pm, va & ~ADDR_POFF, NULL);
2624 pa = (pvo->pvo_pte.pte.pte_lo & PTE_RPGN) |
2626 moea_syncicache(pa, len);
2635 moea_dumpsys_map(mmu_t mmu, struct pmap_md *md, vm_size_t ofs,
2638 if (md->md_vaddr == ~0UL)
2639 return (md->md_paddr + ofs);
2641 return (md->md_vaddr + ofs);
2645 moea_scan_md(mmu_t mmu, struct pmap_md *prev)
2647 static struct pmap_md md;
2648 struct pvo_entry *pvo;
2651 if (dumpsys_minidump) {
2652 md.md_paddr = ~0UL; /* Minidumps use virtual addresses. */
2654 /* 1st: kernel .data and .bss. */
2656 md.md_vaddr = trunc_page((uintptr_t)_etext);
2657 md.md_size = round_page((uintptr_t)_end) - md.md_vaddr;
2660 switch (prev->md_index) {
2662 /* 2nd: msgbuf and tables (see pmap_bootstrap()). */
2664 md.md_vaddr = (vm_offset_t)msgbufp->msg_ptr;
2665 md.md_size = round_page(msgbufp->msg_size);
2668 /* 3rd: kernel VM. */
2669 va = prev->md_vaddr + prev->md_size;
2670 /* Find start of next chunk (from va). */
2671 while (va < virtual_end) {
2672 /* Don't dump the buffer cache. */
2673 if (va >= kmi.buffer_sva &&
2674 va < kmi.buffer_eva) {
2675 va = kmi.buffer_eva;
2678 pvo = moea_pvo_find_va(kernel_pmap,
2679 va & ~ADDR_POFF, NULL);
2681 (pvo->pvo_pte.pte.pte_hi & PTE_VALID))
2685 if (va < virtual_end) {
2688 /* Find last page in chunk. */
2689 while (va < virtual_end) {
2690 /* Don't run into the buffer cache. */
2691 if (va == kmi.buffer_sva)
2693 pvo = moea_pvo_find_va(kernel_pmap,
2694 va & ~ADDR_POFF, NULL);
2696 !(pvo->pvo_pte.pte.pte_hi & PTE_VALID))
2700 md.md_size = va - md.md_vaddr;
2708 } else { /* minidumps */
2709 mem_regions(&pregions, &pregions_sz,
2710 ®ions, ®ions_sz);
2713 /* first physical chunk. */
2714 md.md_paddr = pregions[0].mr_start;
2715 md.md_size = pregions[0].mr_size;
2718 } else if (md.md_index < pregions_sz) {
2719 md.md_paddr = pregions[md.md_index].mr_start;
2720 md.md_size = pregions[md.md_index].mr_size;
2724 /* There's no next physical chunk. */